CHR.Data.Lookup.Stacked

Lookups combined into stack of lookups, allowing combined lookup coupled with updates on top of stack only

Documentation

class Stacked stk where

Functionality on top of Lookup for awareness of a scope. Minimal definition lifts, 'unlifts,', 'top'/'topM', 'pop'/'popM', 'push'/'pushM'

Minimal complete definition

lifts, unlifts

Methods

lifts :: StackedElt stk -> stk

unlifts :: stk -> [StackedElt stk]

top :: stk -> StackedElt stk

pop :: stk -> (StackedElt stk, stk)

push :: StackedElt stk -> stk -> stk

topM :: MonadState stk m => m (StackedElt stk)

popM :: MonadState stk m => m (StackedElt stk)

pushM :: MonadState stk m => StackedElt stk -> m ()

tops :: stk -> stk

pops :: stk -> (stk, stk)

pushs

Arguments

:: stk

-> stk

-> stk

push, but only top of first arg

topsM :: MonadState stk m => m stk

popsM :: MonadState stk m => m stk

pushsM :: MonadState stk m => stk -> m ()

Instances

Stacked (Stacks lkup)

Defined in CHR.Data.Lookup.Stacked

Methods

lifts :: StackedElt (Stacks lkup) -> Stacks lkup

unlifts :: Stacks lkup -> [StackedElt (Stacks lkup)]

top :: Stacks lkup -> StackedElt (Stacks lkup)

pop :: Stacks lkup -> (StackedElt (Stacks lkup), Stacks lkup)

push :: StackedElt (Stacks lkup) -> Stacks lkup -> Stacks lkup

topM :: MonadState (Stacks lkup) m => m (StackedElt (Stacks lkup))

popM :: MonadState (Stacks lkup) m => m (StackedElt (Stacks lkup))

pushM :: MonadState (Stacks lkup) m => StackedElt (Stacks lkup) -> m ()

tops :: Stacks lkup -> Stacks lkup

pops :: Stacks lkup -> (Stacks lkup, Stacks lkup)

pushs :: Stacks lkup -> Stacks lkup -> Stacks lkup

topsM :: MonadState (Stacks lkup) m => m (Stacks lkup)

popsM :: MonadState (Stacks lkup) m => m (Stacks lkup)

pushsM :: MonadState (Stacks lkup) m => Stacks lkup -> m ()

type family StackedElt stk :: *

Instances

type StackedElt (Stacks e)

Defined in CHR.Data.Lookup.Stacked

type StackedElt (Stacks e) = e

type StackedElt (StackedVarLookup s)

Defined in CHR.Data.VarLookup

type StackedElt (StackedVarLookup s) = s

newtype Stacks l

Stacked Lookup derived from a base one, to allow a use of multiple lookups but update on top only

Constructors

Stacks

Fields

• unStacks :: [l]

Instances

Functor Stacks

Defined in CHR.Data.Lookup.Stacked

Methods

fmap :: (a -> b) -> Stacks a -> Stacks b

(<$) :: a -> Stacks b -> Stacks a

Applicative Stacks

Defined in CHR.Data.Lookup.Stacked

Methods

pure :: a -> Stacks a

(<*>) :: Stacks (a -> b) -> Stacks a -> Stacks b

liftA2 :: (a -> b -> c) -> Stacks a -> Stacks b -> Stacks c

(*>) :: Stacks a -> Stacks b -> Stacks b

(<*) :: Stacks a -> Stacks b -> Stacks a

LookupApply l1 l2 => LookupApply l1 (Stacks l2)

Defined in CHR.Data.Lookup.Stacked

Methods

apply :: l1 -> Stacks l2 -> Stacks l2

Show (Stacks s)

Defined in CHR.Data.Lookup.Stacked

Methods

showsPrec :: Int -> Stacks s -> ShowS

show :: Stacks s -> String

showList :: [Stacks s] -> ShowS

PP s => PP (Stacks s)

Defined in CHR.Data.Lookup.Stacked

Methods

pp :: Stacks s -> PP_Doc

ppList :: [Stacks s] -> PP_Doc

Stacked (Stacks lkup)

Defined in CHR.Data.Lookup.Stacked

Methods

lifts :: StackedElt (Stacks lkup) -> Stacks lkup

unlifts :: Stacks lkup -> [StackedElt (Stacks lkup)]

top :: Stacks lkup -> StackedElt (Stacks lkup)

pop :: Stacks lkup -> (StackedElt (Stacks lkup), Stacks lkup)

push :: StackedElt (Stacks lkup) -> Stacks lkup -> Stacks lkup

topM :: MonadState (Stacks lkup) m => m (StackedElt (Stacks lkup))

popM :: MonadState (Stacks lkup) m => m (StackedElt (Stacks lkup))

pushM :: MonadState (Stacks lkup) m => StackedElt (Stacks lkup) -> m ()

tops :: Stacks lkup -> Stacks lkup

pops :: Stacks lkup -> (Stacks lkup, Stacks lkup)

pushs :: Stacks lkup -> Stacks lkup -> Stacks lkup

topsM :: MonadState (Stacks lkup) m => m (Stacks lkup)

popsM :: MonadState (Stacks lkup) m => m (Stacks lkup)

pushsM :: MonadState (Stacks lkup) m => Stacks lkup -> m ()

Lookup lkup k v => Lookup (Stacks lkup) k v

Defined in CHR.Data.Lookup.Stacked

Methods

lookup :: k -> Stacks lkup -> Maybe v

fromList :: [(k, v)] -> Stacks lkup

toList :: Stacks lkup -> [(k, v)]

null :: Stacks lkup -> Bool

size :: Stacks lkup -> Int

alter :: (Maybe v -> Maybe v) -> k -> Stacks lkup -> Stacks lkup

singleton :: k -> v -> Stacks lkup

empty :: Stacks lkup

insertWith :: (v -> v -> v) -> k -> v -> Stacks lkup -> Stacks lkup

insert :: k -> v -> Stacks lkup -> Stacks lkup

unionWith :: (v -> v -> v) -> Stacks lkup -> Stacks lkup -> Stacks lkup

union :: Stacks lkup -> Stacks lkup -> Stacks lkup

unionsWith :: (v -> v -> v) -> [Stacks lkup] -> Stacks lkup

unions :: [Stacks lkup] -> Stacks lkup

delete :: k -> Stacks lkup -> Stacks lkup

keys :: Stacks lkup -> [k]

keysSet :: Stacks lkup -> Set k

elems :: Stacks lkup -> [v]

map :: (v -> v) -> Stacks lkup -> Stacks lkup

type StackedElt (Stacks e)

Defined in CHR.Data.Lookup.Stacked

type StackedElt (Stacks e) = e

type StackedElt (StackedVarLookup s)

Defined in CHR.Data.VarLookup

type StackedElt (StackedVarLookup s) = s

type VarLookupVal (StackedVarLookup s)

Defined in CHR.Data.VarLookup

type VarLookupVal (StackedVarLookup s) = VarLookupVal s

type VarLookupKey (StackedVarLookup s)

Defined in CHR.Data.VarLookup

type VarLookupKey (StackedVarLookup s) = VarLookupKey s