happstack-ixset-0.3.2: Efficient relational queries on Haskell sets. Source code Contents Index

Happstack.Data.IxSet.Ix

Synopsis

data Ix a = IxDefault | forall key . (Typeable key, Ord key) => Ix (Map key (Set a)) con_Ix_Data :: Constr ixType_Data :: DataType ixDefaultConstr :: Constr ixConstr :: Constr ixDataType :: DataType insert :: (Ord a, Ord k) => k -> a -> Map k (Set a) -> Map k (Set a) delete :: (Ord a, Ord k) => k -> a -> Map k (Set a) -> Map k (Set a)

Documentation

data Ix a Source

Constructors IxDefault forall key . (Typeable key, Ord key) => Ix (Map key (Set a)) Instances Typeable1 Ix (Data ctx a, Sat (ctx (Ix a))) => Data ctx (Ix a) Data a => Data (Ix a) Default a => Default (Ix a)

con_Ix_Data :: Constr Source

ixType_Data :: DataType Source

ixDefaultConstr :: Constr Source

ixConstr :: Constr Source

ixDataType :: DataType Source

insert :: (Ord a, Ord k) => k -> a -> Map k (Set a) -> Map k (Set a) Source

Convenience function for inserting into Maps of Sets as in the case of an Ix. If they key did not already exist in the Map, then a new Set is added transparently.

delete :: (Ord a, Ord k) => k -> a -> Map k (Set a) -> Map k (Set a) Source

Convenience function for deleting from Maps of Sets If the resulting Set is empty, then the entry is removed from the Map

Produced by Haddock version 2.4.2