map -package:Cabal-syntax -package:base -package:ghc -package:containers package:bimap -is:package
O(n*log n) Map a function over all the left keys in the map.
Version 0.3
O(n). Map a strictly increasing function over all left keys in
the map. The precondition is not checked. Version 0.3
O(n). Map a strictly increasing function over all right keys in
the map. The precondition is not checked. Version 0.3
O(n*log n) Map a function over all the right keys in the map.
Version 0.3
An implementation of bidirectional maps between values of two key
types. A
Bimap is essentially a bijection between subsets of
its two argument types.
Each element of the left-hand type is associated with an element of
the right-hand type, and vice-versa, such that the two mappings are
inverses. Deleting an element will cause its twin to be deleted, and
inserting a pair of elements will cause any overlapping bindings to be
deleted.
Most functions implicitly consider the left-hand type to be the key,
and the right-hand type to be the value. Functions with an
R
suffix reverse this convention, treating the right-hand type as the
key and the left-hand type as the value.
A bidirectional map between values of types a and b.
O(1). Extract only the left-to-right component of a bimap.
Version: 0.2.1
O(1). Extract only the right-to-left component of a bimap.
Version: 0.2.1