filter -package:Cabal -package:containers is:exact

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]

Examples

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

>>> filter (\l -> length l > 3) ["Hello", ", ", "World", "!"]
["Hello","World"]

>>> filter (/= 3) [1, 2, 3, 4, 3, 2, 1]
[1,2,4,2,1]

filter p xs removes any elements from xs that do not satisfy p.

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

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

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

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

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 all keys/values that satisfy some predicate.

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

Filter this set by retaining only elements satisfying a predicate.

Keep only values in the stream passing a given predicate. Subject to fusion

Keep only values in the stream passing a given predicate. Subject to fusion Since 0.3.0

Generates a value that satisfies a predicate. Shrinks of the generated value will also satisfy the predicate. From the original generator's shrink tree, any values that fail the predicate will be removed, but any subsequent shrinks that satisfy it will be retained. Compared to filter, shrinking may be slower but will be optimal. It's possible that the predicate will never pass, or will only pass at a larger size than we're currently running at. To avoid looping forever, we limit the number of retries, and grow the size with each retry. If we retry too many times then the whole generator is discarded.

Returns a tree containing only elements that match the predicate. If the root of the tree does not match the predicate then Nothing is returned.

Filter all values that satisfy some predicate.

filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty
filter (< "a") (fromList [(5,"a"), (3,"b")]) == empty

Filter all elements that satisfy some predicate.

(filter predicate) only forwards values that satisfy the predicate.

filter (pure True) = cat

filter (liftA2 (&&) p1 p2) = filter p1 >-> filter p2

filter f = mapMaybe (\a -> a <$ guard (f a))

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]

Drops chunks from an input stream if they fail to match a given filter predicate. See filter. Items pushed back to the returned stream are propagated back upstream. Example:

ghci> Streams.fromList ["the", "quick", "brown", "fox"] >>=
Streams.filter (/= "brown") >>= Streams.toList
["the","quick","fox"]