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.

Exact lookup

1. notElem :: (Storable a, Eq a) => a -> Vector a -> Bool

   storablevector	Data.StorableVector

   O(n) notElem is the inverse of elem

2. notElemOf :: Eq a => Getting All s a -> a -> s -> Bool

   diagrams-lib	Diagrams.Prelude

   Does the element not occur anywhere within a given Fold of the structure?

   >>> notElemOf each 'd' ('a','b','c')
   True
   

   >>> notElemOf each 'a' ('a','b','c')
   False
   

   notElem ≡ notElemOf folded
   

   notElemOf :: Eq a => Getter s a     -> a -> s -> Bool
   notElemOf :: Eq a => Fold s a       -> a -> s -> Bool
   notElemOf :: Eq a => Iso' s a       -> a -> s -> Bool
   notElemOf :: Eq a => Lens' s a      -> a -> s -> Bool
   notElemOf :: Eq a => Traversal' s a -> a -> s -> Bool
   notElemOf :: Eq a => Prism' s a     -> a -> s -> Bool
   

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

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

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

   relude	Relude.Foldable.Fold

   Like notElem but doesn't work on Set and HashSet for performance reasons.

   >>> notElem 'x' ("abc" :: String)
   True
   
   >>> notElem False (one True :: Set Bool)
   ...
   ... Do not use 'elem' and 'notElem' methods from 'Foldable' on Set
   Suggestions:
   Instead of
   elem :: (Foldable t, Eq a) => a -> t a -> Bool
   use
   member :: Ord a => a -> Set a -> Bool
   ...
   Instead of
   notElem :: (Foldable t, Eq a) => a -> t a -> Bool
   use
   not . member
   ...
   

5. notElem :: (Monad m, Eq a) => a -> Stream (Of a) m r -> m (Of Bool r)

   streaming	Streaming.Prelude

   Exhaust a stream deciding whether a was an element.

6. notElem_ :: (Monad m, Eq a) => a -> Stream (Of a) m r -> m Bool

   streaming	Streaming.Prelude

   No documentation available.

7. notElem :: forall (v :: Type -> Type) a (n :: Nat) . (Vector v a, Eq a) => a -> Vector v n a -> Bool

   vector-sized	Data.Vector.Generic.Sized

   O(n) Check if the vector does not contain an element (inverse of elem).

8. notElem :: forall a (n :: Nat) . (Prim a, Eq a) => a -> Vector n a -> Bool

   vector-sized	Data.Vector.Primitive.Sized

   O(n) Check if the vector does not contain an element (inverse of elem).

9. notElem :: forall a (n :: Nat) . Eq a => a -> Vector n a -> Bool

   vector-sized	Data.Vector.Sized

   O(n) Check if the vector does not contain an element (inverse of elem).

10. notElem :: forall a (n :: Nat) . (Storable a, Eq a) => a -> Vector n a -> Bool

    vector-sized	Data.Vector.Storable.Sized

    O(n) Check if the vector does not contain an element (inverse of elem).

Page 11 of many | Previous | Next