/build/soong/cc/config/ |
clang.go | 9 var ClangUnknownCflags = sorted([]string{ 146 func sorted(list []string) []string { func
|
/external/clang/test/CodeGenCXX/ |
2007-04-05-PackedBitFieldsOverlap-2.cpp | 10 unsigned long sorted : 1; member in struct:M_Packed
|
/external/boringssl/src/include/openssl/ |
stack.h | 101 /* sorted is non-zero if the values pointed to by |data| are in ascending 103 int sorted; member in struct:stack_st 247 * stack will be sorted if need be so that a binary search can be used. 270 * comparison function. The stack maintains a |sorted| flag and sorting an 271 * already sorted stack is a no-op. */ 274 /* sk_is_sorted returns one if |sk| is known to be sorted and zero
|
/frameworks/base/tools/preload2/src/com/android/preload/actions/ |
ShowDataAction.java | 87 List<String> sorted = new ArrayList<>(set); local 88 Collections.sort(sorted); 89 for (String s : sorted) {
|
/system/update_engine/payload_generator/ |
topological_sort_unittest.cc | 80 vector<Vertex::Index> sorted; local 81 TopologicalSort(graph, &sorted); 85 EXPECT_TRUE(IndexOf(sorted, i, &src_index)); 89 EXPECT_TRUE(IndexOf(sorted, it->first, &dst_index));
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
Graph.java | 83 ArrayList<Object> sorted = new ArrayList<Object>(); local 91 DFS(n, visited, sorted); 93 return sorted; 96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { 102 DFS(target, visited, sorted); 105 sorted.add(n.payload);
|
/external/clang/utils/ |
FindSpecRefs | 758 def sorted(l): function 790 children = sorted(map(flatten,children.values())) 791 return (key, children, sorted(data)) [all...] |
/external/libvorbis/vq/ |
vqgen.h | 23 int sorted; member in struct:vqgen
|
/external/doclava/src/com/google/doclava/ |
NavTree.java | 68 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local 73 sorted.put(cl.qualifiedName(), cl); 82 sorted.put(name, pkg); 85 data = makeYamlHDF(sorted, "docs.pages", data); 97 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) { 101 for (String s : sorted.keySet()) { 102 Object o = sorted.get(s);
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/tests/ |
test_pytree.py | 23 sorted
25 def sorted(lst):
function 441 self.assertEqual(sorted(r.keys()), ["pl", "pn", "pw"])
|
/external/clang/utils/TableGen/ |
ClangSACheckersEmitter.cpp | 268 std::map<int, const Record *> sorted; local 271 sorted[(*I)->getID()] = *I; 274 I = sorted.begin(), E = sorted.end(); I != E; ++I) 283 std::map<int, const Record *> sorted; local 286 sorted[(*I)->getID()] = *I; 289 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
|
/external/e2fsprogs/resize/ |
extent.c | 32 __u64 sorted; member in struct:_ext2_extent 51 extent->sorted = 1; 115 extent->sorted = 0; 149 if (!extent->sorted) { 152 extent->sorted = 1; 203 fprintf(out, _("#\tNum=%llu, Size=%llu, Cursor=%llu, Sorted=%llu\n"), 204 extent->num, extent->size, extent->cursor, extent->sorted);
|
/external/snakeyaml/src/test/java/examples/collections/ |
TypeSafeMapImplementationsTest.java | 71 private SortedMap<String, String> sorted; field in class:TypeSafeMapImplementationsTest.MapBean 80 return sorted; 83 public void setSorted(SortedMap<String, String> sorted) { 84 this.sorted = sorted; 187 // test that the order is NOT taken from YAML but sorted
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue29/ |
FlexibleScalarStylesInJavaBeanTest.java | 83 Set<Property> sorted = new TreeSet<Property>(new PropertyComparator()); local 84 sorted.addAll(standard); 85 return sorted;
|
/external/webp/src/utils/ |
huffman_utils.c | 78 // sorted[code_lengths_size] is a pre-allocated array for sorting symbols 82 uint16_t sorted[]) { 86 int symbol; // symbol index in original or sorted table 89 // offsets in sorted table for each length: 110 // Generate offsets into sorted symbol table by code length. 123 sorted[offset[symbol_code_length]++] = symbol; 131 code.value = (uint16_t)sorted[0]; 157 code.value = (uint16_t)sorted[symbol++]; 184 code.value = (uint16_t)sorted[symbol++]; 211 uint16_t sorted[SORTED_SIZE_CUTOFF] local 215 uint16_t* const sorted = local [all...] |
/frameworks/support/design/jvm-tests/src/android/support/design/widget/ |
DirectedAcyclicGraphTest.java | 186 final List<TestNode> sorted = mGraph.getSortedList(); local 188 assertEquals(4, sorted.size()); 189 // Assert that all of the nodes are present and in their sorted order 190 assertEquals(node1, sorted.get(0)); 191 assertEquals(node3, sorted.get(1)); 192 assertEquals(node2, sorted.get(2)); 193 assertEquals(node4, sorted.get(3));
|
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
IntSliceOpTest.java | 184 exerciseOps(IntStream.range(1, 101).map(i -> 101 - i).toArray(), s -> s.limit(10).sorted()); method
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
test_pytree.py | 23 sorted 25 def sorted(lst): function 441 self.assertEqual(sorted(r.keys()), ["pl", "pn", "pw"])
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
test_pytree.py | 23 sorted 25 def sorted(lst): function 441 self.assertEqual(sorted(r.keys()), ["pl", "pn", "pw"])
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/animator/ |
AnimationContentAssist.java | 143 List<AttributeDescriptor> sorted = local 145 sorted.addAll(matches.values()); 146 Collections.sort(sorted); 151 new ArrayList<Pair<String, String>>(sorted.size()); 152 for (AttributeDescriptor d : sorted) {
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
LocaleMatcherTest.java | 449 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); local 453 check(sorted); 454 sorted.clear(); 457 sorted.add(loc); 459 check(sorted); 462 private void check(Set<ULocale> sorted) { 463 if (sorted.isEmpty()) { 466 check2(sorted); 467 ULocale first = sorted.iterator().next(); 469 sorted.add(max) [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
LocaleMatcherTest.java | 448 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); local 452 check(sorted); 453 sorted.clear(); 456 sorted.add(loc); 458 check(sorted); 461 private void check(Set<ULocale> sorted) { 462 if (sorted.isEmpty()) { 465 check2(sorted); 466 ULocale first = sorted.iterator().next(); 468 sorted.add(max) [all...] |
/art/test/005-annotations/src/android/test/anno/ |
TestAnnotations.java | 28 * Print the annotations in sorted order, so as to avoid 32 TreeMap<String, Annotation> sorted = local 36 sorted.put(a.annotationType().getName(), a); 39 for (Annotation a : sorted.values()) {
|
/dalvik/dexgen/src/com/android/dexgen/util/ |
IntList.java | 34 /** whether the values are currently sorted */ 35 private boolean sorted; field in class:IntList 94 sorted = true; 122 if (sorted != otherList.sorted) { 199 sorted = false; 221 if (sorted && (size > 1)) { 222 sorted = (value >= values[size - 2]); 246 sorted = sorted [all...] |
/dalvik/dx/src/com/android/dx/util/ |
IntList.java | 34 /** whether the values are currently sorted */ 35 private boolean sorted; field in class:IntList 94 sorted = true; 122 if (sorted != otherList.sorted) { 199 sorted = false; 221 if (sorted && (size > 1)) { 222 sorted = (value >= values[size - 2]); 246 sorted = sorted [all...] |