Home
last modified time | relevance | path

Searched full:sorted (Results 1 – 25 of 1785) sorted by relevance

12345678910>>...72

/external/selinux/prebuilts/bin/
Dsediff.py114 for name, added, removed in sorted(diff.modified_properties, key=lambda x: x.property):
125 for c in sorted(diff.added_commons):
129 for c in sorted(diff.removed_commons):
133 for name, mod in sorted(diff.modified_commons.items()):
141 for p in sorted(mod.added_perms):
143 for p in sorted(mod.removed_perms):
153 for c in sorted(diff.added_classes):
157 for c in sorted(diff.removed_classes):
161 for name, mod in sorted(diff.modified_classes.items()):
169 for p in sorted(mod.added_perms):
[all …]
/external/webp/src/utils/
Dhuffman.c82 int* sorted = NULL; // symbols sorted by code length in VP8LBuildHuffmanTable() local
84 int symbol; // symbol index in original or sorted table in VP8LBuildHuffmanTable()
87 // offsets in sorted table for each length: in VP8LBuildHuffmanTable()
108 // Generate offsets into sorted symbol table by code length. in VP8LBuildHuffmanTable()
117 sorted = (int*)WebPSafeMalloc(code_lengths_size, sizeof(*sorted)); in VP8LBuildHuffmanTable()
118 if (sorted == NULL) { in VP8LBuildHuffmanTable()
126 sorted[offset[symbol_code_length]++] = symbol; in VP8LBuildHuffmanTable()
134 code.value = (uint16_t)sorted[0]; in VP8LBuildHuffmanTable()
136 WebPSafeFree(sorted); in VP8LBuildHuffmanTable()
156 WebPSafeFree(sorted); in VP8LBuildHuffmanTable()
[all …]
/external/guava/guava/src/com/google/common/collect/
DImmutableSortedMultiset.java32 * 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 …]
DImmutableSortedSet.java40 * 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 …]
DImmutableSortedMap.java111 * 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/dexmaker/src/dx/java/com/android/dx/util/
DIntList.java34 /** whether the values are currently sorted */
35 private boolean sorted; field in IntList
94 sorted = true; in IntList()
122 if (sorted != otherList.sorted) { in equals()
199 sorted = false; in set()
221 if (sorted && (size > 1)) { in add()
222 sorted = (value >= values[size - 2]); in add()
246 sorted = sorted in insert()
360 if (!sorted) { in sort()
362 sorted = true; in sort()
[all …]
/external/chromium-trace/catapult/third_party/closure_linter/closure_linter/
Drequireprovidesorter.py20 top of the file to manage dependencies. These statements should be sorted
43 stay with the statement as it gets sorted.
59 None is returned if all goog.provide statements are already sorted.
63 sorted_provide_strings = sorted(provide_strings)
81 None is returned if all goog.require statements are already sorted.
85 sorted_require_strings = sorted(require_strings)
117 sorted_strings = sorted(strings)
140 # Save token to rest of file. Sorted token will be inserted before this.
281 """Get fixed/sorted order of goog.require statements.
287 A string for correct sorted order of goog.require.
[all …]
/external/selinux/libsepol/cil/src/
Dcil_binary.h334 * 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/
Dsort.c32 /* 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/chromium-trace/catapult/third_party/coverage/coverage/
Dresults.py28 self._arc_possibilities = sorted(self.file_reporter.arcs())
66 """Returns a sorted list of the arcs in the code."""
70 """Returns a sorted list of the arcs actually executed in the code."""
73 return sorted(executed)
76 """Returns a sorted list of the arcs in the code not executed."""
84 return sorted(missing)
96 line_exits = sorted(iitems(arcs))
99 for ex in sorted(exits):
105 """Returns a sorted list of the executed arcs missing from the code."""
119 return sorted(unpredicted)
/external/apache-xml/src/main/java/org/apache/xalan/templates/
DElemSort.java132 * 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/libdrm/
Dxf86drmMode.c1200 /* 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/lzma/CPP/7zip/Common/
DUniqBlocks.cpp9 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/libopus/silk/float/
Dsort_FLP.c32 /* 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/
DGraph.java83 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/e2fsprogs/resize/
Dextent.c31 __u64 sorted; member
50 extent->sorted = 1; in ext2fs_create_extent_table()
114 extent->sorted = 0; in ext2fs_add_extent_entry()
148 if (!extent->sorted) { in ext2fs_extent_translate()
151 extent->sorted = 1; in ext2fs_extent_translate()
202 fprintf(out, _("#\tNum=%llu, Size=%llu, Cursor=%llu, Sorted=%llu\n"), in ext2fs_extent_dump()
203 extent->num, extent->size, extent->cursor, extent->sorted); in ext2fs_extent_dump()
/external/opencv/ml/src/
Dmlboost.cpp211 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/skia/tools/
DStats.h47 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/icu/icu4c/source/common/
Dusetiter.cpp43 …* <br>You are guaranteed that the codepoints are in sorted order, and the strings are in sorted or…
70 * <br>Note that the codepoints are in sorted order, and the strings are in sorted order,
72 * <br>You are guaranteed that the ranges are in sorted order, and the strings are in sorted order,
/external/autotest/client/cros/chameleon/
Daudio_test_utils.py36 sorted(curr_in_nodes) != sorted(in_audio_nodes)):
40 sorted(curr_out_nodes) != sorted(out_audio_nodes)):
60 sorted(curr_in_nodes) != sorted(in_audio_nodes)):
64 sorted(curr_out_nodes) != sorted(out_audio_nodes)):
/external/e2fsprogs/lib/ext2fs/
Ddblist.c123 dblist->sorted = 1; in ext2fs_init_dblist()
144 dblist->sorted = src->sorted; in ext2fs_copy_dblist()
184 dblist->sorted = 0; in ext2fs_add_dir_block2()
204 dblist->sorted = 0; in ext2fs_set_dir_block2()
218 dblist->sorted = 1; in ext2fs_dblist_sort2()
235 if (!dblist->sorted) in ext2fs_dblist_iterate2()
323 dblist->sorted = 1; in ext2fs_dblist_sort()
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/integration/ec2/elb/
Dtest_connection.py95 sorted(l.get_tuple() for l in balancers[0].listeners),
96 sorted(self.listeners + more_listeners)
109 sorted([l.get_tuple() for l in mod_balancers[0].listeners]),
110 sorted(mod_listeners))
140 sorted(l.get_tuple() for l in balancers[0].listeners),
141 sorted(self.listeners + more_listeners)
191 sorted(l.get_complex_tuple() for l in balancers[0].listeners),
193 sorted([(80, 8000, 'HTTP', 'HTTP')] + complex_listeners)
/external/chromium-trace/catapult/tracing/tracing/base/
Dsorted_array_utils.html13 * over sorted arrays and intervals.
21 * be prearranged such that ary.map(mapFn) would also be sorted in
79 * sorted in ascending order by loVal.
81 * @param {Array} ary An array of objects that can be converted into sorted
126 * Finds an index in an array of sorted closed intervals that either
136 * sorted in ascending order by val.
138 * @param {Array} ary An array of objects that can be converted into sorted
189 * @param {Array} ary An array of objects that can be converted into sorted
284 * @param {Array} ary An array of objects that can be converted into sorted
/external/valgrind/VEX/orig_amd64/
DCompare.hs6 {- 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/doclava/src/com/google/doclava/
DNavTree.java73 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); in writeYamlTree() local
78 sorted.put(cl.qualifiedName(), cl); in writeYamlTree()
87 sorted.put(name, pkg); in writeYamlTree()
90 data = makeYamlHDF(sorted, "docs.pages", data); in writeYamlTree()
99 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) { in makeYamlHDF() argument
103 for (String s : sorted.keySet()) { in makeYamlHDF()
104 Object o = sorted.get(s); in makeYamlHDF()

12345678910>>...72