HomeSort by relevance Sort by last modified time
    Searched defs:sorted (Results 1 - 25 of 79) sorted by null

1 2 3 4

  /external/clang/test/CodeGenCXX/
2007-04-05-PackedBitFieldsOverlap-2.cpp 10 unsigned long sorted : 1; member in struct:M_Packed
  /external/dhcpcd/
if-pref.c 79 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;
  /external/openssl/crypto/stack/
stack.h 70 int sorted; member in struct:stack_st
  /external/openssl/include/openssl/
stack.h 70 int sorted; member in struct:stack_st
  /external/openfst/src/lib/
symbol-table-ops.cc 86 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/jmonkeyengine/engine/src/core/com/jme3/collision/
CollisionResults.java 48 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 = true
    [all...]
  /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/chromium/chrome/browser/extensions/
extension_toolbar_model.cc 168 // 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/libvorbis/vq/
vqgen.h 23 int sorted; member in struct:vqgen
  /sdk/emulator/qtools/
bb2sym.cpp 75 MyStaticRec **sorted = assign_inner_blocks(num_static_bb, blocks); local
91 if (sorted[ii]->bb.bb_addr == 0 || sorted[ii]->bb.num_insns == 0
92 || sorted[ii]->sym == NULL)
96 sorted[ii]->bb.bb_num, sorted[ii]->bb.num_insns,
97 sorted[ii]->bb.bb_addr, sorted[ii]->sym->region->path,
98 sorted[ii]->sym->name);
110 MyStaticRec **sorted = new MyStaticRec*[num_blocks] local
    [all...]
bbprof.cpp 93 MyStaticRec **sorted = assign_inner_blocks(num_static_bb, blocks); local
133 qsort(sorted, num_static_bb, sizeof(MyStaticRec*), cmp_dec_elapsed);
140 sorted[ii]->bb.bb_num, sorted[ii]->bb.bb_addr,
141 sorted[ii]->bb.num_insns, sorted[ii]->freq,
142 sorted[ii]->elapsed);
143 int num_insns = sorted[ii]->bb.num_insns;
144 uint32_t addr = sorted[ii]->bb.bb_addr;
146 uint32_t elapsed = sorted[ii]->cycles[jj]
192 MyStaticRec **sorted = new MyStaticRec*[num_blocks]; local
    [all...]
  /external/doclava/src/com/google/doclava/
NavTree.java 65 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local
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) {
90 for (String s : sorted.keySet()) {
91 Object o = sorted.get(s);
  /cts/tools/cts-xml-generator/src/com/android/cts/xmlgenerator/
XmlGenerator.java 147 Collection<TestSuite> sorted = sortCollection(suites); local
148 for (TestSuite suite : sorted) {
168 Collection<TestCase> sorted = sortCollection(cases); local
169 for (TestCase testCase : sorted) {
184 Collection<Test> sorted = sortCollection(tests); local
185 for (Test test : sorted) {
  /dalvik/tests/004-annotations/src/android/test/anno/
TestAnnotations.java 11 * Print the annotations in sorted order, so as to avoid
15 TreeMap<String, Annotation> sorted = local
19 sorted.put(a.annotationType().getName(), a);
22 for (Annotation a : sorted.values()) {
  /external/clang/utils/
FindSpecRefs 758 def sorted(l): function
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
    [all...]
  /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/lib/ext2fs/
ext2fsP.h 40 int sorted; member in struct:ext2_struct_dblist
  /external/e2fsprogs/resize/
extent.c 31 int sorted; member in struct:_ext2_extent
50 extent->sorted = 1;
114 extent->sorted = 0;
148 if (!extent->sorted) {
151 extent->sorted = 1;
202 fprintf(out, _("#\tNum=%d, Size=%d, Cursor=%d, Sorted=%d\n"),
203 extent->num, extent->size, extent->cursor, extent->sorted);
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
SortUtil.java 119 private static void test(Float[] original, Float[] sorted, Comparator<Float> ic) {
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 = new Float[original.length] local
    [all...]
  /hardware/invensense/mlsdk/mllite/
compass.c 107 float avg, sum, median, sorted[YAS_DEFAULT_FILTER_LEN]; local
129 memcpy(sorted, adap_filter->sequence, adap_filter->len * sizeof(float));
130 qsort(&sorted, adap_filter->len, sizeof(float), cmpfloat);
131 median = sorted[adap_filter->len/2];
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/animator/
AnimationContentAssist.java 143 List<AttributeDescriptor> sorted = local
145 sorted.addAll(matches.values());
146 Collections.sort(sorted);
151 new ArrayList<Pair<String, String>>(sorted.size());
152 for (AttributeDescriptor d : sorted) {
  /dalvik/dexgen/src/com/android/dexgen/util/
IntList.java 34 /** 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...]
  /dalvik/dx/src/com/android/dx/util/
IntList.java 34 /** 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/dexmaker/src/dx/java/com/android/dx/util/
IntList.java 34 /** 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/v8/test/mjsunit/
array-sort.js 369 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");

Completed in 1007 milliseconds

1 2 3 4