Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. replaceFromApply :: (Delta da, a ~ Base da) => Embedding' da (Replace a)

    delta-types Data.Delta.Embedding

    Having an apply function is equivalent to the existence of a canonical embedding into the trivial Replace delta type.

  2. data DeltaMap key da

    delta-types Data.Delta.Map

    Delta type for Map.

  3. package dependent-monoidal-map

    Dependent map that uses semigroup mappend Data.Dependent.Map variant that appends conflicting entries when merging maps instead of discarding one side of the conflict.

  4. newtype MonoidalDMap (f :: k -> Type) (g :: k -> Type)

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    No documentation available.

  5. MonoidalDMap :: DMap f g -> MonoidalDMap (f :: k -> Type) (g :: k -> Type)

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    No documentation available.

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

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    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.

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

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    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.

  8. unMonoidalDMap :: MonoidalDMap (f :: k -> Type) (g :: k -> Type) -> DMap f g

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    No documentation available.

  9. data DynMap

    dictionary-sharing Data.ClassSharing

    A dynamic map with type safe insertion and lookup.

  10. dmap :: forall a1 a2 (d :: Dimension) . KnownVariant v => (a1 -> a2) -> Dimensional v d a1 -> Dimensional v d a2

    dimensional Numeric.Units.Dimensional

    Maps over the underlying representation of a dimensional value. The caller is responsible for ensuring that the supplied function respects the dimensional abstraction. This means that the function must preserve numerical values, or linearly scale them while preserving the origin.

Page 1146 of many | Previous | Next