plutus-core-1.30.0.0: Language library for Plutus Core
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.RandomAccessList.SkewBinarySlab

Synopsis

Documentation

data RAList a Source #

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
IsList (RAList a) Source # 
Instance details

Defined in Data.RandomAccessList.SkewBinarySlab

Associated Types

type Item (RAList a) Source #

Methods

fromList ∷ [Item (RAList a)] → RAList a Source #

fromListNInt → [Item (RAList a)] → RAList a Source #

toListRAList a → [Item (RAList a)] Source #

Show a ⇒ Show (RAList a) Source # 
Instance details

Defined in Data.RandomAccessList.SkewBinarySlab

Methods

showsPrecIntRAList a → ShowS Source #

showRAList a → String Source #

showList ∷ [RAList a] → ShowS Source #

Eq a ⇒ Eq (RAList a) Source # 
Instance details

Defined in Data.RandomAccessList.SkewBinarySlab

Methods

(==)RAList a → RAList a → Bool Source #

(/=)RAList a → RAList a → Bool Source #

RandomAccessList (RAList a) Source # 
Instance details

Defined in Data.RandomAccessList.SkewBinarySlab

Associated Types

type Element (RAList a) Source #

type Item (RAList a) Source # 
Instance details

Defined in Data.RandomAccessList.SkewBinarySlab

type Item (RAList a) = Item (AsRAL (RAList a))
type Element (RAList a) Source # 
Instance details

Defined in Data.RandomAccessList.SkewBinarySlab

type Element (RAList a) = a

nullRAList a → Bool Source #

unconsRAList a → Maybe (a, RAList a) Source #

consSlab ∷ NonEmptyVector a → RAList a → RAList a Source #