Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
+++ ) :: Ord a => [a] -> [a] -> [a]code-conjure Conjure.Utils No documentation available.
(
+++ ) :: (C shx, C shy, Storable a) => Vector shx a -> Vector shy a -> Vector (shx ::+ shy) acomfort-blas Numeric.BLAS.Vector Precedence and associativity (right) of (List.++). This also matches (::+).
forVector number_ $ \xs -> forVector number_ $ \ys -> forVector number_ $ \zs -> Vector.toList ((xs +++ ys) +++ zs) == Vector.toList (xs +++ (ys +++ zs))
(
+++ ) :: Ord a => [a] -> [a] -> [a]extrapolate Test.Extrapolate.Utils No documentation available.
(
+++ ) :: Semigroupal (->) Either Either (,) p => p a b -> p c d -> p (Either a c) (Either b d)monoidal-functors Data.Bifunctor.Monoidal.Specialized Infix operator for demux.
-
pipes-extras Pipes.Extras Like (+++) from ArrowChoice
pL +++ pR = left pL >-> right pR
(
+++ ) :: AddR n m v w => RangeR n m a -> RangeR v w a -> RangeR (n + v) (m + w) aranged-list Data.List.Length To concatenate two lists whose types are RangeR n m a and RangeR v w a.
>>> :set -XDataKinds >>> sampleRangeR1 = NilR :++ 'f' :+ 'o' :+ 'o' :: RangeR 2 5 Char >>> sampleRangeR2 = NilR :++ 'b' :++ 'a' :+ 'r' :: RangeR 1 6 Char >>> sampleRangeR1 +++ sampleRangeR2 (((((NilR :++ 'f') :++ 'o') :++ 'o') :+ 'b') :+ 'a') :+ 'r' >>> :type sampleRangeR1 +++ sampleRangeR2 sampleRangeR1 +++ sampleRangeR2 :: RangeR 3 11 Char
(
++. ) :: AddL n m v w => RangeL n m a -> RangeL v w a -> RangeL (n + v) (m + w) aranged-list Data.List.Length To concatenate two lists whose types are RangeL n m a and RangeL v w a.
>>> :set -XDataKinds >>> sampleAddL1 = 'f' :. 'o' :. 'o' :.. NilL :: RangeL 2 5 Char >>> sampleAddL2 = 'b' :. 'a' :.. 'r' :.. NilL :: RangeL 1 6 Char >>> sampleAddL1 ++. sampleAddL2 'f' :. ('o' :. ('o' :. ('b' :.. ('a' :.. ('r' :.. NilL))))) >>> :type sampleAddL1 ++. sampleAddL2 sampleAddL1 ++. sampleAddL2 :: RangeL 3 11 Char
(
++.+ ) :: LeftToRight n m v w => RangeR n m a -> RangeL v w a -> RangeR (n + v) (m + w) aranged-list Data.List.Length 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.Length 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)))))
(
+++ ) :: AddR n m v w => RangeR n m a -> RangeR v w a -> RangeR (n + v) (m + w) aranged-list Data.List.Range To concatenate two lists whose types are RangeR n m a and RangeR v w a.
>>> :set -XDataKinds >>> sampleRangeR1 = NilR :++ 'f' :+ 'o' :+ 'o' :: RangeR 2 5 Char >>> sampleRangeR2 = NilR :++ 'b' :++ 'a' :+ 'r' :: RangeR 1 6 Char >>> sampleRangeR1 +++ sampleRangeR2 (((((NilR :++ 'f') :++ 'o') :++ 'o') :+ 'b') :+ 'a') :+ 'r' >>> :type sampleRangeR1 +++ sampleRangeR2 sampleRangeR1 +++ sampleRangeR2 :: RangeR 3 11 Char