Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. (++.+) :: LeftToRight n m v w => RangeR n m a -> RangeL v w a -> RangeR (n + v) (m + w) a

    ranged-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
    

  2. (++..) :: RightToLeft n m v w => RangeR n m a -> RangeL v w a -> RangeL (n + v) (m + w) a

    ranged-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)))))
    

  3. (+++) :: AddR n m v w => RangeR n m a -> RangeR v w a -> RangeR (n + v) (m + w) a

    ranged-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
    

  4. (++.) :: AddL n m v w => RangeL n m a -> RangeL v w a -> RangeL (n + v) (m + w) a

    ranged-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
    

  5. (++.+) :: LeftToRight n m v w => RangeR n m a -> RangeL v w a -> RangeR (n + v) (m + w) a

    ranged-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
    

  6. (++..) :: RightToLeft n m v w => RangeR n m a -> RangeL v w a -> RangeL (n + v) (m + w) a

    ranged-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)))))
    

  7. (++) :: forall (f :: Type -> Type) (n :: Nat) (m :: Nat) a . (CFreeMonoid f, Dom f a) => Sized f n a -> Sized f m a -> Sized f (n + m) a

    sized Data.Sized

    Infix version of append. Since 0.7.0.0

  8. (++|) :: Pattern String -> Pattern String -> Pattern String

    tidal Sound.Tidal.Boot

    No documentation available.

  9. (+|) :: Num a => Pattern a -> Pattern a -> Pattern a

    tidal Sound.Tidal.Boot

    No documentation available.

  10. (++) :: Unboxable a => Vector a -> Vector a -> Vector a

    unboxing-vector Data.Vector.Unboxing

    No documentation available.

Page 34 of many | Previous | Next