Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
adjust :: (Ord k, Ord (Tag v), HasTag v) => (v -> v) -> k -> BiMap k v -> BiMap k vAgda Agda.Utils.BiMap Modifies the value at the given position, if any. O(log n). Precondition: See adjustPrecondition.
adjustPrecondition :: (Ord k, Eq v, Eq (Tag v), HasTag v) => (v -> v) -> k -> BiMap k v -> BoolAgda Agda.Utils.BiMap The precondition for adjust f k m is that, if the value v is inserted into m, and tag v is defined, then no key other than k may map to a value v' for which tag v' = tag v.
applyWhenJust :: Maybe b -> (b -> a -> a) -> a -> aAgda Agda.Utils.Function catchImpossibleJust :: CatchImpossible m => (Impossible -> Maybe b) -> m a -> (b -> m a) -> m aAgda Agda.Utils.Impossible Catch only Impossible exceptions selected by the filter.
handleImpossibleJust :: CatchImpossible m => (Impossible -> Maybe b) -> (b -> m a) -> m a -> m aAgda Agda.Utils.Impossible Version of catchImpossibleJust with argument order suiting short handlers.
spanJust :: (a -> Maybe b) -> [a] -> (Prefix b, Suffix a)Agda Agda.Utils.List A generalized version of span. O(length . fst . spanJust f).
takeWhileJust :: (a -> Maybe b) -> [a] -> Prefix bAgda Agda.Utils.List A generalized version of takeWhile. (Cf. mapMaybe vs. filter). @O(length . takeWhileJust f). takeWhileJust f = fst . spanJust f.
adjustM :: (Functor f, Ord k) => (v -> f v) -> k -> Map k v -> f (Map k v)Agda Agda.Utils.Map Update monadically the value at one position (must exist!).
adjustM' :: (Functor f, Ord k) => (v -> f (a, v)) -> k -> Map k v -> f (a, Map k v)Agda Agda.Utils.Map Wrapper for adjustM for convenience.
allJustM :: Monad m => [m (Maybe a)] -> m (Maybe [a])Agda Agda.Utils.Maybe Lazy version of allJust . sequence. (allJust = mapM for the Maybe monad.) Only executes monadic effect while isJust.