/external/walt/ios/WALT/ |
H A D | NSArray+Extensions.m | 21 NSArray<NSNumber *> *sorted = [self sortedArrayUsingSelector:@selector(compare:)]; 22 const NSUInteger count = sorted.count; 28 return [sorted objectAtIndex:count / 2]; 30 return [NSNumber numberWithDouble:0.5 * ([sorted objectAtIndex:count / 2].doubleValue + 31 [sorted objectAtIndex:count / 2 - 1].doubleValue)];
|
/external/clang/test/CodeGenCXX/ |
H A D | 2007-04-05-PackedBitFieldsOverlap-2.cpp | 10 unsigned long sorted : 1; member in struct:M_Packed
|
/external/skia/tools/ |
H A D | Stats.h | 47 SkAutoTMalloc<double> sorted(n); 48 memcpy(sorted.get(), samples.begin(), n * sizeof(double)); 49 SkTQSort(sorted.get(), sorted.get() + n - 1); 50 median = sorted[n/2];
|
/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/skia/bin/ |
H A D | list-skia-bots | 11 for j in sorted(json.load(open(path, 'r'))['jobs'].keys()):
|
/external/selinux/prebuilts/bin/ |
H A D | sediff.py | 138 for name, added, removed in sorted(diff.modified_properties, key=lambda x: x.property): 149 for c in sorted(diff.added_commons): 153 for c in sorted(diff.removed_commons): 157 for name, mod in sorted(diff.modified_commons.items()): 165 for p in sorted(mod.added_perms): 167 for p in sorted(mod.removed_perms): 177 for c in sorted(diff.added_classes): 181 for c in sorted(diff.removed_classes): 185 for name, mod in sorted(diff.modified_classes.items()): 193 for p in sorted(mo [all...] |
/external/python/cpython2/Doc/includes/ |
H A D | mp_newtype.py | 71 assert sorted(f1._exposed_) == sorted(['f', 'g']) 79 assert sorted(f2._exposed_) == sorted(['g', '_h'])
|
/external/r8/src/main/java/com/android/tools/r8/graph/ |
H A D | DexAnnotationSet.java | 17 private int sorted = UNSORTED; field in class:DexAnnotationSet 60 if (sorted != UNSORTED) { 61 assert sorted == sortedHashCode(); 68 sorted = hashCode();
|
H A D | DexEncodedAnnotation.java | 17 private int sorted = UNSORTED; field in class:DexEncodedAnnotation 58 if (sorted != UNSORTED) { 59 assert sorted == sortedHashCode(); 66 sorted = sortedHashCode();
|
/external/r8/src/main/java/com/android/tools/r8/ir/code/ |
H A D | DominatorTree.java | 15 private BasicBlock[] sorted; field in class:DominatorTree 25 this.sorted = code.topologicallySortedBlocks(blocksToIgnore); 93 return sorted; 97 for (int i = 0; i < sorted.length; i++) { 98 sorted[i].setNumber(i); 113 doms = new BasicBlock[sorted.length]; 114 doms[0] = sorted[0]; 119 for (int i = 1; i < sorted.length; i++) { 120 BasicBlock b = sorted[i]; 167 for (BasicBlock block : sorted) { [all...] |
/external/hyphenation-patterns/de/ |
H A D | create_chr.py | 31 for c in sorted(all_chars):
|
/external/llvm/utils/ |
H A D | sort_includes.py | 72 local_headers = sorted(set(local_headers)) 73 subproject_headers = sorted(set(subproject_headers)) 74 llvm_headers = sorted(set(llvm_headers)) 75 system_headers = sorted(set(system_headers))
|
/external/python/cpython2/Demo/comparisons/ |
H A D | sortingtest.py | 9 # such that each output line is sorted WRT to the number. Order 23 # - Outputs the sorted fields with exactly one space between them 40 items = sorted(makekey(item) for item in line.split())
|
/external/webp/src/utils/ |
H A D | huffman_utils.c | 78 // sorted[code_lengths_size] is a pre-allocated array for sorting symbols 82 uint16_t sorted[]) { 86 int symbol; // symbol index in original or sorted table 89 // offsets in sorted table for each length: 110 // Generate offsets into sorted symbol table by code length. 123 sorted[offset[symbol_code_length]++] = symbol; 131 code.value = (uint16_t)sorted[0]; 157 code.value = (uint16_t)sorted[symbol++]; 184 code.value = (uint16_t)sorted[symbol++]; 211 uint16_t sorted[SORTED_SIZE_CUTOF local 80 BuildHuffmanTable(HuffmanCode* const root_table, int root_bits, const int code_lengths[], int code_lengths_size, uint16_t sorted[]) argument 215 uint16_t* const sorted = local [all...] |
/external/brotli/java/org/brotli/dec/ |
H A D | Huffman.java | 71 int[] sorted = new int[codeLengthsSize]; // Symbols sorted by code length. 74 int[] offset = new int[MAX_LENGTH + 1]; // Offsets in sorted table for each length. 82 // Generate offsets into sorted symbol table by code length. 91 sorted[offset[codeLengths[symbol]]++] = symbol; 102 rootTable[tableOffset + key] = sorted[0]; 112 replicateValue(rootTable, tableOffset + key, step, tableSize, len << 16 | sorted[symbol++]); 133 (len - rootBits) << 16 | sorted[symbol++]);
|
/external/v8/tools/ |
H A D | gyp_flag_compare.py | 150 'defines': sorted(defines), 151 'include_dirs': sorted(include_dirs), # TODO(scottmg): This is wrong. 152 'dash_f': sorted(dash_f), 153 'warnings': sorted(warnings), 154 'other': sorted(others), 179 sorted(missing_in_gyp)) + '\n' 183 sorted(missing_in_gn)) + '\n\n' 234 sorted(gyp_files - gn_files)) 236 sorted(gn_files - gyp_files)) 240 for filename in sorted(file_lis [all...] |
/external/python/cpython2/Tools/ssl/ |
H A D | make_ssl_data.py | 47 for libcode, prefix, h_file in sorted(error_libraries.values()): 71 for mnemo, (libcode, _, _) in sorted(error_libraries.items()): 78 for errcode, (libcode, name, num) in sorted(codes.items()):
|
/external/autotest/client/cros/camera/ |
H A D | camera_utils.py | 26 ', '.join('%s=%s' % (k, v) for k, v in sorted(self.__dict__.items())
|
/external/libmojo/third_party/catapult/devil/devil/android/tools/ |
H A D | script_common.py | 24 return sorted(device_utils.DeviceUtils(d)
|
/external/libnl/doc/ |
H A D | resolve-asciidoc-refs.py | 23 rc = re.compile('|'.join(map(re.escape, sorted(refs, reverse=True))))
|
/external/python/cpython2/Lib/idlelib/ |
H A D | PathBrowser.py | 81 sorted = [] 90 sorted.append((normed_name, name)) 92 sorted.sort() 93 return sorted
|
/external/vixl/tools/ |
H A D | known_test_failures.py | 79 for t in sorted(known_valgrind_test_failures):
|
/external/boringssl/src/crypto/stack/ |
H A D | stack.c | 111 sk->sorted = 0; 189 sk->sorted = 0; 315 ret->sorted = sk->sorted; 328 if (sk == NULL || sk->comp == NULL || sk->sorted) { 335 sk->sorted = 1; 342 return sk->sorted; 349 sk->sorted = 0;
|
/external/chromium-trace/catapult/third_party/pyserial/serial/tools/ |
H A D | list_ports.py | 84 iterator = sorted(grep(args[0])) 86 iterator = sorted(comports())
|
/external/fonttools/Lib/fontTools/misc/ |
H A D | textTools.py | 67 """Return a sorted copy of a list. If there are only strings 72 return sorted(alist, key=lambda a: (a.lower(), a)) 74 return sorted(alist)
|