taoensso.tukey.impl — com.taoensso/tukey 0.1.0

Private implementation details.

counting-merge-sort clj/s

(counting-merge-sort keyfn xs)

(counting-merge-sort keyfn n-swaps_ v)

Modified merge sort implementation that tracks number of values that needed to be swapped, and returns [<n-swaps> <sorted-xs>] in O(n.log_n).

DoublePair cljs

doubles? clj

(doubles? x)

indexed clj/s

(indexed xs)

[:a :b :c ...] -> {0 :a, 1 :b, 2 :c ...}, useful for distinguishing between duplicate elements in xs.

is-not-zero clj/s macro

(is-not-zero ex-msg ex-map x)

is-p clj/s

(is-p x)

is-same-count clj/s

(is-same-count context xs ys)

is-sorted clj/s

(is-sorted x)

kendall-correlation-impl-knight clj/s

(kendall-correlation-impl-knight xys)

Returns {:keys [n_c-n_d n_xy n_yt n_xyt n_p} in O(n.log_n) using Knight's Tau method [R1], [R2].

kendall-correlation-impl-naive clj/s

(kendall-correlation-impl-naive reduce-combinations xys)

Returns {:keys [n_c-n_d n_xy n_yt n_xyt n_p} in O(n²) using reduce-combinations.

kendall-knight-tied-pair-count clj/s

(kendall-knight-tied-pair-count keyfn sorted-xs)

Given sorted xs, returns the total number of rank ties in all possible [xi xj] combinations, as per Knight's Tau method [R1], [R2].

longs? clj

(longs? x)

pow' clj/s

(pow' base exp)

Auto-promoting Math/pow.

rand-ints clj/s

(rand-ints n)

For tests

sorted-doubles clj/s

(sorted-doubles x)

Advanced: returns a SortedDoubles instance for given numerical values, backed by a double array. May be provided to certain utils as a performance optimisation.

sorted-doubles? clj/s

(sorted-doubles? x)

sorted-fixnums? clj/s

(sorted-fixnums? x)

sorted-longs clj/s

(sorted-longs x)

Advanced: returns a SortedLongs instance for given numerical values, backed by a long array. May be provided to certain utils as a performance optimisation.

sorted-longs? clj/s

(sorted-longs? x)

sorted-max clj/s

(sorted-max x)

sorted-median clj/s

(sorted-median x)

sorted-min clj/s

(sorted-min x)

sorted-percentile clj/s

(sorted-percentile p x)

SortedDoubles cljs

SortedLongs cljs

vsplit clj/s

(vsplit v)

Splits vector ~evenly into [<left> <right>] sub-vectors in O(1).