Data.FingerTree

data Node v a

Constructors

• Node2 v a a
• Node3 v a a a

Instances

• (Show a, Show v) => Show (Node v a)
• Functor (Node v)
• Foldable (Node v)
• Traversable (Node v)
• Measured (Node v a) v

node2 :: forall a v. Monoid v => Measured a v => a -> a -> Node v a

node3 :: forall a v. Monoid v => Measured a v => a -> a -> a -> Node v a

nodeToDigit :: forall a v. Node v a -> Digit a

data FingerTree v a

Constructors

• Empty
• Single a
• Deep (Lazy v) (Digit a) (Lazy (FingerTree v (Node v a))) (Digit a)

Instances

• (Show v, Show a) => Show (FingerTree v a)
• (Monoid v, Measured a v) => Semigroup (FingerTree v a)
• Functor (FingerTree v)
• Foldable (FingerTree v)
• Traversable (FingerTree v)
• (Monoid v, Measured a v) => Measured (FingerTree v a) v

lazyEmpty :: forall v a. Lazy (FingerTree v a)

deep :: forall a v. Monoid v => Measured a v => Digit a -> Lazy (FingerTree v (Node v a)) -> Digit a -> FingerTree v a

eqFingerTree :: forall a v. Monoid v => Measured a v => Eq a => FingerTree v a -> FingerTree v a -> Boolean

compareFingerTree :: forall a v. Monoid v => Measured a v => Ord a => FingerTree v a -> FingerTree v a -> Ordering

cons :: forall a v. Monoid v => Measured a v => a -> FingerTree v a -> FingerTree v a

snoc :: forall a v. Monoid v => Measured a v => FingerTree v a -> a -> FingerTree v a

consAll :: forall f a v. Monoid v => Measured a v => Foldable f => f a -> FingerTree v a -> FingerTree v a

snocAll :: forall f a v. Monoid v => Measured a v => Foldable f => FingerTree v a -> f a -> FingerTree v a

toFingerTree :: forall f a v. Monoid v => Measured a v => Foldable f => f a -> FingerTree v a

data ViewL :: (Type -> Type) -> Type -> Typedata ViewL s a

Constructors

• NilL
• ConsL a (Lazy (s a))

Instances

• (Functor s) => Functor (ViewL s)

viewL :: forall a v. Monoid v => Measured a v => FingerTree v a -> ViewL (FingerTree v) a

deepL :: forall a v. Monoid v => Measured a v => Array a -> Lazy (FingerTree v (Node v a)) -> Digit a -> FingerTree v a

isEmpty :: forall a v. Monoid v => Measured a v => FingerTree v a -> Boolean

head :: forall a v. Monoid v => Measured a v => FingerTree v a -> Maybe a

tail :: forall a v. Monoid v => Measured a v => FingerTree v a -> Maybe (FingerTree v a)

data ViewR :: (Type -> Type) -> Type -> Typedata ViewR s a

Constructors

• NilR
• SnocR (Lazy (s a)) a

viewR :: forall a v. Monoid v => Measured a v => FingerTree v a -> ViewR (FingerTree v) a

deepR :: forall a v. Monoid v => Measured a v => Digit a -> Lazy (FingerTree v (Node v a)) -> Array a -> FingerTree v a

last :: forall a v. Monoid v => Measured a v => FingerTree v a -> Maybe a

init :: forall a v. Monoid v => Measured a v => FingerTree v a -> Maybe (FingerTree v a)

app3 :: forall a v. Monoid v => Measured a v => FingerTree v a -> Array a -> FingerTree v a -> FingerTree v a

nodes :: forall a v. Monoid v => Measured a v => Array a -> Array (Node v a)

append :: forall a v. Monoid v => Measured a v => FingerTree v a -> FingerTree v a -> FingerTree v a

data Split :: (Type -> Type) -> Type -> Typedata Split f a

Constructors

• Split (f a) a (f a)

data LazySplit :: (Type -> Type) -> Type -> Typedata LazySplit f a

Constructors

• LazySplit (Lazy (f a)) a (Lazy (f a))

splitDigit :: forall a v. Monoid v => Measured a v => (v -> Boolean) -> v -> Digit a -> Split Array a

splitTree :: forall a v. Monoid v => Measured a v => Partial => (v -> Boolean) -> v -> FingerTree v a -> LazySplit (FingerTree v) a

This function throws an error if the argument is empty.

split :: forall a v. Monoid v => Measured a v => Partial => (v -> Boolean) -> FingerTree v a -> Tuple (Lazy (FingerTree v a)) (Lazy (FingerTree v a))

Split a finger tree according to which elements satisfy a predicate. This function is partial because it requires that the result of applying the predicate to mempty is false; if this is not the case, the behaviour is undefined.

filter :: forall a v. Monoid v => Measured a v => (a -> Boolean) -> FingerTree v a -> FingerTree v a

unfoldLeft :: forall f a v. Unfoldable f => Monoid v => Measured a v => FingerTree v a -> f a

unfoldRight :: forall f a v. Unfoldable f => Monoid v => Measured a v => FingerTree v a -> f a

fullyForce :: forall a v. FingerTree v a -> FingerTree v a

newtype Digit a

A Digit is just an array which has between one and four elements (inclusive). If a Digit has two or three elements, it is described as 'safe'; otherwise, it is described as 'dangerous'.

Instances

• Functor Digit
• (Show a) => Show (Digit a)
• Foldable Digit
• Traversable Digit
• (Monoid v, Measured a v) => Measured (Digit a) v

unsafeIndex :: forall a. Partial => Digit a -> Int -> a

tailDigit :: forall a. Digit a -> Array a

snocDigit :: forall a. Partial => Digit a -> a -> Digit a

Append a single element. This is partial because the result is not defined in the case where the argument has 4 elements.

runDigit :: forall a. Digit a -> Array a

mkDigitMay :: forall a. Array a -> Maybe (Digit a)

Like mkDigit, except this returns Nothing on invalid input.

mkDigit3 :: forall a. a -> a -> a -> Digit a

mkDigit2 :: forall a. a -> a -> Digit a

mkDigit1 :: forall a. a -> Digit a

mkDigit :: forall a. Partial => Array a -> Digit a

This function is only defined when the argument has between one and four elements inclusive. It will not throw an error if this is not satisfied, although the Digit length invariant will be violated, which will cause other functions to break.

lastDigit :: forall a. Digit a -> a

initDigit :: forall a. Digit a -> Array a

headDigit :: forall a. Digit a -> a

dropDigit :: forall a. Int -> Digit a -> Array a

digitLength :: forall a. Digit a -> Int

consDigit :: forall a. Partial => a -> Digit a -> Digit a

Prepend a single element. This is partial because the result is not defined in the case where the argument has 4 elements.

Operator alias for Data.FingerTree.Digit.unsafeIndex (non-associative / precedence 2)