| /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 size_t sorted; member in struct:stack_st
248 * stack will be sorted if need be so that a binary search can be used.
271 * comparison function. The stack maintains a |sorted| flag and sorting an
272 * already sorted stack is a no-op. */
275 /* 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/libvorbis/vq/ |
| vqgen.h | 23 int sorted; member in struct:vqgen
|
| /external/opencv3/modules/shape/src/ |
| haus_dis.cpp | 124 Mat sorted; local
125 cv::sort(shortest, sorted, SORT_EVERY_ROW | SORT_DESCENDING);
126 return sorted.at<float>(K,0);
|
| /external/webp/src/utils/ |
| huffman.c | 82 int* sorted = NULL; // symbols sorted by code length local
84 int symbol; // symbol index in original or sorted table
87 // offsets in sorted table for each length:
108 // Generate offsets into sorted symbol table by code length.
117 sorted = (int*)WebPSafeMalloc(code_lengths_size, sizeof(*sorted));
118 if (sorted == NULL) {
126 sorted[offset[symbol_code_length]++] = symbol;
134 code.value = (uint16_t)sorted[0]
[all...] |
| /external/doclava/src/com/google/doclava/ |
| NavTree.java | 73 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local
78 sorted.put(cl.qualifiedName(), cl);
87 sorted.put(name, pkg);
90 data = makeYamlHDF(sorted, "docs.pages", data);
99 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) {
103 for (String s : sorted.keySet()) {
104 Object o = sorted.get(s);
|
| /external/clang/utils/ |
| FindSpecRefs | 758 def sorted(l): function
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
[all...] |
| /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/lib/ext2fs/ |
| ext2fsP.h | 42 int sorted; member in struct:ext2_struct_dblist
|
| /external/e2fsprogs/resize/ |
| extent.c | 31 __u64 sorted; member in struct:_ext2_extent
50 extent->sorted = 1;
114 extent->sorted = 0;
148 if (!extent->sorted) {
151 extent->sorted = 1;
202 fprintf(out, _("#\tNum=%llu, Size=%llu, Cursor=%llu, Sorted=%llu\n"),
203 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;
|
| /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
|
| /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 | 427 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); local
431 check(sorted);
432 sorted.clear();
435 sorted.add(loc);
437 check(sorted);
440 private void check(Set<ULocale> sorted) {
441 if (sorted.isEmpty()) {
444 check2(sorted);
445 ULocale first = sorted.iterator().next();
447 sorted.add(max)
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| LocaleMatcherTest.java | 423 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); local
427 check(sorted);
428 sorted.clear();
431 sorted.add(loc);
433 check(sorted);
436 private void check(Set<ULocale> sorted) {
437 if (sorted.isEmpty()) {
440 check2(sorted);
441 ULocale first = sorted.iterator().next();
443 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()) {
|
| /cts/tools/cts-xml-generator/src/com/android/cts/xmlgenerator/ |
| XmlGenerator.java | 167 Collection<TestSuite> sorted = sortCollection(suites); local
168 for (TestSuite suite : sorted) {
191 Collection<TestCase> sorted = sortCollection(cases); local
192 for (TestCase testCase : sorted) {
210 Collection<Test> sorted = sortCollection(tests); local
211 for (Test test : sorted) {
|
| /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...] |
| /external/dexmaker/src/dx/java/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...] |
| /external/dhcpcd-6.8.2/ |
| if.c | 698 struct if_head sorted; local
706 TAILQ_INIT(&sorted);
708 TAILQ_INSERT_HEAD(&sorted, ifp, next);
711 TAILQ_FOREACH(ift, &sorted, next) {
718 TAILQ_INSERT_TAIL(&sorted, ifp, next);
720 TAILQ_CONCAT(ctx->ifaces, &sorted, next);
|
