aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

66
Task/Create-a-two-dimensional-array-at-runtime/REXX/create-a-two-dimensional-array-at-runtime.rexx
View file

@ -1,39 +1,33 @@
/*REXX program to allocate/populate/display a two-dimensional array. */
call bloat
/*no more array named A. at this point.*/
exit /*stick a fork in it, we're all done. */
/*REXX program allocates/populates/displays a two-dimensional array. */
call bloat /*the BLOAT procedure does all allocations.*/
/*no more array named @ at this point. */
exit /*stick a fork in it, we're all done honey.*/
/*─────────────────────────BLOAT subroutine─────────────────────────────*/
bloat: procedure; say
bloat: procedure; say /*"PROCEDURE" makes this a ··· procedure. */
say 'Enter two positive integers (a 2-dimensional array will be created).'
pull n m . /*there is no way to pre-allocate an array,*/
/*REXX will allocate each element when it's*/
/*assigned. */
a.='~' /*default value for all elements so far. */
/*this ensures every element has a value. */
do j =1 for n
do k=1 for m
if random()//7==0 then a.j.k=j'_'k /*populate every 7th random*/
pull n m . /*elements are allocated as they're defined*/
/*N and M should be verified at this point.*/
@.=' · ' /*Initial value for all @ array elements,*/
/*this ensures every element has a value.*/
do j =1 for n /*traipse through the first dimension [N]*/
do k=1 for m /* " " " second " [M]*/
if random()//7==0 then @.j.k=j'~'k /*populate every 7th random*/
end /*k*/
end /*j*/
do r=1 for n /*display array to the console (row,col). */
_=
do c=1 for m
_=_ right(a.r.c,4) /*display one row at a time, align the vals*/
end /*kk*/
say _
end /*jj*/
/*when the RETURN is executed (from a */
/*PROCEDURE in this case), the array A. is*/
/*"de-allocated", that is, it's no longer */
/*defined, and the memory that the array */
/*has is now free for other REXX variables.*/
/*If the BLOAT subroutine didn't have */
/*a "PROCEDURE" on that statement, the */
/*array "a." would be left intact. */
/*The same effect is performed by a DROP. */
drop a. /*because of the PROCEDURE statement, */
return /* the DROP statement is superfluous. */
end /*j*/
/* [↓] display array to console: row,col */
do r=1 for n; _= /*construct one row (or line) at a time. */
do c=1 for m /*construct row one column at a time. */
_=_ right(@.r.c,4) /*append a nice-aligned column to the line.*/
end /*kk*/ /* [↑] an nicely aligned line is built. */
say _ /*display one row at a time to the terminal*/
end /*jj*/
/*╔════════════════════════════════════════════════════════════════════╗
║ When the RETURN is executed (from a PROCEDURE in this case), and ║
║ array @ is "de─allocated", that is, it's no longer defined, and ║
║ the array's storage is now free for other REXX variables. If the ║
║ BLOAT subroutine didn't have a "PROCEDURE" on that statement,║
║ the array @ would've been left intact. The same effect is ║
║ performed by a DROP statement (an example is shown below). ║
╚════════════════════════════════════════════════════════════════════╝*/
drop @. /*because of the PROCEDURE statement, the*/
return /* [↑] DROP statement is superfluous. */