:: (a -> Bool) -> [a] -> Maybe a -package:ghc-internal

lookupBy :: (a -> Bool) -> [a] -> Maybe a
HaXml Text.XML.HaXml.Schema.Parse
An auxiliary you might expect to find in Data.List
find :: (a -> Bool) -> [a] -> Maybe a
prelude-compat Data.List2010
match' :: () => (a -> Bool) -> [a] -> Maybe a
ENIG Data.Text.ENIG
findSucc :: (a -> Bool) -> [a] -> Maybe a
zenacy-html Zenacy.HTML.Internal.Core
Finds the element in a list that is the succeessor of the element matching a predicate.
find :: Foldable t => (a -> Bool) -> t a -> Maybe a
base Data.List Data.Foldable, protolude Protolude, relude Relude.Foldable.Reexport, rio RIO.List, base-prelude BasePrelude, Cabal-syntax Distribution.Compat.Prelude, ihaskell IHaskellPrelude, numhask NumHask.Prelude, rebase Rebase.Prelude, xmonad-contrib XMonad.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, incipit-base Incipit.Foldable, LambdaHack Game.LambdaHack.Core.Prelude, faktory Faktory.Prelude, verset Verset, calligraphy Calligraphy.Prelude
The find function takes a predicate and a structure and returns the leftmost element of the structure matching the predicate, or Nothing if there is no such element.

Examples

Basic usage: 
>>> find (> 42) [0, 5..]
Just 45

>>> find (> 12) [1..7]
Nothing
find :: Vector v a => (a -> Bool) -> v a -> Maybe a
vector Data.Vector.Generic
O(n) Yield Just the first element matching the predicate or Nothing if no such element exists.
find :: Vector v a => (a -> Bool) -> v a -> Maybe a
rio RIO.Vector
find :: Vector v a => (a -> Bool) -> v a -> Maybe a
fixed-vector Data.Vector.Fixed
The find function takes a predicate and a vector and returns the leftmost element of the vector matching the predicate, or Nothing if there is no such element.
findIndex :: C n => (a -> Bool) -> [a] -> Maybe n
numeric-prelude NumericPrelude.List.Generic
lastOf :: [a] -> (a -> Bool) -> Maybe a
Hastructure Util