/external/webkit/WebKitTools/Scripts/webkitpy/ |
stepsequence.py | 54 # Remove duplicates.
|
/external/v8/src/ |
factory.cc | 607 // Number of duplicates detected. 608 int duplicates = 0; local 626 duplicates++; 630 // If duplicates were detected, allocate a result of the right size 632 if (duplicates > 0) { 633 int number_of_descriptors = result->number_of_descriptors() - duplicates; [all...] |
/external/guava/src/com/google/common/collect/ |
Sets.java | 73 * @return an immutable set containing those elements, minus duplicates 91 * @return an immutable set containing those elements, minus duplicates 168 * @return a new {@code HashSet} containing those elements (minus duplicates) 201 * @return a new {@code HashSet} containing those elements (minus duplicates) 224 * @return a new {@code HashSet} containing those elements (minus duplicates) 257 * duplicates) 303 * @return a new {@code TreeSet} containing those elements (minus duplicates) [all...] |
ImmutableSet.java | 281 // The iterable contained only duplicates of the same element. 284 // Resize the table when the iterable includes too many duplicates.
|
/bionic/libc/kernel/tools/ |
kernel.py | 299 self.duplicates = False 315 self.duplicates = True
|
/dalvik/libcore/luni/src/main/java/java/lang/reflect/ |
Proxy.java | 77 * must be visible from the supplied class loader; no duplicates are 205 * supplied class loader; no duplicates are permitted. All non-public
|
/dalvik/libcore/security-kernel/src/main/java/java/security/ |
AccessControlContext.java | 130 * <li>duplicates will be removed 149 * <li>duplicates will be removed
|
/external/dnsmasq/src/ |
log.c | 48 pid_t pid; /* to avoid duplicates over a fork */ 153 /* Avoid duplicates over a fork() */
|
/external/emma/core/java12/com/vladium/util/ |
Strings.java | 79 * Also removes duplicates. 119 * Removes duplicates.
|
/dalvik/libcore/ |
NativeCode.mk | 76 # removes duplicates.
|
/dalvik/vm/alloc/ |
HeapSource.h | 110 * order. This implies that there are no duplicates, and no entries
|
/external/openssl/crypto/pqueue/ |
pqueue.c | 138 /* duplicates not allowed */
|
/external/ping/ |
ping_common.h | 83 extern long nrepeats; /* number of duplicates */
|
/external/v8/test/mjsunit/regress/ |
regress-219.js | 30 // We should now allow duplicates of flags.
|
/external/webkit/WebCore/css/ |
CSSVariablesDeclaration.cpp | 99 // Don't leak duplicates. For multiple variables with the same name, the last one
|
/frameworks/base/core/java/android/os/ |
Broadcaster.java | 79 // check for duplicates, and don't do it if we are dup.
|
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
upredalgo.h | 169 /// elements to be duplicates. In the first version, the test is simple 170 /// equality: the elements in a range [f, l) are duplicates if, for every 173 /// [f, l) are duplicates if, for every iterator i in the range, either 194 /// new_last) contains no two consecutive elements that are duplicates.
|
/sdk/emulator/qtools/ |
trace_reader_base.h | 324 // Duplicates a string, allocating space using new[].
|
/system/core/sh/ |
mkinit.sh | 60 # ignore duplicates
|
/external/icu4c/common/ |
triedict.cpp | 884 // Check for comparing a node to itself, to avoid spurious duplicates 931 // We sort the array of nodes to place duplicates next to each other 943 // Now repeatedly identify duplicates until there are no more 959 // 2. The way we find one and only one instance of a set of duplicates is to 962 // duplicates would wind up with a node ID equal to its array index. [all...] |
/cts/tools/dasm/src/java_cup/ |
terminal.java | 30 /* add to set of all terminals and check for duplicates */
|
/dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
KeyTable.java | 251 // suppress duplicates, we only need to check against the last entry
|
/external/emma/tools/java/com/vladium/tools/ |
ClassDep.java | 186 * @return array of class VM names [may contain duplicates]
|
/external/icu4c/i18n/ |
csdetect.cpp | 299 // deleted, just reordered, with the unwanted duplicates placed after the good results.
|
/external/webkit/WebCore/dom/ |
MessagePort.cpp | 199 // HashSet used to efficiently check for duplicates in the passed-in array.
|