<>

(<>) :: Semigroup a => a -> a -> a
base Prelude Data.Monoid Data.Semigroup GHC.Base, relude Relude.Monoid, ghc-internal GHC.Internal.Base GHC.Internal.Data.Monoid, xmonad-contrib XMonad.Config.Prime, incipit-base Incipit.Base
An associative operation.

Examples

>>> [1,2,3] <> [4,5,6]
[1,2,3,4,5,6]

>>> Just [1, 2, 3] <> Just [4, 5, 6]
Just [1,2,3,4,5,6]

>>> putStr "Hello, " <> putStrLn "World!"
Hello, World!
(<>) :: Builder -> Builder -> Builder
text Data.Text.Internal.Builder.Functions, formatting Formatting.Internal.Raw
The normal mappend function with right associativity instead of left.
(<>) :: Semigroup a => a -> a -> a
optparse-applicative Options.Applicative.Help.Pretty, attoparsec Data.Attoparsec.Internal.Types, hedgehog Hedgehog.Internal.Prelude Hedgehog.Internal.Prelude, prettyprinter Prettyprinter, base-compat Data.Monoid.Compat Data.Semigroup.Compat Prelude.Compat, ansi-wl-pprint Text.PrettyPrint.ANSI.Leijen, fast-logger System.Log.FastLogger.Internal, pandoc-types Text.Pandoc.Builder, streaming Streaming, rio RIO.Prelude, validity Data.Validity, base-prelude BasePrelude BasePrelude.Operators, turtle Turtle, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude Distribution.Compat.Semigroup, aws Aws.Iam.Internal, universum Universum.Monoid, ihaskell IHaskellPrelude, basement Basement.Compat.Base Basement.Compat.Semigroup Basement.Imports, numhask NumHask.Prelude NumHask.Prelude, base-compat-batteries Data.Monoid.Compat Data.Semigroup.Compat, clash-prelude Clash.HaskellPrelude, github GitHub.Internal.Prelude, HaTeX Text.LaTeX.Base Text.LaTeX.Base.Syntax, envparse Env, foundation Foundation, Agda Agda.Syntax.Common.Pretty Agda.TypeChecking.Pretty Agda.Utils.Semigroup, dimensional Numeric.Units.Dimensional.Prelude, haxl Haxl.Prelude, rebase Rebase.Prelude, quaalude Essentials, boomerang Text.Boomerang.Combinators, mixed-types-num Numeric.MixedTypes.PreludeHiding, text-printer Text.Printer, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, flat Flat.Encoder, copilot-language Copilot.Language.Prelude, prettyprinter-compat-ansi-wl-pprint Text.PrettyPrint.ANSI.Leijen, LambdaHack Game.LambdaHack.Core.Prelude Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude
An associative operation. 
>>> [1,2,3] <> [4,5,6]
[1,2,3,4,5,6]
(<>) :: Doc -> Doc -> Doc
pretty Text.PrettyPrint Text.PrettyPrint.HughesPJ, ghc GHC.Utils.Ppr, ghc-lib-parser GHC.Utils.Ppr
Beside. <> is associative, with identity empty.
(<>) :: Doc a -> Doc a -> Doc a
pretty Text.PrettyPrint.Annotated Text.PrettyPrint.Annotated.HughesPJ
Beside. <> is associative, with identity empty.
(<>) :: IsLine doc => doc -> doc -> doc
ghc GHC.Utils.Outputable, ghc-lib-parser GHC.Utils.Outputable, breakpoint Debug.Breakpoint.GhcFacade
Join two docs together horizontally without a gap.
(<>) :: forall s e (pre :: [WasmType]) (mid :: [WasmType]) (post :: [WasmType]) . WasmControl s e pre mid -> WasmControl s e mid post -> WasmControl s e pre post
ghc GHC.Wasm.ControlFlow
(<>) :: Monoid m => m -> m -> m
utility-ht Data.Monoid.HT
Infix synonym for mappend.
(<>) :: Numeric t => Matrix t -> Matrix t -> Matrix t
hmatrix Numeric.LinearAlgebra
dense matrix product 
>>> let a = (3><5) [1..]

>>> a
(3><5)
[  1.0,  2.0,  3.0,  4.0,  5.0
,  6.0,  7.0,  8.0,  9.0, 10.0
, 11.0, 12.0, 13.0, 14.0, 15.0 ]

>>> let b = (5><2) [1,3, 0,2, -1,5, 7,7, 6,0]

>>> b
(5><2)
[  1.0, 3.0
,  0.0, 2.0
, -1.0, 5.0
,  7.0, 7.0
,  6.0, 0.0 ]

>>> a <> b
(3><2)
[  56.0,  50.0
, 121.0, 135.0
, 186.0, 220.0 ]
(<>) :: forall m k n . (KnownNat m, KnownNat k, KnownNat n) => L m k -> L k n -> L m n
hmatrix Numeric.LinearAlgebra.Static
(<>) :: Monoid m => m -> m -> m
string-conversions Data.String.Conversions, basic-prelude CorePrelude, svg-builder Graphics.Svg
An infix synonym for mappend.
(<>) :: Box -> Box -> Box
boxes Text.PrettyPrint.Boxes
Paste two boxes together horizontally, using a default (top) alignment.
type family (<>) (x :: a) (y :: a) :: a
first-class-families Fcf.Class.Monoid
Type-level semigroup composition (<>).
(<>) :: Doc -> Doc -> Doc
wl-pprint Text.PrettyPrint.Leijen
The document (x <> y) concatenates document x and document y. It is an associative operation having empty as a left and right unit. (infixr 6)
(<>) :: ToJExpr a => JExpr -> a -> JExpr
jmacro Language.Javascript.JMacro.Util
(<>) :: Doc -> Doc -> Doc
ghc-lib-parser Language.Haskell.TH.PprLib
(<>) :: Diagram -> Diagram -> Diagram
diagrams Graphics.Rendering.Diagrams Graphics.Rendering.Diagrams.Layouts
d1 <> d2 is a Diagram with d1 to the left of d2, aligned along their top edges.
(<>) :: Semigroup a => a -> a -> a
wl-pprint-annotated Text.PrettyPrint.Annotated.WL, colorful-monoids Data.Monoid.Colorful Data.Monoid.Colorful.Flat, glob-posix System.Directory.Glob
An associative operation.
(<>) :: Semigroup a => a -> a -> a
xmlgen Text.XML.Generator
An associative operation. 
(a <> b) <> c = a <> (b <> c)
If a is also a Monoid we further require 
(<>) = mappend
type family (l :: k1) <> (r :: k2) :: ErrorMessage
incipit-base Incipit.TypeError
Concat two error message strings.
(<>) :: Doc a -> Doc a -> Doc a
annotated-wl-pprint Text.PrettyPrint.Annotated.Leijen
The document (x <> y) concatenates document x and document y. It is an associative operation having empty as a left and right unit. (infixr 6)
(<>) :: Ord a => Bra a -> Ket a -> Scalar
numeric-quest QuantumVector
(<>) :: forall s e pre mid post . WasmControl s e pre mid -> WasmControl s e mid post -> WasmControl s e pre post
ghc-lib GHC.Wasm.ControlFlow
(<>) :: (KnownNat m, KnownNat k, KnownNat n, Reifies s W) => BVar s (L m k) -> BVar s (L k n) -> BVar s (L m n)
hmatrix-backprop Numeric.LinearAlgebra.Static.Backprop
Matrix product
(<>) :: Mult a b c => a -> b -> c
learn-physics Physics.Learn.Ket