Home
last modified time | relevance | path

Searched refs:sorted (Results 1 – 25 of 185) sorted by relevance

12345678

/external/jmonkeyengine/engine/src/core/com/jme3/collision/
DCollisionResults.java48 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/webkit/LayoutTests/storage/indexeddb/
Dobjectstore-cursor-expected.txt23 Next test: lower open bound is 0; sorted ascending.
32 Next test: lower bound is 0; sorted ascending.
42 Next test: upper open bound is 0; sorted ascending.
45 Next test: upper bound is 0; sorted ascending.
49 Next test: lower open bound is 0; sorted descending.
58 Next test: lower bound is 0; sorted descending.
68 Next test: upper open bound is 0; sorted descending.
71 Next test: upper bound is 0; sorted descending.
75 Next test: lower open bound is 0; upper open bound is 6; sorted ascending.
83 Next test: lower open bound is 0; upper bound is 6; sorted ascending.
[all …]
Dindex-cursor-expected.txt25 Next test: lower open bound is 0; sorted ascending.
40 Next test: lower bound is 0; sorted ascending.
59 Next test: upper open bound is 0; sorted ascending.
62 Next test: upper bound is 0; sorted ascending.
69 Next test: lower open bound is 0; sorted descending.
84 Next test: lower bound is 0; sorted descending.
103 Next test: upper open bound is 0; sorted descending.
106 Next test: upper bound is 0; sorted descending.
113 Next test: lower open bound is 0; upper open bound is 6; sorted ascending.
124 Next test: lower open bound is 0; upper bound is 6; sorted ascending.
[all …]
/external/dhcpcd/
Dif-pref.c79 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/
DIntList.java35 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/jmonkeyengine/engine/src/core/com/jme3/util/
DSortUtil.java119 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/
DGraph.java83 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/openssl/crypto/stack/
Dstack.c86 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/e2fsprogs/resize/
Dextent.c31 int 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()
198 extent->num, extent->size, extent->cursor, extent->sorted); in ext2fs_extent_dump()
/external/e2fsprogs/lib/ext2fs/
Ddblist.c120 dblist->sorted = 1; in ext2fs_init_dblist()
141 dblist->sorted = src->sorted; in ext2fs_copy_dblist()
181 dblist->sorted = 0; in ext2fs_add_dir_block()
201 dblist->sorted = 0; in ext2fs_set_dir_block()
215 dblist->sorted = 1; in ext2fs_dblist_sort()
232 if (!dblist->sorted) in ext2fs_dblist_iterate()
/external/doclava/src/com/google/doclava/
DDoclava.java563 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); in makePackageHDF() local
572 sorted.put(name, pkg); in makePackageHDF()
576 for (String s : sorted.keySet()) { in makePackageHDF()
577 PackageInfo pkg = sorted.get(s); in makePackageHDF()
702 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); in writeLists() local
707 sorted.put(cl.qualifiedName(), cl); in writeLists()
715 sorted.put(name, pkg); in writeLists()
719 for (String s : sorted.keySet()) { in writeLists()
723 Object o = sorted.get(s); in writeLists()
806 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); in choosePackages() local
[all …]
/external/opencv/ml/src/
Dmlboost.cpp211 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 …]
Dmltree.cpp1477 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); in calc_node_dir() local
1486 dir[sorted[i].i] = (char)-1; in calc_node_dir()
1488 dir[sorted[i].i] = (char)1; in calc_node_dir()
1490 dir[sorted[i].i] = (char)0; in calc_node_dir()
1503 int idx = sorted[i].i; in calc_node_dir()
1511 int idx = sorted[i].i; in calc_node_dir()
1518 dir[sorted[i].i] = (char)0; in calc_node_dir()
1569 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); in find_split_ord_class() local
1590 rc[responses[sorted[i].i]]--; in find_split_ord_class()
1601 int idx = responses[sorted[i].i]; in find_split_ord_class()
[all …]
/external/openfst/src/lib/
Dsymbol-table-ops.cc86 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/chromium/chrome/browser/extensions/
Dextension_toolbar_model.cc178 ExtensionList sorted; in InitializeExtensionList() local
179 sorted.resize(pref_order.size(), NULL); in InitializeExtensionList()
195 sorted[index] = extension; in InitializeExtensionList()
202 toolitems_.reserve(sorted.size() + unsorted.size()); in InitializeExtensionList()
203 for (ExtensionList::iterator iter = sorted.begin(); in InitializeExtensionList()
204 iter != sorted.end(); ++iter) { in InitializeExtensionList()
/external/clang/utils/TableGen/
DClangSACheckersEmitter.cpp266 std::map<int, const Record *> sorted; in run() local
269 sorted[(*I)->getID()] = *I; in run()
272 I = sorted.begin(), E = sorted.end(); I != E; ++I) in run()
281 std::map<int, const Record *> sorted; in run() local
284 sorted[(*I)->getID()] = *I; in run()
287 I = sorted.begin(), E = sorted.end(); I != E; ++I) { in run()
/external/valgrind/main/coregrind/
Dm_xarray.c49 Bool sorted; /* is it sorted? */ member
77 xa->sorted = False; in VG_()
134 xa->sorted = False; in VG_()
194 xa->sorted = False; in VG_()
215 xa->sorted = False; in VG_()
225 xa->sorted = True; in VG_()
273 vg_assert(xa->sorted); in VG_()
/external/mesa3d/src/glsl/builtins/tools/
Dgenerate_builtins.py45 for k, v in sorted(fs.iteritems()):
90 for func in sorted(function_names):
101 for pfile in sorted(glob(path.join(path.join(builtins_dir, 'profiles'), '*'))):
/external/valgrind/main/VEX/orig_amd64/
DCompare.hs29 = do sorted <- readFile sorted_fn
31 let ress = zipWith check (lines (deTab sorted))
/external/replicaisland/src/com/replica/replicaisland/
DFixedSizeArray.java197 final boolean sorted = mSorted;
200 if (sorted && !ignoreComparator && count > LINEAR_SEARCH_CUTOFF) {
220 } else if (result > 0 && sorted) {
/external/v8/test/mjsunit/
Darray-sort.js369 var sorted = ["a2", "a3", "b1", "b2", "c1", "c2", "d1", "d2", "e3",
371 for (var i = 0; i < sorted.length; i++) {
373 assertEquals(sorted[i], x[i], name + i);
375 assertFalse(x.hasOwnProperty(sorted.length), name + "haspost");
376 assertFalse(sorted.length in x, name + "haspost2");
/external/icu4c/stubdata/
Dicu_dat_generator.py165 print "%s=%s" % (kind, sorted(locales))
174 print "%s includes %s." % (input_basename, ", ".join(sorted(every_language)))
185 for missing_file in sorted(missing_files):
285 for input_file in sorted(input_files):
/external/webkit/Tools/Scripts/webkitpy/common/net/
Dfailuremap.py47 return sorted(set(sum(failing_revisions, [])))
60 return sorted(result)
/external/webkit/Tools/Scripts/webkitpy/style/
Doptparser.py226 for key in sorted(flags.keys()):
377 for category in sorted(self._all_categories):
381 for filter_rule in sorted(self._base_filter_rules):
/external/clang/test/CodeGenCXX/
D2007-04-05-PackedBitFieldsOverlap-2.cpp10 unsigned long sorted : 1; member

12345678