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. (∉) :: Eq α => α -> [α] -> Bool

   base-unicode-symbols	Prelude.Unicode

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

2. member :: Ord a => a -> [a] -> Bool

   data-ordlist	Data.List.Ordered

   The member function returns True if the element appears in the ordered list.

3. elem' :: Ord a => a -> [a] -> Bool

   text-ldap	Text.LDAP.Data

   Test element using ordered set.

4. notElem' :: Ord a => a -> [a] -> Bool

   text-ldap	Text.LDAP.Data

   Test not element using ordered set.

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

   base	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 *
   

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

   base	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 *
   

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

   base	Data.List

   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

   base	Data.List

   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

   base	Data.Foldable

   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

    base	Data.Foldable

    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 3 of many | Previous | Next