Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
rhine FRP.Rhine.ResamplingBuffer.FIFO A bounded FIFO buffer that forgets the oldest values when the size is above a given threshold. If the buffer is empty, it will return Nothing.
-
rhine FRP.Rhine.ResamplingBuffer.FIFO An unbounded FIFO buffer. If the buffer is empty, it will return Nothing.
-
rhine FRP.Rhine.ResamplingBuffer.LIFO A bounded LIFO buffer that forgets the oldest values when the size is above a given threshold. If the buffer is empty, it will return Nothing.
-
rhine FRP.Rhine.ResamplingBuffer.LIFO An unbounded LIFO buffer. If the buffer is empty, it will return Nothing.
lowerBounded :: Int -> Pattern a -> Pattern [a]turtle Turtle.Pattern Apply the given pattern at least the given number of times, collecting the results
>>> match (lowerBounded 5 dot) "123" [] >>> match (lowerBounded 2 dot) "123" ["123"]
upperBounded :: Int -> Pattern a -> Pattern [a]turtle Turtle.Pattern Apply the given pattern 0 or more times, up to a given bound, collecting the results
>>> match (upperBounded 5 dot) "123" ["123"] >>> match (upperBounded 2 dot) "123" [] >>> match ((,) <$> upperBounded 2 dot <*> chars) "123" [("12","3"),("1","23")]newBoundedQ :: BoundedL d => Int -> IO (d elt)abstract-deque Data.Concurrent.Deque.Class Create a new, bounded deque with a specified capacity.
newBoundedQ :: Int -> IO (SimpleDeque elt)abstract-deque Data.Concurrent.Deque.Reference No documentation available.
WindowFrameUnbounded :: WindowFrameBoundbeam-core Database.Beam.Backend.SQL.AST No documentation available.
unboundedSyntax :: IsSql2003WindowFrameBoundSyntax bound => boundbeam-core Database.Beam.Backend.SQL.SQL2003 No documentation available.