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.
(
++. ) :: AddL n m v w => RangeL n m a -> RangeL v w a -> RangeL (n + v) (m + w) aranged-list Data.List.Range 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.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)))))
(
++| ) :: Pattern String -> Pattern String -> Pattern Stringtidal Sound.Tidal.Boot No documentation available.
(
+++ ) :: RealVectorSpace ds => ds -> ds -> dsLPFP-core LPFPCore No documentation available.
(
+++ ) :: RealVectorSpace ds => ds -> ds -> dsLPFP-core LPFPCore.Mechanics1D No documentation available.
-
constrained-categories Control.Arrow.Constrained No documentation available.
(
<++ ) :: ReadP a -> ReadP a -> ReadP abase Text.ParserCombinators.ReadP Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.
(
<++ ) :: ReadPrec a -> ReadPrec a -> ReadPrec abase Text.ParserCombinators.ReadPrec Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.
-
conduit Data.Conduit Continue processing after usage of $$+. Since 0.5.0