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

1 2 3 4 5

  /external/chromium_org/third_party/openssl/openssl/crypto/stack/
stack.h 70 int sorted; member in struct:stack_st
  /external/chromium_org/third_party/openssl/openssl/include/openssl/
stack.h 70 int sorted; member in struct:stack_st
  /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/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/
backward.py 17 # Python 2.3 doesn't have `sorted`.
19 sorted = sorted variable
21 def sorted(iterable): function
22 """A 2.3-compatible implementation of `sorted`."""
xmlreport.py 7 from coverage.backward import sorted # pylint: disable=W0622 namespace
63 for pkg_name in sorted(self.packages.keys()):
70 for class_name in sorted(class_elts.keys()):
misc.py 4 from coverage.backward import md5, sorted # pylint: disable=W0622 namespace
103 for k in sorted(keys):
data.py 5 from coverage.backward import pickle, sorted # pylint: disable=W0622 namespace
16 * lines: a dict mapping filenames to sorted lists of line numbers
20 * arcs: a dict mapping filenames to sorted lists of line number pairs:
64 self.sorted = sorted
104 [(f, self.sorted(lmap.keys())) for f, lmap in self.lines.items()]
110 [(f, self.sorted(amap.keys())) for f, amap in self.arcs.items()]
results.py 5 from coverage.backward import set, sorted # pylint: disable=W0622 namespace
35 self.missing = sorted(set(self.statements) - set(exec1))
73 """Returns a sorted list of the arcs in the code."""
78 """Returns a sorted list of the arcs actually executed in the code."""
82 return sorted(executed)
85 """Returns a sorted list of the arcs in the code not executed."""
93 return sorted(missing)
96 """Returns a sorted list of the executed arcs missing from the code."""
107 return sorted(unpredicted)
  /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...]
  /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);
  /art/test/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()) {
  /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/chromium_org/chrome/browser/extensions/
extension_toolbar_model.cc 309 // 1. Create a vector of extensions sorted by their pref values. This vector may
312 // 3. Remove holes from the sorted vector and append the unsorted vector.
326 ExtensionList sorted; local
327 sorted.resize(positions.size(), NULL);
348 sorted[pos - positions.begin()] = extension;
361 toolbar_items_.reserve(sorted.size() + unsorted.size());
362 for (ExtensionList::const_iterator iter = sorted.begin();
363 iter != sorted.end(); ++iter) {
  /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

Completed in 2501 milliseconds

1 2 3 4 5