Hoogle Search

Within LTS Haskell 24.9 (ghc-9.10.2)

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

Exact lookup

1. firstDayOfWeekOnAfter :: DayOfWeek -> Day -> Day

   rio	RIO.Time

   The first day-of-week on or after some day

2. firstChild :: Cursor -> Maybe Cursor

   xml	Text.XML.Light.Cursor

   The first child of the given location.

3. firstDayOfWeekOnAfter :: DayOfWeek -> Day -> Day

   time-compat	Data.Time.Calendar.Compat

   The first day-of-week on or after some day

4. first1Of :: Getting (First a) s a -> s -> a

   diagrams-lib	Diagrams.Prelude

   Retrieve the First entry of a Fold1 or Traversal1 or the result from a Getter or Lens.

   >>> first1Of traverse1 (1 :| [2..10])
   1
   

   >>> first1Of both1 (1,2)
   1
   

   Note: this is different from ^..

   >>> first1Of traverse1 ([1,2] :| [[3,4],[5,6]])
   [1,2]
   

   >>> ([1,2] :| [[3,4],[5,6]]) ^. traverse1
   [1,2,3,4,5,6]
   

   first1Of :: Getter s a      -> s -> a
   first1Of :: Fold1 s a       -> s -> a
   first1Of :: Lens' s a       -> s -> a
   first1Of :: Iso' s a        -> s -> a
   first1Of :: Traversal1' s a -> s -> a
   

5. firstOf :: Getting (Leftmost a) s a -> s -> Maybe a

   diagrams-lib	Diagrams.Prelude

   Retrieve the First entry of a Fold or Traversal or retrieve Just the result from a Getter or Lens. The answer is computed in a manner that leaks space less than preview or ^?' and gives you back access to the outermost Just constructor more quickly, but does so in a way that builds an intermediate structure, and thus may have worse constant factors. This also means that it can not be used in any MonadReader, but must instead have s passed as its last argument, unlike preview. Note: this could been named headOf.

   >>> firstOf traverse [1..10]
   Just 1
   

   >>> firstOf both (1,2)
   Just 1
   

   >>> firstOf ignored ()
   Nothing
   

   firstOf :: Getter s a     -> s -> Maybe a
   firstOf :: Fold s a       -> s -> Maybe a
   firstOf :: Lens' s a      -> s -> Maybe a
   firstOf :: Iso' s a       -> s -> Maybe a
   firstOf :: Traversal' s a -> s -> Maybe a
   

6. firsting :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b x y . (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)

   diagrams-lib	Diagrams.Prelude

   Lift an Iso into the first argument of a Bifunctor.

   firsting :: Bifunctor p => Iso s t a b -> Iso (p s x) (p t y) (p a x) (p b y)
   firsting :: Bifunctor p => Iso' s a -> Iso' (p s x) (p a x)
   

7. firstF :: (Functor f, Bifunctor p) => (a -> c) -> f (p a b) -> f (p c b)

   relude	Relude.Extra.Bifunctor

   Short for fmap . first.

   >>> firstF not $ Just (False, ['a', 'b'])
   Just (True,"ab")
   

8. firstNonReservedProcessId :: Int32

   distributed-process	Control.Distributed.Process.Internal.Types

   No documentation available.

9. package first-class-families

   First-class type families A library for type-level programming. See README.

10. firstA :: (Bitraversable t, Applicative f) => (a -> f c) -> t a b -> f (t c b)

    base-compat-batteries	Data.Bitraversable.Compat

    Traverses only over the first argument.

    firstA f ≡ bitraverse f pure
    

Page 19 of many | Previous | Next