Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

Exact lookup

1. adjust' :: (a -> a) -> Int -> Seq a -> Seq a

   containers	Data.Sequence

   Update the element at the specified position. If the position is out of range, the original sequence is returned. The new value is forced before it is installed in the sequence.

   adjust' f i xs =
   case xs !? i of
   Nothing -> xs
   Just x -> let !x' = f x
   in update i x' xs
   

2. adjust :: (a -> a) -> Int -> Seq a -> Seq a

   containers	Data.Sequence.Internal

   Update the element at the specified position. If the position is out of range, the original sequence is returned. adjust can lead to poor performance and even memory leaks, because it does not force the new value before installing it in the sequence. adjust' should usually be preferred.

3. adjust' :: (a -> a) -> Int -> Seq a -> Seq a

   containers	Data.Sequence.Internal

   Update the element at the specified position. If the position is out of range, the original sequence is returned. The new value is forced before it is installed in the sequence.

   adjust' f i xs =
   case xs !? i of
   Nothing -> xs
   Just x -> let !x' = f x
   in update i x' xs
   

4. adjustOption :: IsOption v => (v -> v) -> TestTree -> TestTree

   tasty	Test.Tasty

   Locally adjust the option value for the given test subtree.

5. adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.

6. adjust# :: (Eq k, Hashable k) => (v -> (# v #)) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Internal

   Much like adjust, but not inherently leaky.

7. adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Internal.Strict

   Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.

8. adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Lazy

   Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.

9. adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v

   unordered-containers	Data.HashMap.Strict

   Adjust the value tied to a given key in this map only if it is present. Otherwise, leave the map alone.

10. catchJust :: (HasCallStack, MonadCatch m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a

    exceptions	Control.Monad.Catch

    A more generalized way of determining which exceptions to catch at run time.

Page 28 of many | Previous | Next