Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.RandomAccessList.SkewBinarySlab

Synopsis

data RAList a where
- Nil
- pattern Cons :: a -> RAList a -> RAList a
safeIndexZero :: RAList a -> NonEmptyVector a -> RAList a -> RAList a

Documentation

data RAList a #

A strict list of complete binary trees accompanied by their node size. The trees appear in >=-node size order. Note: this list is strict in its spine, unlike the Prelude list

Constructors

Nil

Bundled Patterns

pattern Cons :: a -> RAList a -> RAList a

Instances

Instances details

NonEmptyVector a -> RAList a -> RAList a #