Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  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. ixmapP :: (Ix i, Ix i', IArray a e, IArray a' e) => (i', i') -> (i' -> i) -> a i e -> a' i' e

    carray Data.Array.CArray

    More polymorphic version of ixmap.

  6. ixmapWith :: (Ix i, Ix i', IArray a e, IArray a e') => (i', i') -> (i' -> i) -> (e -> e') -> a i e -> a i' e'

    carray Data.Array.CArray

    Less polymorphic version.

  7. ixmapWithInd :: (Ix i, Ix i', IArray a e, IArray a e') => (i', i') -> (i' -> i) -> (i -> e -> i' -> e') -> a i e -> a i' e'

    carray Data.Array.CArray

    Less polymorphic version.

  8. ixmapWithIndP :: (Ix i, Ix i', IArray a e, IArray a' e') => (i', i') -> (i' -> i) -> (i -> e -> i' -> e') -> a i e -> a' i' e'

    carray Data.Array.CArray

    Generic slice and map. This takes the new range, the inverse map on indices, and function to produce the next element. It is the most general operation in its class.

  9. ixmapWithP :: (Ix i, Ix i', IArray a e, IArray a' e') => (i', i') -> (i' -> i) -> (e -> e') -> a i e -> a' i' e'

    carray Data.Array.CArray

    Perform an operation on the elements, independent of their location.

  10. ixmapP :: (Ix i, Ix i', IArray a e, IArray a' e) => (i', i') -> (i' -> i) -> a i e -> a' i' e

    carray Data.Array.CArray.Base

    More polymorphic version of ixmap.

Page 575 of many | Previous | Next