Algebraic data types: Difference between revisions

Content added Content deleted
(C# changed output to look more like a tree)
m (→‎{{header|REXX}}: added/changed whitespace and comments.)
Line 1,803: Line 1,803:
The nodes used for this example are taken from the Wikipedia example at:  
The nodes used for this example are taken from the Wikipedia example at:  
[[https://en.wikipedia.org/wiki/Red%E2%80%93black_tree#/media/File:Red-black_tree_example.svg red black tree, an example]]
[[https://en.wikipedia.org/wiki/Red%E2%80%93black_tree#/media/File:Red-black_tree_example.svg red black tree, an example]]
<lang rexx>/*REXX pgm builds a red/black tree (with verification & validation), balances as needed.*/
<lang rexx>/*REXX pgm builds a red/black tree (with verification & validation), balanced as needed.*/
parse arg nodes '/' insert /*obtain optional arguments from the CL*/
parse arg nodes '/' insert /*obtain optional arguments from the CL*/
if nodes='' then nodes = 13.8.17 8.1.11 17.15.25 1.6 25.22.27 /*default nodes.*/
if nodes='' then nodes = 13.8.17 8.1.11 17.15.25 1.6 25.22.27 /*default nodes. */
if insert='' then insert= 22.44 44.66 /* " inserts*/
if insert='' then insert= 22.44 44.66 /* " inserts.*/
⚫
top= . /*define the default for the TOP var.*/
top=.
call Dnodes nodes /*define nodes, balance them as added. */
call Dnodes nodes /*define nodes, balance them as added. */
call Dnodes insert /*insert nodes, balance them as needed.*/
call Dnodes insert /*insert " " " " needed.*/
call Lnodes /*list the nodes (with indentation). */
call Lnodes /*list the nodes (with indentations). */
exit /*stick a fork in it, we're all done. */
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
Dnodes: arg $d; do j=1 for words($d); t=word($d, j) /*color: encoded into LEV.*/
err: say; say '***error***: ' arg(1); say; exit 13
⚫
parse var t p '.' a "." b '.' x 1 . . . xx
⚫
call Vnodes p a b
⚫
if x\=='' then call err "too many nodes specified: " xx
⚫
if p\==top then if @.p==. then call err "node isn't defined: " p
⚫
if p ==top then do; !.p=1; L.1=p; end /*assign the top node. */
⚫
@.p=a b; n=!.p + 1 /*assign node; bump level.*/
⚫
if a\=='' then do; !.a=n; @.a=; maxL=max(maxL, !.a); end
⚫
if b\=='' then do; !.b=n; @.b=; maxL=max(maxL, !.b); end
⚫
L.n=space(L.n a b) /*append to the level list*/
⚫
end /*j*/
⚫
return
/*──────────────────────────────────────────────────────────────────────────────────────*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
err: say; say '***error***: ' arg(1); say; exit 13
Dnodes: arg $d; do j=1 for words($d); t= word($d, j) /*color: encoded into L. */
⚫
parse var t p '.' a "." b '.' x 1 . . . xx
⚫
call Vnodes p a b
⚫
if x\=='' then call err "too many nodes specified: " xx
⚫
if p\==top then if @.p==. then call err "node isn't defined: " p
⚫
if p ==top then do; !.p=1; L.1=p; end /*assign the top node. */
⚫
@.p= a b; n= !.p + 1 /*assign node; bump level.*/
⚫
if a\=='' then do; !.a= n; @.a=; maxL= max(maxL, !.a); end
⚫
if b\=='' then do; !.b= n; @.b=; maxL= max(maxL, !.b); end
L.n= space(L.n a b) /*append to the level list*/
⚫
end /*j*/
⚫
return
/*──────────────────────────────────────────────────────────────────────────────────────*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
Lnodes: do L=1 for maxL; w=length(maxL); rb=word('(red) (black)', 1 + L//2)
Lnodes: do L=1 for maxL; w= length(maxL); rb= word('(red) (black)', 1+L//2)
say "level:" right(L, w) left('', L+L) " ───► " rb ' ' L.L
say "level:" right(L, w) left('', L+L) " ───► " rb ' ' L.L
end /*lev*/
end /*lev*/
return
return
/*──────────────────────────────────────────────────────────────────────────────────────*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
Vnodes: arg $v; do v=1 for words($v); y=word($v, v)
Vnodes: arg $v; do v=1 for words($v); y= word($v, v)
if \datatype(y, 'W') then call err "node isn't a whole number: " y
if \datatype(y, 'W') then call err "node isn't a whole number: " y
y=y/1 /*normalize the Y integer: no LZ, dot*/
y= y / 1 /*normalize Y int.: no LZ, dot*/
if top==. then do; LO=y; top=y; HI=y; L.=; @.=; maxL=1; end
if top==. then do; LO=y; top=y; HI=y; L.=; @.=; maxL=1; end
LO=min(LO, y); HI=max(HI, y)
LO= min(LO, y); HI= max(HI, y)
if @.y\==. & @.y\=='' then call err "node is already defined: " y
if @.y\==. & @.y\=='' then call err "node is already defined: " y
end /*v*/
end /*v*/
return</lang>
return</lang>
{{out|output|text=&nbsp; when using the default inputs:}}
{{out|output|text=&nbsp; when using the default inputs:}}
Retrieved from "https://rosettacode.org/wiki/Algebraic_data_types"