| /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 | 82 uint16_t sorted[]) { in BuildHuffmanTable() argument
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
213 code_lengths, code_lengths_size, sorted); in VP8LBuildHuffmanTable()
215 uint16_t* const sorted = in VP8LBuildHuffmanTable() local
216 (uint16_t*)WebPSafeMalloc(code_lengths_size, sizeof(*sorted)); in VP8LBuildHuffmanTable()
217 if (sorted == NULL) return 0; in VP8LBuildHuffmanTable()
[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/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/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/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/ |
| D | DeltaFriendlyOldBlobSizeLimiter.java | 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()
|
| D | TotalRecompressionLimiter.java | 87 List<QualifiedRecommendation> sorted = in getModifiedRecommendations() local
89 Collections.sort(sorted, COMPARATOR); in getModifiedRecommendations()
90 Collections.reverse(sorted); in getModifiedRecommendations()
92 List<QualifiedRecommendation> result = new ArrayList<>(sorted.size()); in getModifiedRecommendations()
94 for (QualifiedRecommendation originalRecommendation : sorted) { in getModifiedRecommendations()
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| D | XLocaleMatcherTest.java | 132 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); in testExactMatches() local
136 check(sorted); in testExactMatches()
137 sorted.clear(); in testExactMatches()
140 sorted.add(loc); in testExactMatches()
142 check(sorted); in testExactMatches()
145 private void check(Set<ULocale> sorted) { in check() argument
146 if (sorted.isEmpty()) { in check()
149 check2(sorted); in check()
150 ULocale first = sorted.iterator().next(); in check()
152 sorted.add(max); in check()
[all …]
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| D | XLocaleMatcherTest.java | 129 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); in testExactMatches() local
133 check(sorted); in testExactMatches()
134 sorted.clear(); in testExactMatches()
137 sorted.add(loc); in testExactMatches()
139 check(sorted); in testExactMatches()
142 private void check(Set<ULocale> sorted) { in check() argument
143 if (sorted.isEmpty()) { in check()
146 check2(sorted); in check()
147 ULocale first = sorted.iterator().next(); in check()
149 sorted.add(max); in check()
[all …]
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| D | XLocaleMatcherTest.java | 121 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); in testExactMatches() local
125 check(sorted); in testExactMatches()
126 sorted.clear(); in testExactMatches()
129 sorted.add(loc); in testExactMatches()
131 check(sorted); in testExactMatches()
134 private void check(Set<ULocale> sorted) { in check() argument
135 if (sorted.isEmpty()) { in check()
138 check2(sorted); in check()
139 ULocale first = sorted.iterator().next(); in check()
141 sorted.add(max); in check()
[all …]
|
| D | LocaleMatcherTest.java | 423 TreeSet<ULocale> sorted = new TreeSet<ULocale>(); in testExactMatches() local
427 check(sorted); in testExactMatches()
428 sorted.clear(); in testExactMatches()
431 sorted.add(loc); in testExactMatches()
433 check(sorted); in testExactMatches()
436 private void check(Set<ULocale> sorted) { in check() argument
437 if (sorted.isEmpty()) { in check()
440 check2(sorted); in check()
441 ULocale first = sorted.iterator().next(); in check()
443 sorted.add(max); in check()
[all …]
|
| /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/tensorflow/tensorflow/contrib/session_bundle/ |
| D | gc.py | 96 return sorted(keepers)
127 return sorted(keeper_map.values())
148 return sorted(keepers)
167 return sorted(list(l|r))
185 return sorted(list(l-r))
216 return sorted(paths)
|
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 84 ArrayList<T> sorted = new ArrayList<T>(); in sort() local
92 DFS(n, visited, sorted); in sort()
94 return sorted; in sort()
97 public void DFS(Node<T> n, Set<Node<T>> visited, ArrayList<T> sorted) { in DFS() argument
102 DFS(target, visited, sorted); in DFS()
105 sorted.add(n.payload); in DFS()
|
| /external/tensorflow/tensorflow/contrib/learn/python/learn/utils/ |
| D | gc.py | 101 return sorted(keepers)
133 return sorted(keeper_map.values())
153 return sorted(keepers)
171 return sorted(list(l|r))
188 return sorted(list(l-r))
220 return sorted(paths)
|
| /external/grpc-grpc/src/boringssl/ |
| D | gen_build_yaml.py | 64 'src': sorted(
68 'headers': sorted(
86 for f in sorted(files['test_support'])
104 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
123 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
139 for test in list(sorted(set(files['ssl_test'] + files['crypto_test'])))
|
| /external/grpc-grpc/tools/run_tests/python_utils/ |
| D | report_utils.py | 128 sorted_test_cases = sorted(test_cases)
129 sorted_auth_test_cases = sorted(auth_test_cases)
130 sorted_http2_cases = sorted(http2_cases)
131 sorted_http2_server_cases = sorted(http2_server_cases)
132 sorted_client_langs = sorted(client_langs)
133 sorted_server_langs = sorted(server_langs)
134 sorted_prod_servers = sorted(prod_servers)
|
| /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):
120 for f in sorted(files['ssl']):
128 for f in sorted(files['tool']):
136 for f in sorted(files['test_support']):
144 for f in sorted(files['crypto_test']):
152 for f in sorted(files['ssl_test']):
186 for f in sorted(files):
214 for filename in sorted(files['test_support'] +
[all …]
|
| /external/skia/tools/ |
| D | Stats.h | 48 SkAutoTMalloc<double> sorted(n); in Stats()
49 memcpy(sorted.get(), samples.begin(), n * sizeof(double)); in Stats()
50 SkTQSort(sorted.get(), sorted.get() + n - 1); in Stats()
51 median = sorted[n/2]; in Stats()
|
| /external/skqp/tools/ |
| D | Stats.h | 48 SkAutoTMalloc<double> sorted(n); in Stats()
49 memcpy(sorted.get(), samples.begin(), n * sizeof(double)); in Stats()
50 SkTQSort(sorted.get(), sorted.get() + n - 1); in Stats()
51 median = sorted[n/2]; in Stats()
|
| /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)];
|