| /external/skia/src/sksl/lex/ |
| D | NFAtoDFA.h | 139 std::vector<std::vector<int>*> uniques; in computeMappings() local
143 for (size_t j = 0; j < uniques.size(); ++j) { in computeMappings()
144 if (*uniques[j] == fTransitions[i]) { in computeMappings()
150 found = (int) uniques.size(); in computeMappings()
151 uniques.push_back(&fTransitions[i]); in computeMappings()
156 for (std::vector<int>* row : uniques) { in computeMappings()
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | ImmutableSet.java | 162 int uniques = 0; in construct() local
171 elements[uniques++] = element; in construct()
180 Arrays.fill(elements, uniques, n, null); in construct()
181 if (uniques == 1) { in construct()
187 } else if (chooseTableSize(uniques) < tableSize / 2) { in construct()
189 return construct(uniques, elements); in construct()
193 shouldTrim(uniques, elements.length) ? Arrays.copyOf(elements, uniques) : elements; in construct()
194 return new RegularImmutableSet<E>(uniqueElements, hashCode, table, mask, uniques); in construct()
|
| D | ImmutableSortedMultiset.java | 460 int uniques = 1; in dedupAndCoalesce() local
462 if (comparator.compare(sortedElements[uniques - 1], sortedElements[i]) < 0) { in dedupAndCoalesce()
463 sortedElements[uniques] = sortedElements[i]; in dedupAndCoalesce()
464 uniques++; in dedupAndCoalesce()
467 Arrays.fill(sortedElements, uniques, length, null); in dedupAndCoalesce()
468 if (maybeExpand && uniques * 4 > length * 3) { in dedupAndCoalesce()
475 int index = Arrays.binarySearch(sortedElements, 0, uniques, elements[i], comparator); in dedupAndCoalesce()
485 this.length = uniques; in dedupAndCoalesce()
|
| D | ImmutableSortedSet.java | 353 int uniques = 1; in construct() local
356 E prev = contents[uniques - 1]; in construct()
358 contents[uniques++] = cur; in construct()
361 Arrays.fill(contents, uniques, n, null); in construct()
362 if (uniques < contents.length / 2) { in construct()
365 contents = Arrays.copyOf(contents, uniques); in construct()
368 ImmutableList.<E>asImmutableList(contents, uniques), comparator); in construct()
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfAccelTable.cpp | 46 std::vector<uint32_t> uniques(Data.size()); in ComputeBucketCount() local
48 uniques[i] = Data[i]->HashValue; in ComputeBucketCount()
49 array_pod_sort(uniques.begin(), uniques.end()); in ComputeBucketCount()
51 std::unique(uniques.begin(), uniques.end()); in ComputeBucketCount()
52 uint32_t num = std::distance(uniques.begin(), p); in ComputeBucketCount()
|
| /external/rust/crates/grpcio-sys/grpc/src/core/lib/channel/ |
| D | channel_args.cc | 130 grpc_arg* uniques = in grpc_channel_args_union() local
131 static_cast<grpc_arg*>(gpr_malloc(sizeof(*uniques) * max_out)); in grpc_channel_args_union()
132 for (size_t i = 0; i < a->num_args; ++i) uniques[i] = a->args[i]; in grpc_channel_args_union()
138 uniques[uniques_idx++] = b->args[i]; in grpc_channel_args_union()
142 grpc_channel_args_copy_and_add(nullptr, uniques, uniques_idx); in grpc_channel_args_union()
143 gpr_free(uniques); in grpc_channel_args_union()
|
| /external/grpc-grpc/src/core/lib/channel/ |
| D | channel_args.cc | 122 grpc_arg* uniques = in grpc_channel_args_union() local
123 static_cast<grpc_arg*>(gpr_malloc(sizeof(*uniques) * max_out)); in grpc_channel_args_union()
124 for (size_t i = 0; i < a->num_args; ++i) uniques[i] = a->args[i]; in grpc_channel_args_union()
130 uniques[uniques_idx++] = b->args[i]; in grpc_channel_args_union()
134 grpc_channel_args_copy_and_add(nullptr, uniques, uniques_idx); in grpc_channel_args_union()
135 gpr_free(uniques); in grpc_channel_args_union()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableSortedSet.java | 374 int uniques = 1; in construct() local
377 E prev = contents[uniques - 1]; in construct()
379 contents[uniques++] = cur; in construct()
382 Arrays.fill(contents, uniques, n, null); in construct()
384 ImmutableList.<E>asImmutableList(contents, uniques), comparator); in construct()
|
| /external/clang/utils/TableGen/ |
| D | ClangAttrEmitter.cpp | 719 std::vector<std::string> uniques; in uniqueEnumsInOrder() local
724 uniques.push_back(i); in uniqueEnumsInOrder()
728 return uniques; in uniqueEnumsInOrder()
733 std::vector<std::string> values, enums, uniques; member in __anon7453f2a60211::EnumArgument
739 uniques(uniqueEnumsInOrder(enums)) in EnumArgument()
742 assert(!uniques.empty()); in EnumArgument()
770 auto i = uniques.cbegin(), e = uniques.cend(); in writeDeclarations()
808 for (const auto &I : uniques) { in writeDump()
852 std::vector<std::string> values, enums, uniques; member in __anon7453f2a60211::VariadicEnumArgument
869 uniques(uniqueEnumsInOrder(enums)) in VariadicEnumArgument()
[all …]
|
| /external/python/setuptools/pkg_resources/_vendor/more_itertools/ |
| D | more.py | 827 uniques = {element for element in counts if counts[element] == 1}
828 return [list(filter(uniques.__contains__, it)) for it in pool]
4181 uniques = set()
4186 if k in uniques:
4189 if len(uniques) == n:
4190 uniques.discard(window[0])
4192 uniques.add(k)
|
| /external/python/setuptools/setuptools/_vendor/more_itertools/ |
| D | more.py | 735 uniques = {element for element in counts if counts[element] == 1}
736 return [list(filter(uniques.__contains__, it)) for it in pool]
|
| /external/clang/docs/ |
| D | InternalsManual.rst | 815 and uniques them as they are needed. Types have a couple of non-obvious
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | ospd.txt.gz | |