Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
first3 :: (a -> a') -> (a, b, c) -> (a', b, c)extra Extra Update the first component of a triple.
first3 succ (1,1,1) == (2,1,1)
firstJust :: (a -> Maybe b) -> [a] -> Maybe bextra Extra Find the first element of a list for which the operation returns Just, along with the result of the operation. Like find but useful where the function also computes some expensive information that can be reused. Particular useful when the function is monadic, see firstJustM.
firstJust id [Nothing,Just 3] == Just 3 firstJust id [Nothing,Nothing] == Nothing
firstJustM :: Monad m => (a -> m (Maybe b)) -> [a] -> m (Maybe b)extra Extra Like findM, but also allows you to compute some additional information in the predicate.
firstM :: Functor m => (a -> m a') -> (a, b) -> m (a', b)extra Extra Update the first component of a pair.
firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
firstA :: (Bitraversable t, Applicative f) => (a -> f c) -> t a b -> f (t c b)base-compat Data.Bitraversable.Compat Traverses only over the first argument.
firstA f ≡ bitraverse f pure
-
ghc GHC.Builtin.Names No documentation available.
-
ghc GHC.Builtin.Names No documentation available.
firstNode :: forall n (x :: Extensibility) . Block n C x -> n C Oghc GHC.Cmm.Dataflow.Block No documentation available.
-
ghc GHC.CmmToAsm.X86.Regs No documentation available.
-
ghc GHC.Core.DataCon Tags are allocated from here for real constructors or for superclass selectors