Safe Haskell	None
Language	Haskell2010

Data.BiMap

Synopsis

data BiMap v a b where
- MkBiMap :: v ~ b => !( Map a b) -> !( Map b ( Set a)) -> BiMap v a b
biMapToMap :: BiMap v a b -> Map a b
biMapFromMap :: ( Ord k, Ord v) => Map k v -> BiMap v k v
decodeMapAsBimap :: ( FromCBOR a, FromCBOR b, Ord a, Ord b) => Decoder s ( BiMap b a b)
addBack :: ( Ord v, Ord k) => v -> k -> Map v ( Set k) -> Map v ( Set k)
retract :: ( Ord v, Ord k) => v -> k -> Map v ( Set k) -> Map v ( Set k)
insertBackwards :: ( Ord k, Ord v) => v -> v -> k -> Map v ( Set k) -> Map v ( Set k)
insertWithBiMap :: ( Ord k, Ord v) => (v -> v -> v) -> k -> v -> BiMap v k v -> BiMap v k v
biMapEmpty :: BiMap v k v
biMapFromList :: ( Ord k, Ord v) => (v -> v -> v) -> [(k, v)] -> BiMap v k v
mapflip :: (v -> v -> v) -> v -> v -> v
biMapFromAscDistinctList :: ( Ord k, Ord v) => [(k, v)] -> BiMap v k v
type Bimap k v = BiMap v k v
removeval :: ( Ord k, Ord v) => v -> BiMap v k v -> BiMap v k v

Documentation

data BiMap v a b where Source #

Constructors

MkBiMap :: v ~ b => !( Map a b) -> !( Map b ( Set a)) -> BiMap v a b

Instances

Instances details

( Eq k, Eq v) => Eq ( BiMap u k v) Source #
Instance details Defined in Data.BiMap Methods (==) :: BiMap u k v -> BiMap u k v -> Bool Source # (/=) :: BiMap u k v -> BiMap u k v -> Bool Source #
( Show k, Show v) => Show ( BiMap u k v) Source #
Instance details Defined in Data.BiMap Methods showsPrec :: Int -> BiMap u k v -> ShowS Source # show :: BiMap u k v -> String Source # showList :: [ BiMap u k v] -> ShowS Source #
( Ord a, Ord b, ToCBOR a, ToCBOR b) => ToCBOR ( BiMap b a b) Source #
Instance details Defined in Data.BiMap Methods toCBOR :: BiMap b a b -> Encoding Source # encodedSizeExpr :: ( forall t. ToCBOR t => Proxy t -> Size ) -> Proxy ( BiMap b a b) -> Size Source # encodedListSizeExpr :: ( forall t. ToCBOR t => Proxy t -> Size ) -> Proxy [ BiMap b a b] -> Size Source #
( Ord a, Ord b, FromCBOR a, FromCBOR b) => FromCBOR ( BiMap b a b) Source #
Instance details Defined in Data.BiMap Methods fromCBOR :: Decoder s ( BiMap b a b) Source # label :: Proxy ( BiMap b a b) -> Text Source #
NFData ( BiMap v a b) Source #
Instance details Defined in Data.BiMap Methods rnf :: BiMap v a b -> () Source #
( NoThunks a, NoThunks b) => NoThunks ( BiMap v a b) Source #
Instance details Defined in Data.BiMap Methods noThunks :: Context -> BiMap v a b -> IO ( Maybe ThunkInfo ) Source # wNoThunks :: Context -> BiMap v a b -> IO ( Maybe ThunkInfo ) Source # showTypeOf :: Proxy ( BiMap v a b) -> String Source #
( Ord a, Ord b, FromCBOR a, FromCBOR b) => FromSharedCBOR ( BiMap b a b) Source #
Instance details Defined in Data.Sharing Associated Types type Share ( BiMap b a b) Source # Methods getShare :: BiMap b a b -> Share ( BiMap b a b) Source # fromSharedCBOR :: Share ( BiMap b a b) -> Decoder s ( BiMap b a b) Source # fromSharedPlusCBOR :: StateT ( Share ( BiMap b a b)) ( Decoder s) ( BiMap b a b) Source #
type Share ( BiMap b a b) Source #
Instance details Defined in Data.Sharing type Share ( BiMap b a b) = ( Interns a, Interns b)

biMapToMap :: BiMap v a b -> Map a b Source #

biMapFromMap :: ( Ord k, Ord v) => Map k v -> BiMap v k v Source #

decodeMapAsBimap :: ( FromCBOR a, FromCBOR b, Ord a, Ord b) => Decoder s ( BiMap b a b) Source #

Decode a serialised CBOR Map as a Bimap

addBack :: ( Ord v, Ord k) => v -> k -> Map v ( Set k) -> Map v ( Set k) Source #

retract :: ( Ord v, Ord k) => v -> k -> Map v ( Set k) -> Map v ( Set k) Source #

insertBackwards :: ( Ord k, Ord v) => v -> v -> k -> Map v ( Set k) -> Map v ( Set k) Source #

insertWithBiMap :: ( Ord k, Ord v) => (v -> v -> v) -> k -> v -> BiMap v k v -> BiMap v k v Source #

biMapEmpty :: BiMap v k v Source #

biMapFromList :: ( Ord k, Ord v) => (v -> v -> v) -> [(k, v)] -> BiMap v k v Source #

mapflip :: (v -> v -> v) -> v -> v -> v Source #

biMapFromAscDistinctList :: ( Ord k, Ord v) => [(k, v)] -> BiMap v k v Source #

Warning - invariant that keys are distinct and in ascending order is not checked. Make sure it is not violated, otherwise crazy things will happen.

type Bimap k v = BiMap v k v Source #

removeval :: ( Ord k, Ord v) => v -> BiMap v k v -> BiMap v k v Source #