Data.HashCons.WordMap

Documentation

data WordMap a

The main WordMap data type.

Instances

Generic (WordMap a)

Defined in Data.HashCons.WordMap.Internal

Associated Types

type Rep (WordMap a)

Defined in Data.HashCons.WordMap.Internal

type Rep (WordMap a) = D1 ('MetaData "WordMap" "Data.HashCons.WordMap.Internal" "hash-cons-0.2.0.0-inplace" 'False) (C1 ('MetaCons "Empty" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NonEmptyMap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HashCons (NonEmptyWordMap a)))))

Methods

from :: WordMap a -> Rep (WordMap a) x

to :: Rep (WordMap a) x -> WordMap a

Show a => Show (WordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

showsPrec :: Int -> WordMap a -> ShowS

show :: WordMap a -> String

showList :: [WordMap a] -> ShowS

Eq a => Eq (WordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

(==) :: WordMap a -> WordMap a -> Bool

(/=) :: WordMap a -> WordMap a -> Bool

Ord a => Ord (WordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

compare :: WordMap a -> WordMap a -> Ordering

(<) :: WordMap a -> WordMap a -> Bool

(<=) :: WordMap a -> WordMap a -> Bool

(>) :: WordMap a -> WordMap a -> Bool

(>=) :: WordMap a -> WordMap a -> Bool

max :: WordMap a -> WordMap a -> WordMap a

min :: WordMap a -> WordMap a -> WordMap a

Hashable a => Hashable (WordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

hashWithSalt :: Int -> WordMap a -> Int

hash :: WordMap a -> Int

type Rep (WordMap a)

Defined in Data.HashCons.WordMap.Internal

type Rep (WordMap a) = D1 ('MetaData "WordMap" "Data.HashCons.WordMap.Internal" "hash-cons-0.2.0.0-inplace" 'False) (C1 ('MetaCons "Empty" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NonEmptyMap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HashCons (NonEmptyWordMap a)))))

data NonEmptyWordMap a

Non-empty trie nodes.

Instances

Generic (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

Associated Types

type Rep (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

type Rep (NonEmptyWordMap a) = D1 ('MetaData "NonEmptyWordMap" "Data.HashCons.WordMap.Internal" "hash-cons-0.2.0.0-inplace" 'False) (C1 ('MetaCons "Leaf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Word) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Bin" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Word) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Word)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (WordMap a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (WordMap a)))))

Methods

from :: NonEmptyWordMap a -> Rep (NonEmptyWordMap a) x

to :: Rep (NonEmptyWordMap a) x -> NonEmptyWordMap a

Show a => Show (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

showsPrec :: Int -> NonEmptyWordMap a -> ShowS

show :: NonEmptyWordMap a -> String

showList :: [NonEmptyWordMap a] -> ShowS

Eq a => Eq (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

(==) :: NonEmptyWordMap a -> NonEmptyWordMap a -> Bool

(/=) :: NonEmptyWordMap a -> NonEmptyWordMap a -> Bool

Ord a => Ord (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

compare :: NonEmptyWordMap a -> NonEmptyWordMap a -> Ordering

(<) :: NonEmptyWordMap a -> NonEmptyWordMap a -> Bool

(<=) :: NonEmptyWordMap a -> NonEmptyWordMap a -> Bool

(>) :: NonEmptyWordMap a -> NonEmptyWordMap a -> Bool

(>=) :: NonEmptyWordMap a -> NonEmptyWordMap a -> Bool

max :: NonEmptyWordMap a -> NonEmptyWordMap a -> NonEmptyWordMap a

min :: NonEmptyWordMap a -> NonEmptyWordMap a -> NonEmptyWordMap a

Hashable a => Hashable (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

Methods

hashWithSalt :: Int -> NonEmptyWordMap a -> Int

hash :: NonEmptyWordMap a -> Int

type Rep (NonEmptyWordMap a)

Defined in Data.HashCons.WordMap.Internal

type Rep (NonEmptyWordMap a) = D1 ('MetaData "NonEmptyWordMap" "Data.HashCons.WordMap.Internal" "hash-cons-0.2.0.0-inplace" 'False) (C1 ('MetaCons "Leaf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Word) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Bin" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Word) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Word)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (WordMap a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (WordMap a)))))

empty :: WordMap a

O(1). Create an empty map.

singleton :: Hashable a => Word -> a -> WordMap a

O(1). Create a map with a single key-value pair.

singletonNonEmpty :: Hashable a => Word -> a -> NonEmptyWordMap a

O(1). Create a map with a single key-value pair.

insert :: Hashable a => Word -> a -> WordMap a -> WordMap a

O(log n). Insert a key-value pair into the map. If the key is already present, the value is replaced.

insertNonEmpty :: Hashable a => Word -> a -> NonEmptyWordMap a -> NonEmptyWordMap a

lookup :: Word -> WordMap a -> Maybe a

O(log n). Lookup the value at a key in the map.

lookupNonEmpty :: Word -> NonEmptyWordMap a -> Maybe a

map :: Hashable b => (a -> b) -> WordMap a -> WordMap b

O(n). Map a function over all values in the map.

mapNonEmpty :: Hashable b => (a -> b) -> NonEmptyWordMap a -> NonEmptyWordMap b

mapWithKey :: Hashable b => (Word -> a -> b) -> WordMap a -> WordMap b

O(n). Map a function over all key-value pairs in the map.

mapWithKeyNonEmpty :: Hashable b => (Word -> a -> b) -> NonEmptyWordMap a -> NonEmptyWordMap b

traverseWithKey :: (Applicative t, Hashable b) => (Word -> a -> t b) -> WordMap a -> t (WordMap b)

O(n). Traverse the map with a function that accesses keys.

traverseWithKeyNonEmpty :: (Applicative t, Hashable b) => (Word -> a -> t b) -> NonEmptyWordMap a -> t (NonEmptyWordMap b)

union :: Hashable a => WordMap a -> WordMap a -> WordMap a

O(n). The union of two maps. If a key occurs in both maps, the value from the left map is used.

unionNonEmpty :: Hashable a => NonEmptyWordMap a -> WordMap a -> NonEmptyWordMap a

intersection :: Hashable a => WordMap a -> WordMap a -> WordMap a

O(n). Intersection of two maps. Only keys present in both maps are included.

intersectionNonEmpty :: Hashable a => NonEmptyWordMap a -> WordMap a -> WordMap a

difference :: Hashable a => WordMap a -> WordMap a -> WordMap a

O(n). Difference of two maps. Keys in the first map but not in the second are included.

differenceNonEmpty :: Hashable a => NonEmptyWordMap a -> WordMap a -> WordMap a

member :: Word -> WordMap a -> Bool

Check if a key is present in the map.

memberNonEmpty :: Word -> NonEmptyWordMap a -> Bool