Home
last modified time | relevance | path

Searched refs:quicksort (Results 1 – 21 of 21) sorted by relevance

/external/replicaisland/src/com/replica/replicaisland/
DQuickSorter.java23 quicksort(array, 0, count - 1, comparator); in sort()
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { in quicksort() method in QuickSorter
48 quicksort(a, left, i - 1, comparator); in quicksort()
49 quicksort(a, i + 1, right, comparator); in quicksort()
/external/python/cpython2/Demo/tkinter/guido/
Dsortvisu.py412 def quicksort(array): function
475 for alg in [quicksort, insertionsort, selectionsort, bubblesort]:
568 self.run(quicksort)
/external/deqp/android/cts/main/vk-master-2021-03-01/
Dgraphicsfuzz.txt264 dEQP-VK.graphicsfuzz.spv-stable-quicksort-mat-func-param
277 dEQP-VK.graphicsfuzz.stable-quicksort-for-loop-with-injection
278 dEQP-VK.graphicsfuzz.stable-quicksort-if-false-else-return
279 dEQP-VK.graphicsfuzz.stable-quicksort-max-value-as-index
/external/python/cpython3/Tools/demo/
Dsortvisu.py414 def quicksort(array): function
477 for alg in [quicksort, insertionsort, selectionsort, bubblesort]:
569 self.run(quicksort)
/external/rust/crates/rayon/src/slice/
Dmod.rs10 mod quicksort; module
16 use self::quicksort::par_quicksort;
/external/rust/crates/grpcio-sys/grpc/third_party/upb/bazel/
Dragel.BUILD130 "aapl/quicksort.h",
/external/deqp/android/cts/main/vk-master-2022-03-01/
Dgraphicsfuzz.txt201 dEQP-VK.graphicsfuzz.spv-stable-quicksort-dontinline
207 dEQP-VK.graphicsfuzz.stable-quicksort-conditional-bitwise-or-clamp
/external/deqp/android/cts/main/vk-master/
Dgraphicsfuzz.txt690 dEQP-VK.graphicsfuzz.spv-stable-quicksort-dontinline
691 dEQP-VK.graphicsfuzz.spv-stable-quicksort-mat-func-param
709 dEQP-VK.graphicsfuzz.stable-quicksort-conditional-bitwise-or-clamp
710 dEQP-VK.graphicsfuzz.stable-quicksort-for-loop-with-injection
711 dEQP-VK.graphicsfuzz.stable-quicksort-if-false-else-return
712 dEQP-VK.graphicsfuzz.stable-quicksort-max-value-as-index
/external/deqp/external/vulkancts/mustpass/main/vk-default/
Dgraphicsfuzz.txt690 dEQP-VK.graphicsfuzz.spv-stable-quicksort-dontinline
691 dEQP-VK.graphicsfuzz.spv-stable-quicksort-mat-func-param
709 dEQP-VK.graphicsfuzz.stable-quicksort-conditional-bitwise-or-clamp
710 dEQP-VK.graphicsfuzz.stable-quicksort-for-loop-with-injection
711 dEQP-VK.graphicsfuzz.stable-quicksort-if-false-else-return
712 dEQP-VK.graphicsfuzz.stable-quicksort-max-value-as-index
/external/swiftshader/tests/regres/testlists/vk-default/
Dgraphicsfuzz.txt690 dEQP-VK.graphicsfuzz.spv-stable-quicksort-dontinline
691 dEQP-VK.graphicsfuzz.spv-stable-quicksort-mat-func-param
709 dEQP-VK.graphicsfuzz.stable-quicksort-conditional-bitwise-or-clamp
710 dEQP-VK.graphicsfuzz.stable-quicksort-for-loop-with-injection
711 dEQP-VK.graphicsfuzz.stable-quicksort-if-false-else-return
712 dEQP-VK.graphicsfuzz.stable-quicksort-max-value-as-index
/external/deqp/external/vulkancts/data/vulkan/amber/graphicsfuzz/
Dindex.txt690 { "spv-stable-quicksort-dontinline.amber", "spv-stable-quicksort-dontinline", …
691 { "spv-stable-quicksort-mat-func-param.amber", "spv-stable-quicksort-mat-func-param", …
709 { "stable-quicksort-conditional-bitwise-or-clamp.amber", "stable-quicksort-conditional-bit…
710 { "stable-quicksort-for-loop-with-injection.amber", "stable-quicksort-for-loop-with-injec…
711 { "stable-quicksort-if-false-else-return.amber", "stable-quicksort-if-false-else-return"…
712 { "stable-quicksort-max-value-as-index.amber", "stable-quicksort-max-value-as-index", …
/external/tensorflow/third_party/py/numpy/tf_numpy_api/
Dtensorflow.experimental.numpy.pbtxt197 …', \'kind\', \'order\'], varargs=None, keywords=None, defaults=[\'-1\', \'quicksort\', \'None\'], "
797 …', \'kind\', \'order\'], varargs=None, keywords=None, defaults=[\'-1\', \'quicksort\', \'None\'], "
/external/swiftshader/docs/
DReactor.md33 …aster to swap them if they are not yet in order, than to call a generic quicksort function. Specia…
/external/python/cpython2/Objects/
Dlistsort.txt145 quicksort does about 39% more compares than the limit, and the median-of-3
151 a previous quicksort implementation. That timsort nails it came as a
/external/python/cpython3/Objects/
Dlistsort.txt145 quicksort does about 39% more compares than the limit, and the median-of-3
151 a previous quicksort implementation. That timsort nails it came as a
/external/harfbuzz_ng/perf/texts/
Den-words.txt8775 quicksort
/external/one-true-awk/testdir/
Dfunstack.ok1373 R. E. Wheeler Increasing the efficiency of quicksort 311--311
Dfunstack.in2614quicksort is presented which uses a bounding interval instead of a single element as bound. This g…
10149 title = "Increasing the efficiency of quicksort",
10162 keywords = "efficiency; quicksort; sorting",
12732 …abstract = "Detailed performance evaluations are presented for six ACM algorithms: quicksort (…
12738quicksort'; ACM; algorithms; computer programming; computer testing; general; performance evaluati…
/external/skia/bazel/rbe/gce_linux/cc/
Dmodule.modulemap1225 textual header "/usr/include/c++/10/parallel/quicksort.h"
5332 textual header "/usr/include/c++/10/parallel/quicksort.h"
/external/python/cpython2/Misc/
DHISTORY12523 - <listobject>.sort() now uses a modified quicksort by Raymund Galvin,
12524 after studying the GNU libg++ quicksort. This should be much faster
13393 wrote my own quicksort implementation, with lots of help (in the form
/external/python/cpython3/Misc/
DHISTORY29902 - <listobject>.sort() now uses a modified quicksort by Raymund Galvin,
29903 after studying the GNU libg++ quicksort. This should be much faster
30772 wrote my own quicksort implementation, with lots of help (in the form