filter -is:exact -package:base -package:containers

filter :: (Word8 -> Bool) -> ByteString -> ByteString

bytestring Data.ByteString Data.ByteString.Lazy

O(n) filter, applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate.

filter :: (Char -> Bool) -> ByteString -> ByteString

bytestring Data.ByteString.Char8 Data.ByteString.Lazy.Char8

O(n) filter, applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate.

filter :: (Word8 -> Bool) -> ShortByteString -> ShortByteString

bytestring Data.ByteString.Short Data.ByteString.Short.Internal

O(n) filter, applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate.

filter :: (Char -> Bool) -> Text -> Text

text Data.Text Data.Text.Lazy

O(n) filter, applied to a predicate and a Text, returns a Text containing those characters that satisfy the predicate.

filter :: (Char -> Bool) -> Stream Char -> Stream Char

text Data.Text.Internal.Fusion.Common

O(n) filter, applied to a predicate and a stream, returns a stream containing those characters that satisfy the predicate. Properties

unstream . filter p . stream = filter p

filter :: (a -> Bool) -> Vector a -> Vector a

vector Data.Vector

O(n) Drop all elements that do not satisfy the predicate.

filter :: (a -> Bool) -> Bundle v a -> Bundle v a

vector Data.Vector.Fusion.Bundle

Drop elements which do not satisfy the predicate

filter :: Monad m => (a -> Bool) -> Bundle m v a -> Bundle m v a

vector Data.Vector.Fusion.Bundle.Monadic

Drop elements which do not satisfy the predicate

filter :: Vector v a => (a -> Bool) -> v a -> v a

vector Data.Vector.Generic

O(n) Drop all elements that do not satisfy the predicate.

filter :: Prim a => (a -> Bool) -> Vector a -> Vector a

vector Data.Vector.Primitive

O(n) Drop all elements that do not satisfy the predicate.

filter :: Storable a => (a -> Bool) -> Vector a -> Vector a

vector Data.Vector.Storable

O(n) Drop all elements that do not satisfy the predicate.

filter :: Unbox a => (a -> Bool) -> Vector a -> Vector a

vector Data.Vector.Unboxed

O(n) Drop all elements that do not satisfy the predicate.

filter :: (v -> Bool) -> HashMap k v -> HashMap k v

unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict

Filter this map by retaining only elements which values satisfy a predicate.

filter :: (a -> Bool) -> HashSet a -> HashSet a

unordered-containers Data.HashSet Data.HashSet.Internal

Filter this set by retaining only elements satisfying a predicate.

filter :: (a -> Bool) -> [a] -> [a]

Cabal Distribution.Compat.Prelude.Internal, ghc GHC.Prelude

filter, applied to a predicate and a list, returns the list of those elements that satisfy the predicate; i.e.,

filter p xs = [ x | x <- xs, p x]

>>> filter odd [1, 2, 3]
[1,3]

filterM :: Monad m => (a -> m Bool) -> Vector a -> m (Vector a)

vector Data.Vector

O(n) Drop all elements that do not satisfy the monadic predicate.

filterM :: Monad m => (a -> m Bool) -> Bundle v a -> Bundle m v a

vector Data.Vector.Fusion.Bundle

Yield a monadic stream of elements that satisfy the monadic predicate

filterM :: Monad m => (a -> m Bool) -> Bundle m v a -> Bundle m v a

vector Data.Vector.Fusion.Bundle.Monadic

Drop elements which do not satisfy the monadic predicate

filterM :: (Monad m, Vector v a) => (a -> m Bool) -> v a -> m (v a)

vector Data.Vector.Generic

O(n) Drop all elements that do not satisfy the monadic predicate.

filterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a)

vector Data.Vector.Primitive

O(n) Drop all elements that do not satisfy the monadic predicate.

filterM :: (Monad m, Storable a) => (a -> m Bool) -> Vector a -> m (Vector a)

vector Data.Vector.Storable

O(n) Drop all elements that do not satisfy the monadic predicate.

filterM :: (Monad m, Unbox a) => (a -> m Bool) -> Vector a -> m (Vector a)

vector Data.Vector.Unboxed

O(n) Drop all elements that do not satisfy the monadic predicate.

filterMapAux :: forall k v1 v2 . (HashMap k v1 -> Maybe (HashMap k v2)) -> (Leaf k v1 -> Maybe (Leaf k v2)) -> HashMap k v1 -> HashMap k v2

unordered-containers Data.HashMap.Internal

Common implementation for filterWithKey and mapMaybeWithKey, allowing the former to former to reuse terms.

filterWithKey :: forall k v . (k -> v -> Bool) -> HashMap k v -> HashMap k v

unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict

Filter this map by retaining only elements satisfying a predicate.

filterCmsg :: CmsgId -> [Cmsg] -> [Cmsg]

network Network.Socket

Filtering control message.