List comprehensions: Difference between revisions

Content added Content deleted
(→‎{{header|AppleScript}}: Removed two unused generic functions)
m (→‎{{header|REXX}}: changed some comments, added/changed whitespace.)
Line 1,717:
===vertical list===
<lang rexx>/*REXX program displays a vertical list of Pythagorean triples up to a specified number.*/
parse arg n . /*get theobtain optional argument from the CL.*/
if n=='' | n=="," then n=100 /*Not specified? Then use the default.*/
say 'Pythagorean triples (a² + b² = c², c ≤' n"):" /*display the list's title. */
$= /*assign a null to the triples list. */
do a=1 for n-2; aa=a*a /*Note: A*A is faster than A**2, but */
do b=a+1 to n-1; aabb=aa + b*b /* ··· but not by much.*/
do c=b+1 to n
if aabb==c*c then $=$ '{'a"," || b','c"}"
end /*c*/
end /*b*/
end /*a*/
#=words($)
do j=1 for #
say left('', 20) word($, j) /*display a member of the list, */
end /*j*/ /* [↑] list the members vertically. */
say # 'members listed.' /*stick a fork in it, we're all done. */</lang>
{{out|output|text=&nbsp; when using the default input:}}
Line 1,797:
say 'Pythagorean triples (a² + b² = c², c ≤' n"):" /*display the list's title. */
$= /*assign a null to the triples list. */
do a=1 for n-2; aa=a*a /*Note: A*A is faster than A**2, but */
do b=a+1 to n-1; aabb=aa + b*b /* ··· but not by much.*/
do c=b+1 to n
if aabb==c*c then $=$ '{'a"," || b','c"}"
end /*c*/
end /*b*/
end /*a*/ /*stick a fork in it, we're all done. */
#=words($) /*number of members in the list. */
say; say strip($) /*show the Pythagorean triples to term.*/
say; say # 'members listed.' /*triples are listed in order of 1st #.*/</lang>
{{out|output|text=&nbsp; when using the following input: &nbsp; <tt> 35 </tt>}}
<pre>
Retrieved from "https://rosettacode.org/wiki/List_comprehensions"