Data.MinLen

Type level naturals

data Zero

Constructors

Zero

Instances

TypeNat Zero

MonoPointed mono => MonoPointed (MinLen (Succ Zero) mono)

MonoPointed mono => MonoPointed (MinLen Zero mono)

data Succ nat

Constructors

Succ nat

Instances

TypeNat nat => TypeNat (Succ nat)

MonoPointed mono => MonoPointed (MinLen (Succ Zero) mono)

class TypeNat nat where

Methods

toValueNat :: Num i => nat -> i

typeNat :: nat

Instances

TypeNat Zero

TypeNat nat => TypeNat (Succ nat)

type family AddNat x y

type family MaxNat x y

Minimum length newtype wrapper

data MinLen nat mono

Instances

Typeable2 MinLen

Functor (MinLen nat)

Eq mono => Eq (MinLen nat mono)

(Data nat, Data mono) => Data (MinLen nat mono)

Ord mono => Ord (MinLen nat mono)

Read mono => Read (MinLen nat mono)

Show mono => Show (MinLen nat mono)

GrowingAppend mono => Semigroup (MinLen nat mono)

MonoPointed mono => MonoPointed (MinLen (Succ Zero) mono)

MonoPointed mono => MonoPointed (MinLen Zero mono)

MonoTraversable mono => MonoTraversable (MinLen nat mono)

MonoFoldableOrd mono => MonoFoldableOrd (MinLen nat mono)

MonoFoldable mono => MonoFoldable (MinLen nat mono)

MonoFunctor mono => MonoFunctor (MinLen nat mono)

GrowingAppend mono => GrowingAppend (MinLen nat mono)

SemiSequence seq => SemiSequence (MinLen nat seq)

unMinLen :: MinLen nat mono -> mono

toMinLenZero :: mono -> MinLen Zero mono

toMinLen :: (MonoFoldable mono, TypeNat nat) => mono -> Maybe (MinLen nat mono)

unsafeToMinLen :: mono -> MinLen nat mono

Although this function itself cannot cause a segfault, it breaks the safety guarantees of MinLen and can lead to a segfault when using otherwise safe functions.

mlcons :: IsSequence seq => Element seq -> MinLen nat seq -> MinLen (Succ nat) seq

mlappend :: IsSequence seq => MinLen x seq -> MinLen y seq -> MinLen (AddNat x y) seq

mlunion :: GrowingAppend mono => MinLen x mono -> MinLen y mono -> MinLen (MaxNat x y) mono

head :: MonoTraversable mono => MinLen (Succ nat) mono -> Element mono

last :: MonoTraversable mono => MinLen (Succ nat) mono -> Element mono

tailML :: IsSequence seq => MinLen (Succ nat) seq -> MinLen nat seq

initML :: IsSequence seq => MinLen (Succ nat) seq -> MinLen nat seq

class (Semigroup mono, MonoFoldable mono) => GrowingAppend mono

olength (x y) >= olength x + olength y

Instances

GrowingAppend ByteString

GrowingAppend ByteString

GrowingAppend IntSet

GrowingAppend Text

GrowingAppend Text

GrowingAppend [a]

GrowingAppend (Seq a)

GrowingAppend (IntMap v)

Ord v => GrowingAppend (Set v)

GrowingAppend (DList a)

GrowingAppend (NonEmpty a)

(Eq v, Hashable v) => GrowingAppend (HashSet v)

GrowingAppend (Vector a)

Unbox a => GrowingAppend (Vector a)

Storable a => GrowingAppend (Vector a)

Ord k => GrowingAppend (Map k v)

(Eq k, Hashable k) => GrowingAppend (HashMap k v)

GrowingAppend mono => GrowingAppend (MinLen nat mono)

ofoldMap1 :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> MinLen (Succ nat) mono -> m

ofold1 :: (MonoFoldable mono, Semigroup (Element mono)) => MinLen (Succ nat) mono -> Element mono

ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> MinLen (Succ nat) mono -> Element mono

ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> MinLen (Succ nat) mono -> Element mono

A variant of 'ofoldl\'' that has no base case, and thus may only be applied to non-empty structures.

'foldl1\'' f = foldl1 f . otoList

maximum :: MonoFoldableOrd mono => MinLen (Succ nat) mono -> Element mono

like Data.List, but not partial on a MonoFoldable

minimum :: MonoFoldableOrd mono => MinLen (Succ nat) mono -> Element mono

like Data.List, but not partial on a MonoFoldable

maximumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> MinLen (Succ nat) mono -> Element mono

like Data.List, but not partial on a MonoFoldable

minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> MinLen (Succ nat) mono -> Element mono

like Data.List, but not partial on a MonoFoldable