Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. package dependent-map

    Dependent finite maps (partial dependent products) Provides a type called DMap which generalizes Data.Map.Map, allowing keys to specify the type of value that can be associated with them.

  2. data DMap (k1 :: k -> Type) (f :: k -> Type)

    dependent-map Data.Dependent.Map

    Dependent maps: k is a GADT-like thing with a facility for rediscovering its type parameter, elements of which function as identifiers tagged with the type of the thing they identify. Real GADTs are one useful instantiation of k, as are Tags from Data.Unique.Tag in the 'prim-uniq' package. Semantically, DMap k f is equivalent to a set of DSum k f where no two elements have the same tag. More informally, DMap is to dependent products as Map is to (->). Thus it could also be thought of as a partial (in the sense of "partial function") dependent product.

  3. isProperSubmapOfBy :: GCompare k2 => (forall (v :: k1) . () => k2 v -> k2 v -> f v -> g v -> Bool) -> DMap k2 f -> DMap k2 g -> Bool

    dependent-map Data.Dependent.Map

    O(n+m). Is this a proper submap? (ie. a submap but not equal). The expression (isProperSubmapOfBy f m1 m2) returns True when m1 and m2 are not equal, all keys in m1 are in m2, and when f returns True when applied to their respective keys and values.

  4. isSubmapOfBy :: GCompare k2 => (forall (v :: k1) . () => k2 v -> k2 v -> f v -> g v -> Bool) -> DMap k2 f -> DMap k2 g -> Bool

    dependent-map Data.Dependent.Map

    O(n+m). The expression (isSubmapOfBy f t1 t2) returns True if all keys in t1 are in tree t2, and when f returns True when applied to their respective keys and values.

  5. data DMap (k1 :: k -> Type) (f :: k -> Type)

    dependent-map Data.Dependent.Map.Internal

    Dependent maps: k is a GADT-like thing with a facility for rediscovering its type parameter, elements of which function as identifiers tagged with the type of the thing they identify. Real GADTs are one useful instantiation of k, as are Tags from Data.Unique.Tag in the 'prim-uniq' package. Semantically, DMap k f is equivalent to a set of DSum k f where no two elements have the same tag. More informally, DMap is to dependent products as Map is to (->). Thus it could also be thought of as a partial (in the sense of "partial function") dependent product.

  6. emap :: DynGraph gr => (b -> c) -> gr a b -> gr a c

    fgl Data.Graph.Inductive.Graph

    Map a function over the Edge labels in a graph.

  7. gfiltermap :: DynGraph gr => (Context a b -> MContext c d) -> gr a b -> gr c d

    fgl Data.Graph.Inductive.Graph

    Build a graph out of the contexts for which the predicate is satisfied by recursively calling match.

  8. gmap :: DynGraph gr => (Context a b -> Context c d) -> gr a b -> gr c d

    fgl Data.Graph.Inductive.Graph

    Map a function over the graph by recursively calling match.

  9. nemap :: DynGraph gr => (a -> c) -> (b -> d) -> gr a b -> gr c d

    fgl Data.Graph.Inductive.Graph

    Map functions over both the Node and Edge labels in a graph.

  10. nmap :: DynGraph gr => (a -> c) -> gr a b -> gr c b

    fgl Data.Graph.Inductive.Graph

    Map a function over the Node labels in a graph.

Page 506 of many | Previous | Next