filter

filter :: (a -> Bool) -> [a] -> [a]
base Prelude, base Data.List
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 :: (Char -> Bool) -> ByteString -> ByteString
bytestring Data.ByteString.Char8, bytestring 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 :: (Char -> Bool) -> Text -> Text
text Data.Text, 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 :: (Key -> Bool) -> IntSet -> IntSet
containers Data.IntSet
O(n). Filter all elements that satisfy some predicate.
filter :: (Word8 -> Bool) -> ByteString -> ByteString
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 :: (Word8 -> Bool) -> ByteString -> ByteString
bytestring Data.ByteString
O(n) filter, applied to a predicate and a ByteString, returns a ByteString containing those characters that satisfy the predicate. This function is subject to array fusion.
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.
filterM :: Monad m => (a -> m Bool) -> [a] -> m [a]
base Control.Monad
This generalizes the list-based filter function.
filteredStrategy :: CompressionStrategy
zlib Codec.Compression.Zlib.Internal, zlib Codec.Compression.Zlib.Raw, zlib Codec.Compression.Zlib, zlib Codec.Compression.GZip
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.
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"
Filtered :: CompressionStrategy
zlib Codec.Compression.Zlib.Internal, zlib Codec.Compression.Zlib.Raw, zlib Codec.Compression.Zlib, zlib Codec.Compression.GZip
Deprecated: Use filteredStrategy. CompressionStrategy constructors will be hidden in version 0.7
mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
base Control.Monad
Direct MonadPlus equivalent of filter filter = (mfilter:: (a -> Bool) -> [a] -> [a] applicable to any MonadPlus, for example mfilter odd (Just 1) == Just 1 mfilter odd (Just 2) == Nothing
package bloomfilter
package
Pure and impure Bloom Filter implementations. Version 1.2.6.10
convolutionFilter1D :: PixelInternalFormat -> GLsizei -> PixelData a -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
convolutionFilter2D :: PixelInternalFormat -> Size -> PixelData a -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
convolutionFilterBias :: ConvolutionTarget -> StateVar (Color4 GLfloat)
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
convolutionFilterScale :: ConvolutionTarget -> StateVar (Color4 GLfloat)
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
copyConvolutionFilter1D :: PixelInternalFormat -> Position -> GLsizei -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
copyConvolutionFilter2D :: PixelInternalFormat -> Position -> Size -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
defaultCookieFilter :: URI -> Cookie -> IO Bool
HTTP Network.Browser
defaultCookieFilter is the initial cookie acceptance filter. It welcomes them all into the store :-)
efilter :: DynGraph gr => (LEdge b -> Bool) -> gr a b -> gr a b
fgl Data.Graph.Inductive.Basic
Filter based on edge property.
elfilter :: DynGraph gr => (b -> Bool) -> gr a b -> gr a b
fgl Data.Graph.Inductive.Basic
Filter based on edge label property.
getConvolutionFilter1D :: PixelData a -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
getConvolutionFilter2D :: PixelData a -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
getCookieFilter :: BrowserAction t (URI -> Cookie -> IO Bool)
HTTP Network.Browser
getCookieFilter returns the current cookie acceptance filter.
getSeparableFilter2D :: PixelData a -> PixelData a -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
package google-mail-filters
package
Organise your Google Mail filters as a Haskell EDSL, and produce XML output that can be imported from the GMail web interface. See https://github.com/liyang/google-mail-filters/blob/master/example.hs. Version 0.0.1.1
graphFilter :: GraphM m gr => (Context a b -> Bool) -> m (gr a b) -> m [Context a b]
fgl Data.Graph.Inductive.Query.Monad
graphFilterM :: GraphM m gr => (Context a b -> Bool) -> GT m (gr a b) [Context a b]
fgl Data.Graph.Inductive.Query.Monad
package hxt-filter
package
The Haskell XML Toolbox bases on the ideas of HaXml and HXML. This package is a compatibitlity package for old software working with the filter approach like in HaXml. For new projects it's recomended to use the arrow based library (hxt). Version 8.4.2
package imagefilters
package
This package brings image filters comparable to PHP's imagefilter functions. In the current release, these filters may only be used with the GD Haskell extension library, but in the future it may support other image management libraries, such as the new JuicyPixels library. imagefilters also supplies functionality for creating custom filters by using the pixelTransform function for per-pixel transformations, or the convolute function for the application of convolution matrices Version 0.1
type MagnificationFilter = TextureFilter
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Parameters
type MinificationFilter = (TextureFilter, Maybe TextureFilter)
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Parameters
separableFilter2D :: PixelInternalFormat -> Size -> PixelData a -> PixelData a -> IO ()
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
setCookieFilter :: (URI -> Cookie -> IO Bool) -> BrowserAction t ()
HTTP Network.Browser
setCookieFilter fn sets the cookie acceptance filter to fn.
data TextureFilter
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Parameters

Show more results