| /external/selinux/prebuilts/bin/ |
| 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(mod.added_perms):
[all …]
|
| /external/webp/src/utils/ |
| D | huffman_utils.c | 78 // sorted[code_lengths_size] is a pre-allocated array for sorting symbols
82 uint16_t sorted[]) { in BuildHuffmanTable() argument
86 int symbol; // symbol index in original or sorted table in BuildHuffmanTable()
89 // offsets in sorted table for each length: in BuildHuffmanTable()
110 // Generate offsets into sorted symbol table by code length. in BuildHuffmanTable()
123 sorted[offset[symbol_code_length]++] = symbol; in BuildHuffmanTable()
131 code.value = (uint16_t)sorted[0]; in BuildHuffmanTable()
157 code.value = (uint16_t)sorted[symbol++]; in BuildHuffmanTable()
184 code.value = (uint16_t)sorted[symbol++]; in BuildHuffmanTable()
211 uint16_t sorted[SORTED_SIZE_CUTOFF]; in VP8LBuildHuffmanTable() local
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableSortedMultiset.java | 32 * An immutable {@code SortedMultiset} that stores its elements in a sorted array. Some instances
92 * Returns the empty immutable sorted multiset.
100 * Returns an immutable sorted multiset containing a single element.
111 * Returns an immutable sorted multiset containing the given elements sorted by their natural
122 * Returns an immutable sorted multiset containing the given elements sorted by their natural
133 * Returns an immutable sorted multiset containing the given elements sorted by their natural
145 * Returns an immutable sorted multiset containing the given elements sorted by their natural
157 * Returns an immutable sorted multiset containing the given elements sorted by their natural
173 * Returns an immutable sorted multiset containing the given elements sorted by their natural
183 * Returns an immutable sorted multiset containing the given elements sorted by their natural
[all …]
|
| D | ImmutableSortedSet.java | 40 * An immutable {@code SortedSet} that stores its elements in a sorted array.
118 * Returns the empty immutable sorted set.
125 * Returns an immutable sorted set containing a single element.
134 * Returns an immutable sorted set containing the given elements sorted by
147 * Returns an immutable sorted set containing the given elements sorted by
160 * Returns an immutable sorted set containing the given elements sorted by
173 * Returns an immutable sorted set containing the given elements sorted by
186 * Returns an immutable sorted set containing the given elements sorted by
210 * Returns an immutable sorted set containing the given elements sorted by
223 * Returns an immutable sorted set containing the given elements sorted by
[all …]
|
| D | ImmutableSortedMap.java | 111 * Returns the empty sorted map.
129 * Returns an immutable sorted map containing the given entries, sorted by the
142 * Returns an immutable sorted map containing the given entries, sorted by the
156 * Returns an immutable sorted map containing the given entries, sorted by the
170 * Returns an immutable sorted map containing the given entries, sorted by the
184 * Returns an immutable map containing the same entries as {@code map}, sorted
211 * keys sorted by the provided comparator.
227 * Returns an immutable map containing the same entries as the provided sorted
306 * Returns a builder that creates immutable sorted maps whose keys are
307 * ordered by their natural ordering. The sorted maps use {@link
[all …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_binary.h | 334 * The function is given a structure containing the sorted portcons and
338 * @param[in] node The cil_sort structure that contains the sorted portcons.
346 * The function is given a structure containing the sorted netifcons and
350 * @param[in] node The cil_sort structure that contains the sorted netifcons.
358 * The function is given a structure containing the sorted nodecons and
362 * @param[in] node The cil_sort structure that contains the sorted nodecons.
370 * The function is given a structure containing the sorted fsuses and
374 * @param[in] node The cil_sort structure that contains the sorted fsuses.
382 * The function is given a structure containing the sorted genfscons and
386 * @param[in] node The cil_sort structure that contains the sorted genfscons.
[all …]
|
| /external/libopus/silk/ |
| D | sort.c | 32 /* Insertion sort (fast for already almost sorted arrays): */
33 /* Best case: O(n) for an already sorted array */
34 /* Worst case: O(n^2) for an inversely sorted array */
41 opus_int32 *a, /* I/O Unsorted / Sorted vector */ in silk_insertion_sort_increasing()
42 opus_int *idx, /* O Index vector for the sorted elements */ in silk_insertion_sort_increasing()
44 const opus_int K /* I Number of correctly sorted positions */ in silk_insertion_sort_increasing()
89 …opus_int16 *a, /* I/O Unsorted / Sorted vector … in silk_insertion_sort_decreasing_int16()
90 …opus_int *idx, /* O Index vector for the sorted elements … in silk_insertion_sort_decreasing_int16()
92 …const opus_int K /* I Number of correctly sorted positions … in silk_insertion_sort_decreasing_int16()
136 …opus_int16 *a, /* I/O Unsorted / Sorted vector … in silk_insertion_sort_increasing_all_values_int16()
|
| /external/skia/tools/ |
| D | monobench.cpp | 115 std::vector<Result> sorted(benches.size()); in main() local
117 sorted[i].name = benches[i].name.c_str(); in main()
118 sorted[i].best = benches[i].best; in main()
120 std::sort(sorted.begin(), sorted.end(), [](const Result& a, const Result& b) { in main()
125 for (auto& result : sorted) { in main()
126 if (sorted.size() == 1) { in main()
129 SkDebugf(" %s %.3gx", result.name, result.best / sorted[0].best); in main()
|
| D | Stats.h | 47 SkAutoTMalloc<double> sorted(n); in Stats()
48 memcpy(sorted.get(), samples.begin(), n * sizeof(double)); in Stats()
49 SkTQSort(sorted.get(), sorted.get() + n - 1); in Stats()
50 median = sorted[n/2]; in Stats()
|
| /external/lzma/CPP/7zip/Common/ |
| D | UniqBlocks.cpp | 9 unsigned left = 0, right = Sorted.Size(); in AddUniq()
13 int index = Sorted[mid]; in AddUniq()
32 Sorted.Insert(left, index); in AddUniq()
48 unsigned num = Sorted.Size(); in GetReverseMap()
55 p[Sorted[i]] = i; in GetReverseMap()
|
| /external/v8/tools/ |
| 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_list):
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | ElemSort.java | 132 * strings to be sorted.
144 * sorted lexicographically in the culturally correct manner for the
149 * converted to numbers and then sorted according to the numeric value;
181 * sorted lexicographically in the culturally correct manner for the
186 * converted to numbers and then sorted according to the numeric value;
212 * order specifies whether the strings should be sorted in ascending
220 * order specifies whether the strings should be sorted in ascending
233 * order specifies whether the strings should be sorted in ascending
256 * For example, if lang="en", then A a B b are sorted with
257 * case-order="upper-first" and a A b B are sorted with case-order="lower-first".
[all …]
|
| /external/libopus/silk/float/ |
| D | sort_FLP.c | 32 /* Insertion sort (fast for already almost sorted arrays): */
33 /* Best case: O(n) for an already sorted array */
34 /* Worst case: O(n^2) for an inversely sorted array */
40 …silk_float *a, /* I/O Unsorted / Sorted vector … in silk_insertion_sort_decreasing_FLP()
41 …opus_int *idx, /* O Index vector for the sorted elements … in silk_insertion_sort_decreasing_FLP()
43 …const opus_int K /* I Number of correctly sorted positions … in silk_insertion_sort_decreasing_FLP()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 83 ArrayList<Object> sorted = new ArrayList<Object>(); in sort() local
91 DFS(n, visited, sorted); in sort()
93 return sorted; in sort()
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { in DFS() argument
102 DFS(target, visited, sorted); in DFS()
105 sorted.add(n.payload); in DFS()
|
| /external/boringssl/src/util/ |
| D | generate_build_files.py | 84 for f in sorted(files):
96 for f in sorted(files['crypto']):
109 for f in sorted(asm_files):
117 for f in sorted(asm_files):
128 for f in sorted(files['ssl']):
136 for f in sorted(files['tool']):
144 for f in sorted(files['test_support']):
152 for f in sorted(files['crypto_test']):
160 for f in sorted(files['ssl_test']):
168 for f in sorted(files['test']):
[all …]
|
| /external/e2fsprogs/resize/ |
| D | extent.c | 32 __u64 sorted; member
51 extent->sorted = 1; in ext2fs_create_extent_table()
115 extent->sorted = 0; in ext2fs_add_extent_entry()
149 if (!extent->sorted) { in ext2fs_extent_translate()
152 extent->sorted = 1; in ext2fs_extent_translate()
203 fprintf(out, _("#\tNum=%llu, Size=%llu, Cursor=%llu, Sorted=%llu\n"), in ext2fs_extent_dump()
204 extent->num, extent->size, extent->cursor, extent->sorted); in ext2fs_extent_dump()
|
| /external/valgrind/VEX/orig_amd64/ |
| D | Compare.hs | 6 {- Compares a .sorted file with a raw printout of instructions
24 main = mayn "test2.sorted" "out.txt"
29 = do sorted <- readFile sorted_fn
31 let ress = zipWith check (lines (deTab sorted))
|
| /external/libdrm/ |
| D | xf86drmMode.c | 1200 /* keep it sorted by object_id and property_id */ in drmModePropertySetAdd()
1260 /* keep it sorted by object_id and property_id */ in drmModePropertySetAddBlob()
1582 drmModeAtomicReqPtr sorted; in drmModeAtomicCommit() local
1599 sorted = drmModeAtomicDuplicate(req); in drmModeAtomicCommit()
1600 if (sorted == NULL) in drmModeAtomicCommit()
1606 qsort(sorted->items, sorted->cursor, sizeof(*sorted->items), in drmModeAtomicCommit()
1609 /* Now the list is sorted, eliminate duplicate property sets. */ in drmModeAtomicCommit()
1610 for (i = 0; i < sorted->cursor; i++) { in drmModeAtomicCommit()
1611 if (sorted->items[i].object_id != last_obj_id) { in drmModeAtomicCommit()
1613 last_obj_id = sorted->items[i].object_id; in drmModeAtomicCommit()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | usetiter.cpp | 45 …* <br>You are guaranteed that the codepoints are in sorted order, and the strings are in sorted or…
72 * <br>Note that the codepoints are in sorted order, and the strings are in sorted order,
74 * <br>You are guaranteed that the ranges are in sorted order, and the strings are in sorted order,
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | dblist.c | 96 dblist->sorted = 1; in ext2fs_init_dblist()
117 dblist->sorted = src->sorted; in ext2fs_copy_dblist()
157 dblist->sorted = 0; in ext2fs_add_dir_block2()
177 dblist->sorted = 0; in ext2fs_set_dir_block2()
191 dblist->sorted = 1; in ext2fs_dblist_sort2()
211 if (!dblist->sorted) in ext2fs_dblist_iterate3()
311 dblist->sorted = 1; in ext2fs_dblist_sort()
|
| /external/clang/test/Format/ |
| D | disable-include-sorting.cpp | 3 // RUN: clang-format %s -sort-includes=false | FileCheck %s -check-prefix=NOT-SORTED
9 // NOT-SORTED: <b>
10 // NOT-SORTED-NEXT: <a>
|
| /external/llvm/test/tools/llvm-objdump/X86/ |
| D | macho-archive-headers.test | 10 CHECK: -rw-r--r--124/11 44 {{.*}} __.SYMDEF SORTED
13 CHECK: -rw-r--r--124/11 60 {{.*}} __.SYMDEF SORTED
17 OFFSETS: 8 -rw-r--r--124/11 44 {{.*}} __.SYMDEF SORTED
20 OFFSETS: 8 -rw-r--r--124/11 60 {{.*}} __.SYMDEF SORTED
|
| /external/opencv/ml/src/ |
| D | mlboost.cpp | 211 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); in calc_node_dir() local
220 int idx = sorted[i].i; in calc_node_dir()
228 int idx = sorted[i].i; in calc_node_dir()
235 dir[sorted[i].i] = (char)0; in calc_node_dir()
247 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); in find_split_ord_class() local
262 int idx = sorted[i].i; in find_split_ord_class()
277 int idx = sorted[i].i; in find_split_ord_class()
287 if( sorted[i].val + epsilon < sorted[i+1].val ) in find_split_ord_class()
302 int idx = sorted[i].i; in find_split_ord_class()
308 if( sorted[i].val + epsilon < sorted[i+1].val ) in find_split_ord_class()
[all …]
|
| /external/llvm/utils/ |
| 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/doclava/src/com/google/doclava/ |
| D | NavTree.java | 68 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); in writeYamlTree() local
73 sorted.put(cl.qualifiedName(), cl); in writeYamlTree()
82 sorted.put(name, pkg); in writeYamlTree()
85 data = makeYamlHDF(sorted, "docs.pages", data); in writeYamlTree()
97 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) { in makeYamlHDF() argument
101 for (String s : sorted.keySet()) { in makeYamlHDF()
102 Object o = sorted.get(s); in makeYamlHDF()
|