Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. newtype PatchIntMap a

    patch Data.Patch

    Patch for IntMap which represents insertion or deletion of keys in the mapping. Internally represented by 'IntMap (Maybe a)', where Just means insert/update and Nothing means delete.

  2. PatchIntMap :: IntMap (Maybe a) -> PatchIntMap a

    patch Data.Patch

    No documentation available.

  3. data PatchMapWithMove k v

    patch Data.Patch

    Patch a Map with additions, deletions, and moves. Invariant: If key k1 is coming from From_Move k2, then key k2 should be going to Just k1, and vice versa. There should never be any unpaired From/To keys.

  4. class Patch p

    patch Data.Patch.Class

    A Patch type represents a kind of change made to a datastructure. If an instance of Patch is also an instance of Semigroup, it should obey the law that applyAlways (f <> g) == applyAlways f . applyAlways g.

  5. newtype PatchDMap (k1 :: k -> Type) (v :: k -> Type)

    patch Data.Patch.DMap

    A set of changes to a DMap. Any element may be inserted/updated or deleted. Insertions are represented as ComposeMaybe (Just value), while deletions are represented as ComposeMaybe Nothing.

  6. PatchDMap :: DMap k1 (ComposeMaybe v) -> PatchDMap (k1 :: k -> Type) (v :: k -> Type)

    patch Data.Patch.DMap

    No documentation available.

  7. data Pair1 (f :: k -> Type) (g :: k -> Type) (a :: k)

    patch Data.Patch.DMapWithMove

    Higher kinded 2-tuple, identical to Data.Functor.Product from base ≥ 4.9

  8. Pair1 :: f a -> g a -> Pair1 (f :: k -> Type) (g :: k -> Type) (a :: k)

    patch Data.Patch.DMapWithMove

    No documentation available.

  9. newtype PatchDMapWithMove (k1 :: k -> Type) (v :: k -> Type)

    patch Data.Patch.DMapWithMove

    Like PatchMapWithMove, but for DMap. Each key carries a NodeInfo which describes how it will be changed by the patch and connects move sources and destinations. Invariants:

    • A key should not move to itself.
    • A move should always be represented with both the destination key (as a From_Move) and the source key (as a ComposeMaybe (Just destination))

  10. PatchDMapWithMove :: DMap k1 (NodeInfo k1 v) -> PatchDMapWithMove (k1 :: k -> Type) (v :: k -> Type)

    patch Data.Patch.DMapWithMove

    No documentation available.

Page 631 of many | Previous | Next