| /third_party/jerryscript/tests/jerry/ |
| D | array-prototype-sort.js | 7 // http://www.apache.org/licenses/LICENSE-2.0
16 array.sort();
29 array.sort();
39 return -1;
45 array.sort(f);
47 assert(array[array.length - i - 1] === i);
54 array.sort();
66 arr.sort(obj);
73 var obj = { sort : Array.prototype.sort} property
74 Object.defineProperty(obj, 'length', { 'get' : function () { throw new ReferenceError ("foo"); } });
[all …]
|
| /third_party/mesa3d/src/amd/registers/ |
| D | makeregheader.py | 3 * Copyright 2015-2019 Advanced Micro Devices, Inc.
5 * SPDX-License-Identifier: MIT
9 Create the (combined) register header from register JSON. Use --help for usage.
19 from regdb import Object, RegisterDatabase, deduplicate_enums, deduplicate_register_types
26 Object(name='gfx6', disambiguation='GFX6'),
27 Object(name='gfx7', disambiguation='GFX7'),
28 Object(name='gfx8', disambiguation='GFX8'),
29 Object(name='gfx81', disambiguation='GFX81'),
30 Object(name='gfx9', disambiguation='GFX9'),
31 Object(name='gfx940', disambiguation='GFX940'),
[all …]
|
| /third_party/python/Objects/clinic/ |
| D | listobject.c.h | 6 "insert($self, index, object, /)\n"
7 "--\n"
9 "Insert object before index.");
15 list_insert_impl(PyListObject *self, Py_ssize_t index, PyObject *object);
22 PyObject *object; in list_insert() local
28 Py_ssize_t ival = -1; in list_insert()
34 if (ival == -1 && PyErr_Occurred()) { in list_insert()
39 object = args[1]; in list_insert()
40 return_value = list_insert_impl(self, index, object); in list_insert()
48 "--\n"
[all …]
|
| /third_party/python/Lib/test/ |
| D | test_sort.py | 18 raw.sort(key=cmp_to_key(compare))
20 raw.sort()
48 sizes.extend(range(n-1, n+2))
51 class Complains(object):
67 class Stable(object):
97 check("reversed via function", y, s, lambda a, b: (b>a)-(b<a))
103 s.sort(key=cmp_to_key(lambda a, b: int(random.random() * 3) - 1))
110 self.assertRaises(RuntimeError, s.sort, key=bad_key)
118 s.sort()
123 check("exception during sort left some permutation", x, s)
[all …]
|
| /third_party/mesa3d/src/vulkan/runtime/ |
| D | vk_cmd_copy.c | 35 /* We don't have a vk_command_buffer object but we can assume, since we're in vk_common_CmdCopyBuffer()
36 * using common dispatch, that it's a vk_object of some sort. in vk_common_CmdCopyBuffer()
59 disp->device->dispatch_table.CmdCopyBuffer2(commandBuffer, &info); in vk_common_CmdCopyBuffer()
73 /* We don't have a vk_command_buffer object but we can assume, since we're in vk_common_CmdCopyImage()
74 * using common dispatch, that it's a vk_object of some sort. in vk_common_CmdCopyImage()
101 disp->device->dispatch_table.CmdCopyImage2(commandBuffer, &info); in vk_common_CmdCopyImage()
114 /* We don't have a vk_command_buffer object but we can assume, since we're in vk_common_CmdCopyBufferToImage()
115 * using common dispatch, that it's a vk_object of some sort. in vk_common_CmdCopyBufferToImage()
142 disp->device->dispatch_table.CmdCopyBufferToImage2(commandBuffer, &info); in vk_common_CmdCopyBufferToImage()
155 /* We don't have a vk_command_buffer object but we can assume, since we're in vk_common_CmdCopyImageToBuffer()
[all …]
|
| /third_party/skia/m133/third_party/externals/icu/source/i18n/unicode/ |
| D | coll.h | 5 * Copyright (C) 1996-2016, International Business Machines
49 * 2012-2014 markus Rewritten in C++ again.
87 * The <code>Collator</code> class performs locale-sensitive string
98 * Like other locale-sensitive classes, you can use the static factory method,
100 * <code>Collator</code> object for a given locale. You will only need to
113 * if (myCollator->compare("abc", "ABC") < 0)
136 * usCollator->setStrength(Collator::PRIMARY);
137 * if (usCollator->compare("abc", "ABC") == 0)
145 * other sort keys using <code>strcmp()</code>. Sort keys are written as
146 * zero-terminated byte strings.
[all …]
|
| D | sortkey.h | 5 * Copyright (C) 1996-2014, International Business Machines Corporation and others.
51 * preprocesses the comparison information from the Collator object to
53 * multiple times, then using the Collator object is generally faster,
57 * <p>When comparing "Abernathy" to "Baggins-Smythworthy", Collator
60 * if you are doing a sort of a number of fields, it is much faster to use
71 * myCollator->getCollationKey("Tom", keys[0], success );
72 * myCollator->getCollationKey("Dick", keys[1], success );
73 * myCollator->getCollationKey("Harry", keys[2], success );
75 * // Inside body of sort routine, compare keys this way:
83 * <p>Because Collator::compare()'s algorithm is complex, it is faster to sort
[all …]
|
| D | tblcoll.h | 5 * Copyright (C) 1996-2016, International Business Machines Corporation and
24 * constructor which reads RuleBasedCollator object from
29 * 2/12/97 aliu Modified to use TableCollationData sub-object to
59 * 2012-2014 markus Rewritten in C++ again.
98 * Collator, using data-driven tables. The user can create a customized
99 * table-based collation.
102 * <a href="https://unicode-org.github.io/icu/userguide/collation">the User Guide</a>.
106 …the <a href="http://www.unicode.org/reports/tr35/tr35-collation.html#Root_Collation">CLDR root sor…
108 * Sort ordering may be customized by providing your own set of rules. For more on
109 …* this subject see the <a href="https://unicode-org.github.io/icu/userguide/collation/customizatio…
[all …]
|
| /third_party/skia/third_party/externals/icu/source/i18n/unicode/ |
| D | coll.h | 5 * Copyright (C) 1996-2016, International Business Machines
49 * 2012-2014 markus Rewritten in C++ again.
87 * The <code>Collator</code> class performs locale-sensitive string
98 * Like other locale-sensitive classes, you can use the static factory method,
100 * <code>Collator</code> object for a given locale. You will only need to
113 * if (myCollator->compare("abc", "ABC") < 0)
136 * usCollator->setStrength(Collator::PRIMARY);
137 * if (usCollator->compare("abc", "ABC") == 0)
145 * other sort keys using <code>strcmp()</code>. Sort keys are written as
146 * zero-terminated byte strings.
[all …]
|
| D | sortkey.h | 5 * Copyright (C) 1996-2014, International Business Machines Corporation and others.
51 * preprocesses the comparison information from the Collator object to
53 * multiple times, then using the Collator object is generally faster,
57 * <p>When comparing "Abernathy" to "Baggins-Smythworthy", Collator
60 * if you are doing a sort of a number of fields, it is much faster to use
71 * myCollator->getCollationKey("Tom", keys[0], success );
72 * myCollator->getCollationKey("Dick", keys[1], success );
73 * myCollator->getCollationKey("Harry", keys[2], success );
75 * // Inside body of sort routine, compare keys this way:
83 * <p>Because Collator::compare()'s algorithm is complex, it is faster to sort
[all …]
|
| D | tblcoll.h | 5 * Copyright (C) 1996-2016, International Business Machines Corporation and
24 * constructor which reads RuleBasedCollator object from
29 * 2/12/97 aliu Modified to use TableCollationData sub-object to
59 * 2012-2014 markus Rewritten in C++ again.
98 * Collator, using data-driven tables. The user can create a customized
99 * table-based collation.
102 * <a href="https://unicode-org.github.io/icu/userguide/collation">the User Guide</a>.
106 …the <a href="http://www.unicode.org/reports/tr35/tr35-collation.html#Root_Collation">CLDR root sor…
108 * Sort ordering may be customized by providing your own set of rules. For more on
109 …* this subject see the <a href="https://unicode-org.github.io/icu/userguide/collation/customizatio…
[all …]
|
| /third_party/icu/icu4c/source/i18n/unicode/ |
| D | coll.h | 5 * Copyright (C) 1996-2016, International Business Machines
49 * 2012-2014 markus Rewritten in C++ again.
87 * The <code>Collator</code> class performs locale-sensitive string
98 * Like other locale-sensitive classes, you can use the static factory method,
100 * <code>Collator</code> object for a given locale. You will only need to
113 * if (myCollator->compare("abc", "ABC") < 0)
136 * usCollator->setStrength(Collator::PRIMARY);
137 * if (usCollator->compare("abc", "ABC") == 0)
145 * other sort keys using <code>strcmp()</code>. Sort keys are written as
146 * zero-terminated byte strings.
[all …]
|
| D | sortkey.h | 5 * Copyright (C) 1996-2014, International Business Machines Corporation and others.
51 * preprocesses the comparison information from the Collator object to
53 * multiple times, then using the Collator object is generally faster,
57 * <p>When comparing "Abernathy" to "Baggins-Smythworthy", Collator
60 * if you are doing a sort of a number of fields, it is much faster to use
71 * myCollator->getCollationKey("Tom", keys[0], success );
72 * myCollator->getCollationKey("Dick", keys[1], success );
73 * myCollator->getCollationKey("Harry", keys[2], success );
75 * // Inside body of sort routine, compare keys this way:
83 * <p>Because Collator::compare()'s algorithm is complex, it is faster to sort
[all …]
|
| D | tblcoll.h | 5 * Copyright (C) 1996-2016, International Business Machines Corporation and
24 * constructor which reads RuleBasedCollator object from
29 * 2/12/97 aliu Modified to use TableCollationData sub-object to
59 * 2012-2014 markus Rewritten in C++ again.
98 * Collator, using data-driven tables. The user can create a customized
99 * table-based collation.
102 * <a href="https://unicode-org.github.io/icu/userguide/collation">the User Guide</a>.
106 …the <a href="http://www.unicode.org/reports/tr35/tr35-collation.html#Root_Collation">CLDR root sor…
108 * Sort ordering may be customized by providing your own set of rules. For more on
109 …* this subject see the <a href="https://unicode-org.github.io/icu/userguide/collation/customizatio…
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | CollationKey.java | 6 * Copyright (C) 1996-2016, International Business Machines Corporation and
17 * object. Comparing two <code>CollationKey</code>s returns the
21 * sort orders of the same string under two different
52 * <a href="http://www.icu-project.org/userguide/Collate_ServiceArchitecture.html">
56 * to sort a list of <code>String</code>s.</p>
65 * sort( keys );
69 * // Inside body of sort routine, compare keys this way
75 * // Finally, when we've returned from sort.
89 // public inner classes -------------------------------------------------
134 // public constructor ---------------------------------------------------
[all …]
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| D | CollationKey.java | 5 * Copyright (C) 1996-2016, International Business Machines Corporation and
16 * object. Comparing two <code>CollationKey</code>s returns the
20 * sort orders of the same string under two different
51 * <a href="https://unicode-org.github.io/icu/userguide/collation/architecture">
55 * to sort a list of <code>String</code>s.</p>
64 * sort( keys );
68 * // Inside body of sort routine, compare keys this way
74 * // Finally, when we've returned from sort.
89 // public inner classes -------------------------------------------------
137 // public constructor ---------------------------------------------------
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | typeFromPropertyAssignment9_1.types | 29 my.object = {};
30 >my.object = {} : {}
31 >my.object : {}
33 >object : {}
105 my.predicate.sort = my.predicate.sort ?? function (first, second) {
106 >my.predicate.sort = my.predicate.sort ?? function (first, second) { return first > second ? fir…
107 >my.predicate.sort : (first: number, second: number) => number
111 >sort : (first: number, second: number) => number
112 >my.predicate.sort ?? function (first, second) { return first > second ? first : second;} : (fir…
113 >my.predicate.sort : (first: number, second: number) => number
[all …]
|
| D | typeFromPropertyAssignment9.types | 29 my.object = {};
30 >my.object = {} : {}
31 >my.object : {}
33 >object : {}
105 my.predicate.sort = my.predicate.sort || function (first, second) {
106 >my.predicate.sort = my.predicate.sort || function (first, second) { return first > second ? fir…
107 >my.predicate.sort : (first: number, second: number) => number
111 >sort : (first: number, second: number) => number
112 >my.predicate.sort || function (first, second) { return first > second ? first : second;} : (fir…
113 >my.predicate.sort : (first: number, second: number) => number
[all …]
|
| /third_party/python/Doc/library/ |
| D | profile.rst | 9 --------------
11 .. _profiler-introduction:
29 reasonable overhead that makes it suitable for profiling long-running
44 but not for C-level functions, and so the C code would seem faster than any
48 .. _profile-instant:
74 1 0.000 0.000 0.002 0.002 {built-in method builtins.exec}
86 far right column was used to sort the output. The column headings include:
93 calls to sub-functions)
127 python -m cProfile [-o output_file] [-s sort_order] (-m module | myscript.py)
129 ``-o`` writes the profile results to a file instead of to stdout
[all …]
|
| /third_party/python/Doc/howto/ |
| D | sorting.rst | 10 Python lists have a built-in :meth:`list.sort` method that modifies the list
11 in-place. There is also a :func:`sorted` built-in function that builds a new
20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
28 You can also use the :meth:`list.sort` method. It modifies the list
29 in-place (and returns ``None`` to avoid confusion). Usually it's less convenient
30 than :func:`sorted` - but if you don't need the original list, it's slightly
36 >>> a.sort()
40 Another difference is that the :meth:`list.sort` method is only defined for
51 Both :meth:`list.sort` and :func:`sorted` have a *key* parameter to specify a
55 For example, here's a case-insensitive string comparison:
[all …]
|
| /third_party/mesa3d/src/gfxstream/codegen/scripts/ |
| D | generator.py | 1 #!/usr/bin/python3 -i
3 # Copyright 2013-2023 The Khronos Group Inc.
4 # Copyright 2023-2024 Google Inc.
6 # SPDX-License-Identifier: Apache-2.0
85 s - string to convert"""
91 """Sort key for regSortFeatures.
94 - Core API features (those defined with a `<feature>` tag)
95 - (sort VKSC after VK - this is Vulkan-specific)
96 - ARB/KHR/OES (Khronos extensions)
97 - other (EXT/vendor extensions)"""
[all …]
|
| /third_party/skia/third_party/externals/jinja2/ |
| D | filters.py | 1 # -*- coding: utf-8 -*-
2 """Built-in template filters used with the ``|`` operator."""
28 _word_beginning_split_re = re.compile(r"([-\s\(\{\[\<]+)", re.UNICODE)
40 """Decorator for marking eval-context dependent filters. An eval
41 context object is passed as first argument. For more information
42 about the eval context, see :ref:`eval-context`.
60 to lowercase and returns other types as-is."""
66 passed object with the rules of the environment. Dots are allowed
89 attributes from a passed object with the rules of the environment.
138 """Quote data for use in a URL path or query using UTF-8.
[all …]
|
| /third_party/littlefs/scripts/ |
| D | summary.py | 6 # ./scripts/code.py lfs.o lfs_util.o -q -o lfs.code.csv
7 # ./scripts/data.py lfs.o lfs_util.o -q -o lfs.data.csv
8 # ./scripts/summary.py lfs.code.csv lfs.data.csv -q -o lfs.csv
9 # ./scripts/summary.py -Y lfs.csv -f code=code_size,data=data_size
12 # SPDX-License-Identifier: BSD-3-Clause
36 m.sqrt(sum((float(x) - mean)**2 for x in xs) / len(xs)))
57 # also accept +-∞ and +-inf
60 elif re.match('^\s*-\s*(?:∞|inf)\s*$', x):
61 x = -m.inf
70 elif self.x == -m.inf:
[all …]
|
| /third_party/elfutils/tests/ |
| D | run-readelf-s.sh | 18 . $srcdir/test-subr.sh
20 # Tests readelf -s and readelf --elf-section -s
21 # See also run-dwflsyms.sh
23 # - bar.c
36 # return b - foo (b - b1);
39 # - foo.c
50 # gcc -pie -g -c foo.c
51 # gcc -pie -g -c bar.c
52 # gcc -pie -g -o baz foo.o bar.o
54 # - testfilebaztab (dynsym + symtab)
[all …]
|
| /third_party/python/Doc/c-api/ |
| D | list.rst | 6 ------------
8 .. index:: pair: object; list
13 This subtype of :c:type:`PyObject` represents a Python list object.
19 This is the same object as :class:`list` in the Python layer.
24 Return true if *p* is a list object or an instance of a subtype of the list
30 Return true if *p* is a list object, but not an instance of a subtype of
40 If *len* is greater than zero, the returned list object's items are
42 :c:func:`PySequence_SetItem` or expose the object to Python code before
43 setting all items to a real object with :c:func:`PyList_SetItem`.
48 .. index:: pair: built-in function; len
[all …]
|