Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. module Data.Bimap

   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.

2. data Bimap a b

   bimap	Data.Bimap

   A bidirectional map between values of types a and b.

3. toMap :: Bimap a b -> Map a b

   bimap	Data.Bimap

   O(1). Extract only the left-to-right component of a bimap. Version: 0.2.1

4. toMapR :: Bimap a b -> Map b a

   bimap	Data.Bimap

   O(1). Extract only the right-to-left component of a bimap. Version: 0.2.1

5. package enummapset

   IntMap and IntSet with Enum keys/elements. This package contains simple wrappers around Data.IntMap and Data.IntSet with Enum keys and elements respectively. Especially useful for Ints wrapped with `newtype`.

6. module Data.EnumMap

   No documentation available.

7. data EnumMap k a

   enummapset	Data.EnumMap.Lazy

   Wrapper for IntMap with Enum keys.

8. enumMapToIntMap :: EnumMap k a -> IntMap a

   enummapset	Data.EnumMap.Lazy

   Unwrap IntMap.

9. intMapToEnumMap :: IntMap a -> EnumMap k a

   enummapset	Data.EnumMap.Lazy

   Wrap IntMap.

10. isProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool

    enummapset	Data.EnumMap.Lazy

    No documentation available.

Page 563 of many | Previous | Next