Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
++.+ ) :: LeftToRight n m v w => RangeR n m a -> RangeL v w a -> RangeR (n + v) (m + w) aranged-list Data.List.Range To concatenate a right-list and a left-list and return a right-list.
>>> :set -XDataKinds >>> sampleLeftToRight1 = NilR :++ 'f' :++ 'o' :+ 'o' :: RangeR 1 4 Char >>> sampleLeftToRight2 = 'b' :. 'a' :. 'r' :.. NilL :: RangeL 2 3 Char >>> sampleLeftToRight1 ++.+ sampleLeftToRight2 (((((NilR :++ 'f') :++ 'o') :++ 'o') :+ 'b') :+ 'a') :+ 'r' >>> :type sampleLeftToRight1 ++.+ sampleLeftToRight2 sampleLeftToRight1 ++.+ sampleLeftToRight2 :: RangeR 3 7 Char
(
++.. ) :: RightToLeft n m v w => RangeR n m a -> RangeL v w a -> RangeL (n + v) (m + w) aranged-list Data.List.Range To concatenate a right-list and a left-list and return a left-list.
>>> :set -XDataKinds >>> sampleRightToLeft1 = NilR :++ 'f' :++ 'o' :+ 'o' :: RangeR 1 4 Char >>> sampleRightToLeft2 = 'b' :. 'a' :. 'r' :.. NilL :: RangeL 2 3 Char >>> sampleRightToLeft1 ++.. sampleRightToLeft2 'f' :. ('o' :. ('o' :. ('b' :.. ('a' :.. ('r' :.. NilL)))))-
ranged-list Data.List.Range No documentation available.
(
<..> ) :: Functor f => (a -> b) -> f (f a) -> f (f b)status-notifier-item StatusNotifier.Util No documentation available.
(
|$. ) :: (IsStream t, MonadAsync m) => (t m a -> m b) -> t m a -> m bstreamly Streamly.Internal.Data.Stream.IsStream Parallel fold application operator; applies a fold function t m a -> m b to a stream t m a concurrently; The the input stream is evaluated asynchronously in an independent thread yielding elements to a buffer and the folding action runs in another thread consuming the input from the buffer. If you read the signature as (t m a -> m b) -> (t m a -> m b) you can look at it as a transformation that converts a fold function to a buffered concurrent fold function. The . at the end of the operator is a mnemonic for termination of the stream. In the example below, each stage introduces a delay of 1 sec but output is printed every second because both stages are concurrent.
>>> import Control.Concurrent (threadDelay) >>> import Streamly.Prelude ((|$.)) >>> :{ Stream.foldlM' (\_ a -> threadDelay 1000000 >> print a) (return ()) |$. Stream.replicateM 3 (threadDelay 1000000 >> return 1) :} 1 1 1Concurrent Since: 0.3.0 (Streamly)(
|&. ) :: (IsStream t, MonadAsync m) => t m a -> (t m a -> m b) -> m bstreamly Streamly.Internal.Data.Stream.IsStream Same as |$. but with arguments reversed.
(|&.) = flip (|$.)
Concurrent Since: 0.3.0 (Streamly)(
|$. ) :: (IsStream t, MonadAsync m) => (t m a -> m b) -> t m a -> m bstreamly Streamly.Prelude Parallel fold application operator; applies a fold function t m a -> m b to a stream t m a concurrently; The the input stream is evaluated asynchronously in an independent thread yielding elements to a buffer and the folding action runs in another thread consuming the input from the buffer. If you read the signature as (t m a -> m b) -> (t m a -> m b) you can look at it as a transformation that converts a fold function to a buffered concurrent fold function. The . at the end of the operator is a mnemonic for termination of the stream. In the example below, each stage introduces a delay of 1 sec but output is printed every second because both stages are concurrent.
>>> import Control.Concurrent (threadDelay) >>> import Streamly.Prelude ((|$.)) >>> :{ Stream.foldlM' (\_ a -> threadDelay 1000000 >> print a) (return ()) |$. Stream.replicateM 3 (threadDelay 1000000 >> return 1) :} 1 1 1Concurrent Since: 0.3.0 (Streamly)(
|&. ) :: (IsStream t, MonadAsync m) => t m a -> (t m a -> m b) -> m bstreamly Streamly.Prelude Same as |$. but with arguments reversed.
(|&.) = flip (|$.)
Concurrent Since: 0.3.0 (Streamly)(
#. ) :: UI Element -> String -> UI Elementthreepenny-gui Graphics.UI.Threepenny.Core Convenient combinator for setting the CSS class on element creation.
-
type-level-kv-list Data.KVList No documentation available.