| /prebuilts/go/darwin-x86/src/sort/ |
| export_test.go | 7 func Heapsort(data Interface) {
8 heapSort(data, 0, data.Len())
|
| sort_test.go | 349 testBentleyMcIlroy(t, Heapsort, func(n int) int { return n * lg(n) * 12 / 10 })
401 Sort(d) // This should degenerate to heapsort.
|
| sort.go | 58 func heapSort(data Interface, a, b int) {
168 heapSort(data, a, b)
192 // Switch to heapsort if depth of 2*ceil(lg(n+1)) is reached.
|
| /prebuilts/go/linux-x86/src/sort/ |
| export_test.go | 7 func Heapsort(data Interface) {
8 heapSort(data, 0, data.Len())
|
| sort_test.go | 349 testBentleyMcIlroy(t, Heapsort, func(n int) int { return n * lg(n) * 12 / 10 })
401 Sort(d) // This should degenerate to heapsort.
|
| sort.go | 58 func heapSort(data Interface, a, b int) {
168 heapSort(data, a, b)
192 // Switch to heapsort if depth of 2*ceil(lg(n+1)) is reached.
|
| /external/lzma/C/ |
| Sort.h | 11 void HeapSort(UInt32 *p, size_t size);
|
| Sort.c | 17 void HeapSort(UInt32 *p, size_t size)
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btSimulationIslandManager.cpp | 380 //tried a radix sort, but quicksort/heapsort seems still faster
383 //m_islandmanifold.heapSort(btPersistentManifoldSortPredicate());
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
| btMultiSapBroadphase.cpp | 374 // overlappingPairArray.heapSort(btMultiSapBroadphasePairSortPredicate());
442 //overlappingPairArray.heapSort(btMultiSapBroadphasePairSortPredicate());
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
| btAlignedObjectArray.h | 415 void heapSort(const L& CompareFunc)
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/doc/ |
| dom.md | 174 > (In computer science) An algorithm is said to be an in situ algorithm, or in-place algorithm, if the extra amount of memory required to execute the algorithm is O(1), that is, does not exceed a constant no matter how large the input. For example, heapsort is an in situ sorting algorithm.
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_heapq.py | 139 # Exercise everything with repeated heapsort checks
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_heapq.py | 139 # Exercise everything with repeated heapsort checks
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 139 # Exercise everything with repeated heapsort checks
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_heapq.py | 139 # Exercise everything with repeated heapsort checks
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_common.h | 555 // HeapSort for arrays and InternalMmapVector.
|
| /external/libdivsufsort/lib/ |
| trsort.c | 111 /* Simple top-down heapsort. */
|
| sssort.c | 206 /* Simple top-down heapsort. */
|
| /prebuilts/go/darwin-x86/pkg/darwin_amd64/ |
| sort.a | 122 "".lo type.int "".data "type."".Interface `&_`?_`^ ? :R!^>> }? Tgclocals·1347047f6245a35b91e9a4f213167d52 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Pprebuilts/go/darwin-x86/src/sort/sort.go?"".heapSort ? ?eH? % H;a?
174 "".heapSort ?
[all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64/ |
| sort.a | 122 "".lo type.int "".data "type."".Interface `&_`?_`^ ? :R!^>> }? Tgclocals·1347047f6245a35b91e9a4f213167d52 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Nprebuilts/go/linux-x86/src/sort/sort.go?"".heapSort ? ?dH? % H;a?
174 "".heapSort ?
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| block-placement.ll | 933 ; This test case comes from the heapsort benchmark, and exemplifies several
|
| /prebuilts/go/darwin-x86/pkg/darwin_amd64_race/ |
| sort.a | 154 "".lo type.int "".data "type."".Interface `9_`?_`f ? FR ^>> ? Tgclocals·1347047f6245a35b91e9a4f213167d52 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Pprebuilts/go/darwin-x86/src/sort/sort.go?"".heapSort ? ?eH? % H;a? H??PH?\$PH? $? H?D$hH?D$HH?D$( H?\$pH)?H?\$@H?\$@H??H??H???H)?H??H?? |DH?\$XH? $H?\$`H?\$H?D$0H?D$H?\$@H?\$H?\$HH?\$ ? H?D$0H??H?? }?H?D$@H??H?? |tH?\$HH?\$H?\$HH?D$8H?H?\$H?\$`H? $H?\$XH?[0??H?\$XH? $H?\$`H?\$H?\$(H?\$H?\$8H?\$H?\$HH?\$ ? H?D$8H??H?? }?? H??P?? ?????
218 "".heapSort ?
[all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64_race/ |
| sort.a | 154 "".lo type.int "".data "type."".Interface `9_`?_`f ? FR ^>> ? Tgclocals·1347047f6245a35b91e9a4f213167d52 Tgclocals·33cdeccccebe80329f1fdbee7f5874cb Nprebuilts/go/linux-x86/src/sort/sort.go?"".heapSort ? ?dH? % H;a? H??PH?\$PH? $? H?D$hH?D$HH?D$( H?\$pH)?H?\$@H?\$@H??H??H???H)?H??H?? |DH?\$XH? $H?\$`H?\$H?D$0H?D$H?\$@H?\$H?\$HH?\$ ? H?D$0H??H?? }?H?D$@H??H?? |tH?\$HH?\$H?\$HH?D$8H?H?\$H?\$`H? $H?\$XH?[0??H?\$XH? $H?\$`H?\$H?\$(H?\$H?\$8H?\$H?\$HH?\$ ? H?D$8H??H?? }?? H??P?? ?????
218 "".heapSort ?
[all...] |
| /prebuilts/go/darwin-x86/doc/devel/ |
| weekly.html | [all...] |
