Searched refs:sorting (Results 1 – 25 of 374) sorted by relevance
12345678910>>...15
| /third_party/boost/libs/sort/doc/ |
| D | spreadsort.qbk | 57 Spreadsort combines generic implementations of multiple high-speed sorting algorithms
66 They are hybrids using both radix and comparison-based sorting,
67 specialized to sorting common data types, such as integers, floats, and strings.
142 …tshiftsample.cpp rightshiftsample.cpp] for a working example of integer sorting with a rightshift…
145 This functor must provide the same sorting order as the integers returned by the rightshift (aside …
164 …ringfunctorsample.cpp stringfunctorsample.cpp] for a working example of sorting strings with all …
172 comparison-based sorting is used. Above it, radix sorting is used.
175 or finish sorting the cut-down pieces with comparison-based sorting.
178 either comparison-based or radix-based sorting when recursing,
261 comparison-based sorting has to be used to sort when
[all …]
|
| D | bibliography.qbk | 31 A high-speed comparison-based sorting algorithm that takes ['[bigo](N * log(N))] time.
39 A high-speed hybrid string sorting algorithm that __string_sort is partially based
44 ARL (Adaptive Left Radix) is a hybrid cache-friendly integer sorting algorithm
49 Arne Maus, [@http://www.nik.no/2002/Maus.pdf ARL, a faster in-place, cache friendly sorting algorit…
|
| D | block_indirect_sort.qbk | 68 This algorithm has an integer parameter indicating the *number of threads* to use in the sorting pr…
123 There are two primary categories of parallelization in sorting algorithms.
133 The algorithm most frequently used in the filter and sorting is quick sort
197 As sample of their results, we can see the the sorting 100 000 000 64 bits numbers, ramdomly gener…
226 …ecute in parallel mode. Due to this, you can find many nice algorithms inside the sorting algorithm
|
| D | introduction.qbk | 13 …rt Library is provide to the users, the most modern, fast, and memory-efficient sorting algorithms.
15 This library provides stable and unstable sorting algorithms, in single threaded and parallel versi…
|
| D | pdqsort.qbk | 23 Pattern-defeating quicksort (__pdqsort_github) is a novel sorting algorithm that combines the fast
88 __pdqsort gets a great speedup over the traditional way of implementing quicksort when sorting large
109 sorting process. If the pattern does not get broken up, this can happen many times in a row. Worse,
137 as n gets big will ensure that we will only switch to heapsort if it would speed up the sorting.
|
| /third_party/icu/docs/userguide/collation/ |
| D | faq.md | 40 very unusual cases, such as sorting an list containing of names according to
46 ## Q. How can collation rules mimic word sorting?
48 Word sort is a way of sorting where certain interpunction characters are
|
| D | concepts.md | 57 collation in sorting and binary search, so comparing strings that are "close" is
66 In general, when comparing and sorting objects, some properties can take
147 French (locale **fr_CA**), for conformance with the [Canadian sorting
165 a single letter in sorting.
167 For example, in the traditional Spanish sorting order, "ch" is considered a
177 Order without contraction | Order with contraction "lj" sorting after letter "l"
193 > For example, in Czech sorting, cU+0000h will sort as it were ch.
200 For example, in German phonebook sorting (de@collation=phonebook or BCP 47
271 In some cases, punctuation can be ignored while searching or sorting data. For
285 The following table shows the results of sorting a list of terms in 3 different
[all …]
|
| /third_party/node/deps/npm/node_modules/query-string/ |
| D | readme.md | 104 Supports both `Function` as a custom sorting function or `false` to disable sorting.
132 Stringify an object into a query string and sorting the keys.
189 Supports both `Function` as a custom sorting function or `false` to disable sorting.
|
| /third_party/skia/third_party/externals/harfbuzz/docs/ |
| D | repacker.md | 48 * [Topological sorting algorithm](https://en.wikipedia.org/wiki/Topological_sorting): an algorithm
49 which given a graph gives a linear sorting of the nodes such that all offsets will be positive.
51 * Overflow check: given a graph and a topological sorting it checks if there will be any overflows
81 The harfbuzz repacker uses two different algorithms for topological sorting:
87 sort will be used for all subsequent topological sorting operations.
109 The topological sorting operation is the core of the repacker and is run on each iteration so it ne…
110 to be as fast as possible. There's a few things that are done to speed up subsequent sorting
124 the topological sorting algorithm. Currently a basic heap based queue is used. Heap based queue's
132 If a graph contains multiple 32 bit offsets then the shortest distance sorting will be likely be
174 The sorting algorithm incorporates this via a "space" modifier that can be applied to nodes in the
|
| /third_party/ejdb/src/jbi/ |
| D | jbi_selection.c | 412 ctx->sorting = false; in _jbi_select_index_for_orderby()
430 ctx->sorting = true; in jbi_selection()
453 ctx->sorting = false; in jbi_selection()
455 ctx->sorting = true; in jbi_selection()
457 } else if (ctx->sorting) { // Last chance to use index and avoid sorting in jbi_selection()
|
| /third_party/gn/src/gn/format_test_data/ |
| D | 066.gn | 1 # Suppress sorting based on comment.
|
| D | 066.golden | 1 # Suppress sorting based on comment.
|
| /third_party/python/Doc/howto/ |
| D | sorting.rst | 14 In this document, we explore the various techniques for sorting data using Python.
63 takes a single argument and returns a key to use for sorting purposes. This
120 The operator module functions allow multiple levels of sorting. For example, to
162 This wonderful property lets you build complex sorts in a series of sorting
227 Now that Python sorting provides key-functions, this technique is not often needed.
311 * For locale aware sorting, use :func:`locale.strxfrm` for a key function or
|
| D | index.rst | 25 sorting.rst
|
| /third_party/icu/docs/userguide/collation/customization/ |
| D | ignorepunct.md | 31 change the sorting behavior of “variable” characters algorithmically. “Variable”
53 Here is an overview of the sorting results with these options.
101 prefixes sorting less-than longer ones), like in last-name+first-name sorting,
|
| /third_party/node/deps/npm/node_modules/libnpmsearch/ |
| D | README.md | 52 …nd `1` that defines the weight of `maintenance` metrics when scoring and sorting packages. Default…
53 …and `1` that defines the weight of `popularity` metrics when scoring and sorting packages. Default…
54 …0` and `1` that defines the weight of `quality` metrics when scoring and sorting packages. Default…
|
| D | CHANGELOG.md | 27 * **opts:** added options for pagination, details, and sorting weights ([ff97eb5](https://github.co…
|
| /third_party/node/deps/npm/docs/content/cli-commands/ |
| D | npm-update.md | 93 to `>=1.1.1 <1.2.0`. So the highest-sorting version that satisfies `~1.1.1` is used,
117 Then `npm update` will install `dep1@0.4.1`, because that is the highest-sorting
|
| /third_party/boost/libs/sort/ |
| D | README.md | 5 The goal of the Boost Sort Library is provide to the users, the most modern and fast sorting algori…
7 This library provides stable and not stable sorting algorithms, in single thread and parallel versi…
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/AMD/ |
| D | AMD_shader_trinary_minmax.txt | 38 operations may be useful for sorting and filtering operations, for example.
41 instruction sequences for perform sorting and other multi-input functions.
|
| /third_party/openGLES/extensions/AMD/ |
| D | AMD_shader_trinary_minmax.txt | 38 operations may be useful for sorting and filtering operations, for example.
41 instruction sequences for perform sorting and other multi-input functions.
|
| /third_party/boost/libs/multi_index/ |
| D | README.md | 10 maintaining one or more indices with different sorting and access semantics.
|
| /third_party/ejdb/src/jbs/ |
| D | README.md | 23 …--sbz ## Max sorting buffer size. If exceeded, an overflow temp file for data will be created. Def…
|
| /third_party/icu/docs/userguide/ |
| D | services.md | 28 currency, message sorting, and searching. ICU provides language-specific results
235 Searching and sorting is done through collation using the `Collator` class and its
242 string comparisons to create sorting and searching routines for natural language
247 ICU provides the following collation classes for sorting and searching natural
260 specifically customize the sorting order.
262 * [`CollationKey`](collation/architecture.md) is an object that enables the fast sorting of stri…
368 … text into an equivalent composed or decomposed form to allow for easier sorting and searching of …
|
| /third_party/EGL/extensions/ANDROID/ |
| D | EGL_ANDROID_recordable.txt | 102 2. How should the new attribute affect the sorting of EGLConfigs?
104 RESOLVED: It should not affect sorting. Some implementations may not have
|
12345678910>>...15