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. elem :: (Foldable t, Eq a) => a -> t a -> Bool

   numhask	NumHask.Prelude

   Does the element occur in the structure? Note: elem is often used in infix form.

   Examples

   Basic usage:

   >>> 3 `elem` []
   False
   

   >>> 3 `elem` [1,2]
   False
   

   >>> 3 `elem` [1,2,3,4,5]
   True
   

   For infinite structures, the default implementation of elem terminates if the sought-after value exists at a finite distance from the left side of the structure:

   >>> 3 `elem` [1..]
   True
   

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

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

   numhask	NumHask.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 *
   

3. elem :: (Foldable t, Eq a) => a -> t a -> Bool

   numhask	NumHask.Prelude

   Does the element occur in the structure? Note: elem is often used in infix form.

   Examples

   Basic usage:

   >>> 3 `elem` []
   False
   

   >>> 3 `elem` [1,2]
   False
   

   >>> 3 `elem` [1,2,3,4,5]
   True
   

   For infinite structures, the default implementation of elem terminates if the sought-after value exists at a finite distance from the left side of the structure:

   >>> 3 `elem` [1..]
   True
   

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

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

   numhask	NumHask.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 *
   

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

   basic-prelude	BasicPrelude

   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 *
   

6. elem :: (Foldable t, Eq a) => a -> t a -> Bool

   basic-prelude	BasicPrelude

   Does the element occur in the structure? Note: elem is often used in infix form.

   Examples

   Basic usage:

   >>> 3 `elem` []
   False
   

   >>> 3 `elem` [1,2]
   False
   

   >>> 3 `elem` [1,2,3,4,5]
   True
   

   For infinite structures, the default implementation of elem terminates if the sought-after value exists at a finite distance from the left side of the structure:

   >>> 3 `elem` [1..]
   True
   

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

7. elem :: (Foldable t, Eq a) => a -> t a -> Bool

   ghc-lib-parser	GHC.Prelude.Basic

   Does the element occur in the structure? Note: elem is often used in infix form.

   Examples

   Basic usage:

   >>> 3 `elem` []
   False
   

   >>> 3 `elem` [1,2]
   False
   

   >>> 3 `elem` [1,2,3,4,5]
   True
   

   For infinite structures, the default implementation of elem terminates if the sought-after value exists at a finite distance from the left side of the structure:

   >>> 3 `elem` [1..]
   True
   

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

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

   ghc-lib-parser	GHC.Prelude.Basic

   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 *
   

9. elem :: (Foldable t, Eq a) => a -> t a -> Bool

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   Does the element occur in the structure? Note: elem is often used in infix form.

   Examples

   Basic usage:

   >>> 3 `elem` []
   False
   

   >>> 3 `elem` [1,2]
   False
   

   >>> 3 `elem` [1,2,3,4,5]
   True
   

   For infinite structures, the default implementation of elem terminates if the sought-after value exists at a finite distance from the left side of the structure:

   >>> 3 `elem` [1..]
   True
   

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

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

    mixed-types-num	Numeric.MixedTypes.PreludeHiding

    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 *
    

Page 6 of many | Previous | Next