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.
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 *
elem :: Eq a => a -> [a] -> Boolghc-internal GHC.Internal.List elem is the list membership predicate, usually written in infix form, e.g., x `elem` xs. For the result to be False, the list must be finite; True, however, results from an element equal to x found at a finite index of a finite or infinite list.
Examples
>>> 3 `elem` [] False
>>> 3 `elem` [1,2] False
>>> 3 `elem` [1,2,3,4,5] True
>>> 3 `elem` [1..] True
>>> 3 `elem` [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 *
elem :: Eq a => a -> [a] -> Boolprelude-compat Data.List2010 No documentation available.
notElem :: Eq a => a -> [a] -> Boolprelude-compat Data.List2010 No documentation available.
elem :: Eq a => a -> [a] -> Boolprelude-compat Prelude2010 No documentation available.
notElem :: Eq a => a -> [a] -> Boolprelude-compat Prelude2010 No documentation available.
(
∈ ) :: Eq α => α -> [α] -> Boolbase-unicode-symbols Data.List.Unicode (∈) = elem U+2208, ELEMENT OF
(
∉ ) :: Eq α => α -> [α] -> Boolbase-unicode-symbols Data.List.Unicode (∉) = notElem U+2209, NOT AN ELEMENT OF
(
∈ ) :: Eq α => α -> [α] -> Boolbase-unicode-symbols Prelude.Unicode (∈) = elem U+2208, ELEMENT OF