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.
notElem :: (Foldable t, Eq a) => a -> t a -> Boolghc-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 *
notElem :: Eq a => a -> [a] -> Boolghc-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 *
notElem :: Eq a => a -> [a] -> Boolghc-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 *
noteTag :: Maybe Text -> Either RegexError Queryhledger-lib Hledger.Query Construct a query for the note: tag
notElem :: (Foldable t, Eq a) => a -> t a -> Boolnumeric-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 *
notElem :: (Foldable t, Eq a) => a -> t a -> Boolnumeric-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 *
notElem :: (Foldable t, Eq a) => a -> t a -> Boolnumhask 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 *
notElem :: (Foldable t, Eq a) => a -> t a -> Boolnumhask 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 *
notElem :: ListLike full item => item -> full -> BoolListLike Data.ListLike True if the item does not occur in the list
notElem :: ListLike full item => item -> full -> BoolListLike Data.ListLike.Base True if the item does not occur in the list