/external/chromium_org/third_party/openssl/openssl/crypto/stack/ |
H A D | stack.h | 70 int sorted; member in struct:stack_st
|
/external/chromium_org/third_party/openssl/openssl/include/openssl/ |
H A D | stack.h | 70 int sorted; member in struct:stack_st
|
/external/clang/test/CodeGenCXX/ |
H A D | 2007-04-05-PackedBitFieldsOverlap-2.cpp | 10 unsigned long sorted : 1; member in struct:M_Packed
|
/external/dhcpcd/ |
H A D | 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/ |
H A D | stack.h | 70 int sorted; member in struct:stack_st
|
/external/openssl/include/openssl/ |
H A D | stack.h | 70 int sorted; member in struct:stack_st
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 83 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/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
H A D | 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`."""
|
H A D | 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()):
|
H A D | misc.py | 4 from coverage.backward import md5, sorted # pylint: disable=W0622 namespace 103 for k in sorted(keys):
|
H A D | 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()]
|
H A D | 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)
|
H A D | cmdline.py | 5 from coverage.backward import sorted # pylint: disable=W0622 namespace 495 filenames = sorted(summary.keys())
|
H A D | parser.py | 5 from coverage.backward import set, sorted, StringIO # pylint: disable=W0622 namespace 179 Returns a sorted list of the first lines. 190 return sorted(lset) 195 Return values are 1) a sorted list of executable line numbers, and 196 2) a sorted list of excluded line numbers. 213 Returns a sorted list of line number pairs. Line numbers have been 223 return sorted(all_arcs)
|
/external/jmonkeyengine/engine/src/core/com/jme3/collision/ |
H A D | 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 [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | SortUtil.java | 119 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 D | 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/chrome/browser/extensions/ |
H A D | 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/clang/utils/ |
H A D | FindSpecRefs | 758 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 D | 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/doclava/src/com/google/doclava/ |
H A D | NavTree.java | 65 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 D | ext2fsP.h | 40 int sorted; member in struct:ext2_struct_dblist
|
/external/e2fsprogs/resize/ |
H A D | 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; 203 extent->num, extent->size, extent->cursor, extent->sorted);
|
/external/libvorbis/vq/ |
H A D | vqgen.h | 23 int sorted; member in struct:vqgen
|
/external/chromium_org/chrome/browser/extensions/ |
H A D | 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) {
|