Replace \> with />>

This makes it visually clear which argument is being piped into

Author: c42f

src/expr.jl

@@ -326,7 +326,7 @@ function _to_expr(node::SyntaxNode; iteration_spec=false, need_linenodes=true,
             args[1] = Expr(headsym, args[1].args...)
             headsym = :const
         end
-    elseif headsym == Symbol("/>") || headsym == Symbol("\\>")
+    elseif headsym == Symbol("/>") || headsym == Symbol("/>>")
         callex = only(args)
         @assert Meta.isexpr(callex, :call)
         args = callex.args
@@ -350,7 +350,7 @@ function _to_expr(node::SyntaxNode; iteration_spec=false, need_linenodes=true,
             return Expr(:call, func, args...)
         end
     elseif headsym == :chain
-        if kind(node_args[1]) in KSet"/> \>"
+        if kind(node_args[1]) in KSet"/> />>"
             return Expr(:call, :(JuliaSyntax.compose_chain), args...)
         else
             return Expr(:call, :(JuliaSyntax.chain), args...)
@@ -360,7 +360,7 @@ function _to_expr(node::SyntaxNode; iteration_spec=false, need_linenodes=true,
 end
 
 #-------------------------------------------------------------------------------
-# Targets for lowering /> and \> syntax
+# Targets for lowering /> and />> syntax
 
 # For use with />
 struct FixButFirst{F,Args,Kws}
@@ -376,7 +376,7 @@ Fix all arguments except for the first
 """
 fixbutfirst(f, args...; kws...) = FixButFirst(f, args, kws)
 
-# For use with \>
+# For use with />>
 struct FixButLast{F,Args,Kws}
     f::F
     args::Args
@@ -394,7 +394,7 @@ chain(x, f, fs...) = chain(f(x), fs...)
 chain(x) = x
 
 # An example of how chain() can be used to rewrite
-# `x \> map(f) \> reduce(g)` into `mapreduce(f, g, x)`
+# `x />> map(f) />> reduce(g)` into `mapreduce(f, g, x)`
 function chain(x, f1::FixButLast{typeof(map)}, f2::FixButLast{typeof(reduce)}, fs...)
     chain(x, fixbutlast(mapreduce, f1.args..., f2.args...; f1.kwargs..., f2.kwargs...), fs...)
 end

src/kinds.jl

@@ -824,7 +824,7 @@ const _kind_names =
     ".'"
     "->"
     "/>"
-    "\\>"
+    "/>>"
 
     "BEGIN_UNICODE_OPS"
         "¬"

src/parser.jl

@@ -826,14 +826,14 @@ end
 function parse_curry_chain(ps::ParseState)
     mark = position(ps)
     nterms = 0
-    if (k = peek(ps); k != K"/>" && k != K"\>")
+    if (k = peek(ps); k != K"/>" && k != K"/>>")
         # x /> f(a)  ==>  (chain x (/> (call f a)))
         parse_range(ps)
         nterms += 1
     else
         # /> f(a) ==>  (/> (call f a))
     end
-    while (k = peek(ps); k == K"/>" || k == K"\>")
+    while (k = peek(ps); k == K"/>" || k == K"/>>")
         m = position(ps)
         bump(ps, TRIVIA_FLAG)
         parse_range(ps)
@@ -847,7 +847,7 @@ function parse_curry_chain(ps::ParseState)
         # x /> f(a) /> g(b)  ==>  (chain x (/> (call f a)) (/> (call g b)))
         # x /> A.f(a,b)      ==>  (chain x (/> (call (. A (quote f)) a b)))
         # /> f(a) /> g(b)    ==>  (chain (/> (call f a)) (/> (call g b)))
-        # x /> f() \> g()    ==>  (chain x (/> (call f)) (\> (call g)))
+        # x /> f() />> g()    ==>  (chain x (/> (call f)) (/>> (call g)))
         # x /> $call         ==>  (chain x (/> ($ call)))
         # x /> notcall[]     ==>  (chain x (/> (error (ref notcall))))
         emit(ps, mark, K"chain")

src/tokenize.jl

@@ -933,7 +933,11 @@ function lex_forwardslash(l::Lexer)
     elseif accept(l, '=')
         return emit(l, K"/=")
     elseif accept(l, '>')
-        return emit(l, K"/>")
+        if accept(l, '>')
+            return emit(l, K"/>>")
+        else
+            return emit(l, K"/>")
+        end
     else
         return emit(l, K"/")
     end
@@ -942,8 +946,6 @@ end
 function lex_backslash(l::Lexer)
     if accept(l, '=')
         return emit(l, K"\=")
-    elseif accept(l, '>')
-        return emit(l, K"\>")
     end
     return emit(l, K"\\")
 end

test/parser.jl

@@ -137,7 +137,7 @@ tests = [
         "x /> f(a) /> g(b)"  =>  "(chain x (/> (call f a)) (/> (call g b)))"
         "x /> A.f(a,b)"      =>  "(chain x (/> (call (. A (quote f)) a b)))"
         "/> f(a) /> g(b)"    =>  "(chain (/> (call f a)) (/> (call g b)))"
-        "x /> f() \\> g()"   =>  "(chain x (/> (call f)) (\\> (call g)))"
+        "x /> f() />> g()"   =>  "(chain x (/> (call f)) (/>> (call g)))"
         "x /> \$call"        =>  "(chain x (/> (\$ call)))"
         "x /> notcall[]"     =>  "(chain x (/> (error (ref notcall))))"
     ],