Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.SOP.Counting

Contents

Working with Exactly
Working with AtMost

Description

Type-level counting

Intended for unqualified import.

Synopsis

data AtMost xs a where
- AtMostNil ∷ AtMost xs a
- AtMostCons ∷ !a → !(AtMost xs a) → AtMost (x ': xs) a
newtype Exactly xs a where
- Exactly {
  - getExactly ∷ NP (K a) xs
  }
- pattern ExactlyNil ∷ () ⇒ xs ~ '[] ⇒ Exactly xs a
- pattern ExactlyCons ∷ () ⇒ xs' ~ (x ': xs) ⇒ a → Exactly xs a → Exactly xs' a
exactlyHead ∷ Exactly (x ': xs) a → a
exactlyOne ∷ a → Exactly '[x] a
exactlyReplicate ∷ ∀ a r. Word → a → (∀ xs. Exactly xs a → r) → r
exactlyTail ∷ Exactly (x ': xs) a → Exactly xs a
exactlyTwo ∷ a → a → Exactly '[x, y] a
exactlyWeaken ∷ Exactly xs a → AtMost xs a
exactlyWeakenNonEmpty ∷ Exactly (x ': xs) a → NonEmpty (x ': xs) a
exactlyZip ∷ Exactly xs a → Exactly xs b → Exactly xs (a, b)
exactlyZipFoldable ∷ Foldable t ⇒ Exactly xs a → t b → AtMost xs (a, b)
atMostFromNonEmpty ∷ NonEmpty xs a → AtMost xs a
atMostHead ∷ AtMost xs a → Maybe a
atMostInit ∷ AtMost xs a → Maybe (AtMost xs a, a)
atMostLast ∷ AtMost xs a → Maybe a
atMostNonEmpty ∷ AtMost (x ': xs) a → Maybe (NonEmpty (x ': xs) a)
atMostOne ∷ a → AtMost (x ': xs) a
atMostZipFoldable ∷ Foldable t ⇒ AtMost xs a → t b → AtMost xs (a, b)

Documentation

data AtMost xs a where Source #

At most one value for each type level index

Constructors

AtMostNil ∷ AtMost xs a
AtMostCons ∷ !a → !(AtMost xs a) → AtMost (x ': xs) a

Instances

Instances details

Foldable (AtMost xs) Source #
Instance details Defined in Data.SOP.Counting Methods fold ∷ Monoid m ⇒ AtMost xs m → m # foldMap ∷ Monoid m ⇒ (a → m) → AtMost xs a → m # foldMap' ∷ Monoid m ⇒ (a → m) → AtMost xs a → m # foldr ∷ (a → b → b) → b → AtMost xs a → b # foldr' ∷ (a → b → b) → b → AtMost xs a → b # foldl ∷ (b → a → b) → b → AtMost xs a → b # foldl' ∷ (b → a → b) → b → AtMost xs a → b # foldr1 ∷ (a → a → a) → AtMost xs a → a # foldl1 ∷ (a → a → a) → AtMost xs a → a # toList ∷ AtMost xs a → [a] # null ∷ AtMost xs a → Bool # length ∷ AtMost xs a → Int # elem ∷ Eq a ⇒ a → AtMost xs a → Bool # maximum ∷ Ord a ⇒ AtMost xs a → a # minimum ∷ Ord a ⇒ AtMost xs a → a # sum ∷ Num a ⇒ AtMost xs a → a # product ∷ Num a ⇒ AtMost xs a → a #
Traversable (AtMost xs) Source #
Instance details Defined in Data.SOP.Counting Methods traverse ∷ Applicative f ⇒ (a → f b) → AtMost xs a → f (AtMost xs b) # sequenceA ∷ Applicative f ⇒ AtMost xs (f a) → f (AtMost xs a) # mapM ∷ Monad m ⇒ (a → m b) → AtMost xs a → m (AtMost xs b) # sequence ∷ Monad m ⇒ AtMost xs (m a) → m (AtMost xs a) #
Functor (AtMost xs) Source #
Instance details Defined in Data.SOP.Counting Methods fmap ∷ (a → b) → AtMost xs a → AtMost xs b # (<$) ∷ a → AtMost xs b → AtMost xs a #
Show a ⇒ Show (AtMost xs a) Source #
Instance details Defined in Data.SOP.Counting Methods showsPrec ∷ Int → AtMost xs a → ShowS # show ∷ AtMost xs a → String # showList ∷ [AtMost xs a] → ShowS #
Eq a ⇒ Eq (AtMost xs a) Source #
Instance details Defined in Data.SOP.Counting Methods (==) ∷ AtMost xs a → AtMost xs a → Bool # (/=) ∷ AtMost xs a → AtMost xs a → Bool #

newtype Exactly xs a Source #

Constructors

Exactly
Fields getExactly ∷ NP (K a) xs

Bundled Patterns

pattern ExactlyNil ∷ () ⇒ xs ~ '[] ⇒ Exactly xs a
pattern ExactlyCons ∷ () ⇒ xs' ~ (x ': xs) ⇒ a → Exactly xs a → Exactly xs' a

Instances

Instances details

Foldable (Exactly xs) Source #
Instance details Defined in Data.SOP.Counting Methods fold ∷ Monoid m ⇒ Exactly xs m → m # foldMap ∷ Monoid m ⇒ (a → m) → Exactly xs a → m # foldMap' ∷ Monoid m ⇒ (a → m) → Exactly xs a → m # foldr ∷ (a → b → b) → b → Exactly xs a → b # foldr' ∷ (a → b → b) → b → Exactly xs a → b # foldl ∷ (b → a → b) → b → Exactly xs a → b # foldl' ∷ (b → a → b) → b → Exactly xs a → b # foldr1 ∷ (a → a → a) → Exactly xs a → a # foldl1 ∷ (a → a → a) → Exactly xs a → a # toList ∷ Exactly xs a → [a] # null ∷ Exactly xs a → Bool # length ∷ Exactly xs a → Int # elem ∷ Eq a ⇒ a → Exactly xs a → Bool # maximum ∷ Ord a ⇒ Exactly xs a → a # minimum ∷ Ord a ⇒ Exactly xs a → a # sum ∷ Num a ⇒ Exactly xs a → a # product ∷ Num a ⇒ Exactly xs a → a #
Traversable (Exactly xs) Source #
Instance details Defined in Data.SOP.Counting Methods traverse ∷ Applicative f ⇒ (a → f b) → Exactly xs a → f (Exactly xs b) # sequenceA ∷ Applicative f ⇒ Exactly xs (f a) → f (Exactly xs a) # mapM ∷ Monad m ⇒ (a → m b) → Exactly xs a → m (Exactly xs b) # sequence ∷ Monad m ⇒ Exactly xs (m a) → m (Exactly xs a) #
Functor (Exactly xs) Source #
Instance details Defined in Data.SOP.Counting Methods fmap ∷ (a → b) → Exactly xs a → Exactly xs b # (<$) ∷ a → Exactly xs b → Exactly xs a #
Show a ⇒ Show (Exactly xs a) Source #
Instance details Defined in Data.SOP.Counting Methods showsPrec ∷ Int → Exactly xs a → ShowS # show ∷ Exactly xs a → String # showList ∷ [Exactly xs a] → ShowS #
Eq a ⇒ Eq (Exactly xs a) Source #
Instance details Defined in Data.SOP.Counting Methods (==) ∷ Exactly xs a → Exactly xs a → Bool # (/=) ∷ Exactly xs a → Exactly xs a → Bool #