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. mapLHSCores :: (LHSCore -> LHSCore) -> RHS -> RHS

    Agda Agda.TypeChecking.Rules.Def

    Modify all the LHSCore of the given RHS. (Used to insert patterns for rewrite or the inspect idiom)

  2. mapKeysMonotonic :: (k -> k') -> AssocList k v -> AssocList k' v

    Agda Agda.Utils.AssocList

    O(n). Named in analogy to mapKeysMonotonic. To preserve the invariant, it is sufficient that the key transformation is injective (rather than monotonic).

  3. mapWithKey :: (k -> v -> v) -> AssocList k v -> AssocList k v

    Agda Agda.Utils.AssocList

    O(n). Map over an association list, preserving the order.

  4. mapWithKeyM :: Applicative m => (k -> v -> m v) -> AssocList k v -> m (AssocList k v)

    Agda Agda.Utils.AssocList

    O(n). If called with a effect-producing function, violation of the invariant could matter here (duplicating effects).

  5. mapBenchmarkOn :: (BenchmarkOn a -> BenchmarkOn a) -> Benchmark a -> Benchmark a

    Agda Agda.Utils.Benchmark

    Semantic editor combinator.

  6. mapCurrentAccount :: (CurrentAccount a -> CurrentAccount a) -> Benchmark a -> Benchmark a

    Agda Agda.Utils.Benchmark

    Semantic editor combinator.

  7. mapTimings :: (Timings a -> Timings a) -> Benchmark a -> Benchmark a

    Agda Agda.Utils.Benchmark

    Semantic editor combinator.

  8. mapWithKey :: (Ord k, Ord (Tag v), HasTag v) => (k -> v -> v) -> BiMap k v -> BiMap k v

    Agda Agda.Utils.BiMap

    Changes all the values using the given function, which is also given access to keys. O(n log n). Precondition: See mapWithKeyPrecondition.

  9. mapWithKeyFixedTags :: (k -> v -> v) -> BiMap k v -> BiMap k v

    Agda Agda.Utils.BiMap

    Changes all the values using the given function, which is also given access to keys. O(n). Precondition: See mapWithKeyFixedTagsPrecondition. Note that tags must not change.

  10. mapWithKeyFixedTagsPrecondition :: (Eq v, Eq (Tag v), HasTag v) => (k -> v -> v) -> BiMap k v -> Bool

    Agda Agda.Utils.BiMap

    The precondition for mapWithKeyFixedTags f m is that, if m maps k to v, then tag (f k v) == tag v.

Page 314 of many | Previous | Next