| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Countable
Synopsis
- class Eq a => Countable a where
- countPrevious :: a -> Maybe a
- countMaybeNext :: Maybe a -> Maybe a
- countDown :: Countable a => a -> [a]
- boundedCountPrevious :: (Eq a, Bounded a, Enum a) => a -> Maybe a
- boundedCountMaybeNext :: (Eq a, Bounded a, Enum a) => Maybe a -> Maybe a
- maybeRecount :: (Countable a, Countable b) => a -> Maybe b
- countDownUp :: (Countable down, Countable up) => (down, up) -> Maybe (down, up)
- countUpDown :: (Countable up, Countable down) => (up, down) -> Maybe (up, down)
- finalIteration :: (a -> Maybe a) -> a -> a
- class Countable a => AtLeastOneCountable a where
- countFirst :: a
- class AtLeastOneCountable a => InfiniteCountable a where
- recount :: (Countable a, InfiniteCountable b) => a -> b
Documentation
class Eq a => Countable a where Source #
Values form a possibly empty, possibly finite, countable sequence.
Instances
finalIteration :: (a -> Maybe a) -> a -> a Source #
class Countable a => AtLeastOneCountable a where Source #
Values form a non-empty, possibly finite, countable sequence.
Methods
countFirst :: a Source #
Instances
class AtLeastOneCountable a => InfiniteCountable a where Source #
Values form an infinite countable sequence.
Instances
| InfiniteCountable Integer Source # | |
| InfiniteCountable a => InfiniteCountable (Maybe a) Source # | |
| AtLeastOneCountable a => InfiniteCountable [a] Source # | |
Defined in Data.Countable | |
| (Countable a, InfiniteCountable b) => InfiniteCountable (Either a b) Source # | |
| (AtLeastOneCountable a, InfiniteCountable b) => InfiniteCountable (a, b) Source # | |
Defined in Data.Countable | |
| (Finite a, AtLeastOneCountable a, InfiniteCountable b) => InfiniteCountable (a -> b) Source # | |
Defined in Data.Function.Eq | |
recount :: (Countable a, InfiniteCountable b) => a -> b Source #