primitive-containers-0.4.1: containers backed by arrays

Data.Map.Subset.Lazy.Lifted

Synopsis

# Documentation

data Map k v Source #

Instances
 Functor (Map k) Source # Instance detailsDefined in Data.Map.Subset.Lazy.Internal Methodsfmap :: (a -> b) -> Map k a -> Map k b #(<\$) :: a -> Map k b -> Map k a # (Eq k, Eq v) => Eq (Map k v) Source # Instance detailsDefined in Data.Map.Subset.Lazy.Internal Methods(==) :: Map k v -> Map k v -> Bool #(/=) :: Map k v -> Map k v -> Bool # (Ord k, Ord v) => Ord (Map k v) Source # Instance detailsDefined in Data.Map.Subset.Lazy.Internal Methodscompare :: Map k v -> Map k v -> Ordering #(<) :: Map k v -> Map k v -> Bool #(<=) :: Map k v -> Map k v -> Bool #(>) :: Map k v -> Map k v -> Bool #(>=) :: Map k v -> Map k v -> Bool #max :: Map k v -> Map k v -> Map k v #min :: Map k v -> Map k v -> Map k v # (Show k, Show v) => Show (Map k v) Source # Instance detailsDefined in Data.Map.Subset.Lazy.Internal MethodsshowsPrec :: Int -> Map k v -> ShowS #show :: Map k v -> String #showList :: [Map k v] -> ShowS # (Semigroup v, Ord k) => Semigroup (Map k v) Source # Instance detailsDefined in Data.Map.Subset.Lazy.Internal Methods(<>) :: Map k v -> Map k v -> Map k v #sconcat :: NonEmpty (Map k v) -> Map k v #stimes :: Integral b => b -> Map k v -> Map k v # (Semigroup v, Ord k) => Monoid (Map k v) Source # Instance detailsDefined in Data.Map.Subset.Lazy.Internal Methodsmempty :: Map k v #mappend :: Map k v -> Map k v -> Map k v #mconcat :: [Map k v] -> Map k v #

empty :: Map k v Source #

# Singleton Subset Maps

singleton :: Set k -> v -> Map k v Source #

A subset map with a single set as its key.

Arguments

 :: Set k negative set -> v value -> Map k v

A subset map with a single negative set as its key. That is, a lookup into this map will only succeed if the needle set and the negative set do not overlap.

Arguments

 :: Map k Bool Map of required presences and absences -> v -> Map k v

Construct a singleton subset map by interpreting a Data.Map.Unlifted.Lifted.Map as requirements about what must be present and absent.

# Querying

lookup :: Ord k => Set k -> Map k v -> Maybe v Source #

# List Conversion

toList :: Map k v -> [(Set k, v)] Source #

fromList :: Ord k => [(Set k, v)] -> Map k v Source #