Home Manual Reference Source

Function

Static Public Summary
public

accumulate(array: *, i: *, j: *)

O(M) time where M=j-i.
public

alloc(n: *)

public

compose(sigma: *, tau: *)

public

cumulativeHistogram(array: *, i: *, j: *, ch: *, offset: *)

O(M+N) time where N=j-i and M = ch.length - offset.
public

* digits(tuples: *, i: *, j: *, s: *, t: *)

public

fill(array: *, x: *, i: *, j: *)

public

histogram(array: *, i: *, j: *, output: *, offset: *)

O(N) time where N = j - i;
public

load(s: *, tuples: *, i: *, j: *, buffer: *)

public

loadLengths(tuples: *, i: *, N: *, buffer: *): *

public

permute(permutation: *, array: *, ai: *, aj: *, output: *, oi: *)

public

permuteInPlace(permutation: *, array: *)

public

rank(ch: Array, array: Array, i: Number, j: Number, permutation: Array)

O(n) time.
public

reset(array: *, i: *, j: *)

public

sort(k: *, M: *, tuples: *): *

public

sortArbitraryTuples(M: *, tuples: *, output: *): *

public

sortFixedLengthTuples(k: *, M: *, tuples: *, output: *, i: *, j: *): *

O(kM + kN) time where k is the number of digits per tuple, M is the radix, and N = j - i is the number of tuples.
public

sortInt16(array: *): *

public

sortInt32(array: *): *

public

sortInt8(array: *): *

public

O(M + N) time where M is the maximum length of a tuple, and N is the number of tuples.
public

sortUint8(array: *): *

public

stable(M: *, current: *, rest: *): *

O(kM + kN) time where k is the number of arrays, M is the radix, and N is the length of each array.
public

zeros(n: *)

Static Public

public accumulate(array: *, i: *, j: *) source 

import accumulate from '@integer-sorting/radix-sort/src/array/core/accumulate.js'

O(M) time where M=j-i.

Params:

NameTypeAttributeDescription
array *
i *
j *

public alloc(n: *) source 

import alloc from '@integer-sorting/radix-sort/src/array/core/alloc.js'

Params:

NameTypeAttributeDescription
n *

public compose(sigma: *, tau: *) source 

import compose from '@integer-sorting/radix-sort/src/array/core/compose.js'

Params:

NameTypeAttributeDescription
sigma *
tau *

public cumulativeHistogram(array: *, i: *, j: *, ch: *, offset: *) source 

import cumulativeHistogram from '@integer-sorting/radix-sort/src/array/core/cumulativeHistogram.js'

O(M+N) time where N=j-i and M = ch.length - offset.

Params:

NameTypeAttributeDescription
array *
i *
j *
ch *
offset *

public * digits(tuples: *, i: *, j: *, s: *, t: *) source 

import digits from '@integer-sorting/radix-sort/src/array/core/digits.js'

Params:

NameTypeAttributeDescription
tuples *
i *
j *
s *
t *

public fill(array: *, x: *, i: *, j: *) source 

import fill from '@integer-sorting/radix-sort/src/array/core/fill.js'

Params:

NameTypeAttributeDescription
array *
x *
i *
j *

public histogram(array: *, i: *, j: *, output: *, offset: *) source 

import histogram from '@integer-sorting/radix-sort/src/array/core/histogram.js'

O(N) time where N = j - i;

Params:

NameTypeAttributeDescription
array *
i *
j *
output *
offset *

public load(s: *, tuples: *, i: *, j: *, buffer: *) source 

import load from '@integer-sorting/radix-sort/src/array/core/load.js'

Params:

NameTypeAttributeDescription
s *
tuples *
i *
j *
buffer *

public loadLengths(tuples: *, i: *, N: *, buffer: *): * source 

import loadLengths from '@integer-sorting/radix-sort/src/array/core/loadLengths.js'

Params:

NameTypeAttributeDescription
tuples *
i *
N *
buffer *

Return:

*

public permute(permutation: *, array: *, ai: *, aj: *, output: *, oi: *) source 

import permute from '@integer-sorting/radix-sort/src/array/core/permute.js'

Params:

NameTypeAttributeDescription
permutation *
array *
ai *
aj *
output *
oi *

public permuteInPlace(permutation: *, array: *) source 

import permuteInPlace from '@integer-sorting/radix-sort/src/array/core/permuteInPlace.js'

Params:

NameTypeAttributeDescription
permutation *
array *

public rank(ch: Array, array: Array, i: Number, j: Number, permutation: Array) source 

import rank from '@integer-sorting/radix-sort/src/array/core/rank.js'

O(n) time.

Params:

NameTypeAttributeDescription
ch Array

The cumulative histogram of the input.
array Array

The input array to sort.
i Number

Inclusive left boundary of the array.
j Number

Non-inclusive right boundary of the array.
permutation Array

The output permutation.

public reset(array: *, i: *, j: *) source 

import reset from '@integer-sorting/radix-sort/src/array/core/reset.js'

Params:

NameTypeAttributeDescription
array *
i *
j *

public sort(k: *, M: *, tuples: *): * source 

import sort from '@integer-sorting/radix-sort/src/array/api/sort.js'

Params:

NameTypeAttributeDescription
k *
M *
tuples *

Return:

*

public sortArbitraryTuples(M: *, tuples: *, output: *): * source 

import sortArbitraryTuples from '@integer-sorting/radix-sort/src/array/core/sortArbitraryTuples.js'

Params:

NameTypeAttributeDescription
M *
tuples *
output *

Return:

*

public sortFixedLengthTuples(k: *, M: *, tuples: *, output: *, i: *, j: *): * source 

import sortFixedLengthTuples from '@integer-sorting/radix-sort/src/array/core/sortFixedLengthTuples.js'

O(kM + kN) time where k is the number of digits per tuple, M is the radix, and N = j - i is the number of tuples. The product kN corresponds to the input size.

Params:

NameTypeAttributeDescription
k *
M *
tuples *
output *
i *
j *

Return:

*

public sortInt16(array: *): * source 

import sortInt16 from '@integer-sorting/radix-sort/src/array/api/sortInt16.js'

Params:

NameTypeAttributeDescription
array *

Return:

*

public sortInt32(array: *): * source 

import sortInt32 from '@integer-sorting/radix-sort/src/array/api/sortInt32.js'

Params:

NameTypeAttributeDescription
array *

Return:

*

public sortInt8(array: *): * source 

import sortInt8 from '@integer-sorting/radix-sort/src/array/api/sortInt8.js'

Params:

NameTypeAttributeDescription
array *

Return:

*

public sortTuplesByLength(tuples: *): undefined[] source 

import sortTuplesByLength from '@integer-sorting/radix-sort/src/array/core/sortTuplesByLength.js'

O(M + N) time where M is the maximum length of a tuple, and N is the number of tuples.

Params:

NameTypeAttributeDescription
tuples *

Return:

undefined[]

public sortUint8(array: *): * source 

import sortUint8 from '@integer-sorting/radix-sort/src/array/api/sortUint8.js'

Params:

NameTypeAttributeDescription
array *

Return:

*

public stable(M: *, current: *, rest: *): * source 

import stable from '@integer-sorting/radix-sort/src/array/core/stable.js'

O(kM + kN) time where k is the number of arrays, M is the radix, and N is the length of each array. The product kN corresponds to the input size.

Params:

NameTypeAttributeDescription
M *
current *
rest *

Return:

*

public zeros(n: *) source 

import zeros from '@integer-sorting/radix-sort/src/array/core/zeros.js'

Params:

NameTypeAttributeDescription
n *