| /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/python/cpython3/Doc/howto/ |
| D | sorting.rst | 11 in-place. There is also a :func:`sorted` built-in function that builds a new
12 sorted list from an iterable.
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
21 returns a new sorted list::
23 >>> sorted([5, 2, 3, 1, 4])
28 than :func:`sorted` - but if you don't need the original list, it's slightly
37 lists. In contrast, the :func:`sorted` function accepts any iterable.
39 >>> sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})
45 Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify a
50 >>> sorted("This is a test string from Andrew".split(), key=str.lower)
[all …]
|
| /external/python/cpython2/Doc/howto/ |
| D | sorting.rst | 11 in-place. There is also a :func:`sorted` built-in function that builds a new
12 sorted list from an iterable.
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
21 returns a new sorted list::
23 >>> sorted([5, 2, 3, 1, 4])
28 than :func:`sorted` - but if you don't need the original list, it's slightly
37 lists. In contrast, the :func:`sorted` function accepts any iterable.
39 >>> sorted({1: 'D', 2: 'B', 3: 'B', 4: 'E', 5: 'A'})
45 Starting with Python 2.4, both :meth:`list.sort` and :func:`sorted` added a
51 >>> sorted("This is a test string from Andrew".split(), key=str.lower)
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | urlshortener_v1.url.html | 109 …"countries": [ # Top countries (expressed as country codes), e.g. "US" or "DE"; sorted by (descend…
115 …"platforms": [ # Top platforms or OSes, e.g. "Windows"; sorted by (descending) click counts. Only …
121 …"browsers": [ # Top browsers, e.g. "Chrome"; sorted by (descending) click counts. Only present if …
127 …"referrers": [ # Top referring hosts, e.g. "www.google.com"; sorted by (descending) click counts. …
137 …"countries": [ # Top countries (expressed as country codes), e.g. "US" or "DE"; sorted by (descend…
143 …"platforms": [ # Top platforms or OSes, e.g. "Windows"; sorted by (descending) click counts. Only …
149 …"browsers": [ # Top browsers, e.g. "Chrome"; sorted by (descending) click counts. Only present if …
155 …"referrers": [ # Top referring hosts, e.g. "www.google.com"; sorted by (descending) click counts. …
165 …"countries": [ # Top countries (expressed as country codes), e.g. "US" or "DE"; sorted by (descend…
171 …"platforms": [ # Top platforms or OSes, e.g. "Windows"; sorted by (descending) click counts. Only …
[all …]
|
| D | safebrowsing_v4.encodedUpdates.html | 109 # Golomb-Rice encoding. The hashes are converted to uint32, sorted in
123 "indices": [ # The indices to remove from a lexicographically-sorted local list.
127 …nding compressed 4-byte hashes or # The encoded local, lexicographically-sorted list indices, usin…
129 # removal indices (uint32) are sorted in ascending order, then delta encoded
151 # sorted in lexicographic order. For JSON API users, hashes are
157 …lient's local database. # The expected SHA256 hash of the client state; that is, of the sorted list
161 … "sha256": "A String", # The SHA256 hash of the client state; that is, of the sorted list of all
171 # Golomb-Rice encoding. The hashes are converted to uint32, sorted in
185 "indices": [ # The indices to remove from a lexicographically-sorted local list.
189 …nding compressed 4-byte hashes or # The encoded local, lexicographically-sorted list indices, usin…
[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/skia/docs/ |
| D | SkIRect_Reference.bmh | 19 May contain any value. The smaller of the horizontal values when sorted.
25 May contain any value. The smaller of the horizontal values when sorted.
31 May contain any value. The larger of the vertical values when sorted.
37 May contain any value. The larger of the vertical values when sorted.
178 #Line # returns smaller bounds in x, if sorted ##
184 SkIRect sorted = unsorted.makeSorted();
185 SkDebugf("sorted.fLeft: %d sorted.left(): %d\n", sorted.fLeft, sorted.left());
188 sorted.fLeft: 10 sorted.left(): 10
201 #Line # returns smaller bounds in y, if sorted ##
207 SkIRect sorted = unsorted.makeSorted();
[all …]
|
| D | SkRect_Reference.bmh | 24 horizontal values when sorted. When equal to or greater than fRight, Rect is empty.
30 vertical values when sorted. When equal to or greater than fBottom, Rect is empty.
36 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
42 vertical values when sorted. When equal to or less than fTop, Rect is empty.
264 SkDebugf("sorted: {%g, %g, %g, %g} is" "%s empty\n", rect.left(), rect.top(), rect.right(),
269 sorted: {10, 40, 20, 50} is not empty
271 sorted: {20, 40, 20, 50} is empty
290 SkDebugf("rect: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
293 SkDebugf("sorted: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
297 rect: {20, 40, 10, 50} is not sorted
[all …]
|
| /external/skqp/docs/ |
| D | SkIRect_Reference.bmh | 19 May contain any value. The smaller of the horizontal values when sorted.
25 May contain any value. The smaller of the horizontal values when sorted.
31 May contain any value. The larger of the vertical values when sorted.
37 May contain any value. The larger of the vertical values when sorted.
178 #Line # returns smaller bounds in x, if sorted ##
184 SkIRect sorted = unsorted.makeSorted();
185 SkDebugf("sorted.fLeft: %d sorted.left(): %d\n", sorted.fLeft, sorted.left());
188 sorted.fLeft: 10 sorted.left(): 10
201 #Line # returns smaller bounds in y, if sorted ##
207 SkIRect sorted = unsorted.makeSorted();
[all …]
|
| D | SkRect_Reference.bmh | 24 horizontal values when sorted. When equal to or greater than fRight, Rect is empty.
30 vertical values when sorted. When equal to or greater than fBottom, Rect is empty.
36 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
42 vertical values when sorted. When equal to or less than fTop, Rect is empty.
264 SkDebugf("sorted: {%g, %g, %g, %g} is" "%s empty\n", rect.left(), rect.top(), rect.right(),
269 sorted: {10, 40, 20, 50} is not empty
271 sorted: {20, 40, 20, 50} is empty
290 SkDebugf("rect: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
293 SkDebugf("sorted: {%g, %g, %g, %g} is" "%s sorted\n", rect.left(), rect.top(), rect.right(),
297 rect: {20, 40, 10, 50} is not sorted
[all …]
|
| /external/lzma/CPP/7zip/Common/ |
| D | UniqBlocks.cpp | 11 unsigned left = 0, right = Sorted.Size(); in AddUniq()
15 unsigned index = Sorted[mid]; in AddUniq()
36 Sorted.Insert(left, index); in AddUniq()
51 unsigned num = Sorted.Size(); in GetReverseMap()
54 const unsigned *sorted = &Sorted[0]; in GetReverseMap() local
56 p[sorted[i]] = i; in GetReverseMap()
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_binary.h | 334 * The function is given a structure containing the sorted ibpkeycons and
338 * @param[in] node The cil_sort structure that contains the sorted ibpkeycons.
346 * The function is given a structure containing the sorted ibendportcons and
350 * @param[in] node The cil_sort structure that contains the sorted ibendportcons.
358 * The function is given a structure containing the sorted portcons and
362 * @param[in] node The cil_sort structure that contains the sorted portcons.
370 * The function is given a structure containing the sorted netifcons and
374 * @param[in] node The cil_sort structure that contains the sorted netifcons.
382 * The function is given a structure containing the sorted nodecons and
386 * @param[in] node The cil_sort structure that contains the sorted nodecons.
[all …]
|
| /external/python/cpython2/Lib/lib2to3/fixes/ |
| D | fix_idioms.py | 25 v = sorted(EXPR)
47 sorted=any<
65 sorted=any<
81 # If we've matched one of the sort/sorted subpatterns above, we
84 if r and "sorted" in r:
95 elif "sorted" in results:
123 list_call.replace(Name(u"sorted", prefix=list_call.prefix))
127 simple_expr.replace(Call(Name(u"sorted"), [new],
135 # shove them right after the sorted() call.
|
| /external/python/cpython3/Lib/lib2to3/fixes/ |
| D | fix_idioms.py | 25 v = sorted(EXPR)
47 sorted=any<
65 sorted=any<
81 # If we've matched one of the sort/sorted subpatterns above, we
84 if r and "sorted" in r:
95 elif "sorted" in results:
123 list_call.replace(Name("sorted", prefix=list_call.prefix))
127 simple_expr.replace(Call(Name("sorted"), [new],
135 # shove them right after the sorted() call.
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/ |
| D | shuffle_and_repeat_test.py | 50 sorted(output), sorted(
53 self.assertSequenceEqual(sorted(output[i * 20:(i + 1) * 20]), range(20))
72 self.assertEqual(sorted(output1), sorted(output2))
80 self.assertEqual(sorted(output1), sorted(output2))
88 self.assertEqual(sorted(output1), sorted(output2))
121 sorted_epoch = sorted(
|
| D | bucket_by_sequence_length_test.py | 189 sorted(generated_batch_sizes[l]), sorted(expected_batch_sizes[l]),
192 sorted(expected_batch_sizes[l]),
193 sorted(generated_batch_sizes[l])))
197 sorted(generated_lengths), sorted(expected_lengths),
200 sorted(expected_lengths), sorted(generated_lengths)))
262 self.assertEqual(sorted(batch_sizes), sorted(batch_sizes_val))
263 self.assertEqual(sorted(lengths), sorted(lengths_val))
310 self.assertEqual(sorted(batch_sizes), sorted(batch_sizes_val))
311 self.assertEqual([boundary - 1 for boundary in sorted(boundaries)],
312 sorted(lengths_val))
|
| /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/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/ |
| D | DeltaFriendlyOldBlobSizeLimiter.java | 42 * be the same as the input order (i.e., it has been sorted in order of decreasing compressed
70 List<QualifiedRecommendation> sorted = sortRecommendations(originalRecommendations); in getModifiedRecommendations() local
72 List<QualifiedRecommendation> result = new ArrayList<>(sorted.size()); in getModifiedRecommendations()
74 for (QualifiedRecommendation originalRecommendation : sorted) { in getModifiedRecommendations()
102 List<QualifiedRecommendation> sorted = in sortRecommendations() local
104 Collections.sort(sorted, COMPARATOR); in sortRecommendations()
105 Collections.reverse(sorted); in sortRecommendations()
106 return sorted; in sortRecommendations()
|
| /external/brotli/java/org/brotli/dec/ |
| D | Huffman.java | 65 int[] sorted = new int[codeLengthsSize]; // Symbols sorted by code length. in buildHuffmanTable() local
68 int[] offset = new int[MAX_LENGTH + 1]; // Offsets in sorted table for each length. in buildHuffmanTable()
76 // Generate offsets into sorted symbol table by code length. in buildHuffmanTable()
85 sorted[offset[codeLengths[symbol]]++] = symbol; in buildHuffmanTable()
96 rootTable[tableOffset + key] = sorted[0]; in buildHuffmanTable()
106 replicateValue(rootTable, tableOffset + key, step, tableSize, len << 16 | sorted[symbol++]); in buildHuffmanTable()
127 (len - rootBits) << 16 | sorted[symbol++]); in buildHuffmanTable()
|
| /external/brotli/csharp/org/brotli/dec/ |
| D | Huffman.cs | 76 int[] sorted = new int[codeLengthsSize]; in BuildHuffmanTable()
77 // Symbols sorted by code length. in BuildHuffmanTable()
82 // Offsets in sorted table for each length. in BuildHuffmanTable()
89 // Generate offsets into sorted symbol table by code length. in BuildHuffmanTable()
100 sorted[offset[codeLengths[symbol]]++] = symbol; in BuildHuffmanTable()
111 rootTable[tableOffset + key] = sorted[0]; in BuildHuffmanTable()
122 ReplicateValue(rootTable, tableOffset + key, step, tableSize, len << 16 | sorted[symbol++]); in BuildHuffmanTable()
143 …le, currentOffset + (key >> rootBits), step, tableSize, (len - rootBits) << 16 | sorted[symbol++]); in BuildHuffmanTable()
|
| /external/grpc-grpc/templates/tools/run_tests/generated/ |
| D | sources_and_headers.json.template | 43 "src": sorted(
47 "headers": sorted(
51 "deps": sorted(tgt.get('deps', []) +
60 "src": sorted(
64 "headers": sorted(
68 "deps": sorted(tgt.get('deps', []) +
|
| /external/walt/ios/WALT/ |
| 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)];
|