FRP.Euphoria.Internal.Maplike

Documentation

class Maplike c k where

A class for types with an API similar to that of Data.Map.

Minimal complete definition

union, intersection, difference, empty, lookup, toList, foldrWithKey

Methods

union :: c k v -> c k v -> c k v

intersection :: c k v -> c k v -> c k v

difference :: c k v -> c k v -> c k v

empty :: c k v

lookup :: k -> c k v -> Maybe v

singleton :: k -> v -> c k v

insert :: k -> v -> c k v -> c k v

delete :: k -> c k v -> c k v

toList :: c k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> c k v -> a

Instances

Ord k => Maplike (Strict Map) k

Methods

union :: Strict Map k v -> Strict Map k v -> Strict Map k v

intersection :: Strict Map k v -> Strict Map k v -> Strict Map k v

difference :: Strict Map k v -> Strict Map k v -> Strict Map k v

empty :: Strict Map k v

lookup :: k -> Strict Map k v -> Maybe v

singleton :: k -> v -> Strict Map k v

insert :: k -> v -> Strict Map k v -> Strict Map k v

delete :: k -> Strict Map k v -> Strict Map k v

toList :: Strict Map k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Strict Map k v -> a

Enum k => Maplike (Strict EnumMap) k

Methods

union :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v

intersection :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v

difference :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v

empty :: Strict EnumMap k v

lookup :: k -> Strict EnumMap k v -> Maybe v

singleton :: k -> v -> Strict EnumMap k v

insert :: k -> v -> Strict EnumMap k v -> Strict EnumMap k v

delete :: k -> Strict EnumMap k v -> Strict EnumMap k v

toList :: Strict EnumMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Strict EnumMap k v -> a

(Eq k, Hashable k) => Maplike (Strict HashMap) k

Methods

union :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v

intersection :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v

difference :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v

empty :: Strict HashMap k v

lookup :: k -> Strict HashMap k v -> Maybe v

singleton :: k -> v -> Strict HashMap k v

insert :: k -> v -> Strict HashMap k v -> Strict HashMap k v

delete :: k -> Strict HashMap k v -> Strict HashMap k v

toList :: Strict HashMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Strict HashMap k v -> a

Ord k => Maplike (Lazy Map) k

Methods

union :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v

intersection :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v

difference :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v

empty :: Lazy Map k v

lookup :: k -> Lazy Map k v -> Maybe v

singleton :: k -> v -> Lazy Map k v

insert :: k -> v -> Lazy Map k v -> Lazy Map k v

delete :: k -> Lazy Map k v -> Lazy Map k v

toList :: Lazy Map k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy Map k v -> a

Enum k => Maplike (Lazy EnumMap) k

Methods

union :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v

intersection :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v

difference :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v

empty :: Lazy EnumMap k v

lookup :: k -> Lazy EnumMap k v -> Maybe v

singleton :: k -> v -> Lazy EnumMap k v

insert :: k -> v -> Lazy EnumMap k v -> Lazy EnumMap k v

delete :: k -> Lazy EnumMap k v -> Lazy EnumMap k v

toList :: Lazy EnumMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy EnumMap k v -> a

(Eq k, Hashable k) => Maplike (Lazy HashMap) k

Methods

union :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v

intersection :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v

difference :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v

empty :: Lazy HashMap k v

lookup :: k -> Lazy HashMap k v -> Maybe v

singleton :: k -> v -> Lazy HashMap k v

insert :: k -> v -> Lazy HashMap k v -> Lazy HashMap k v

delete :: k -> Lazy HashMap k v -> Lazy HashMap k v

toList :: Lazy HashMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy HashMap k v -> a

newtype Lazy c k v

Constructors

Lazy (c k v)

Instances

Ord k => Maplike (Lazy Map) k

Methods

union :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v

intersection :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v

difference :: Lazy Map k v -> Lazy Map k v -> Lazy Map k v

empty :: Lazy Map k v

lookup :: k -> Lazy Map k v -> Maybe v

singleton :: k -> v -> Lazy Map k v

insert :: k -> v -> Lazy Map k v -> Lazy Map k v

delete :: k -> Lazy Map k v -> Lazy Map k v

toList :: Lazy Map k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy Map k v -> a

Enum k => Maplike (Lazy EnumMap) k

Methods

union :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v

intersection :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v

difference :: Lazy EnumMap k v -> Lazy EnumMap k v -> Lazy EnumMap k v

empty :: Lazy EnumMap k v

lookup :: k -> Lazy EnumMap k v -> Maybe v

singleton :: k -> v -> Lazy EnumMap k v

insert :: k -> v -> Lazy EnumMap k v -> Lazy EnumMap k v

delete :: k -> Lazy EnumMap k v -> Lazy EnumMap k v

toList :: Lazy EnumMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy EnumMap k v -> a

(Eq k, Hashable k) => Maplike (Lazy HashMap) k

Methods

union :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v

intersection :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v

difference :: Lazy HashMap k v -> Lazy HashMap k v -> Lazy HashMap k v

empty :: Lazy HashMap k v

lookup :: k -> Lazy HashMap k v -> Maybe v

singleton :: k -> v -> Lazy HashMap k v

insert :: k -> v -> Lazy HashMap k v -> Lazy HashMap k v

delete :: k -> Lazy HashMap k v -> Lazy HashMap k v

toList :: Lazy HashMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Lazy HashMap k v -> a

newtype Strict c k v

Constructors

Strict (c k v)

Instances

Ord k => Maplike (Strict Map) k

Methods

union :: Strict Map k v -> Strict Map k v -> Strict Map k v

intersection :: Strict Map k v -> Strict Map k v -> Strict Map k v

difference :: Strict Map k v -> Strict Map k v -> Strict Map k v

empty :: Strict Map k v

lookup :: k -> Strict Map k v -> Maybe v

singleton :: k -> v -> Strict Map k v

insert :: k -> v -> Strict Map k v -> Strict Map k v

delete :: k -> Strict Map k v -> Strict Map k v

toList :: Strict Map k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Strict Map k v -> a

Enum k => Maplike (Strict EnumMap) k

Methods

union :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v

intersection :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v

difference :: Strict EnumMap k v -> Strict EnumMap k v -> Strict EnumMap k v

empty :: Strict EnumMap k v

lookup :: k -> Strict EnumMap k v -> Maybe v

singleton :: k -> v -> Strict EnumMap k v

insert :: k -> v -> Strict EnumMap k v -> Strict EnumMap k v

delete :: k -> Strict EnumMap k v -> Strict EnumMap k v

toList :: Strict EnumMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Strict EnumMap k v -> a

(Eq k, Hashable k) => Maplike (Strict HashMap) k

Methods

union :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v

intersection :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v

difference :: Strict HashMap k v -> Strict HashMap k v -> Strict HashMap k v

empty :: Strict HashMap k v

lookup :: k -> Strict HashMap k v -> Maybe v

singleton :: k -> v -> Strict HashMap k v

insert :: k -> v -> Strict HashMap k v -> Strict HashMap k v

delete :: k -> Strict HashMap k v -> Strict HashMap k v

toList :: Strict HashMap k v -> [(k, v)]

foldrWithKey :: (k -> v -> a -> a) -> a -> Strict HashMap k v -> a