EdisonCore-1.3.2.1: A library of efficient, purely-functional data structures (Core Implementations)

CopyrightCopyright (c) 1998 2008 Chris Okasaki
LicenseMIT; see COPYRIGHT file for terms and conditions
Maintainerrobdockins AT fastmail DOT fm
Stabilitystable
PortabilityGHC, Hugs (MPTC and FD)
Safe HaskellNone
LanguageHaskell2010

Data.Edison.Assoc.AssocList

Contents

Description

This module implements finite maps as simple association lists.

Duplicates are removed conceptually, but not physically. The first occurrence of a given key is the one that is considered to be in the map.

The list type is mildly customized to prevent boxing the pairs.

Synopsis

Type of simple association lists

data FM k a Source #

Instances
Eq k => Functor (FM k) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

fmap :: (a -> b) -> FM k a -> FM k b

(<$) :: a -> FM k b -> FM k a

Eq k => AssocX (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

empty :: FM k a Source #

singleton :: k -> a -> FM k a Source #

fromSeq :: Sequence seq => seq (k, a) -> FM k a Source #

insert :: k -> a -> FM k a -> FM k a Source #

insertSeq :: Sequence seq => seq (k, a) -> FM k a -> FM k a Source #

union :: FM k a -> FM k a -> FM k a Source #

unionSeq :: Sequence seq => seq (FM k a) -> FM k a Source #

delete :: k -> FM k a -> FM k a Source #

deleteAll :: k -> FM k a -> FM k a Source #

deleteSeq :: Sequence seq => seq k -> FM k a -> FM k a Source #

null :: FM k a -> Bool Source #

size :: FM k a -> Int Source #

member :: k -> FM k a -> Bool Source #

count :: k -> FM k a -> Int Source #

lookup :: k -> FM k a -> a Source #

lookupM :: Monad rm => k -> FM k a -> rm a Source #

lookupAll :: Sequence seq => k -> FM k a -> seq a Source #

lookupAndDelete :: k -> FM k a -> (a, FM k a) Source #

lookupAndDeleteM :: Monad rm => k -> FM k a -> rm (a, FM k a) Source #

lookupAndDeleteAll :: Sequence seq => k -> FM k a -> (seq a, FM k a) Source #

lookupWithDefault :: a -> k -> FM k a -> a Source #

adjust :: (a -> a) -> k -> FM k a -> FM k a Source #

adjustAll :: (a -> a) -> k -> FM k a -> FM k a Source #

adjustOrInsert :: (a -> a) -> a -> k -> FM k a -> FM k a Source #

adjustAllOrInsert :: (a -> a) -> a -> k -> FM k a -> FM k a Source #

adjustOrDelete :: (a -> Maybe a) -> k -> FM k a -> FM k a Source #

adjustOrDeleteAll :: (a -> Maybe a) -> k -> FM k a -> FM k a Source #

fold :: (a -> b -> b) -> b -> FM k a -> b Source #

fold' :: (a -> b -> b) -> b -> FM k a -> b Source #

fold1 :: (a -> a -> a) -> FM k a -> a Source #

fold1' :: (a -> a -> a) -> FM k a -> a Source #

filter :: (a -> Bool) -> FM k a -> FM k a Source #

partition :: (a -> Bool) -> FM k a -> (FM k a, FM k a) Source #

elements :: Sequence seq => FM k a -> seq a Source #

strict :: FM k a -> FM k a Source #

strictWith :: (a -> b) -> FM k a -> FM k a Source #

structuralInvariant :: FM k a -> Bool Source #

instanceName :: FM k a -> String Source #

Ord k => OrdAssocX (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

minView :: Monad rm => FM k a -> rm (a, FM k a) Source #

minElem :: FM k a -> a Source #

deleteMin :: FM k a -> FM k a Source #

unsafeInsertMin :: k -> a -> FM k a -> FM k a Source #

maxView :: Monad rm => FM k a -> rm (a, FM k a) Source #

maxElem :: FM k a -> a Source #

deleteMax :: FM k a -> FM k a Source #

unsafeInsertMax :: k -> a -> FM k a -> FM k a Source #

foldr :: (a -> b -> b) -> b -> FM k a -> b Source #

foldr' :: (a -> b -> b) -> b -> FM k a -> b Source #

foldl :: (b -> a -> b) -> b -> FM k a -> b Source #

foldl' :: (b -> a -> b) -> b -> FM k a -> b Source #

foldr1 :: (a -> a -> a) -> FM k a -> a Source #

foldr1' :: (a -> a -> a) -> FM k a -> a Source #

foldl1 :: (a -> a -> a) -> FM k a -> a Source #

foldl1' :: (a -> a -> a) -> FM k a -> a Source #

unsafeFromOrdSeq :: Sequence seq => seq (k, a) -> FM k a Source #

unsafeAppend :: FM k a -> FM k a -> FM k a Source #

filterLT :: k -> FM k a -> FM k a Source #

filterLE :: k -> FM k a -> FM k a Source #

filterGT :: k -> FM k a -> FM k a Source #

filterGE :: k -> FM k a -> FM k a Source #

partitionLT_GE :: k -> FM k a -> (FM k a, FM k a) Source #

partitionLE_GT :: k -> FM k a -> (FM k a, FM k a) Source #

partitionLT_GT :: k -> FM k a -> (FM k a, FM k a) Source #

Eq k => FiniteMapX (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

fromSeqWith :: Sequence seq => (a -> a -> a) -> seq (k, a) -> FM k a Source #

fromSeqWithKey :: Sequence seq => (k -> a -> a -> a) -> seq (k, a) -> FM k a Source #

insertWith :: (a -> a -> a) -> k -> a -> FM k a -> FM k a Source #

insertWithKey :: (k -> a -> a -> a) -> k -> a -> FM k a -> FM k a Source #

insertSeqWith :: Sequence seq => (a -> a -> a) -> seq (k, a) -> FM k a -> FM k a Source #

insertSeqWithKey :: Sequence seq => (k -> a -> a -> a) -> seq (k, a) -> FM k a -> FM k a Source #

unionl :: FM k a -> FM k a -> FM k a Source #

unionr :: FM k a -> FM k a -> FM k a Source #

unionWith :: (a -> a -> a) -> FM k a -> FM k a -> FM k a Source #

unionSeqWith :: Sequence seq => (a -> a -> a) -> seq (FM k a) -> FM k a Source #

intersectionWith :: (a -> b -> c) -> FM k a -> FM k b -> FM k c Source #

difference :: FM k a -> FM k b -> FM k a Source #

properSubset :: FM k a -> FM k b -> Bool Source #

subset :: FM k a -> FM k b -> Bool Source #

submapBy :: (a -> a -> Bool) -> FM k a -> FM k a -> Bool Source #

properSubmapBy :: (a -> a -> Bool) -> FM k a -> FM k a -> Bool Source #

sameMapBy :: (a -> a -> Bool) -> FM k a -> FM k a -> Bool Source #

Ord k => OrdFiniteMapX (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Eq k => Assoc (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

toSeq :: Sequence seq => FM k a -> seq (k, a) Source #

keys :: Sequence seq => FM k a -> seq k Source #

mapWithKey :: (k -> a -> b) -> FM k a -> FM k b Source #

foldWithKey :: (k -> a -> b -> b) -> b -> FM k a -> b Source #

foldWithKey' :: (k -> a -> b -> b) -> b -> FM k a -> b Source #

filterWithKey :: (k -> a -> Bool) -> FM k a -> FM k a Source #

partitionWithKey :: (k -> a -> Bool) -> FM k a -> (FM k a, FM k a) Source #

Ord k => OrdAssoc (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

minViewWithKey :: Monad rm => FM k a -> rm ((k, a), FM k a) Source #

minElemWithKey :: FM k a -> (k, a) Source #

maxViewWithKey :: Monad rm => FM k a -> rm ((k, a), FM k a) Source #

maxElemWithKey :: FM k a -> (k, a) Source #

foldrWithKey :: (k -> a -> b -> b) -> b -> FM k a -> b Source #

foldrWithKey' :: (k -> a -> b -> b) -> b -> FM k a -> b Source #

foldlWithKey :: (b -> k -> a -> b) -> b -> FM k a -> b Source #

foldlWithKey' :: (b -> k -> a -> b) -> b -> FM k a -> b Source #

toOrdSeq :: Sequence seq => FM k a -> seq (k, a) Source #

Eq k => FiniteMap (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

unionWithKey :: (k -> a -> a -> a) -> FM k a -> FM k a -> FM k a Source #

unionSeqWithKey :: Sequence seq => (k -> a -> a -> a) -> seq (FM k a) -> FM k a Source #

intersectionWithKey :: (k -> a -> b -> c) -> FM k a -> FM k b -> FM k c Source #

Ord k => OrdFiniteMap (FM k) k Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

(Eq k, Eq a) => Eq (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

(==) :: FM k a -> FM k a -> Bool

(/=) :: FM k a -> FM k a -> Bool

(Ord k, Ord a) => Ord (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

compare :: FM k a -> FM k a -> Ordering

(<) :: FM k a -> FM k a -> Bool

(<=) :: FM k a -> FM k a -> Bool

(>) :: FM k a -> FM k a -> Bool

(>=) :: FM k a -> FM k a -> Bool

max :: FM k a -> FM k a -> FM k a

min :: FM k a -> FM k a -> FM k a

(Eq k, Read k, Read a) => Read (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

readsPrec :: Int -> ReadS (FM k a)

readList :: ReadS [FM k a]

readPrec :: ReadPrec (FM k a)

readListPrec :: ReadPrec [FM k a]

(Eq k, Show k, Show a) => Show (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

showsPrec :: Int -> FM k a -> ShowS

show :: FM k a -> String

showList :: [FM k a] -> ShowS

Eq k => Semigroup (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

(<>) :: FM k a -> FM k a -> FM k a

sconcat :: NonEmpty (FM k a) -> FM k a

stimes :: Integral b => b -> FM k a -> FM k a

Eq k => Monoid (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

mempty :: FM k a

mappend :: FM k a -> FM k a -> FM k a

mconcat :: [FM k a] -> FM k a

(Eq k, Arbitrary k, Arbitrary a) => Arbitrary (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

arbitrary :: Gen (FM k a)

shrink :: FM k a -> [FM k a]

(Eq k, CoArbitrary k, CoArbitrary a) => CoArbitrary (FM k a) Source # 
Instance details

Defined in Data.Edison.Assoc.AssocList

Methods

coarbitrary :: FM k a -> Gen b -> Gen b

AssocX operations

empty :: Eq k => FM k a Source #

singleton :: Eq k => k -> a -> FM k a Source #

fromSeq :: (Eq k, Sequence seq) => seq (k, a) -> FM k a Source #

insert :: Eq k => k -> a -> FM k a -> FM k a Source #

insertSeq :: (Eq k, Sequence seq) => seq (k, a) -> FM k a -> FM k a Source #

union :: Eq k => FM k a -> FM k a -> FM k a Source #

unionSeq :: (Eq k, Sequence seq) => seq (FM k a) -> FM k a Source #

delete :: Eq k => k -> FM k a -> FM k a Source #

deleteAll :: Eq k => k -> FM k a -> FM k a Source #

deleteSeq :: (Eq k, Sequence seq) => seq k -> FM k a -> FM k a Source #

null :: Eq k => FM k a -> Bool Source #

size :: Eq k => FM k a -> Int Source #

member :: Eq k => k -> FM k a -> Bool Source #

count :: Eq k => k -> FM k a -> Int Source #

lookup :: Eq k => k -> FM k a -> a Source #

lookupM :: (Eq k, Monad rm) => k -> FM k a -> rm a Source #

lookupAll :: (Eq k, Sequence seq) => k -> FM k a -> seq a Source #

lookupAndDelete :: Eq k => k -> FM k a -> (a, FM k a) Source #

lookupAndDeleteM :: (Eq k, Monad rm) => k -> FM k a -> rm (a, FM k a) Source #

lookupAndDeleteAll :: (Eq k, Sequence seq) => k -> FM k a -> (seq a, FM k a) Source #

lookupWithDefault :: Eq k => a -> k -> FM k a -> a Source #

adjust :: Eq k => (a -> a) -> k -> FM k a -> FM k a Source #

adjustAll :: Eq k => (a -> a) -> k -> FM k a -> FM k a Source #

adjustOrInsert :: Eq k => (a -> a) -> a -> k -> FM k a -> FM k a Source #

adjustAllOrInsert :: Eq k => (a -> a) -> a -> k -> FM k a -> FM k a Source #

adjustOrDelete :: Eq k => (a -> Maybe a) -> k -> FM k a -> FM k a Source #

adjustOrDeleteAll :: Eq k => (a -> Maybe a) -> k -> FM k a -> FM k a Source #

strict :: FM k a -> FM k a Source #

strictWith :: (a -> b) -> FM k a -> FM k a Source #

map :: Eq k => (a -> b) -> FM k a -> FM k b Source #

fold :: Eq k => (a -> b -> b) -> b -> FM k a -> b Source #

fold' :: Eq k => (a -> b -> b) -> b -> FM k a -> b Source #

fold1 :: Eq k => (a -> a -> a) -> FM k a -> a Source #

fold1' :: Eq k => (a -> a -> a) -> FM k a -> a Source #

filter :: Eq k => (a -> Bool) -> FM k a -> FM k a Source #

partition :: Eq k => (a -> Bool) -> FM k a -> (FM k a, FM k a) Source #

elements :: (Eq k, Sequence seq) => FM k a -> seq a Source #

structuralInvariant :: Eq k => FM k a -> Bool Source #

OrdAssocX operations

minView :: (Ord k, Monad m) => FM k a -> m (a, FM k a) Source #

minElem :: Ord k => FM k a -> a Source #

deleteMin :: Ord k => FM k a -> FM k a Source #

unsafeInsertMin :: Ord k => k -> a -> FM k a -> FM k a Source #

maxView :: (Ord k, Monad m) => FM k a -> m (a, FM k a) Source #

maxElem :: Ord k => FM k a -> a Source #

deleteMax :: Ord k => FM k a -> FM k a Source #

unsafeInsertMax :: Ord k => k -> a -> FM k a -> FM k a Source #

foldr :: Ord k => (a -> b -> b) -> b -> FM k a -> b Source #

foldr' :: Ord k => (a -> b -> b) -> b -> FM k a -> b Source #

foldl :: Ord k => (b -> a -> b) -> b -> FM k a -> b Source #

foldl' :: Ord k => (b -> a -> b) -> b -> FM k a -> b Source #

foldr1 :: Ord k => (a -> a -> a) -> FM k a -> a Source #

foldr1' :: Ord k => (a -> a -> a) -> FM k a -> a Source #

foldl1 :: Ord k => (a -> a -> a) -> FM k a -> a Source #

foldl1' :: Ord k => (a -> a -> a) -> FM k a -> a Source #

unsafeFromOrdSeq :: (Ord k, Sequence seq) => seq (k, a) -> FM k a Source #

unsafeAppend :: Ord k => FM k a -> FM k a -> FM k a Source #

filterLT :: Ord k => k -> FM k a -> FM k a Source #

filterLE :: Ord k => k -> FM k a -> FM k a Source #

filterGT :: Ord k => k -> FM k a -> FM k a Source #

filterGE :: Ord k => k -> FM k a -> FM k a Source #

partitionLT_GE :: Ord k => k -> FM k a -> (FM k a, FM k a) Source #

partitionLE_GT :: Ord k => k -> FM k a -> (FM k a, FM k a) Source #

partitionLT_GT :: Ord k => k -> FM k a -> (FM k a, FM k a) Source #

Assoc operations

toSeq :: (Eq k, Sequence seq) => FM k a -> seq (k, a) Source #

keys :: (Eq k, Sequence seq) => FM k a -> seq k Source #

mapWithKey :: Eq k => (k -> a -> b) -> FM k a -> FM k b Source #

foldWithKey :: Eq k => (k -> a -> b -> b) -> b -> FM k a -> b Source #

foldWithKey' :: Eq k => (k -> a -> b -> b) -> b -> FM k a -> b Source #

filterWithKey :: Eq k => (k -> a -> Bool) -> FM k a -> FM k a Source #

partitionWithKey :: Eq k => (k -> a -> Bool) -> FM k a -> (FM k a, FM k a) Source #

OrdAssoc operations

minViewWithKey :: (Ord k, Monad m) => FM k a -> m ((k, a), FM k a) Source #

minElemWithKey :: Ord k => FM k a -> (k, a) Source #

maxViewWithKey :: (Ord k, Monad m) => FM k a -> m ((k, a), FM k a) Source #

maxElemWithKey :: Ord k => FM k a -> (k, a) Source #

foldrWithKey :: Ord k => (k -> a -> b -> b) -> b -> FM k a -> b Source #

foldrWithKey' :: Ord k => (k -> a -> b -> b) -> b -> FM k a -> b Source #

foldlWithKey :: Ord k => (b -> k -> a -> b) -> b -> FM k a -> b Source #

foldlWithKey' :: Ord k => (b -> k -> a -> b) -> b -> FM k a -> b Source #

toOrdSeq :: (Ord k, Sequence seq) => FM k a -> seq (k, a) Source #

FiniteMapX operations

fromSeqWith :: (Eq k, Sequence seq) => (a -> a -> a) -> seq (k, a) -> FM k a Source #

fromSeqWithKey :: (Eq k, Sequence seq) => (k -> a -> a -> a) -> seq (k, a) -> FM k a Source #

insertWith :: Eq k => (a -> a -> a) -> k -> a -> FM k a -> FM k a Source #

insertWithKey :: Eq k => (k -> a -> a -> a) -> k -> a -> FM k a -> FM k a Source #

insertSeqWith :: (Eq k, Sequence seq) => (a -> a -> a) -> seq (k, a) -> FM k a -> FM k a Source #

insertSeqWithKey :: (Eq k, Sequence seq) => (k -> a -> a -> a) -> seq (k, a) -> FM k a -> FM k a Source #

unionl :: Eq k => FM k a -> FM k a -> FM k a Source #

unionr :: Eq k => FM k a -> FM k a -> FM k a Source #

unionWith :: Eq k => (a -> a -> a) -> FM k a -> FM k a -> FM k a Source #

unionSeqWith :: (Eq k, Sequence seq) => (a -> a -> a) -> seq (FM k a) -> FM k a Source #

intersectionWith :: Eq k => (a -> b -> c) -> FM k a -> FM k b -> FM k c Source #

difference :: Eq k => FM k a -> FM k b -> FM k a Source #

properSubset :: Eq k => FM k a -> FM k b -> Bool Source #

subset :: Eq k => FM k a -> FM k b -> Bool Source #

properSubmapBy :: Eq k => (a -> a -> Bool) -> FM k a -> FM k a -> Bool Source #

submapBy :: Eq k => (a -> a -> Bool) -> FM k a -> FM k a -> Bool Source #

sameMapBy :: Eq k => (a -> a -> Bool) -> FM k a -> FM k a -> Bool Source #

properSubmap :: (Eq k, Eq a) => FM k a -> FM k a -> Bool Source #

submap :: (Eq k, Eq a) => FM k a -> FM k a -> Bool Source #

sameMap :: (Eq k, Eq a) => FM k a -> FM k a -> Bool Source #

FiniteMap operations

unionWithKey :: Eq k => (k -> a -> a -> a) -> FM k a -> FM k a -> FM k a Source #

unionSeqWithKey :: (Eq k, Sequence seq) => (k -> a -> a -> a) -> seq (FM k a) -> FM k a Source #

intersectionWithKey :: Eq k => (k -> a -> b -> c) -> FM k a -> FM k b -> FM k c Source #

Documentation

moduleName :: String Source #