| /build/soong/cc/config/ |
| clang.go | 23 var ClangUnknownCflags = sorted([]string{
192 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/lzma/CPP/7zip/Common/ |
| UniqBlocks.cpp | 11 unsigned left = 0, right = Sorted.Size();
15 unsigned index = Sorted[mid];
36 Sorted.Insert(left, index);
51 unsigned num = Sorted.Size();
54 const unsigned *sorted = &Sorted[0];
local
56 p[sorted[i]] = i;
|
| /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/brotli/java/org/brotli/dec/ |
| Huffman.java | 65 int[] sorted = new int[codeLengthsSize]; // Symbols sorted by code length. local
68 int[] offset = new int[MAX_LENGTH + 1]; // Offsets in sorted table for each length.
76 // Generate offsets into sorted symbol table by code length.
85 sorted[offset[codeLengths[symbol]]++] = symbol;
96 rootTable[tableOffset + key] = sorted[0];
106 replicateValue(rootTable, tableOffset + key, step, tableSize, len << 16 | sorted[symbol++]);
127 (len - rootBits) << 16 | sorted[symbol++]);
|
| /external/clang/utils/ |
| FindSpecRefs | 758 def sorted(l): function
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
[all...] |
| /packages/services/Car/tools/ioanalyze/ |
| analyzer.py | 180 def sorted(self, f): member in class:SystemActivity
181 return sorted(self.uids.values(), key=f, reverse=True)
188 A = list(sorted(A, key=lambda i: i[1], reverse=True))
250 writemost = filter(lambda ua: ua.totalWrittenBytes > 0, system.sorted(lambda ua: ua.totalWrittenBytes))
|
| /external/doclava/src/com/google/doclava/ |
| NavTree.java | 103 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local
108 sorted.put(cl.qualifiedName(), cl);
117 sorted.put(name, pkg);
120 data = makeYamlHDF(sorted, "docs.pages", data);
132 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) {
136 for (String s : sorted.keySet()) {
137 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/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
167 // stack will be sorted if need be so that a binary search can be used.
190 // comparison function. The stack maintains a |sorted| flag and sorting an
191 // already sorted stack is a no-op.
194 // sk_is_sorted returns one if |sk| is known to be sorted and zero
|
| /external/brotli/c/dec/ |
| huffman.c | 108 int symbol; /* symbol index in original or sorted table */
113 int sorted[BROTLI_CODE_LENGTH_CODES]; /* symbols sorted by code length */ local
114 /* offsets in sorted table for each length */
121 /* generate offsets into sorted symbol table by code length */
137 sorted[offset[code_lengths[symbol]]--] = symbol;
146 code.value = (uint16_t)sorted[0];
162 code.value = (uint16_t)sorted[symbol++];
178 int symbol; /* symbol index in original or sorted table */
|
| /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/python/cpython2/Lib/lib2to3/tests/ |
| test_pytree.py | 23 sorted
25 def sorted(lst): function
441 self.assertEqual(sorted(r.keys()), ["pl", "pn", "pw"])
|
| /external/python/cpython3/Lib/lib2to3/tests/ |
| test_pytree.py | 18 sorted
20 def sorted(lst): function
419 self.assertEqual(sorted(r.keys()), ["pl", "pn", "pw"])
|
| /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/v8/src/debug/ |
| debug-coverage.cc | 105 std::vector<SharedFunctionInfo*> sorted; local
113 sorted.push_back(info);
115 std::sort(sorted.begin(), sorted.end(), CompareSharedFunctionInfo);
118 functions->reserve(sorted.size() + (has_toplevel ? 0 : 1));
127 // Use sorted list to reconstruct function nesting.
128 for (SharedFunctionInfo* info : 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/coordinatorlayout/src/androidTest/java/androidx/coordinatorlayout/widget/ |
| DirectedAcyclicGraphTest.java | 184 final List<TestNode> sorted = mGraph.getSortedList(); local
186 assertEquals(4, sorted.size());
187 // Assert that all of the nodes are present and in their sorted order
188 assertEquals(node1, sorted.get(0));
189 assertEquals(node3, sorted.get(1));
190 assertEquals(node2, sorted.get(2));
191 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"])
|
