| /external/jmonkeyengine/engine/src/core/com/jme3/collision/ |
| D | CollisionResults.java | 48 private boolean sorted = true; field in CollisionResults
63 if (!sorted){ in iterator()
65 sorted = true; in iterator()
73 sorted = false; in addCollision()
84 if (!sorted){ in getClosestCollision()
86 sorted = true; in getClosestCollision()
96 if (!sorted){ in getFarthestCollision()
98 sorted = true; in getFarthestCollision()
105 if (!sorted){ in getCollision()
107 sorted = true; in getCollision()
|
| /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/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| D | LocaleMatcherTest.java | 317 TreeSet<ULocale> sorted = new TreeSet(); in testExactMatches() local
321 check(sorted); in testExactMatches()
322 sorted.clear(); in testExactMatches()
325 sorted.add(loc); in testExactMatches()
327 check(sorted); in testExactMatches()
330 private void check(Set<ULocale> sorted) { in check() argument
331 if (sorted.isEmpty()) { in check()
334 check2(sorted); in check()
335 ULocale first = sorted.iterator().next(); in check()
337 sorted.add(max); in check()
[all …]
|
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| D | SortUtil.java | 119 private static void test(Float[] original, Float[] sorted, Comparator<Float> ic) { in test() argument
124 System.arraycopy(original, 0, sorted, 0, original.length); in test()
125 gsort(sorted, ic); in test()
132 System.arraycopy(original, 0, sorted, 0, original.length); in test()
133 qsort(sorted, ic); in test()
140 System.arraycopy(original, 0, sorted, 0, original.length); in test()
141 msort(original, sorted, ic); in test()
148 System.arraycopy(original, 0, sorted, 0, original.length); in test()
149 Arrays.sort(sorted, ic); in test()
165 Float[] sorted = new Float[original.length]; in main() local
[all …]
|
| /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/skia/tools/ |
| D | Stats.h | 34 SkAutoTMalloc<double> sorted(n); in Stats()
35 memcpy(sorted.get(), samples, n * sizeof(double)); in Stats()
36 SkTQSort(sorted.get(), sorted.get() + n - 1); in Stats()
37 median = sorted[n/2]; in Stats()
|
| /external/boringssl/src/crypto/stack/ |
| D | stack.c | 108 sk->sorted = 0; in sk_zero()
188 sk->sorted = 0; in sk_insert()
319 ret->sorted = sk->sorted; in sk_dup()
332 if (sk == NULL || sk->sorted) { in sk_sort()
339 sk->sorted = 1; in sk_sort()
346 return sk->sorted; in sk_is_sorted()
353 sk->sorted = 0; in sk_set_cmp_func()
|
| /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()
|
| D | Doclava.java | 708 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); in makePackageHDF() local
717 sorted.put(name, pkg); in makePackageHDF()
721 for (Map.Entry<String, PackageInfo> entry : sorted.entrySet()) { in makePackageHDF()
868 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); in writeLists() local
873 sorted.put(cl.qualifiedName(), cl); in writeLists()
881 sorted.put(name, pkg); in writeLists()
885 for (String s : sorted.keySet()) { in writeLists()
889 Object o = sorted.get(s); in writeLists()
1080 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); in choosePackages() local
1089 sorted.put(name, pkg); in choosePackages()
[all …]
|
| /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/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/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 …]
|
| /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/openfst/src/lib/ |
| D | symbol-table-ops.cc | 86 map<int, string> sorted; in CompactSymbolTable() local
89 sorted[stiter.Value()] = stiter.Symbol(); in CompactSymbolTable()
93 for (map<int, string>::const_iterator si = sorted.begin(); in CompactSymbolTable()
94 si != sorted.end(); ++si) { in CompactSymbolTable()
|
| /external/valgrind/coregrind/ |
| D | m_xarray.c | 49 Bool sorted; /* is it sorted? */ member
76 xa->sorted = False; in VG_()
125 xa->sorted = False; in VG_()
202 xa->sorted = False; in VG_()
222 xa->sorted = False; in VG_()
231 xa->sorted = True; in VG_()
277 vg_assert(xa->sorted); in VG_()
345 xa->sorted = False; in VG_()
|
| /external/clang/utils/TableGen/ |
| D | ClangSACheckersEmitter.cpp | 268 std::map<int, const Record *> sorted; in EmitClangSACheckers() local
271 sorted[(*I)->getID()] = *I; in EmitClangSACheckers()
274 I = sorted.begin(), E = sorted.end(); I != E; ++I) in EmitClangSACheckers()
283 std::map<int, const Record *> sorted; in EmitClangSACheckers() local
286 sorted[(*I)->getID()] = *I; in EmitClangSACheckers()
289 I = sorted.begin(), E = sorted.end(); I != E; ++I) { in EmitClangSACheckers()
|
| /external/llvm/utils/ |
| D | sort_includes.py | 67 local_headers = sorted(set(local_headers))
68 project_headers = sorted(set(project_headers))
69 system_headers = sorted(set(system_headers))
|
| /external/chromium-trace/trace-viewer/tracing/build/ |
| D | check_common.py | 32 sorted_files = sorted(listed_files)
81 error += ' In file only:\n ' + '\n '.join(sorted(in_file_only))
85 error += ' On disk only:\n ' + '\n '.join(sorted(in_known_only))
|
| /external/skia/tests/ |
| D | PathOpsSkpClipTest.cpp | 627 SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) { in buildTestDir() argument
653 if (!sorted) { in buildTestDir()
659 *sorted[dirNo - firstDirNo].append() = (SortByName*) &testSet[index]; in buildTestDir()
661 if (sorted[dirNo - firstDirNo].count()) { in buildTestDir()
662 SkTQSort<SortByName>(sorted[dirNo - firstDirNo].begin(), in buildTestDir()
663 sorted[dirNo - firstDirNo].end() - 1); in buildTestDir()
710 SkTDArray<SortByName*> sorted[1]; in doOneDir() local
711 if (!buildTestDir(dirNo, dirNo, tests, sorted)) { in doOneDir()
727 int count = sorted[0].count(); in doOneDir()
728 int idx = SkTSearch<SortByName, Less>(sorted[0].begin(), count, &name, sizeof(&name)); in doOneDir()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsWinding.cpp | 251 SkSTArray<1, SkOpRayHit*> sorted; in sortableTop() local
254 sorted.push_back(hit); in sortableTop()
257 int count = sorted.count(); in sortableTop()
258 SkTQSort(sorted.begin(), sorted.end() - 1, xy_index(dir) in sortableTop()
267 hit = sorted[index]; in sortableTop()
285 hit = sorted[index]; in sortableTop()
303 const SkPoint& next = sorted[index + 1]->fPt; in sortableTop()
|
| /external/libexif/test/ |
| D | Makefile.am | 13 TESTS = test-mem test-value test-integers test-parse test-tagtable test-sorted
19 test-tagtable test-sorted
|
| /external/icu/icu4c/source/test/depstest/ |
| D | depstest.py | 163 sorted(files_missing_from_deps))
167 sorted(files_missing_from_build))
178 sorted(virtual_classes_with_weak_destructors))
188 print "Info: ignored symbols:\n%s" % sorted(_ignored_symbols)
|
| /external/icu/icu4c/source/i18n/ |
| D | identifier_info.cpp | 286 UVector sorted(status); in displayAlternates() local
296 sorted.addElement(ss, status); in displayAlternates()
298 sorted.sort(uhash_compareScriptSet, status); in displayAlternates()
300 for (int32_t i=0; i<sorted.size(); i++) { in displayAlternates()
304 ScriptSet *ss = static_cast<ScriptSet *>(sorted.elementAt(i)); in displayAlternates()
|
| /external/chromium-trace/trace-viewer/tracing/third_party/closure_linter/closure_linter/ |
| D | requireprovidesorter.py | 66 sorted_provide_strings = sorted(provide_strings)
91 sorted_require_strings = sorted(require_strings)
123 sorted_strings = sorted(strings)
|