filter -zlib +containers

filter :: (Int -> Bool) -> IntSet -> IntSet
containers Data.IntSet
O(n). Filter all elements that satisfy some predicate.
filter :: (a -> Bool) -> IntMap a -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n). 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 :: (a -> Bool) -> Map k a -> Map k a
containers Data.Map.Lazy, containers Data.Map.Strict
O(n). Filter all values that satisfy the 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 :: (a -> Bool) -> Seq a -> Seq a
containers Data.Sequence
O(n). The filter function takes a predicate p and a sequence xs and returns a sequence of those elements which satisfy the predicate.
filter :: (a -> Bool) -> Set a -> Set a
containers Data.Set
O(n). Filter all elements that satisfy the predicate.
filterWithKey :: (Key -> a -> Bool) -> IntMap a -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n). Filter all keys/values that satisfy some predicate. > filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
filterWithKey :: (k -> a -> Bool) -> Map k a -> Map k a
containers Data.Map.Lazy, containers Data.Map.Strict
O(n). Filter all keys/values that satisfy the predicate. > filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"