filter -base -bytestring
O(n) filter, applied to a predicate and a Text, returns a Text containing those characters that satisfy the predicate.
O(n). Filter all elements that satisfy some predicate.
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
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
O(n). The filter function takes a predicate p and a sequence xs and returns a sequence of those elements which satisfy the predicate.
O(n). Filter all elements that satisfy the predicate.
Use the filtered compression strategy for data produced by a filter (or predictor). Filtered data consists mostly of small values with a somewhat random distribution. In this case, the compression algorithm is tuned to compress them better. The effect of this strategy is to force more Huffman coding and less string matching; it is somewhat intermediate between defaultCompressionStrategy and huffmanOnlyCompressionStrategy.
O(n). Filter all keys/values that satisfy some predicate.
> filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
O(n). Filter all keys/values that satisfy the predicate.
> filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
Deprecated: Use filteredStrategy. CompressionStrategy constructors will be hidden in version 0.7
Pure and impure Bloom Filter implementations.
Version 1.2.6.10
defaultCookieFilter is the initial cookie acceptance filter. It welcomes them all into the store :-)
Filter based on edge property.
Filter based on edge label property.
Show more results