September 2017 Update
This commit is contained in:
parent
bba7bfd280
commit
ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
|
|
@ -1,46 +1,45 @@
|
|||
/*REXX program calculates the resistance between any two points on a resister grid.*/
|
||||
numeric digits 20 /*use moderate decimal digs (precision)*/
|
||||
minVal = (1'e-' || (digits()*2)) / 1 /*calculate the threshold minimul value*/
|
||||
if 1=='f1'x then ohms = 'ohms' /*EBCDIC machine? Then use 'ohms'. */
|
||||
else ohms = 'ea'x /* ASCII " " " Greek Ω.*/
|
||||
parse arg high wide Arow Acol Brow Bcol . /*obtain optional arguments from the CL*/
|
||||
if 2=='f2'x then ohms = "ohms" /*EBCDIC machine? Then use 'ohms'. */
|
||||
else ohms = "Ω" /* ASCII " " " Greek Ω.*/
|
||||
parse arg high wide Arow Acol Brow Bcol digs . /*obtain optional arguments from the CL*/
|
||||
if high=='' | high=="," then high=10 /*Not specified? Then use the default.*/
|
||||
if wide=='' | wide=="," then wide=10 /* " " " " " " */
|
||||
if Arow=='' | Arow=="," then Arow= 2 /* " " " " " " */
|
||||
if Acol=='' | Acol=="," then Acol= 2 /* " " " " " " */
|
||||
if Brow=='' | Brow=="," then Brow= 7 /* " " " " " " */
|
||||
if Bcol=='' | Bcol=="," then Bcol= 8 /* " " " " " " */
|
||||
say ' minimum value = ' translate(format(minVal, , , , 0), "e", 'E'); say
|
||||
say ' resistor mesh is of size: ' wide "wide, " high 'high' ; say
|
||||
if digs=='' | digs=="," then digs=20 /* " " " " " " */
|
||||
numeric digits digs /*use moderate decimal digs (precision)*/
|
||||
minVal = 1'e-' || (digs*2) /*calculate the threshold minimul value*/
|
||||
say ' minimum value is ' format(minVal,,,,0) " using " digs ' decimal digits'; say
|
||||
say ' resistor mesh size is: ' wide "wide, " high 'high' ; say
|
||||
say ' point A is at (row,col): ' Arow"," Acol
|
||||
say ' point B is at (row,col): ' Brow"," Bcol
|
||||
@.=0; cell.=1
|
||||
do until $ <= minVal; v = 0
|
||||
@.Arow.Acol = +1 ; cell.Arow.Acol = 0
|
||||
@.Brow.Bcol = -1 ; cell.Brow.Bcol = 0
|
||||
$=0
|
||||
do i=1 for high; im=i - 1; ip=i + 1
|
||||
do j=1 for wide; jm=j - 1; jp=j + 1; n=0; v=0
|
||||
if i\==1 then do; v=v + @.im.j; n=n + 1; end
|
||||
if j\==1 then do; v=v + @.i.jm; n=n + 1; end
|
||||
if i<high then do; v=v + @.ip.j; n=n + 1; end
|
||||
if j<wide then do; v=v + @.i.jp; n=n + 1; end
|
||||
v=@.i.j - v/n; #.i.j=v; if cell.i.j then $=$ + v*v
|
||||
end /*j*/
|
||||
end /*i*/
|
||||
do r=1 for High
|
||||
do c=1 for Wide; @.r.c = @.r.c - #.r.c
|
||||
end /*c*/
|
||||
end /*r*/
|
||||
end /*until*/
|
||||
@.=0; cell.=1
|
||||
do until $<=minVal; v=0
|
||||
@.Arow.Acol= 1 ; cell.Arow.Acol=0
|
||||
@.Brow.Bcol= '-1' ; cell.Brow.Bcol=0
|
||||
$=0
|
||||
do i=1 for high; im=i-1; ip=i+1
|
||||
do j=1 for wide; n=0; v=0
|
||||
if i\==1 then do; v=v + @.im.j; n=n+1; end
|
||||
if j\==1 then do; jm=j-1; v=v + @.i.jm; n=n+1; end
|
||||
if i<high then do; v=v + @.ip.j; n=n+1; end
|
||||
if j<wide then do; jp=j+1; v=v + @.i.jp; n=n+1; end
|
||||
v=@.i.j - v/n; #.i.j=v; if cell.i.j then $=$ + v*v
|
||||
end /*j*/
|
||||
end /*i*/
|
||||
do r=1 for High
|
||||
do c=1 for Wide; @.r.c= @.r.c - #.r.c
|
||||
end /*c*/
|
||||
end /*r*/
|
||||
end /*until*/
|
||||
say
|
||||
Acur = #.Arow.Acol * sides(Arow,Acol)
|
||||
Bcur = #.Brow.Bcol * sides(Brow,Bcol)
|
||||
say ' resistance between point A and point B is: ' 4/(Acur-Bcur) ohms
|
||||
Acur= #.Arow.Acol * sides(Arow, Acol)
|
||||
Bcur= #.Brow.Bcol * sides(Brow, Bcol)
|
||||
say ' resistance between point A and point B is: ' 4 / (Acur - Bcur) ohms
|
||||
exit /*stick a fork in it, we're all done. */
|
||||
/*──────────────────────────────────────────────────────────────────────────────────────*/
|
||||
sides: parse arg row,col; z=0; if row\==1 & row\==high then z=z + 2
|
||||
else z=z + 1
|
||||
if col\==1 & col\==wide then z=z + 2
|
||||
else z=z + 1
|
||||
sides: parse arg row,col; z=0; if row\==1 & row\==high then z=z+2; else z=z+1
|
||||
if col\==1 & col\==wide then z=z+2; else z=z+1
|
||||
return z
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue