Data.RRBVector.Unsized.Internal

RRB Vector Internals

Definitions

Shift : Type

Totality: total
Visibility: public export

blockshift : Shift

  The number of bits used per level.

Totality: total
Visibility: export

blocksize : Nat

  The maximum size of a block.

Totality: total
Visibility: export

blockmask : Nat

  The mask used to extract the index into the array.

Totality: total
Visibility: export

up : Shift -> Shift

Totality: total
Visibility: export

down : Shift -> Shift

Totality: total
Visibility: export

radixIndex : Nat -> Shift -> Nat

Totality: total
Visibility: export

relaxedRadixIndex : Array Nat -> Nat -> Shift -> (Nat, Nat)

Totality: total
Visibility: export

data Tree : Type -> Type

  An internal tree representation.

Totality: total
Visibility: public export
Constructors:

Balanced : Array (Tree a) -> Tree a

Unbalanced : Array (Tree a) -> Array Nat -> Tree a

Leaf : Array a -> Tree a

Hints:

Eq a => Eq (Tree a)

Foldable Tree

Ord a => Ord (Tree a)

Show a => Show (Tree a)

toList : Tree a -> List a

Totality: total
Visibility: export

showTreeRep : Show a => Show (Tree a) => Tree a -> String

Totality: total
Visibility: public export

singleton : a -> Array a

Totality: total
Visibility: export

treeToArray : Tree a -> Array (Tree a)

Totality: total
Visibility: export

treeBalanced : Tree a -> Bool

Totality: total
Visibility: export

treeSize : Shift -> Tree a -> Nat

  Computes the size of a tree with shift.

Totality: total
Visibility: export

computeSizes : Shift -> Array (Tree a) -> Tree a

  Turns an array into a tree node by computing the sizes of its subtrees.
  sh is the shift of the resulting tree.

Totality: total
Visibility: export

countTrailingZeros : Nat -> Nat

Totality: total
Visibility: export

log2 : Nat -> Nat

  Nat log base 2.

Totality: total
Visibility: export

data RRBVector : Type -> Type

  A relaxed radix balanced vector (RRBVector).
  It supports fast indexing, iteration, concatenation and splitting.

Totality: total
Visibility: public export
Constructors:

Root : Nat -> Shift -> Tree a -> RRBVector a

Empty : RRBVector a

Hints:

Applicative RRBVector

Eq a => Eq (RRBVector a)

Foldable RRBVector

Functor RRBVector

Monad RRBVector

Semigroup (RRBVector a) => Monoid (RRBVector a)

Ord a => Ord (RRBVector a)

Semigroup (RRBVector a)

Show {arg:11029} => Show (RRBVector {arg:11029})