Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.RandomAccessList.SkewBinary

Synopsis

data RAList a where
- Nil
- pattern Cons ∷ a → RAList a → RAList a
contIndexZero ∷ ∀ a b. b → (a → b) → RAList a → Word64 → b
contIndexOne ∷ ∀ a b. b → (a → b) → RAList a → Word64 → b
safeIndexZero ∷ RAList a → Word64 → Maybe a
unsafeIndexZero ∷ RAList a → Word64 → a
safeIndexOne ∷ RAList a → Word64 → Maybe a
unsafeIndexOne ∷ RAList a → Word64 → a
null ∷ RAList a → Bool
uncons ∷ RAList a → Maybe (a, RAList a)

Documentation

data RAList a Source #

A strict list of complete binary trees accompanied by their size. The trees appear in >=-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

IsList (RAList a) Source #
Instance details Defined in Data.RandomAccessList.SkewBinary Associated Types type Item (RAList a) Source # Methods fromList ∷ [Item (RAList a)] → RAList a Source # fromListN ∷ Int → [Item (RAList a)] → RAList a Source # toList ∷ RAList a → [Item (RAList a)] Source #
Show a ⇒ Show (RAList a) Source #
Instance details Defined in Data.RandomAccessList.SkewBinary Methods showsPrec ∷ Int → RAList a → ShowS Source # show ∷ RAList a → String Source # showList ∷ [RAList a] → ShowS Source #
Eq a ⇒ Eq (RAList a) Source #
Instance details Defined in Data.RandomAccessList.SkewBinary Methods (==) ∷ RAList a → RAList a → Bool Source # (/=) ∷ RAList a → RAList a → Bool Source #
RandomAccessList (RAList a) Source #
Instance details Defined in Data.RandomAccessList.SkewBinary Associated Types type Element (RAList a) Source # Methods empty ∷ RAList a Source # cons ∷ Element (RAList a) → RAList a → RAList a Source # uncons ∷ RAList a → Maybe (Element (RAList a), RAList a) Source # length ∷ RAList a → Word64 Source # consSlab ∷ NonEmptyVector (Element (RAList a)) → RAList a → RAList a Source # indexZero ∷ RAList a → Word64 → Maybe (Element (RAList a)) Source # indexOne ∷ RAList a → Word64 → Maybe (Element (RAList a)) Source # unsafeIndexZero ∷ RAList a → Word64 → Element (RAList a) Source # unsafeIndexOne ∷ RAList a → Word64 → Element (RAList a) Source #
type Item (RAList a) Source #
Instance details Defined in Data.RandomAccessList.SkewBinary type Item (RAList a) = Item (AsRAL (RAList a))
type Element (RAList a) Source #
Instance details Defined in Data.RandomAccessList.SkewBinary type Element (RAList a) = a

contIndexZero ∷ ∀ a b. b → (a → b) → RAList a → Word64 → b Source #

contIndexOne ∷ ∀ a b. b → (a → b) → RAList a → Word64 → b Source #

safeIndexZero ∷ RAList a → Word64 → Maybe a Source #

unsafeIndexZero ∷ RAList a → Word64 → a Source #

safeIndexOne ∷ RAList a → Word64 → Maybe a Source #

unsafeIndexOne ∷ RAList a → Word64 → a Source #

null ∷ RAList a → Bool Source #

uncons ∷ RAList a → Maybe (a, RAList a) Source #