Searched refs:sorted_indices (Results 1 – 5 of 5) sorted by relevance
| /third_party/protobuf/src/google/protobuf/ |
| D | generated_enum_util.cc | 70 int LookUpEnumName(const EnumEntry* enums, const int* sorted_indices, in LookUpEnumName() argument
76 std::lower_bound(sorted_indices, sorted_indices + size, -1, comparator); in LookUpEnumName()
77 if (it != sorted_indices + size && enums[*it].value == value) { in LookUpEnumName()
78 return it - sorted_indices; in LookUpEnumName()
84 const EnumEntry* enums, const int* sorted_indices, size_t size, in InitializeEnumStrings() argument
87 enum_strings[i].Construct(enums[sorted_indices[i]].name); in InitializeEnumStrings()
|
| D | generated_enum_util.h | 69 const int* sorted_indices, size_t size,
74 const EnumEntry* enums, const int* sorted_indices, size_t size,
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/ |
| D | sparse_optimizer_cpu_kernel.h | 296 std::vector<std::pair<T, T>> sorted_indices; in SortAndReduceBucketSparseGradient() local
297 sorted_indices.reserve(bucket->indices_size_); in SortAndReduceBucketSparseGradient()
301 (void)sorted_indices.emplace_back(std::pair<T, T>(index, global_index)); in SortAndReduceBucketSparseGradient()
303 std::sort(sorted_indices.begin(), sorted_indices.end()); in SortAndReduceBucketSparseGradient()
310 for (size_t i = 0; i < sorted_indices.size(); ++i) { in SortAndReduceBucketSparseGradient()
311 T index = sorted_indices[i].first; in SortAndReduceBucketSparseGradient()
312 T global_index = sorted_indices[i].second; in SortAndReduceBucketSparseGradient()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/ |
| D | parallel_fusion.cc | 475 std::map<AnfNodePtr, int> *sorted_indices) { in DoSearchInSortedCandidates() argument
540 sorted_candidates_used[IntToSize(get_index(sorted_indices, node))] = true; in DoSearchInSortedCandidates()
578 std::map<AnfNodePtr, int> sorted_indices; in SearchFuseNodesInCandidates() local
580 (void)sorted_indices.emplace(candidates[i], i); in SearchFuseNodesInCandidates()
583 return DoSearchInSortedCandidates(cs.size(), candidates, &origin_indices, &sorted_indices); in SearchFuseNodesInCandidates()
|
| D | parallel_fusion.h | 100 std::map<AnfNodePtr, int> *sorted_indices);
|