/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/chromium_org/chrome/browser/safe_browsing/ |
safe_browsing_store.cc | 14 // Return |true| if the range is sorted by the given comparator. 16 bool sorted(CTI beg, CTI end, LESS less) { function in namespace:__anon9171 147 // Make sure things are sorted appropriately. 148 DCHECK(sorted(add_prefixes->begin(), add_prefixes->end(), 150 DCHECK(sorted(sub_prefixes->begin(), sub_prefixes->end(), 152 DCHECK(sorted(add_full_hashes->begin(), add_full_hashes->end(), 154 DCHECK(sorted(sub_full_hashes->begin(), sub_full_hashes->end(),
|
/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/chromium_org/third_party/brotli/src/brotli/dec/ |
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[0] [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/libvorbis/vq/ |
vqgen.h | 23 int sorted; member in struct:vqgen
|
/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/005-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 | 42 int sorted; member in struct:ext2_struct_dblist
|
/external/e2fsprogs/resize/ |
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; 202 fprintf(out, _("#\tNum=%llu, Size=%llu, Cursor=%llu, Sorted=%llu\n"), 203 extent->num, extent->size, extent->cursor, extent->sorted);
|
/hardware/invensense/60xx/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) {
|
/cts/tools/cts-xml-generator/src/com/android/cts/xmlgenerator/ |
XmlGenerator.java | 166 Collection<TestSuite> sorted = sortCollection(suites); local 167 for (TestSuite suite : sorted) { 187 Collection<TestCase> sorted = sortCollection(cases); local 188 for (TestCase testCase : sorted) { 203 Collection<Test> sorted = sortCollection(tests); local 204 for (Test test : 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...] |