Safe Haskell	None
Language	Haskell2010

Control.Iterate.BaseTypes

Description

Defines what types can be used in the SetAlgebra, and what operations those types must support (Iter, Basic, Embed)

Synopsis

class Iter f where
- nxt :: f a b -> Collect (a, b, f a b)
- lub :: Ord k => k -> f k b -> Collect (k, b, f k b)
- hasNxt :: f a b -> Maybe (a, b, f a b)
- hasLub :: Ord k => k -> f k b -> Maybe (k, b, f k b)
- haskey :: Ord key => key -> f key b -> Bool
- isnull :: f k v -> Bool
- lookup :: Ord key => key -> f key rng -> Maybe rng
- element :: Ord k => k -> f k v -> Collect ()
class Basic f where
- addpair :: Ord k => k -> v -> f k v -> f k v
- addkv :: Ord k => (k, v) -> f k v -> (v -> v -> v) -> f k v
- removekey :: Ord k => k -> f k v -> f k v
- domain :: Ord k => f k v -> Set k
- range :: Ord v => f k v -> Set v
data BaseRep f k v where
- MapR :: Basic Map => BaseRep Map k v
- SetR :: Basic Sett => BaseRep Sett k ()
- ListR :: Basic List => BaseRep List k v
- SingleR :: Basic Single => BaseRep Single k v
- BiMapR :: ( Basic ( BiMap v), Ord v) => BaseRep ( BiMap v) k v
- ViewR :: ( Monoid coin, Ord cred, Ord ptr, Ord coin, Ord pool) => Tag coin cred pool ptr k v -> BaseRep ( View coin cred pool ptr) k v
data List k v where
- UnSafeList :: Ord k => [(k, v)] -> List k v
unList :: List k v -> [(k, v)]
fromPairs :: Ord k => (v -> v -> v) -> [(k, v)] -> List k v
normalize :: Ord k => (v -> v -> v) -> [(k, v)] -> [(k, v)]
data Single k v where
- Single :: k -> v -> Single k v
- Fail :: Single k v
- SetSingle :: k -> Single k ()
data Sett k v where
- Sett :: Set k -> Sett k ()
class Embed concrete base | concrete -> base where
- toBase :: concrete -> base
- fromBase :: base -> concrete

Documentation

class Iter f where Source #

Minimal complete definition

nxt , lub

Methods

nxt :: f a b -> Collect (a, b, f a b) Source #

lub :: Ord k => k -> f k b -> Collect (k, b, f k b) Source #

hasNxt :: f a b -> Maybe (a, b, f a b) Source #

hasLub :: Ord k => k -> f k b -> Maybe (k, b, f k b) Source #

haskey :: Ord key => key -> f key b -> Bool Source #

isnull :: f k v -> Bool Source #

lookup :: Ord key => key -> f key rng -> Maybe rng Source #

element :: Ord k => k -> f k v -> Collect () Source #

Instances

Instances details

Iter Map Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: Map a b -> Collect (a, b, Map a b) Source # lub :: Ord k => k -> Map k b -> Collect (k, b, Map k b) Source # hasNxt :: Map a b -> Maybe (a, b, Map a b) Source # hasLub :: Ord k => k -> Map k b -> Maybe (k, b, Map k b) Source # haskey :: Ord key => key -> Map key b -> Bool Source # isnull :: Map k v -> Bool Source # lookup :: Ord key => key -> Map key rng -> Maybe rng Source # element :: Ord k => k -> Map k v -> Collect () Source #
Iter Sett Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: Sett a b -> Collect (a, b, Sett a b) Source # lub :: Ord k => k -> Sett k b -> Collect (k, b, Sett k b) Source # hasNxt :: Sett a b -> Maybe (a, b, Sett a b) Source # hasLub :: Ord k => k -> Sett k b -> Maybe (k, b, Sett k b) Source # haskey :: Ord key => key -> Sett key b -> Bool Source # isnull :: Sett k v -> Bool Source # lookup :: Ord key => key -> Sett key rng -> Maybe rng Source # element :: Ord k => k -> Sett k v -> Collect () Source #
Iter Single Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: Single a b -> Collect (a, b, Single a b) Source # lub :: Ord k => k -> Single k b -> Collect (k, b, Single k b) Source # hasNxt :: Single a b -> Maybe (a, b, Single a b) Source # hasLub :: Ord k => k -> Single k b -> Maybe (k, b, Single k b) Source # haskey :: Ord key => key -> Single key b -> Bool Source # isnull :: Single k v -> Bool Source # lookup :: Ord key => key -> Single key rng -> Maybe rng Source # element :: Ord k => k -> Single k v -> Collect () Source #
Iter List Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: List a b -> Collect (a, b, List a b) Source # lub :: Ord k => k -> List k b -> Collect (k, b, List k b) Source # hasNxt :: List a b -> Maybe (a, b, List a b) Source # hasLub :: Ord k => k -> List k b -> Maybe (k, b, List k b) Source # haskey :: Ord key => key -> List key b -> Bool Source # isnull :: List k v -> Bool Source # lookup :: Ord key => key -> List key rng -> Maybe rng Source # element :: Ord k => k -> List k v -> Collect () Source #
Iter Query Source #
Instance details Defined in Control.Iterate.Exp Methods nxt :: Query a b -> Collect (a, b, Query a b) Source # lub :: Ord k => k -> Query k b -> Collect (k, b, Query k b) Source # hasNxt :: Query a b -> Maybe (a, b, Query a b) Source # hasLub :: Ord k => k -> Query k b -> Maybe (k, b, Query k b) Source # haskey :: Ord key => key -> Query key b -> Bool Source # isnull :: Query k v -> Bool Source # lookup :: Ord key => key -> Query key rng -> Maybe rng Source # element :: Ord k => k -> Query k v -> Collect () Source #
Ord v => Iter ( BiMap v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: BiMap v a b -> Collect (a, b, BiMap v a b) Source # lub :: Ord k => k -> BiMap v k b -> Collect (k, b, BiMap v k b) Source # hasNxt :: BiMap v a b -> Maybe (a, b, BiMap v a b) Source # hasLub :: Ord k => k -> BiMap v k b -> Maybe (k, b, BiMap v k b) Source # haskey :: Ord key => key -> BiMap v key b -> Bool Source # isnull :: BiMap v k v0 -> Bool Source # lookup :: Ord key => key -> BiMap v key rng -> Maybe rng Source # element :: Ord k => k -> BiMap v k v0 -> Collect () Source #
( Ord coin, Ord cred, Ord ptr) => Iter ( View coin cred pool ptr) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: View coin cred pool ptr a b -> Collect (a, b, View coin cred pool ptr a b) Source # lub :: Ord k => k -> View coin cred pool ptr k b -> Collect (k, b, View coin cred pool ptr k b) Source # hasNxt :: View coin cred pool ptr a b -> Maybe (a, b, View coin cred pool ptr a b) Source # hasLub :: Ord k => k -> View coin cred pool ptr k b -> Maybe (k, b, View coin cred pool ptr k b) Source # haskey :: Ord key => key -> View coin cred pool ptr key b -> Bool Source # isnull :: View coin cred pool ptr k v -> Bool Source # lookup :: Ord key => key -> View coin cred pool ptr key rng -> Maybe rng Source # element :: Ord k => k -> View coin cred pool ptr k v -> Collect () Source #

class Basic f where Source #

In order to build typed Exp (which are a typed deep embedding) of Set operations, we need to know what kind of basic types of Maps and Sets can be used this way. Every Basic type has a few operations for creating one from a list, for adding and removing key-value pairs, looking up a value given a key. Instances of this algebra are functional in that every key has exactly one value associated with it.

Minimal complete definition

addkv , removekey , domain , range

Methods

addpair :: Ord k => k -> v -> f k v -> f k v Source #

in addpair the new value always prevails, to make a choice use addkv which has a combining function that allows choice.

addkv :: Ord k => (k, v) -> f k v -> (v -> v -> v) -> f k v Source #

use ( old new -> old) if you want the v in (f k v) to prevail, and use ( old new -> new) if you want the v in (k,v) to prevail

removekey :: Ord k => k -> f k v -> f k v Source #

domain :: Ord k => f k v -> Set k Source #

range :: Ord v => f k v -> Set v Source #

Instances

Instances details

Basic Map Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> Map k v -> Map k v Source # addkv :: Ord k => (k, v) -> Map k v -> (v -> v -> v) -> Map k v Source # removekey :: Ord k => k -> Map k v -> Map k v Source # domain :: Ord k => Map k v -> Set k Source # range :: Ord v => Map k v -> Set v Source #
Basic Sett Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> Sett k v -> Sett k v Source # addkv :: Ord k => (k, v) -> Sett k v -> (v -> v -> v) -> Sett k v Source # removekey :: Ord k => k -> Sett k v -> Sett k v Source # domain :: Ord k => Sett k v -> Set k Source # range :: Ord v => Sett k v -> Set v Source #
Basic Single Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> Single k v -> Single k v Source # addkv :: Ord k => (k, v) -> Single k v -> (v -> v -> v) -> Single k v Source # removekey :: Ord k => k -> Single k v -> Single k v Source # domain :: Ord k => Single k v -> Set k Source # range :: Ord v => Single k v -> Set v Source #
Basic List Source #	The constructor for List is hidden, since it requires some invariants. Use fromPairs to build an initial List.
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> List k v -> List k v Source # addkv :: Ord k => (k, v) -> List k v -> (v -> v -> v) -> List k v Source # removekey :: Ord k => k -> List k v -> List k v Source # domain :: Ord k => List k v -> Set k Source # range :: Ord v => List k v -> Set v Source #
Ord v => Basic ( BiMap v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v0 -> BiMap v k v0 -> BiMap v k v0 Source # addkv :: Ord k => (k, v0) -> BiMap v k v0 -> (v0 -> v0 -> v0) -> BiMap v k v0 Source # removekey :: Ord k => k -> BiMap v k v0 -> BiMap v k v0 Source # domain :: Ord k => BiMap v k v0 -> Set k Source # range :: Ord v0 => BiMap v k v0 -> Set v0 Source #
( Monoid coin, Ord coin, Ord cred, Ord ptr, Ord pool) => Basic ( View coin cred pool ptr) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> View coin cred pool ptr k v -> View coin cred pool ptr k v Source # addkv :: Ord k => (k, v) -> View coin cred pool ptr k v -> (v -> v -> v) -> View coin cred pool ptr k v Source # removekey :: Ord k => k -> View coin cred pool ptr k v -> View coin cred pool ptr k v Source # domain :: Ord k => View coin cred pool ptr k v -> Set k Source # range :: Ord v => View coin cred pool ptr k v -> Set v Source #

data BaseRep f k v where Source #

BaseRep witnesses Basic types. I.e. those types that are instances of both Basic and Iter. Pattern matching against a constructor of type BaseRep, determines which base type. For example data Tag f k v = Tag (BaseRep f k v) (f k v) case Tag MapR x -> -- here we know x :: Map.Map k v

Constructors

MapR :: Basic Map => BaseRep Map k v
SetR :: Basic Sett => BaseRep Sett k ()
ListR :: Basic List => BaseRep List k v
SingleR :: Basic Single => BaseRep Single k v
BiMapR :: ( Basic ( BiMap v), Ord v) => BaseRep ( BiMap v) k v
ViewR :: ( Monoid coin, Ord cred, Ord ptr, Ord coin, Ord pool) => Tag coin cred pool ptr k v -> BaseRep ( View coin cred pool ptr) k v

Instances

Instances details

Show ( BaseRep f k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods showsPrec :: Int -> BaseRep f k v -> ShowS Source # show :: BaseRep f k v -> String Source # showList :: [ BaseRep f k v] -> ShowS Source #

data List k v where Source #

Constructors

UnSafeList :: Ord k => [(k, v)] -> List k v

Instances

Instances details

Basic List Source #	The constructor for List is hidden, since it requires some invariants. Use fromPairs to build an initial List.
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> List k v -> List k v Source # addkv :: Ord k => (k, v) -> List k v -> (v -> v -> v) -> List k v Source # removekey :: Ord k => k -> List k v -> List k v Source # domain :: Ord k => List k v -> Set k Source # range :: Ord v => List k v -> Set v Source #
Iter List Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: List a b -> Collect (a, b, List a b) Source # lub :: Ord k => k -> List k b -> Collect (k, b, List k b) Source # hasNxt :: List a b -> Maybe (a, b, List a b) Source # hasLub :: Ord k => k -> List k b -> Maybe (k, b, List k b) Source # haskey :: Ord key => key -> List key b -> Bool Source # isnull :: List k v -> Bool Source # lookup :: Ord key => key -> List key rng -> Maybe rng Source # element :: Ord k => k -> List k v -> Collect () Source #
Ord k => Embed [(k, v)] ( List k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: [(k, v)] -> List k v Source # fromBase :: List k v -> [(k, v)] Source #
Ord k => HasExp [(k, v)] ( List k v) Source #
Instance details Defined in Control.Iterate.Exp Methods toExp :: [(k, v)] -> Exp ( List k v) Source #
( Eq k, Eq v) => Eq ( List k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods (==) :: List k v -> List k v -> Bool Source # (/=) :: List k v -> List k v -> Bool Source #
( Show k, Show v) => Show ( List k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods showsPrec :: Int -> List k v -> ShowS Source # show :: List k v -> String Source # showList :: [ List k v] -> ShowS Source #

unList :: List k v -> [(k, v)] Source #

fromPairs :: Ord k => (v -> v -> v) -> [(k, v)] -> List k v Source #

normalize :: Ord k => (v -> v -> v) -> [(k, v)] -> [(k, v)] Source #

data Single k v where Source #

Constructors

Single :: k -> v -> Single k v
Fail :: Single k v
SetSingle :: k -> Single k ()

Instances

Instances details

Basic Single Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> Single k v -> Single k v Source # addkv :: Ord k => (k, v) -> Single k v -> (v -> v -> v) -> Single k v Source # removekey :: Ord k => k -> Single k v -> Single k v Source # domain :: Ord k => Single k v -> Set k Source # range :: Ord v => Single k v -> Set v Source #
Iter Single Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: Single a b -> Collect (a, b, Single a b) Source # lub :: Ord k => k -> Single k b -> Collect (k, b, Single k b) Source # hasNxt :: Single a b -> Maybe (a, b, Single a b) Source # hasLub :: Ord k => k -> Single k b -> Maybe (k, b, Single k b) Source # haskey :: Ord key => key -> Single key b -> Bool Source # isnull :: Single k v -> Bool Source # lookup :: Ord key => key -> Single key rng -> Maybe rng Source # element :: Ord k => k -> Single k v -> Collect () Source #
( Eq k, Eq v) => Eq ( Single k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods (==) :: Single k v -> Single k v -> Bool Source # (/=) :: Single k v -> Single k v -> Bool Source #
( Show k, Show v) => Show ( Single k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods showsPrec :: Int -> Single k v -> ShowS Source # show :: Single k v -> String Source # showList :: [ Single k v] -> ShowS Source #
Ord k => HasQuery ( Single k v) k v Source #
Instance details Defined in Control.Iterate.Exp Methods query :: Single k v -> Query k v Source #
Embed ( Single k v) ( Single k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: Single k v -> Single k v Source # fromBase :: Single k v -> Single k v Source #
Ord k => HasExp ( Single k v) ( Single k v) Source #
Instance details Defined in Control.Iterate.Exp Methods toExp :: Single k v -> Exp ( Single k v) Source #

data Sett k v where Source #

Constructors

Sett :: Set k -> Sett k ()

Instances

Instances details

Basic Sett Source #
Instance details Defined in Control.Iterate.BaseTypes Methods addpair :: Ord k => k -> v -> Sett k v -> Sett k v Source # addkv :: Ord k => (k, v) -> Sett k v -> (v -> v -> v) -> Sett k v Source # removekey :: Ord k => k -> Sett k v -> Sett k v Source # domain :: Ord k => Sett k v -> Set k Source # range :: Ord v => Sett k v -> Set v Source #
Iter Sett Source #
Instance details Defined in Control.Iterate.BaseTypes Methods nxt :: Sett a b -> Collect (a, b, Sett a b) Source # lub :: Ord k => k -> Sett k b -> Collect (k, b, Sett k b) Source # hasNxt :: Sett a b -> Maybe (a, b, Sett a b) Source # hasLub :: Ord k => k -> Sett k b -> Maybe (k, b, Sett k b) Source # haskey :: Ord key => key -> Sett key b -> Bool Source # isnull :: Sett k v -> Bool Source # lookup :: Ord key => key -> Sett key rng -> Maybe rng Source # element :: Ord k => k -> Sett k v -> Collect () Source #
Embed ( Set k) ( Sett k ()) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: Set k -> Sett k () Source # fromBase :: Sett k () -> Set k Source #
Ord k => HasExp ( Set k) ( Sett k ()) Source #
Instance details Defined in Control.Iterate.Exp Methods toExp :: Set k -> Exp ( Sett k ()) Source #
Eq k => Eq ( Sett k ()) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods (==) :: Sett k () -> Sett k () -> Bool Source # (/=) :: Sett k () -> Sett k () -> Bool Source #
Show key => Show ( Sett key ()) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods showsPrec :: Int -> Sett key () -> ShowS Source # show :: Sett key () -> String Source # showList :: [ Sett key ()] -> ShowS Source #

class Embed concrete base | concrete -> base where Source #

Methods

toBase :: concrete -> base Source #

fromBase :: base -> concrete Source #

Instances

Instances details

Embed Bool Bool Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: Bool -> Bool Source # fromBase :: Bool -> Bool Source #
Ord k => Embed [(k, v)] ( List k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: [(k, v)] -> List k v Source # fromBase :: List k v -> [(k, v)] Source #
Embed ( Set k) ( Sett k ()) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: Set k -> Sett k () Source # fromBase :: Sett k () -> Set k Source #
Embed ( Map k v) ( Map k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: Map k v -> Map k v Source # fromBase :: Map k v -> Map k v Source #
Embed ( Single k v) ( Single k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: Single k v -> Single k v Source # fromBase :: Single k v -> Single k v Source #
Embed ( BiMap v k v) ( BiMap v k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: BiMap v k v -> BiMap v k v Source # fromBase :: BiMap v k v -> BiMap v k v Source #
Embed ( View coin cred pool ptr k v) ( View coin cred pool ptr k v) Source #
Instance details Defined in Control.Iterate.BaseTypes Methods toBase :: View coin cred pool ptr k v -> View coin cred pool ptr k v Source # fromBase :: View coin cred pool ptr k v -> View coin cred pool ptr k v Source #