Searched defs:sorted (Results 1 - 25 of 38) sorted by relevance

12

/external/clang/test/CodeGenCXX/
H A D2007-04-05-PackedBitFieldsOverlap-2.cpp10 unsigned long sorted : 1; member in struct:M_Packed
/external/dhcpcd/
H A Dif-pref.c79 struct interface *sorted, *ifp, *ifn, *ift; local
83 sorted = ifaces;
85 sorted->next = NULL;
88 if (ifcmp(ifp, sorted) == -1) {
89 ifp->next = sorted;
90 sorted = ifp;
94 for (ift = sorted; ift->next; ift = ift->next) {
107 ifaces = sorted;
H A Dipv6rs.c235 struct ra *rap, *sorted, *ran, *rat; local
241 sorted = ifp->ras;
243 sorted->next = NULL;
246 if (timercmp(&rap->received, &sorted->received, <)) {
247 rap->next = sorted;
248 sorted = rap;
252 for (rat = sorted; rat->next; rat = rat->next) {
/external/openssl/crypto/stack/
H A Dstack.h70 int sorted; member in struct:stack_st
/external/openssl/include/openssl/
H A Dstack.h70 int sorted; member in struct:stack_st
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java83 ArrayList<Object> sorted = new ArrayList<Object>();
91 DFS(n, visited, sorted);
93 return sorted;
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { argument
102 DFS(target, visited, sorted);
105 sorted.add(n.payload);
/external/jmonkeyengine/engine/src/core/com/jme3/collision/
H A DCollisionResults.java48 private boolean sorted = true; field in class:CollisionResults
63 if (!sorted){
65 sorted = true;
73 sorted = false;
84 if (!sorted){
86 sorted = true;
96 if (!sorted){
98 sorted = true;
105 if (!sorted){
107 sorted
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/util/
H A DSortUtil.java119 private static void test(Float[] original, Float[] sorted, Comparator<Float> ic) { argument
124 System.arraycopy(original, 0, sorted, 0, original.length);
125 gsort(sorted, ic);
132 System.arraycopy(original, 0, sorted, 0, original.length);
133 qsort(sorted, ic);
140 System.arraycopy(original, 0, sorted, 0, original.length);
141 msort(original, sorted, ic);
148 System.arraycopy(original, 0, sorted, 0, original.length);
149 Arrays.sort(sorted, ic);
165 Float[] sorted
[all...]
/external/openfst/src/lib/
H A Dsymbol-table-ops.cc86 map<int, string> sorted; local
89 sorted[stiter.Value()] = stiter.Symbol();
93 for (map<int, string>::const_iterator si = sorted.begin();
94 si != sorted.end(); ++si) {
/external/chromium/chrome/browser/extensions/
H A Dextension_toolbar_model.cc168 // 1. Create a vector of extensions sorted by their pref values. This vector may
171 // 3. Remove holes from the sorted vector and append the unsorted vector.
178 ExtensionList sorted; local
179 sorted.resize(pref_order.size(), NULL);
195 sorted[index] = extension;
202 toolitems_.reserve(sorted.size() + unsorted.size());
203 for (ExtensionList::iterator iter = sorted.begin();
204 iter != sorted.end(); ++iter) {
/external/clang/utils/
H A DFindSpecRefs758 def sorted(l): function
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DIntList.java34 /** 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/doclava/src/com/google/doclava/
H A DNavTree.java65 SortedMap<String, Object> sorted = new TreeMap<String, Object>();
70 sorted.put(cl.qualifiedName(), cl);
79 sorted.put(name, pkg);
82 data = makeYamlHDF(sorted, "docs.pages", data);
86 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) { argument
90 for (String s : sorted.keySet()) {
91 Object o = sorted.get(s);
/external/e2fsprogs/lib/ext2fs/
H A Dext2fsP.h40 int sorted; member in struct:ext2_struct_dblist
/external/e2fsprogs/resize/
H A Dextent.c31 int sorted; member in struct:_ext2_extent
50 extent->sorted = 1;
114 extent->sorted = 0;
148 if (!extent->sorted) {
151 extent->sorted = 1;
203 extent->num, extent->size, extent->cursor, extent->sorted);
/external/libvorbis/vq/
H A Dvqgen.h23 int sorted; member in struct:vqgen
/external/clang/utils/TableGen/
H A DClangSACheckersEmitter.cpp267 std::map<int, const Record *> sorted; local
270 sorted[(*I)->getID()] = *I;
273 I = sorted.begin(), E = sorted.end(); I != E; ++I)
282 std::map<int, const Record *> sorted; local
285 sorted[(*I)->getID()] = *I;
288 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
/external/v8/test/mjsunit/
H A Darray-sort.js369 var sorted = ["a2", "a3", "b1", "b2", "c1", "c2", "d1", "d2", "e3", variable
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/valgrind/main/coregrind/
H A Dm_xarray.c49 Bool sorted; /* is it sorted? */ member in struct:_XArray
77 xa->sorted = False;
134 xa->sorted = False;
194 xa->sorted = False;
215 xa->sorted = False;
225 xa->sorted = True;
273 vg_assert(xa->sorted);
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h395 * to be sorted will be numeric indexes into some other structure such as an ANTLR3_VECTOR.
398 * array of the sorted noded indexes, in case you are not sorting ANTLR3_VECTORS but
417 * A vector used to build up the sorted output order. Note that
421 pANTLR3_UINT32 sorted; member in struct:ANTLR3_TOPO_struct
452 * One more than the largest node index that is contained in edges/sorted.
479 * A method that returns a pointer to an array of sorted node indexes.
480 * The array is sorted in topological sorted order. Note that the array
483 * was 16, then the returned array will be the sorted order of the first 16
487 * NB: If the structure that contains the array is freed, then the sorted
[all...]
/external/llvm/lib/ExecutionEngine/JIT/
H A DJIT.cpp124 unsigned long sorted : 1; member in struct:__anon9352::LibgccObject::__anon9353::__anon9354
/external/chromium/chrome/common/extensions/docs/examples/apps/hello-python/httplib2/
H A D__init__.py94 def sorted(seq): function in function:has_timeout
897 auth = auths and sorted(auths)[0][1] or None
/external/freetype/src/pshinter/
H A Dpshalgo.c120 PSH_Hint* sorted = table->sort_global; local
126 for ( ; count > 0; count--, sorted++ )
128 hint2 = sorted[0];
141 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
318 /* will be already sorted -- and the sort will be linear */
/external/guava/guava-tests/test/com/google/common/collect/
H A DSetsTest.java1030 SortedSet<Long> sorted = Sets.newTreeSet();
1032 sorted.add(i);
1034 SortedSet<Long> filteredEven = Sets.filter(sorted, new Predicate<Long>() {
1047 assertEquals("comparator", sorted.comparator(), filteredEven.comparator());
1049 sorted.add(12L);
1050 sorted.add(0L);
1076 static SortedSet<Long> sorted = Sets.newTreeSet(); field in class:SetsTest
1079 sorted.add(i);
1082 static SortedSet<Long> filterAllElements = Sets.filter(sorted, Predicates.alwaysFalse());
/external/skia/src/core/
H A DSkConcaveToTriangles.cpp120 // The ActiveTrapezoids are a sorted list containing the currently active
132 // left and right edges, and insert it into the sorted list.
146 // Insert the specified Trapezoid into the sorted list.
149 // The sorted list of active trapezoids. This is O(n), and would benefit
217 // Classify the vertex, and return its sorted edges.
322 if (vt->fTrap1 < vt->fTrap0) { // Keep trapezoids sorted.
375 // return false; // Outside all trapezoids, since they are sorted.
638 bool sorted; local
641 sorted = true;
647 sorted
[all...]

Completed in 659 milliseconds

12