|
DataMuseum.dkPresents historical artifacts from the history of: RC3500 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about RC3500 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 3840 (0xf00) Types: TextFileVerbose Names: »tpbw1«
└─⟦2c55ea56f⟧ Bits:30001844 SW-save af projekt 1000, Alarm-system └─⟦6b41451d2⟧ └─⟦this⟧ »tpbw1«
mode list.yes o pbwlist (pbw1=algol list.yes bossline.yes scope user pbw1 o c convert pbwlist lookup pbw1 tpbw1 finis) \f begin integer i,j,k,n,n1,n2,ll; real t,t0,lay; zone z(128,1,stderror); open(z,4,<:pbout:>,0); lay:=real <<+ddd.ddd ddd 00'-dd>; inrec6(z,12*4); for i:=1 step 1 until 12 do write(out,<:<10>:>,true add 5,case i of (<:test:>,<:g:>,<:alfa:>,<:dts:>,<:dt:>,<:eps:>,<:delta:>,<:n:>, <:n2:>,<:n1:>,<:n3:>,<:m0:>),<:=:>, if i>1 and i<8 or i=12 then string lay else <<dddd>,z(i),<:<10>:>); n:=z(8)+z(9); n1:=z(10); n2:=z(11); ll:=(117-5-4*n)//2; for i:=1 step 1 until n do begin inrec6(z,16*4); write(out,<:<10>n=:>,<<-dd>,i,<:<10>m=:>,string lay, z(1),<:<10>u=:>,z(2)); for j:=8,2 step 1 until 7 do write(out,string lay,z(i+1),<:(:>,z(j+8), <:)<10>:>,case j of (<:v:>,<:e:>,<:p:>,<:i:>,<:o:>,<:a:>,<::>)); end; for i:=-n1 step 1 until -1 do begin inrec6(z,(1+n2)*4); write(out,<:<10>n=:>,<<-dd>,i,<:<10>m=:>,string lay,z(1)); for j:=1 step 1 until n2 do write(out,<:<10>p:>,<<dd >,j,<:=:>, string lay,z(1+j)); end; inrec6(z,0); getposition(z,i,n2); begin array f(1:n,1:13); integer array c(-ll:ll),ch(1:13); for i:=1 step 1 until 13 do begin ch(i):=case i of('x','1','y','2','z','3','u','v','e','p','i','o','a'); for k:=1 step 1 until n do begin f(k,i):=0; end; end; replacechar(5,-1); inrec6(z,4); t:=z(1); repeat write(out,<:<10> !t=:>,<<ddd ddd.ddd>,t, <: ! ! ! u ! v ! e !:>, <: p ! i ! o ! a:>); replacechar(4,-1); for k:=1 step 1 until n do begin inrec6(z,13*4); write(out,<:<10>:>,<<dd>,k); for i:=1 step 1 until 13 do begin if abs z(i)>f(k,i) then f(k,i):=abs z(i); if i=2 or i=4 or i=6 then write(out,<<+.ddd'-zd>,z(i)) else write(out,<:!:>,<<-.ddd'-zd>,z(i)); end; end; replacechar(4,'.'); inrec6(z,4); t0:=t; t:=z(1); until t0>=t; for i:=-ll step 1 until ll do c(i):=' '; for k:=1 step 1 until n do begin if f(k,2)>f(k,4) then f(k,4):=f(k,2) else f(k,2):=f(k,4); if f(k,6)<f(k,2) then f(k,6):=f(k,2) else f(k,2):=f(k,4):=f(k,6); if f(k,9)>f(k,10) then f(k,10):=f(k,9) else f(k,9):=f(k,10); if f(k,11)>f(k,12) then f(k,12):=f(k,11) else f(k,11):=f(k,12); write(out,<:<12><10>n=:>,<<d >,k); for i:=2,4 step 1 until 13 do write(out,<:<10> :>,false add ch(i),1,<< -d.ddd ddd ddd'-dd >, f(k,i)); setposition(z,0,n2); inrec6(z,4); t:=z(1); repeat write(out,<:<10>:>,<<ddddd>,t); for j:=1 step 1 until n do begin inrec6(z,13*4); write(out,<<-ddd>,180-arg(-z(1),z(3))*(180/3.14159265)); if j=k then begin c(-ll):=c(0):=c(ll):='!'; for i:=2,4 step 1 until 13 do if f(k,i)>0 then c(z(i)/f(k,i)*ll):=ch(i); end; end; for i:=-ll step 1 until ll do begin outchar(out,c(i)); c(i):=' '; end; inrec6(z,4); t0:=t; t:=z(1); until t0>=t; end; end; outchar(out,'nl'); close(z,false); end; «eof»