Home
last modified time | relevance | path

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

12345678910>>...199

/external/rust/crates/serde_cbor/tests/
Dcanonical.rs29 let mut sorted = expected.clone(); in integer_canonical_sort_order() localVariable
30 sorted.sort(); in integer_canonical_sort_order()
32 assert_eq!(expected, sorted); in integer_canonical_sort_order()
42 let mut sorted = expected.clone(); in string_canonical_sort_order() localVariable
43 sorted.sort(); in string_canonical_sort_order()
45 assert_eq!(expected, sorted); in string_canonical_sort_order()
55 let mut sorted = expected.clone(); in bytes_canonical_sort_order() localVariable
56 sorted.sort(); in bytes_canonical_sort_order()
58 assert_eq!(expected, sorted); in bytes_canonical_sort_order()
65 let mut sorted = expected.clone(); in simple_data_canonical_sort_order() localVariable
[all …]
/external/selinux/prebuilts/bin/
Dsediff.py138 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/
Dsorting.rst11 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
51 >>> sorted("This is a test string from Andrew".split(), key=str.lower)
[all …]
/external/python/cpython2/Doc/howto/
Dsorting.rst11 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/
Durlshortener_v1.url.html109 …"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 …]
/external/webp/src/utils/
Dhuffman_utils.c78 // 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()
94 assert((root_table != NULL && sorted != NULL) || in BuildHuffmanTable()
95 (root_table == NULL && sorted == NULL)); in BuildHuffmanTable()
111 // Generate offsets into sorted symbol table by code length. in BuildHuffmanTable()
124 if (sorted != NULL) { in BuildHuffmanTable()
125 sorted[offset[symbol_code_length]++] = symbol; in BuildHuffmanTable()
134 if (sorted != NULL) { in BuildHuffmanTable()
[all …]
/external/rust/crates/remain/tests/
Dorder.rs3 #[remain::sorted]
10 #[remain::sorted]
17 #[remain::sorted]
23 #[remain::sorted]
30 #[remain::sorted]
37 #[remain::sorted]
53 #[remain::sorted]
/external/guava/guava/src/com/google/common/collect/
DImmutableSortedMultiset.java38 * <p><b>Warning:</b> as with any sorted collection, you are strongly advised not to use a {@link
57 * ImmutableMultiset}. Elements are sorted by the specified comparator.
98 /** Returns the empty immutable sorted multiset. */
104 /** Returns an immutable sorted multiset containing a single element. */
113 * Returns an immutable sorted multiset containing the given elements sorted by their natural
124 * Returns an immutable sorted multiset containing the given elements sorted by their natural
135 * Returns an immutable sorted multiset containing the given elements sorted by their natural
147 * Returns an immutable sorted multiset containing the given elements sorted by their natural
159 * Returns an immutable sorted multiset containing the given elements sorted by their natural
175 * Returns an immutable sorted multiset containing the given elements sorted by their natural
[all …]
DImmutableSortedSet.java47 * <p><b>Warning:</b> as with any sorted collection, you are strongly advised not to use a {@link
66 ImmutableSet.SPLITERATOR_CHARACTERISTICS | Spliterator.SORTED;
90 /** Returns the empty immutable sorted set. */
95 /** Returns an immutable sorted set containing a single element. */
101 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
113 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
125 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
137 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
150 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
174 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
[all …]
/external/skia/docs/examples/
DRect_joinPossiblyEmptyRect.cpp8 SkRect sorted = rect.makeSorted(); in draw() local
12 sorted.joinPossiblyEmptyRect(toJoin); in draw()
13 SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom); in draw()
DRect_joinNonEmptyArg.cpp8 SkRect sorted = rect.makeSorted(); in draw() local
12 sorted.joinNonEmptyArg(toJoin); in draw()
13 SkDebugf("sorted: %g, %g, %g, %g\n", sorted.fLeft, sorted.fTop, sorted.fRight, sorted.fBottom); in draw()
/external/skia/infra/bots/task_drivers/perf_puppeteer_canvas/
Dperf_puppeteer_canvas.go273 sorted := make([]float32, len(input))
274 copy(sorted, input)
275 sort.Slice(sorted, func(i, j int) bool {
276 return sorted[i] < sorted[j]
279 avg := computeAverage(sorted)
281 for i := 0; i < len(sorted); i++ {
282 variance += (sorted[i] - avg) * (sorted[i] - avg)
284 stddev := float32(math.Sqrt(float64(variance / float32(len(sorted)))))
286 medIdx := (len(sorted) * 50) / 100
287 percentile90Idx := (len(sorted) * 90) / 100
[all …]
/external/skqp/docs/
DSkIRect_Reference.bmh19 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 …]
DSkRect_Reference.bmh24 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/guava/android/guava/src/com/google/common/collect/
DImmutableSortedSet.java43 * <p><b>Warning:</b> as with any sorted collection, you are strongly advised not to use a {@link
69 /** Returns the empty immutable sorted set. */
74 /** Returns an immutable sorted set containing a single element. */
80 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
92 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
104 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
116 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
129 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
153 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
165 * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
[all …]
DImmutableSortedMultiset.java37 * <p><b>Warning:</b> as with any sorted collection, you are strongly advised not to use a {@link
54 /** Returns the empty immutable sorted multiset. */
60 /** Returns an immutable sorted multiset containing a single element. */
69 * Returns an immutable sorted multiset containing the given elements sorted by their natural
80 * Returns an immutable sorted multiset containing the given elements sorted by their natural
91 * Returns an immutable sorted multiset containing the given elements sorted by their natural
103 * Returns an immutable sorted multiset containing the given elements sorted by their natural
115 * Returns an immutable sorted multiset containing the given elements sorted by their natural
131 * Returns an immutable sorted multiset containing the given elements sorted by their natural
141 * Returns an immutable sorted multiset containing the given elements sorted by their natural
[all …]
/external/lzma/CPP/7zip/Common/
DUniqBlocks.cpp11 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/
Dcil_binary.h334 * 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/rust/crates/remain/
DREADME.md1 Remain sorted
10 variants of an enum or the arms of a match expression are written in sorted
20 Place a `#[remain::sorted]` attribute on enums, structs, match-expressions, or
23 Alternatively, import as `use remain::sorted;` and use `#[sorted]` as the
27 #[remain::sorted]
41 #[remain::sorted]
55 #[remain::sorted]
105 `#[sorted]` to make them work on a stable compiler.
113 #[sorted]
/external/skia/infra/bots/task_drivers/perf_puppeteer_skottie_frames/
Dperf_puppeteer_skottie_frames.go345 sorted := make([]float32, len(input))
346 copy(sorted, input)
347 sort.Slice(sorted, func(i, j int) bool {
348 return sorted[i] < sorted[j]
351 avg := computeAverage(sorted)
353 for i := 0; i < len(sorted); i++ {
354 variance += (sorted[i] - avg) * (sorted[i] - avg)
356 stddev := float32(math.Sqrt(float64(variance / float32(len(sorted)))))
358 medIdx := (len(sorted) * 50) / 100
359 p90Idx := (len(sorted) * 90) / 100
[all …]
/external/autotest/server/
Dsite_utils_unittest.py88 self.assertEqual(sorted(test_views.keys()),
89 sorted(expected_test_views.keys()),
91 (sorted(test_views.keys()),
92 sorted(expected_test_views.keys())))
95 self.assertEqual(sorted(test_status_list),
96 sorted(expected_test_views[test_name]),
100 sorted(test_status_list),
101 sorted(expected_test_views[test_name])))
/external/python/cpython2/Lib/lib2to3/fixes/
Dfix_idioms.py25 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/
Dfix_idioms.py25 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/starlark-go/starlark/testdata/
Dbuiltins.star39 # sorted
40 assert.eq(sorted([42, 123, 3]), [3, 42, 123])
41 assert.eq(sorted([42, 123, 3], reverse=True), [123, 42, 3])
42 assert.eq(sorted(["wiz", "foo", "bar"]), ["bar", "foo", "wiz"])
43 assert.eq(sorted(["wiz", "foo", "bar"], reverse=True), ["wiz", "foo", "bar"])
44 assert.fails(lambda: sorted([1, 2, None, 3]), "int < NoneType not implemented")
45 assert.fails(lambda: sorted([1, "one"]), "string < int not implemented")
47 assert.eq(sorted(["two", "three", "four"], key=len),
49 assert.eq(sorted(["two", "three", "four"], key=len, reverse=True),
51 assert.fails(lambda: sorted([1, 2, 3], key=None), "got NoneType, want callable")
[all …]
/external/python/cpython3/Lib/test/
Dtest_setcomps.py16 >>> list(sorted({(i,j) for i in range(3) for j in range(4)}))
21 >>> list(sorted({(i,j) for i in range(4) for j in range(i)}))
26 >>> sorted({j*j for i in range(4) for j in [i+1]})
28 >>> sorted({j*k for i in range(4) for j in [i+1] for k in [j+1]})
30 >>> sorted({j*k for i in range(4) for j, k in [(i+1, i+2)]})
35 >>> sorted({i*i for i in [*range(4)]})
37 >>> sorted({i*i for i in (*range(4),)})
66 >>> list(sorted(srange(10)))
72 >>> list(sorted(lrange(10)))
80 >>> list(sorted(grange(5)))

12345678910>>...199