MCPcopy Create free account

hub / github.com/BonzaiThePenguin/WikiSort / functions

Functions126 in github.com/BonzaiThePenguin/WikiSort

⨍ Functions 126◇ Types & classes 24
↓ 105 callersFunctionRange_length
WikiSort.c:104
↓ 105 callersMethodlength
()
WikiSort.java:53
↓ 71 callersFunctionRange_new
WikiSort.c:106
↓ 61 callersMethodNetSwap
(T array[], int order[], Range range, Comparator<T> comp, int x, int y)
WikiSort.java:443
↓ 50 callersMethodlength
WikiSort.cpp:59
↓ 37 callersMethodcompare
(Test a, Test b)
WikiSort.java:25
↓ 31 callersMethodset
(int start1, int end1)
WikiSort.java:48
↓ 11 callersFunctionWikiIterator_nextRange
WikiSort.c:291
↓ 11 callersMethodbegin
WikiSort.cpp:298
↓ 11 callersMethodnextRange
WikiSort.cpp:303
↓ 11 callersMethodnextRange
()
WikiSort.java:103
↓ 9 callersFunctionRotate
rotate the values in an array ([0 1 2 3] becomes [1 2 3 0] if we rotate by 1) */ this assumes that 0 <= amount <= range.length() */
WikiSort.c:248
↓ 9 callersMethodRotate
(T array[], int amount, Range range, boolean use_cache)
WikiSort.java:269
↓ 8 callersMethodnextInt
(int max)
WikiSort.java:1086
↓ 7 callersFunctionWikiIterator_length
WikiSort.c:319
↓ 7 callersMethodlength
()
WikiSort.java:131
↓ 6 callersFunctionBinaryFirst
find the index of the first value within the range that is equal to array[index] */
WikiSort.c:142
↓ 6 callersMethodBinaryFirst
(T array[], T value, Range range, Comparator<T> comp)
WikiSort.java:166
↓ 6 callersFunctionBinaryLast
find the index of the last value within the range that is equal to array[index], plus 1 */
WikiSort.c:157
↓ 6 callersFunctionBlockSwap
swap a series of values in the array */
WikiSort.c:240
↓ 6 callersMethodBlockSwap
(T array[], int start1, int start2, int block_size)
WikiSort.java:259
↓ 6 callersFunctionSeconds
WikiSort.c:37
↓ 6 callersFunctionSeconds
WikiSort.cpp:39
↓ 6 callersMethodSeconds
()
WikiSort.java:1165
↓ 6 callersFunctionWikiIterator_begin
WikiSort.c:287
↓ 5 callersMethodBinaryLast
(T array[], T value, Range range, Comparator<T> comp)
WikiSort.java:180
↓ 5 callersFunctionWikiIterator_finished
WikiSort.c:304
↓ 5 callersMethodbegin
()
WikiSort.java:99
↓ 5 callersMethodfinished
WikiSort.cpp:316
↓ 5 callersMethodfinished
()
WikiSort.java:116
↓ 4 callersFunctionMax
WikiSort.c:54
↓ 4 callersMethodSort
(T array[], Comparator<T> comp)
WikiSort.java:456
↓ 3 callersFunctionMergeExternal
merge operation using an external buffer, */
WikiSort.c:364
↓ 3 callersFunctionMergeExternal
WikiSort.cpp:170
↓ 3 callersMethodMergeExternal
(T array[], Range A, Range B, Comparator<T> comp)
WikiSort.java:341
↓ 3 callersFunctionMergeInto
merge two ranges from one array and save the results into a different array */
WikiSort.c:335
↓ 3 callersMethodMergeInto
(T from[], Range A, Range B, Comparator<T> comp, T into[], int at_index)
WikiSort.java:310
↓ 3 callersFunctionReverse
reverse a range of values within the array */
WikiSort.c:233
↓ 3 callersMethodReverse
(T array[], Range range)
WikiSort.java:250
↓ 2 callersFunctionFindFirstBackward
WikiSort.c:197
↓ 2 callersFunctionFindFirstBackward
WikiSort.cpp:113
↓ 2 callersMethodFindFirstBackward
(T array[], T value, Range range, Comparator<T> comp, int unique)
WikiSort.java:217
↓ 2 callersFunctionFindLastForward
WikiSort.c:185
↓ 2 callersFunctionFindLastForward
WikiSort.cpp:96
↓ 2 callersMethodFindLastForward
(T array[], T value, Range range, Comparator<T> comp, int unique)
WikiSort.java:206
↓ 2 callersFunctionInsertionSort
n^2 sorting algorithm used to sort tiny chunks of the full array */
WikiSort.c:222
↓ 2 callersFunctionMergeInPlace
merge operation without a buffer */
WikiSort.c:419
↓ 2 callersFunctionMergeInPlace
WikiSort.cpp:235
↓ 2 callersMethodMergeInPlace
(T array[], Range A, Range B, Comparator<T> comp)
WikiSort.java:400
↓ 2 callersFunctionMergeInternal
merge operation using an internal buffer */
WikiSort.c:393
↓ 2 callersFunctionMergeInternal
WikiSort.cpp:202
↓ 2 callersMethodMergeInternal
(T array[], Range A, Range B, Comparator<T> comp, Range buffer)
WikiSort.java:370
↓ 2 callersFunctionMergeSort
WikiSort.c:1084
↓ 2 callersFunctionSort
WikiSort.cpp:377
↓ 2 callersMethodSort
(T array[], Comparator<T> comp)
WikiSort.java:1073
↓ 2 callersFunctionVerify
WikiSort.cpp:1021
↓ 2 callersMethodVerify
(Test array[], Range range, TestComparator comp, String msg)
WikiSort.java:1172
↓ 2 callersFunctionWikiIterator_nextLevel
WikiSort.c:308
↓ 2 callersFunctionWikiSort
bottom-up merge sort combined with an in-place merge algorithm for O(1) memory use */
WikiSort.c:460
↓ 2 callersFunctionWikiVerify
WikiSort.c:1139
↓ 2 callersMethodnextLevel
WikiSort.cpp:320
↓ 2 callersMethodnextLevel
()
WikiSort.java:120
↓ 2 callersMethodreset
()
WikiSort.java:62
↓ 1 callersFunctionFindFirstForward
combine a linear search with a binary search to reduce the number of comparisons in situations */ where have some idea as to how many unique values th
WikiSort.c:173
↓ 1 callersFunctionFindFirstForward
WikiSort.cpp:79
↓ 1 callersMethodFindFirstForward
(T array[], T value, Range range, Comparator<T> comp, int unique)
WikiSort.java:195
↓ 1 callersFunctionFindLastBackward
WikiSort.c:209
↓ 1 callersFunctionFindLastBackward
WikiSort.cpp:130
↓ 1 callersMethodFindLastBackward
(T array[], T value, Range range, Comparator<T> comp, int unique)
WikiSort.java:228
↓ 1 callersFunctionFloorPowerOfTwo
63 -> 32, 64 -> 64, etc. */ this comes from Hacker's Delight */
WikiSort.c:128
↓ 1 callersMethodFloorPowerOfTwo
(int value)
WikiSort.java:80
↓ 1 callersFunctionHyperfloor
WikiSort.cpp:69
↓ 1 callersFunctionInsertionSort
WikiSort.cpp:147
↓ 1 callersMethodInsertionSort
(T array[], Range range, Comparator<T> comp)
WikiSort.java:240
↓ 1 callersMethodInsertionSort
(T array[], Range range, Comparator<T> comp)
WikiSort.java:1031
↓ 1 callersFunctionMergeSortR
standard merge sort, so we have a baseline for how well WikiSort works */
WikiSort.c:1051
↓ 1 callersFunctionMin
WikiSort.c:49
↓ 1 callersFunctionRandom
WikiSort.cpp:1039
↓ 1 callersMethodSortR
(T array[], Range range, Comparator<T> comp, T buffer[])
WikiSort.java:1042
↓ 1 callersFunctionTestingRandom
WikiSort.c:1093
↓ 1 callersFunctionWikiIterator_new
WikiSort.c:323
↓ 1 callersMethodvalue
(int index, int total)
WikiSort.java:1097
FunctionAppend
the last 1/5 of the data is random
WikiSort.cpp:1076
FunctionAscending
WikiSort.cpp:1055
MethodCache
WikiSort.cpp:349
FunctionDescending
WikiSort.cpp:1059
FunctionEqual
WikiSort.cpp:1063
MethodIterator
WikiSort.cpp:288
MethodIterator
(int size2, int min_level)
WikiSort.java:90
FunctionJittered
WikiSort.cpp:1067
FunctionMostlyAscending
WikiSort.cpp:1051
FunctionMostlyDescending
WikiSort.cpp:1047
FunctionMostlyEqual
WikiSort.cpp:1071
MethodPull
()
WikiSort.java:61
FunctionRandomFew
WikiSort.cpp:1043
MethodRange
WikiSort.cpp:52
MethodRange
(int start1, int end1)
WikiSort.java:38
FunctionTestCompare
WikiSort.c:78
FunctionTestCompare
WikiSort.cpp:998
FunctionTestingAppend
the last 1/5 of the data is random */
WikiSort.c:1130
next →1–100 of 126, ranked by callers