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.
-
Agda Agda.TypeChecking.Monad.Context Map a monadic function on the thing under the abstraction, adding the abstracted variable to the context.
mapAbstraction_ :: (Subst a, Subst b, MonadAddContext m) => (a -> m b) -> Abs a -> m (Abs b)Agda Agda.TypeChecking.Monad.Context No documentation available.
mapLHSCores :: (LHSCore -> LHSCore) -> RHS -> RHSAgda Agda.TypeChecking.Rules.Def Modify all the LHSCore of the given RHS. (Used to insert patterns for rewrite or the inspect idiom)
mapKeysMonotonic :: (k -> k') -> AssocList k v -> AssocList k' vAgda 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).
mapWithKey :: (k -> v -> v) -> AssocList k v -> AssocList k vAgda Agda.Utils.AssocList O(n). Map over an association list, preserving the order.
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).
mapBenchmarkOn :: (BenchmarkOn a -> BenchmarkOn a) -> Benchmark a -> Benchmark aAgda Agda.Utils.Benchmark Semantic editor combinator.
mapCurrentAccount :: (CurrentAccount a -> CurrentAccount a) -> Benchmark a -> Benchmark aAgda Agda.Utils.Benchmark Semantic editor combinator.
mapTimings :: (Timings a -> Timings a) -> Benchmark a -> Benchmark aAgda Agda.Utils.Benchmark Semantic editor combinator.
mapWithKey :: (Ord k, Ord (Tag v), HasTag v) => (k -> v -> v) -> BiMap k v -> BiMap k vAgda 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.