@@ -1897,10 +1897,10 @@ Short-circuits.
1897
1897
1898
1898
= head2 infix C « ==> »
1899
1899
1900
- This X < pipeline > operator takes the result from the left and passes it as the
1900
+ This X < feed > operator takes the result from the left and passes it as the
1901
1901
last parameter to the right. This allows for a more natural left-to-right data
1902
1902
flow similar to method chaining, but can be used with functions that are not
1903
- methods of the data in the pipeline .
1903
+ methods of the data in each step .
1904
1904
1905
1905
# Traditional structure, read bottom-to-top
1906
1906
my @result =
@@ -1909,7 +1909,7 @@ methods of the data in the pipeline.
1909
1909
map { .tc }, # (2) Capitalize the words
1910
1910
<people of earth>; # (1) Start with the input
1911
1911
1912
- # Pipeline (left-to-right), read top-to-bottom
1912
+ # Feed (left-to-right), read top-to-bottom
1913
1913
my @result =
1914
1914
<people of earth> # (1) Start with the input
1915
1915
==> map { .tc } # (2) Capitalize the words
@@ -1925,7 +1925,7 @@ methods of the data in the pipeline.
1925
1925
1926
1926
= head2 infix C « <== »
1927
1927
1928
- This X < leftward pipeline > operator takes the result from the right and passes
1928
+ This X < leftward feed > operator takes the result from the right and passes
1929
1929
it as the last parameter to the left. This makes visible the right-to-left
1930
1930
dataflow for a series of list manipulating functions.
1931
1931
@@ -1936,7 +1936,7 @@ dataflow for a series of list manipulating functions.
1936
1936
map { .tc }, # (2) Capitalize the words
1937
1937
<people of earth>; # (1) Start with the input
1938
1938
1939
- # Pipeline (right-to-left), read bottom-to-top
1939
+ # Feed (right-to-left), read bottom-to-top
1940
1940
my @result =
1941
1941
sort # (4) Sort, result is <Earth People>
1942
1942
<== grep { /<[PE]>/ }, # (3) Look for P or E
0 commit comments