/external/chromium_org/tools/traceline/traceline/scripts/ |
D | heap.js | 27 this.sorted = [ ]; property in TopN 35 this.sorted.push([num, data]); 36 this.sorted.sort(function(a, b) { return b[0] - a[0] }); 37 if (this.sorted.length > this.n) 38 this.sorted.pop(); 40 this.min = this.sorted[this.sorted.lenth - 1]; 46 for (var i = 0, il = this.sorted.length; i < il; ++i) { 47 datas.push(this.sorted[i][1]);
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
D | bot_test_expectations_unittest.py | 137 'foo/veryflaky.html': sorted(["TEXT", "PASS"]), 141 'foo/veryflaky.html': sorted(["TEXT", "PASS"]), 142 'foo/maybeflaky.html': sorted(["TEXT", "PASS"]), 155 'foo/imageplustextflake.html': sorted(["IMAGE+TEXT", "PASS"]), 156 …'foo/allfailures.html': sorted(["TEXT", "PASS", "IMAGE+TEXT", "TIMEOUT", "CRASH", "IMAGE", "MISSIN… 190 'foo/pass1.html': sorted(["FAIL", "PASS"]), 191 'foo/pass2.html': sorted(["IMAGE", "PASS"]), 192 'foo/fail.html': sorted(["TEXT", "PASS"]), 193 'foo/f_p.html': sorted(["TEXT", "PASS"]), 194 'foo/crash.html': sorted(["WONTFIX", "CRASH", "TEXT"]), [all …]
|
/external/dhcpcd/ |
D | if-pref.c | 79 struct interface *sorted, *ifp, *ifn, *ift; in sort_interfaces() local 83 sorted = ifaces; in sort_interfaces() 85 sorted->next = NULL; in sort_interfaces() 88 if (ifcmp(ifp, sorted) == -1) { in sort_interfaces() 89 ifp->next = sorted; in sort_interfaces() 90 sorted = ifp; in sort_interfaces() 94 for (ift = sorted; ift->next; ift = ift->next) { in sort_interfaces() 107 ifaces = sorted; in sort_interfaces()
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
D | IntList.java | 35 private boolean sorted; field in IntList 94 sorted = true; in IntList() 122 if (sorted != otherList.sorted) { in equals() 199 sorted = false; in set() 221 if (sorted && (size > 1)) { in add() 222 sorted = (value >= values[size - 2]); in add() 246 sorted = sorted in insert() 360 if (!sorted) { in sort() 362 sorted = true; in sort() 395 if (!sorted) { in binarysearch()
|
/external/chromium_org/third_party/brotli/src/brotli/dec/ |
D | huffman.c | 82 int* sorted; /* symbols sorted by code length */ in BrotliBuildHuffmanTable() local 86 sorted = (int*)malloc((size_t)code_lengths_size * sizeof(*sorted)); in BrotliBuildHuffmanTable() 87 if (sorted == NULL) { in BrotliBuildHuffmanTable() 105 sorted[offset[code_lengths[symbol]]++] = symbol; in BrotliBuildHuffmanTable() 117 code.value = (uint16_t)sorted[0]; in BrotliBuildHuffmanTable() 121 free(sorted); in BrotliBuildHuffmanTable() 131 code.value = (uint16_t)sorted[symbol++]; in BrotliBuildHuffmanTable() 152 code.value = (uint16_t)sorted[symbol++]; in BrotliBuildHuffmanTable() 158 free(sorted); in BrotliBuildHuffmanTable()
|
/external/chromium_org/chrome/common/extensions/docs/server2/ |
D | patched_file_system_test.py | 110 sorted(self._file_system.ReadSingle('dir1/').Get()), 111 sorted(set(self._host_file_system.ReadSingle('dir1/').Get()) | 115 sorted(self._file_system.ReadSingle('dir1/newsubdir/').Get()), 116 sorted(['a.js'])) 118 self.assertEqual(sorted(self._file_system.ReadSingle('dir2/').Get()), 119 sorted(self._host_file_system.ReadSingle('dir2/').Get())) 122 sorted(self._file_system.ReadSingle('dir2/subdir1/').Get()), 123 sorted(set(self._host_file_system.ReadSingle('dir2/subdir1/').Get()) - 126 self.assertEqual(sorted(self._file_system.ReadSingle('newdir/').Get()), 127 sorted(['1.html']))
|
D | features_utility_test.py | 115 self.assertEqual(sorted(apps_names), 116 sorted(Filtered(unfiltered, 'apps').keys())) 117 self.assertEqual(sorted(extension_names), 118 sorted(Filtered(unfiltered, 'extensions').keys()))
|
D | new_github_file_system_test.py | 116 sorted(['requirements.txt', '.gitignore', 'README.md', 'src/']), 117 sorted(self._gfs.ReadSingle('').Get())) 119 sorted(['__init__.notpy', 'hello.notpy']), 120 sorted(self._gfs.ReadSingle('src/').Get())) 139 'src/': sorted(['hello.notpy', '__init__.notpy']), 140 '': sorted(['requirements.txt', '.gitignore', 'README.md', 'src/']) 144 self.assertEqual(expected['src/'], sorted(read['src/'])) 145 self.assertEqual(expected[''], sorted(read[''])) 190 sorted(self._gfs.ReadSingle('src/').Get())) 208 initial_dir_read = sorted(gfs.ReadSingle('').Get()) [all …]
|
D | file_system_test.py | 59 self.assertEqual(sorted(expected_files), sorted(all_files)) 60 self.assertEqual(sorted(expected_dirs), sorted(all_dirs))
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
D | Graph.java | 83 ArrayList<Object> sorted = new ArrayList<Object>(); in sort() local 91 DFS(n, visited, sorted); in sort() 93 return sorted; in sort() 96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { in DFS() argument 102 DFS(target, visited, sorted); in DFS() 105 sorted.add(n.payload); in DFS()
|
/external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
D | Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/Android.mk 19 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until 23 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_comp 27 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted 31 test_name := algorithms/alg.sorting/alg.sort/is.sorted/is_sorted_until_comp
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
D | print_layout_test_times.py | 77 for key in sorted(by_key): 87 keys_by_time = sorted(by_key, key=lambda k: (by_key[k], k)) 90 for test_name in sorted(times): 92 if key in sorted(tests_by_key): 104 tests_by_time = sorted(tests_by_key[key], key=lambda t: (times[t], t)) 114 for k in sorted(fast_tests_by_key):
|
/external/chromium_org/net/android/tools/ |
D | proxy_test_cases.py | 300 for key in sorted(properties.iterkeys()): 305 for url in sorted(mappings.iterkeys()): 334 for key in sorted(properties.iterkeys()): 339 for url in sorted(mappings.iterkeys()):
|
/external/openssl/crypto/stack/ |
D | stack.c | 86 sk->sorted=0; in sk_set_cmp_func() 105 ret->sorted=sk->sorted; in sk_dup() 134 ret->sorted=0; in sk_new() 176 st->sorted=0; in sk_insert() 314 if (st && !st->sorted) in sk_sort() 325 st->sorted=1; in sk_sort() 333 return st->sorted; in sk_is_sorted()
|
/external/chromium_org/third_party/openssl/openssl/crypto/stack/ |
D | stack.c | 86 sk->sorted=0; in sk_set_cmp_func() 105 ret->sorted=sk->sorted; in sk_dup() 134 ret->sorted=0; in sk_new() 176 st->sorted=0; in sk_insert() 314 if (st && !st->sorted) in sk_sort() 325 st->sorted=1; in sk_sort() 333 return st->sorted; in sk_is_sorted()
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
D | ShapeOps.cpp | 43 SkTDArray<Angle*> sorted; in findChaseOp() local 44 bool sortable = Segment::SortAngles(angles, sorted); in findChaseOp() 45 int angleCount = sorted.count(); in findChaseOp() 47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0); in findChaseOp() 56 angle = sorted[++firstIndex]; in findChaseOp() 60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex); in findChaseOp() 75 angle = sorted[nextIndex]; in findChaseOp()
|
/external/skia/experimental/Intersection/ |
D | ShapeOps.cpp | 43 SkTDArray<Angle*> sorted; in findChaseOp() local 44 bool sortable = Segment::SortAngles(angles, sorted); in findChaseOp() 45 int angleCount = sorted.count(); in findChaseOp() 47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0); in findChaseOp() 56 angle = sorted[++firstIndex]; in findChaseOp() 60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex); in findChaseOp() 75 angle = sorted[nextIndex]; in findChaseOp()
|
/external/e2fsprogs/resize/ |
D | extent.c | 31 __u64 sorted; member 50 extent->sorted = 1; in ext2fs_create_extent_table() 114 extent->sorted = 0; in ext2fs_add_extent_entry() 148 if (!extent->sorted) { in ext2fs_extent_translate() 151 extent->sorted = 1; in ext2fs_extent_translate() 203 extent->num, extent->size, extent->cursor, extent->sorted); in ext2fs_extent_dump()
|
/external/doclava/src/com/google/doclava/ |
D | NavTree.java | 65 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); in writeYamlTree() local 70 sorted.put(cl.qualifiedName(), cl); in writeYamlTree() 79 sorted.put(name, pkg); in writeYamlTree() 82 data = makeYamlHDF(sorted, "docs.pages", data); in writeYamlTree() 86 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) { in makeYamlHDF() argument 90 for (String s : sorted.keySet()) { in makeYamlHDF() 91 Object o = sorted.get(s); in makeYamlHDF()
|
/external/chromium_org/tools/gn/ |
D | trace.cc | 88 std::vector<Coalesced> sorted; in SummarizeCoalesced() local 91 sorted.push_back(iter->second); in SummarizeCoalesced() 92 std::sort(sorted.begin(), sorted.end(), &CoalescedDurationGreater); in SummarizeCoalesced() 94 for (size_t i = 0; i < sorted.size(); i++) { in SummarizeCoalesced() 96 sorted[i].total_duration, sorted[i].count); in SummarizeCoalesced() 97 out << *sorted[i].name_ptr << std::endl; in SummarizeCoalesced()
|
/external/chromium_org/chrome/browser/safe_browsing/ |
D | safe_browsing_store.cc | 16 bool sorted(CTI beg, CTI end, LESS less) { in sorted() function 148 DCHECK(sorted(add_prefixes->begin(), add_prefixes->end(), in SBProcessSubs() 150 DCHECK(sorted(sub_prefixes->begin(), sub_prefixes->end(), in SBProcessSubs() 152 DCHECK(sorted(add_full_hashes->begin(), add_full_hashes->end(), in SBProcessSubs() 154 DCHECK(sorted(sub_full_hashes->begin(), sub_full_hashes->end(), in SBProcessSubs()
|
/external/skia/bench/ |
D | SortBench.cpp | 126 SkAutoTMalloc<int> sorted(N); in onDraw() local 128 memcpy(sorted.get(), fUnsorted.get(), N*sizeof(int)); in onDraw() 129 fSortProc(sorted.get()); in onDraw() 132 SkASSERT(sorted[j - 1] <= sorted[j]); in onDraw()
|
/external/chromium_org/third_party/skia/bench/ |
D | SortBench.cpp | 126 SkAutoTMalloc<int> sorted(N); in onDraw() local 128 memcpy(sorted.get(), fUnsorted.get(), N*sizeof(int)); in onDraw() 129 fSortProc(sorted.get()); in onDraw() 132 SkASSERT(sorted[j - 1] <= sorted[j]); in onDraw()
|
/external/e2fsprogs/lib/ext2fs/ |
D | dblist.c | 123 dblist->sorted = 1; in ext2fs_init_dblist() 144 dblist->sorted = src->sorted; in ext2fs_copy_dblist() 184 dblist->sorted = 0; in ext2fs_add_dir_block2() 204 dblist->sorted = 0; in ext2fs_set_dir_block2() 218 dblist->sorted = 1; in ext2fs_dblist_sort2() 235 if (!dblist->sorted) in ext2fs_dblist_iterate2() 323 dblist->sorted = 1; in ext2fs_dblist_sort()
|
/external/opencv/ml/src/ |
D | mlboost.cpp | 211 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); in calc_node_dir() local 220 int idx = sorted[i].i; in calc_node_dir() 228 int idx = sorted[i].i; in calc_node_dir() 235 dir[sorted[i].i] = (char)0; in calc_node_dir() 247 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); in find_split_ord_class() local 262 int idx = sorted[i].i; in find_split_ord_class() 277 int idx = sorted[i].i; in find_split_ord_class() 287 if( sorted[i].val + epsilon < sorted[i+1].val ) in find_split_ord_class() 302 int idx = sorted[i].i; in find_split_ord_class() 308 if( sorted[i].val + epsilon < sorted[i+1].val ) in find_split_ord_class() [all …]
|