/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/chromium_org/third_party/boringssl/src/include/openssl/ |
H A D | stack.h | 101 /* sorted is non-zero if the values pointed to by |data| are in ascending 103 size_t sorted; member in struct:stack_st 254 * stack will be sorted if need be so that a binary search can be used. 277 * comparison function. The stack maintains a |sorted| flag and sorting an 278 * already sorted stack is a no-op. */ 281 /* sk_is_sorted returns one if |sk| is known to be sorted and zero
|
/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/chromium_org/chrome/browser/safe_browsing/ |
H A D | safe_browsing_store.cc | 13 // Return |true| if the range is sorted by the given comparator. 15 bool sorted(CTI beg, CTI end, LESS less) { function in namespace:__anon4616 104 // Make sure things are sorted appropriately. 105 DCHECK(sorted(add_prefixes->begin(), add_prefixes->end(), 107 DCHECK(sorted(sub_prefixes->begin(), sub_prefixes->end(), 109 DCHECK(sorted(add_full_hashes->begin(), add_full_hashes->end(), 111 DCHECK(sorted(sub_full_hashes->begin(), sub_full_hashes->end(),
|
/external/chromium_org/third_party/brotli/src/brotli/dec/ |
H A D | huffman.c | 74 int symbol; /* symbol index in original or sorted table */ 82 int* sorted; /* symbols sorted by code length */ local 84 int offset[MAX_LENGTH + 1]; /* offsets in sorted table for each length */ 86 sorted = (int*)malloc((size_t)code_lengths_size * sizeof(*sorted)); 87 if (sorted == NULL) { 96 /* generate offsets into sorted symbol table by code length */ 105 sorted[offset[code_lengths[symbol]]++] = symbol; 117 code.value = (uint16_t)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/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 | 42 int sorted; member in struct:ext2_struct_dblist
|
/external/e2fsprogs/resize/ |
H A D | extent.c | 31 __u64 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 | 365 // 1. Create a vector of extensions sorted by their pref values. This vector may 368 // 3. Remove holes from the sorted vector and append the unsorted vector. 382 ExtensionList sorted; local 383 sorted.resize(positions.size(), NULL); 405 sorted[pos - positions.begin()] = extension; 423 toolbar_items_.reserve(sorted.size() + unsorted.size()); 425 for (ExtensionList::const_iterator iter = sorted.begin(); 426 iter != sorted.end(); ++iter) {
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | ShapeOps.cpp | 43 SkTDArray<Angle*> sorted; local 44 bool sortable = Segment::SortAngles(angles, sorted); 45 int angleCount = sorted.count(); 47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0); 56 angle = sorted[++firstIndex]; 60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex); 75 angle = sorted[nextIndex];
|
/external/chromium_org/tools/gn/ |
H A D | trace.cc | 88 std::vector<Coalesced> sorted; local 91 sorted.push_back(iter->second); 92 std::sort(sorted.begin(), sorted.end(), &CoalescedDurationGreater); 94 for (size_t i = 0; i < sorted.size(); i++) { 96 sorted[i].total_duration, sorted[i].count); 97 out << *sorted[i].name_ptr << std::endl;
|