Talk:User defined pipe and redirection operators: Difference between revisions

Content added Content deleted
Line 46: Line 46:
</pre>
</pre>


This task should be OK in python, especially the operators, and also Ada. I figure the GNU C has a fair chance. C++ should be able to hangle the operator overloading.
This task should be OK in python, especially the operators, and also Ada. I figure the GNU C has a fair chance. C++ should be able to handle the operator overloading.


I'm not familiar enough with other languages to make any comment. (Ocaml can do any thing! (apparently))
I'm not familiar enough with other languages to make any real comment. [Ocaml can do any thing! (apparently)] :-) Go should be real interesting!


BTW: Here is a complete implementation of "''tail''":
BTW: Here is a complete implementation of "''tail''", notice it uses a sliding window:
<lang algol68>PROC tail yield rec = (INT n, CONJUNCTION args, YIELDREC yield)VOID:
<lang algol68>PROC tail yield rec = (INT n, CONJUNCTION args, YIELDREC yield)VOID:
FOR argn FROM LWB args TO UPB args DO
FOR argn FROM LWB args TO UPB args DO
Line 78: Line 78:
Note that this "''tail''" implementation requires just one argument "n", keeping things simple to satisfy the use of tail in the "''Sample shell script''". I'm not asking for reinvention of head/tail etc, just enough to run the "''sample shell script''", basically a proof of concept the each particular language.
Note that this "''tail''" implementation requires just one argument "n", keeping things simple to satisfy the use of tail in the "''Sample shell script''". I'm not asking for reinvention of head/tail etc, just enough to run the "''sample shell script''", basically a proof of concept the each particular language.


[[User:NevilleDNZ|NevilleDNZ]] 02:55, 13 September 2011 (UTC)
[[User:NevilleDNZ|NevilleDNZ]] 02:57, 13 September 2011 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:User_defined_pipe_and_redirection_operators"