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.
-
vivid-supercollider Vivid.SC.SynthDef.Types No documentation available.
pattern
FIRST_ORDERED_NODE_TYPE :: (Eq a, Num a) => ajsaddle-dom JSDOM.Generated.XPathResult No documentation available.
-
xmonad-contrib XMonad.Config.Prime No documentation available.
firstf :: (a -> c) -> Maybe (a, b) -> Maybe (c, b)text Data.Text.Internal Apply a function to the first element of an optional pair.
firstDayOfWeekOnAfter :: DayOfWeek -> Day -> Daytime Data.Time.Calendar The first day-of-week on or after some day
first1Of :: Getting (First a) s a -> s -> alens Control.Lens.Combinators 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
firstOf :: Getting (Leftmost a) s a -> s -> Maybe alens Control.Lens.Combinators 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
-
lens Control.Lens.Combinators 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)
first1Of :: Getting (First a) s a -> s -> alens Control.Lens.Fold 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
firstOf :: Getting (Leftmost a) s a -> s -> Maybe alens Control.Lens.Fold 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