Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

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

    ghc-internal GHC.Internal.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 *
    

  2. notElem :: Eq a => a -> [a] -> Bool

    ghc-internal GHC.Internal.Data.OldList

    notElem is the negation of elem.

    Examples

    >>> 3 `notElem` []
    True
    
    >>> 3 `notElem` [1,2]
    True
    
    >>> 3 `notElem` [1,2,3,4,5]
    False
    
    >>> 3 `notElem` [1..]
    False
    
    >>> 3 `notElem` [4..]
    * Hangs forever *
    

  3. notElem :: Eq a => a -> [a] -> Bool

    ghc-internal GHC.Internal.List

    notElem is the negation of elem.

    Examples

    >>> 3 `notElem` []
    True
    
    >>> 3 `notElem` [1,2]
    True
    
    >>> 3 `notElem` [1,2,3,4,5]
    False
    
    >>> 3 `notElem` [1..]
    False
    
    >>> 3 `notElem` [4..]
    * Hangs forever *
    

  4. noteTag :: Maybe Text -> Either RegexError Query

    hledger-lib Hledger.Query

    Construct a query for the note: tag

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

    numeric-prelude NumericPrelude

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

    numeric-prelude NumericPrelude.Base

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

  8. 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 *
    

  9. notElem :: ListLike full item => item -> full -> Bool

    ListLike Data.ListLike

    True if the item does not occur in the list

  10. notElem :: ListLike full item => item -> full -> Bool

    ListLike Data.ListLike.Base

    True if the item does not occur in the list

Page 13 of many | Previous | Next