Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

Exact lookup

1. notElem :: (Foldable t, Eq a) => a -> t a -> Bool

   xmonad-contrib	XMonad.Prelude

   notElem is the negation of elem.

   Examples

   Basic usage:

   >>> 3 `notElem` []
   True
   

   >>> 3 `notElem` [1,2]
   True
   

   >>> 3 `notElem` [1,2,3,4,5]
   False
   

   For infinite structures, notElem terminates if the value exists at a finite distance from the left side of the structure:

   >>> 3 `notElem` [1..]
   False
   

   >>> 3 `notElem` ([4..] ++ [3])
   * Hangs forever *
   

2. (∈) :: (Foldable t, Eq α) => α -> t α -> Bool

   base-unicode-symbols	Data.Foldable.Unicode

   (∈) = elem U+2208, ELEMENT OF

3. (∉) :: (Foldable t, Eq α) => α -> t α -> Bool

   base-unicode-symbols	Data.Foldable.Unicode

   (∉) = notElem U+2209, NOT AN ELEMENT OF

4. elem :: (Vector v a, Eq a) => a -> v a -> Bool

   rio	RIO.Vector

   No documentation available.

5. notElem :: (Vector v a, Eq a) => a -> v a -> Bool

   rio	RIO.Vector

   No documentation available.

6. elem :: (Vector v a, Eq a) => a -> v a -> Bool

   rebase	Rebase.Data.Vector.Generic

   No documentation available.

7. notElem :: (Vector v a, Eq a) => a -> v a -> Bool

   rebase	Rebase.Data.Vector.Generic

   No documentation available.

8. in_ :: SqlIn expr a => a -> [a] -> expr Bool

   beam-core	Database.Beam.Query

   SQL IN predicate

9. elemIndex :: (C n, Eq a) => a -> [a] -> Maybe n

   numeric-prelude	NumericPrelude.List.Generic

   No documentation available.

10. genericElemIndex :: (Eq a, Integral i) => a -> [a] -> Maybe i

    Agda	Agda.Utils.List

    A generalised variant of elemIndex. O(n).

Page 10 of many | Previous | Next