CubeInt.Mod 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361
  1. (* CAPO - Computational Analysis Platform for Oberon - by Alan Freed and Felix Friedrich. *)
  2. (* Version 1, Update 2 *)
  3. MODULE CubeInt; (** AUTHOR "fof"; PURPOSE "3D matrix object of type Integer."; *)
  4. IMPORT SYSTEM, NbrInt, ArrayXdBytes, ArrayXd := ArrayXdInt, DataErrors, DataIO;
  5. CONST
  6. (** The version number used when reading/writing a cube to file. *)
  7. VERSION* = 1;
  8. TYPE
  9. Value* = ArrayXd.Value; Index* = LONGINT; Array* = ArrayXd.Array; Map* = ArrayXd.Map; ArrayC* = ArrayXd.Array3;
  10. (** Type Cube is DataIO registered, instances of it can therefore be made persistent. *)
  11. Cube* = OBJECT (Array)
  12. VAR lenx-, leny-, lenz-: LONGINT; (* lenx = nr.Columns, leny = nr.Rows *)
  13. ox-, oy-, oz-: LONGINT;
  14. Get-: PROCEDURE {DELEGATE} ( x, y, z: Index ): Value;
  15. (* override *)
  16. PROCEDURE AlikeX*( ): ArrayXdBytes.Array;
  17. VAR copy: Cube;
  18. BEGIN
  19. NEW( copy, origin[0], len[0], origin[1], len[1], origin[2], len[2] ); RETURN copy;
  20. END AlikeX;
  21. PROCEDURE NewRangeX*( neworigin, newlen: ArrayXdBytes.IndexArray; copydata: BOOLEAN );
  22. BEGIN
  23. IF LEN( newlen ) # 3 THEN HALT( 1001 ) END;
  24. NewRangeX^( neworigin, newlen, copydata );
  25. END NewRangeX;
  26. PROCEDURE ValidateCache*;
  27. BEGIN
  28. ValidateCache^;
  29. IF dim # 3 THEN HALT( 100 ) END;
  30. lenx := len[0]; leny := len[1]; lenz := len[2]; ox := origin[0]; oy := origin[1]; oz := origin[2];
  31. END ValidateCache;
  32. PROCEDURE SetBoundaryCondition*( c: SHORTINT ); (* called by new, load and directly *)
  33. BEGIN
  34. SetBoundaryCondition^( c );
  35. CASE c OF
  36. ArrayXd.StrictBoundaryC:
  37. Get := Get3;
  38. | ArrayXd.AbsorbingBoundaryC:
  39. Get := Get3BAbsorbing;
  40. | ArrayXd.PeriodicBoundaryC:
  41. Get := Get3BPeriodic;
  42. | ArrayXd.SymmetricOnBoundaryC:
  43. Get := Get3BSymmetricOnB
  44. | ArrayXd.SymmetricOffBoundaryC:
  45. Get := Get3BSymmetricOffB
  46. | ArrayXd.AntisymmetricOnBoundaryC:
  47. Get := Get3BAntisymmetricOnB
  48. | ArrayXd.AntisymmetricOffBoundaryC:
  49. Get := Get3BAntisymmetricOffB
  50. END;
  51. END SetBoundaryCondition;
  52. (** new *)
  53. PROCEDURE & New*( ox, w, oy, h, oz, d: LONGINT );
  54. BEGIN
  55. NewXdB( ArrayXdBytes.Array3( ox, oy, oz ), ArrayXdBytes.Array3( w, h, d ) );
  56. END New;
  57. PROCEDURE Alike*( ): Cube;
  58. VAR copy: ArrayXdBytes.Array;
  59. BEGIN
  60. copy := AlikeX(); RETURN copy( Cube );
  61. END Alike;
  62. PROCEDURE NewRange*( ox, w, oy, h, oz, d: LONGINT; copydata: BOOLEAN );
  63. BEGIN
  64. IF (w # len[0]) OR (h # len[1]) OR (d # len[2]) OR (ox # origin[0]) OR (oy # origin[1]) OR (oz # origin[2]) THEN
  65. NewRangeX^( ArrayXdBytes.Array3( ox, oy, oz ), ArrayXdBytes.Array3( w, h, d ), copydata )
  66. END;
  67. END NewRange;
  68. PROCEDURE Copy*( ): Cube;
  69. VAR res: ArrayXdBytes.Array;
  70. BEGIN
  71. res := CopyX(); RETURN res( Cube );
  72. END Copy;
  73. PROCEDURE Set*( x, y, z: Index; v: Value );
  74. BEGIN
  75. ArrayXdBytes.Set3( SELF, x, y, z, v );
  76. END Set;
  77. (** copy methods using the current boundary condition SELF.bc*)
  78. PROCEDURE CopyToVec*( dest: Array; dim: Index; srcx, srcy, srcz, destx, len: Index );
  79. VAR slen: ArrayXdBytes.IndexArray;
  80. BEGIN
  81. IF (dest.dim # 1) THEN HALT( 1003 ) END;
  82. slen := ArrayXdBytes.Index3( 1, 1, 1 ); slen[dim] := len;
  83. CopyToArray( dest, ArrayXdBytes.Index3( srcx, srcy, srcz ), slen, ArrayXdBytes.Index1( destx ),
  84. ArrayXdBytes.Index1( len ) );
  85. END CopyToVec;
  86. PROCEDURE CopyToMtx*( dest: Array; dimx, dimy: Index; srcx, srcy, srcz, destx, desty, lenx, leny: Index );
  87. VAR slen: ArrayXdBytes.IndexArray;
  88. BEGIN
  89. IF (dest.dim # 2) OR (dimx >= dimy) THEN HALT( 1005 ) END;
  90. slen := ArrayXdBytes.Index3( 1, 1, 1 ); slen[dimx] := lenx; slen[dimy] := leny;
  91. CopyToArray( dest, ArrayXdBytes.Index3( srcx, srcy, srcz ), slen, ArrayXdBytes.Index2( destx, desty ),
  92. ArrayXdBytes.Index2( lenx, leny ) );
  93. END CopyToMtx;
  94. PROCEDURE CopyToCube*( dest: Array; srcx, srcy, srcz, destx, desty, destz, lenx, leny, lenz: Index );
  95. VAR slen: ArrayXdBytes.IndexArray;
  96. BEGIN
  97. IF (dest.dim # 3) THEN HALT( 1005 ) END;
  98. slen := ArrayXdBytes.Index3( lenx, leny, lenz );
  99. CopyToArray( dest, ArrayXdBytes.Index3( srcx, srcy, srcz ), slen, ArrayXdBytes.Index3( destx, desty, destz ), slen );
  100. END CopyToCube;
  101. PROCEDURE CopyToHCube*( dest: Array; dimx, dimy, dimz: Index;
  102. srcx, srcy, srcz, destx, desty, destz, destt, lenx, leny, lenz: Index );
  103. VAR slen: ArrayXdBytes.IndexArray;
  104. BEGIN
  105. IF (dest.dim # 4) OR (dimx >= dimy) OR (dimy >= dimz) THEN HALT( 1005 ) END;
  106. slen := ArrayXdBytes.Index4( 1, 1, 1, 1 ); slen[dimx] := lenx; slen[dimy] := leny; slen[dimz] := lenz;
  107. CopyToArray( dest, ArrayXdBytes.Index3( srcx, srcy, srcz ), ArrayXdBytes.Index3( lenx, leny, lenz ),
  108. ArrayXdBytes.Index4( destx, desty, destz, destt ), slen );
  109. END CopyToHCube;
  110. PROCEDURE CopyTo1dArray*( VAR dest: ARRAY OF Value; sx, sy, sz, slenx, sleny, slenz: Index; dpos, dlen: LONGINT );
  111. VAR destm: ArrayXdBytes.ArrayMemoryStructure;
  112. BEGIN
  113. destm :=
  114. ArrayXdBytes.MakeMemoryStructure( 1, ArrayXdBytes.Index1( 0 ), ArrayXdBytes.Index1( LEN( dest ) ), SIZEOF( Value ),
  115. ADDRESSOF( dest[0] ) );
  116. ArrayXd.CopyArrayToArrayPartB( SELF, destm, bc, ArrayXdBytes.Index3( sx, sy, sz ),
  117. ArrayXdBytes.Index3( slenx, sleny, slenz ), ArrayXdBytes.Index1( dpos ),
  118. ArrayXdBytes.Index1( dlen ) );
  119. END CopyTo1dArray;
  120. PROCEDURE CopyTo2dArray*( VAR dest: ARRAY OF ARRAY OF Value; sx, sy, sz, slenx, sleny, slenz: Index;
  121. dposx, dposy, dlenx, dleny: LONGINT );
  122. VAR destm: ArrayXdBytes.ArrayMemoryStructure;
  123. BEGIN
  124. destm :=
  125. ArrayXdBytes.MakeMemoryStructure( 2, ArrayXdBytes.Index2( 0, 0 ), ArrayXdBytes.Index2( LEN( dest, 1 ), LEN( dest, 0 ) ),
  126. SIZEOF( Value ), ADDRESSOF( dest[0, 0] ) );
  127. ArrayXd.CopyArrayToArrayPartB( SELF, destm, bc, ArrayXdBytes.Index3( sx, sy, sz ),
  128. ArrayXdBytes.Index3( slenx, sleny, slenz ), ArrayXdBytes.Index2( dposx, dposy ),
  129. ArrayXdBytes.Index2( dlenx, dleny ) );
  130. END CopyTo2dArray;
  131. PROCEDURE CopyTo3dArray*( VAR dest: ARRAY OF ARRAY OF ARRAY OF Value; sx, sy, sz, slenx, sleny, slenz: Index;
  132. dposx, dposy, dposz, dlenx, dleny, dlenz: LONGINT );
  133. VAR destm: ArrayXdBytes.ArrayMemoryStructure;
  134. BEGIN
  135. destm :=
  136. ArrayXdBytes.MakeMemoryStructure( 3, ArrayXdBytes.Index3( 0, 0, 0 ),
  137. ArrayXdBytes.Index3( LEN( dest, 2 ), LEN( dest, 1 ), LEN( dest, 0 ) ), SIZEOF( Value ),
  138. ADDRESSOF( dest[0, 0, 0] ) );
  139. ArrayXd.CopyArrayToArrayPartB( SELF, destm, bc, ArrayXdBytes.Index3( sx, sy, sz ),
  140. ArrayXdBytes.Index3( slenx, sleny, slenz ),
  141. ArrayXdBytes.Index3( dposx, dposy, dposz ),
  142. ArrayXdBytes.Index3( dlenx, dleny, dlenz ) );
  143. END CopyTo3dArray;
  144. PROCEDURE CopyTo4dArray*( VAR dest: ARRAY OF ARRAY OF ARRAY OF ARRAY OF Value; sx, sy, sz, slenx, sleny, slenz: Index;
  145. dposx, dposy, dposz, dpost, dlenx, dleny, dlenz, dlent: LONGINT );
  146. VAR destm: ArrayXdBytes.ArrayMemoryStructure;
  147. BEGIN
  148. destm :=
  149. ArrayXdBytes.MakeMemoryStructure( 4, ArrayXdBytes.Index4( 0, 0, 0, 0 ),
  150. ArrayXdBytes.Index4( LEN( dest, 3 ), LEN( dest, 2 ), LEN( dest, 1 ), LEN( dest, 0 ) ), SIZEOF( Value ),
  151. ADDRESSOF( dest[0, 0, 0, 0] ) );
  152. ArrayXd.CopyArrayToArrayPartB( SELF, destm, bc, ArrayXdBytes.Index3( sx, sy, sz ),
  153. ArrayXdBytes.Index3( slenx, sleny, slenz ),
  154. ArrayXdBytes.Index4( dposx, dposy, dposz, dpost ),
  155. ArrayXdBytes.Index4( dlenx, dleny, dlenz, dlent ) );
  156. END CopyTo4dArray;
  157. (** copy from without boundary conditions *)
  158. PROCEDURE CopyFrom1dArray*( VAR src: ARRAY OF Value; spos, slen: Index; dx, dy, dz, dlenx, dleny, dlenz: Index );
  159. VAR srcm: ArrayXdBytes.ArrayMemoryStructure;
  160. BEGIN
  161. srcm :=
  162. ArrayXdBytes.MakeMemoryStructure( 1, ArrayXdBytes.Index1( 0 ), ArrayXdBytes.Index1( LEN( src ) ), SIZEOF( Value ),
  163. ADDRESSOF( src[0] ) );
  164. ArrayXdBytes.CopyArrayPartToArrayPart( srcm, SELF, ArrayXdBytes.Index1( spos ), ArrayXdBytes.Index1( slen ),
  165. ArrayXdBytes.Index3( dx, dy, dz ),
  166. ArrayXdBytes.Index3( dlenx, dleny, dlenz ) );
  167. END CopyFrom1dArray;
  168. PROCEDURE CopyFrom2dArray*( VAR src: ARRAY OF ARRAY OF Value; sposx, spoxy, slenx, sleny: Index;
  169. dx, dy, dz, dlenx, dleny, dlenz: Index );
  170. VAR srcm: ArrayXdBytes.ArrayMemoryStructure;
  171. BEGIN
  172. srcm :=
  173. ArrayXdBytes.MakeMemoryStructure( 2, ArrayXdBytes.Index2( 0, 0 ), ArrayXdBytes.Index2( LEN( src, 1 ), LEN( src, 0 ) ),
  174. SIZEOF( Value ), ADDRESSOF( src[0, 0] ) );
  175. ArrayXdBytes.CopyArrayPartToArrayPart( srcm, SELF, ArrayXdBytes.Index2( sposx, spoxy ),
  176. ArrayXdBytes.Index2( slenx, sleny ), ArrayXdBytes.Index3( dx, dy, dz ),
  177. ArrayXdBytes.Index3( dlenx, dleny, dlenz ) );
  178. END CopyFrom2dArray;
  179. PROCEDURE CopyFrom3dArray*( VAR src: ARRAY OF ARRAY OF ARRAY OF Value; sposx, spoxy, sposz, slenx, sleny, slenz: Index;
  180. dx, dy, dz, dlenx, dleny, dlenz: Index );
  181. VAR srcm: ArrayXdBytes.ArrayMemoryStructure;
  182. BEGIN
  183. srcm :=
  184. ArrayXdBytes.MakeMemoryStructure( 3, ArrayXdBytes.Index3( 0, 0, 0 ),
  185. ArrayXdBytes.Index3( LEN( src, 2 ), LEN( src, 1 ), LEN( src, 0 ) ), SIZEOF( Value ),
  186. ADDRESSOF( src[0, 0, 0] ) );
  187. ArrayXdBytes.CopyArrayPartToArrayPart( srcm, SELF, ArrayXdBytes.Index3( sposx, spoxy, sposz ),
  188. ArrayXdBytes.Index3( slenx, sleny, slenz ),
  189. ArrayXdBytes.Index3( dx, dy, dz ),
  190. ArrayXdBytes.Index3( dlenx, dleny, dlenz ) );
  191. END CopyFrom3dArray;
  192. PROCEDURE CopyFrom4dArray*( VAR src: ARRAY OF ARRAY OF ARRAY OF ARRAY OF Value;
  193. sposx, spoxy, sposz, spost, slenx, sleny, slenz, slent: Index;
  194. dx, dy, dz, dlenx, dleny, dlenz: Index );
  195. VAR srcm: ArrayXdBytes.ArrayMemoryStructure;
  196. BEGIN
  197. srcm :=
  198. ArrayXdBytes.MakeMemoryStructure( 4, ArrayXdBytes.Index4( 0, 0, 0, 0 ),
  199. ArrayXdBytes.Index4( LEN( src, 3 ), LEN( src, 2 ), LEN( src, 1 ), LEN( src, 0 ) ), SIZEOF( Value ),
  200. ADDRESSOF( src[0, 0, 0, 0] ) );
  201. ArrayXdBytes.CopyArrayPartToArrayPart( srcm, SELF, ArrayXdBytes.Index4( sposx, spoxy, sposz, spost ),
  202. ArrayXdBytes.Index4( slenx, sleny, slenz, slent ),
  203. ArrayXdBytes.Index3( dx, dy, dz ),
  204. ArrayXdBytes.Index3( dlenx, dleny, dlenz ) );
  205. END CopyFrom4dArray;
  206. END Cube;
  207. OPERATOR ":="*( VAR l: Cube; VAR r: ARRAY OF ARRAY OF ARRAY OF Value );
  208. BEGIN
  209. (* IF r = NIL THEN l := NIL; RETURN END; *)
  210. IF l = NIL THEN NEW( l, 0, LEN( r, 2 ), 0, LEN( r, 1 ), 0, LEN( r, 0 ) ); ELSE l.NewRange( 0, LEN( r, 2 ), 0, LEN( r, 1 ), 0, LEN( r, 0 ), FALSE ); END;
  211. ArrayXdBytes.CopyMemoryToArrayPart( ADDRESSOF( r[0, 0, 0] ), l, LEN( r, 0 ) * LEN( r, 1 ) * LEN( r, 2 ), NIL , NIL );
  212. END ":=";
  213. OPERATOR ":="*( VAR l: Cube; r: Value );
  214. BEGIN
  215. IF l # NIL THEN ArrayXd.Fill( l, r ); END;
  216. END ":=";
  217. OPERATOR "+"*( l, r: Cube ): Cube;
  218. VAR res: Cube;
  219. BEGIN
  220. res := l.Alike(); ArrayXd.Add( l, r, res ); RETURN res;
  221. END "+";
  222. OPERATOR "-"*( l, r: Cube ): Cube;
  223. VAR res: Cube;
  224. BEGIN
  225. res := l.Alike(); ArrayXd.Sub( l, r, res ); RETURN res;
  226. END "-";
  227. OPERATOR "+"*( l: Cube; r: Value ): Cube;
  228. VAR res: Cube;
  229. BEGIN
  230. res := l.Alike(); ArrayXd.AddAV( l, r, res ); RETURN res;
  231. END "+";
  232. OPERATOR "+"*( l: Value; r: Cube ): Cube;
  233. BEGIN
  234. RETURN r + l
  235. END "+";
  236. OPERATOR "-"*( l: Cube; r: Value ): Cube;
  237. VAR res: Cube;
  238. BEGIN
  239. res := l.Alike(); ArrayXd.SubAV( l, r, res ); RETURN res;
  240. END "-";
  241. OPERATOR "-"*( l: Value; r: Cube ): Cube;
  242. VAR res: Cube;
  243. BEGIN
  244. res := r.Alike(); ArrayXd.SubVA( l, r, res ); RETURN res;
  245. END "-";
  246. OPERATOR "-"*( l: Cube ): Cube;
  247. BEGIN
  248. RETURN 0 - l;
  249. END "-";
  250. OPERATOR "*"*( l: Cube; r: Value ): Cube;
  251. VAR res: Cube;
  252. BEGIN
  253. res := l.Alike(); ArrayXd.MulAV( l, r, res ); RETURN res;
  254. END "*";
  255. OPERATOR "*"*( l: Value; r: Cube ): Cube;
  256. BEGIN
  257. RETURN r * l;
  258. END "*";
  259. OPERATOR "DIV"*( l: Cube; r: Value ): Cube;
  260. VAR res: Cube;
  261. BEGIN
  262. res := l.Alike(); ArrayXd.DivAV( l, r, res ); RETURN res;
  263. END "DIV";
  264. OPERATOR "DIV"*( l: Value; r: Cube ): Cube;
  265. VAR res: Cube;
  266. BEGIN
  267. res := r.Alike(); ArrayXd.DivVA( l, r, res ); RETURN res;
  268. END "DIV";
  269. OPERATOR "MOD"*( l: Cube; r: Value ): Cube;
  270. VAR res: Cube;
  271. BEGIN
  272. res := l.Alike(); ArrayXd.ModAV( l, r, res ); RETURN res;
  273. END "MOD";
  274. OPERATOR "MOD"*( l: Value; r: Cube ): Cube;
  275. VAR res: Cube;
  276. BEGIN
  277. res := r.Alike(); ArrayXd.ModVA( l, r, res ); RETURN res;
  278. END "MOD";
  279. (* The procedures needed to register type Cube so that its instances can be made persistent. *)
  280. PROCEDURE LoadCube( R: DataIO.Reader; VAR obj: OBJECT );
  281. VAR a: Cube; version: SHORTINT; ver: NbrInt.Integer;
  282. BEGIN
  283. R.RawSInt( version );
  284. IF version = -1 THEN
  285. obj := NIL (* Version tag is -1 for NIL. *)
  286. ELSIF version = VERSION THEN NEW( a, 0, 0, 0, 0, 0, 0 ); a.Read( R ); obj := a
  287. ELSE ver := version; DataErrors.IntError( ver, "Alien version number encountered." ); HALT( 1000 )
  288. END
  289. END LoadCube;
  290. PROCEDURE StoreCube( W: DataIO.Writer; obj: OBJECT );
  291. VAR a: Cube;
  292. BEGIN
  293. IF obj = NIL THEN W.RawSInt( -1 ) ELSE W.RawSInt( VERSION ); a := obj( Cube ); a.Write( W ) END
  294. END StoreCube;
  295. PROCEDURE Register;
  296. VAR a: Cube;
  297. BEGIN
  298. NEW( a, 0, 0, 0, 0, 0, 0 ); DataIO.PlugIn( a, LoadCube, StoreCube )
  299. END Register;
  300. (** Load and Store are procedures for external use that read/write an instance of Cube from/to a file. *)
  301. PROCEDURE Load*( R: DataIO.Reader; VAR obj: Cube );
  302. VAR ptr: OBJECT;
  303. BEGIN
  304. R.Object( ptr ); obj := ptr( Cube )
  305. END Load;
  306. PROCEDURE Store*( W: DataIO.Writer; obj: Cube );
  307. BEGIN
  308. W.Object( obj )
  309. END Store;
  310. BEGIN
  311. Register
  312. END CubeInt.