-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpmC2IPLibrary.clw
More file actions
1042 lines (881 loc) · 35.6 KB
/
Copy pathpmC2IPLibrary.clw
File metadata and controls
1042 lines (881 loc) · 35.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
MEMBER('learnMil')
MAP
END
INCLUDE('Equates.CLW'),ONCE
INCLUDE('pmC2IPLibrary.INC'),ONCE
! Local objects
! JSON objects
json JSONClass
collection &JSONClass
! string theory objects
sst stringtheory
BSO.Construct PROCEDURE()
CODE
BSO.Destruct PROCEDURE()
CODE
UnitsCollection.Construct PROCEDURE()
CODE
SELF.ul &= NEW(UnitsQueue)
SELF.tmpul &=NEW(UnitsQueue)
! collection
SELF.collection &= NEW(UnitsClassQueue)
UnitsCollection.Destruct PROCEDURE()
CODE
! collection
DISPOSE(SELF.collection)
DISPOSE(SELF.tmpul)
DISPOSE(SELF.ul)
UnitsCollection.prepRndName PROCEDURE
tmpUnitName STRING(100)
CODE
LOOP 10 TIMES
tmpUnitName = CLIP(tmpUnitName) & CHR(RANDOM(97, 122))
END
RETURN tmpUnitName
UnitsCollection.insertFirstNode PROCEDURE
CODE
!sst.Trace('START:UnitsCollection.insertFirstNode')
SELF.ul.UnitName = SELF.prepRndName()
!SELF.ul.UnitType = uTpy:notDefined
SELF.ul.UnitTypeCode = ''
SELF.ul.Echelon = echTpy:notDefined
SELF.ul.Hostility = hTpy:Unknown
SELF.ul.IsHQ = FALSE
SELF.ul.xPos = 1
SELF.ul.yPos = 1
SELF.ul.TreePos = 1
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
ADD(SELF.ul)
IF NOT ERRORCODE() THEN
SELF.selTreePos = 1
SELF.maxTreePos = 1
SELF.selQueuePos = POINTER(SELF.ul)
!sst.Trace('SELF.selTreePos = ' & SELF.selTreePos)
!sst.Trace('SELF.maxTreePos = ' & SELF.maxTreePos)
!sst.Trace('SELF.selQueuePos = ' & SELF.selQueuePos)
ELSE
!sst.Trace('ADD(SELF.ul) error')
END
!sst.Trace('END:UnitsCollection.insertFirstNode')
UnitsCollection.prepNewNode PROCEDURE(LONG nNewRecPosition)
CODE
!sst.Trace('START:UnitsCollection.prepNewNode')
CLEAR(SELF.urec)
SELF.urec.TreePos = SELF.selTreePos
SELF.urec.UnitName = SELF.prepRndName()
! Unit Type, Echelon and IsHQ are similare as the current ones
SELF.urec.UnitType = SELF.ul.UnitType
SELF.urec.UnitTypeCode = SELF.ul.UnitTypeCode
SELF.urec.Echelon = SELF.ul.Echelon
SELF.ul.Hostility = SELF.ul.Hostility
SELF.urec.IsHQ = SELF.ul.IsHQ
SELF.urec.xPos = (SELF.urec.TreePos-1)*50 + 1
SELF.urec.yPos = (nNewRecPosition - 1)*30 + 1
!sst.Trace('END:UnitsCollection.prepNewNode')
UnitsCollection.moveNodesToTmp PROCEDURE(LONG nStartPos, LONG nEndPos)
CODE
!sst.Trace('START:UnitsCollection.moveNodesToTmp')
FREE(SELF.tmpul)
LOOP i# = nStartPos TO nEndPos
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
SELF.tmpul.TreePos = SELF.ul.TreePos
SELF.tmpul.UnitName = SELF.ul.UnitName
SELF.tmpul.UnitType = SELF.ul.UnitType
SELF.tmpul.UnitTypeCode = SELF.ul.UnitTypeCode
SELF.tmpul.Echelon = SELF.ul.Echelon
SELF.tmpul.Hostility = SELF.ul.Hostility
SELF.tmpul.xPos = SELF.ul.xPos
SELF.tmpul.yPos = SELF.ul.yPos + 30
ADD(SELF.tmpul)
END
END
!sst.Trace('END:UnitsCollection.moveNodesToTmp')
UnitsCollection.addEmptyNode PROCEDURE
CODE
!sst.Trace('START:UnitsCollection.insertEmptyNode')
ADD(SELF.ul)
IF NOT ERRORCODE() THEN
END
!sst.Trace('END:UnitsCollection.insertEmptyNode')
UnitsCollection.insertCurrentPrepNode PROCEDURE(LONG nPosition)
CODE
!sst.Trace('START:UnitsCollection.insertCurrentNode')
GET(SELF.ul, nPosition)
IF NOT ERRORCODE() THEN
SELF.ul.TreePos = SELF.urec.TreePos
SELF.ul.UnitName = SELF.urec.UnitName
SELF.ul.UnitType = SELF.urec.UnitType
SELF.ul.UnitTypeCode = SELF.urec.UnitTypeCode
SELF.ul.Echelon = SELF.urec.Echelon
SELF.ul.Hostility = SELF.urec.Hostility
SELF.ul.xPos = SELF.urec.xPos
SELF.ul.yPos = SELF.urec.yPos
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
PUT(SELF.ul)
END
!sst.Trace('END:UnitsCollection.insertCurrentNode')
UnitsCollection.moveNodesBackFromTmp PROCEDURE(LONG nStartPos)
CODE
!sst.Trace('START:UnitsCollection.moveNodesBackFromTmp')
j# = 0
LOOP i# = nStartPos TO RECORDS(SELF.ul)
j# = j# + 1
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
GET(SELF.tmpul, j#)
IF NOT ERRORCODE() THEN
SELF.ul.TreePos = SELF.tmpul.TreePos
SELF.ul.UnitName = SELF.tmpul.UnitName
SELF.ul.UnitType = SELF.tmpul.UnitType
SELF.ul.UnitTypeCode = SELF.tmpul.UnitTypeCode
SELF.ul.Echelon = SELF.tmpul.Echelon
SELF.ul.Hostility = SELF.tmpul.Hostility
SELF.ul.xPos = SELF.tmpul.xPos
SELF.ul.yPos = SELF.tmpul.yPos
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
PUT(SELF.ul)
END
END
END
!sst.Trace('END:UnitsCollection.moveNodesBackFromTmp')
UnitsCollection.insertLastNode PROCEDURE()
CODE
!sst.Trace('START:UnitsCollection.insertLastNode')
SELF.ul.TreePos = SELF.urec.TreePos
SELF.ul.UnitName = SELF.urec.UnitName
SELF.ul.UnitType = SELF.urec.UnitType
SELF.ul.UnitTypeCode = SELF.urec.UnitTypeCode
SELF.ul.Echelon = SELF.urec.Echelon
SELF.ul.Hostility = SELF.urec.Hostility
SELF.ul.xPos = SELF.urec.xPos
SELF.ul.yPos = SELF.urec.yPos
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
ADD(SELF.ul)
IF NOT ERRORCODE() THEN
SELF.selQueuePos = POINTER(SELF.ul)
SELF.selTreePos = SELF.ul.TreePos
!sst.Trace('SELF.selTreePos = ' & SELF.selTreePos)
!sst.Trace('SELF.maxTreePos = ' & SELF.maxTreePos)
!sst.Trace('SELF.selQueuePos = ' & SELF.selQueuePos)
ELSE
!sst.Trace('ADD(SELF.ul) error')
END
!sst.Trace('END:UnitsCollection.insertLastNode')
UnitsCollection.InsertNode PROCEDURE
tmpUnitName STRING(100)
CODE
! insert a new node to the current collection
!sst.Trace('START:UnitsCollection.InsertNode')
tmpUnitName = SELF.prepRndName()
IF RECORDS(SELF.ul) = 0 THEN
! 1st records
!sst.Trace('1st queue record')
!sst.Trace('CALL:SELF.insertFirstNode()')
SELF.insertFirstNode()
ELSE
! inside the queue
!sst.Trace('inside the queue')
! increment Tree Position
!sst.Trace('increment Tree Position')
SELF.selTreePos = SELF.ul.TreePos + 1
IF SELF.selTreePos > SELF.maxTreePos THEN
SELF.maxTreePos = SELF.selTreePos
END
! preserve current position and all records number
!sst.Trace('preserve current position and all records number')
allPos# = RECORDS(SELF.ul)
! prepare the new record
!sst.Trace('prepare the new record')
!sst.Trace('CALL:SELF.prepNewNode()')
SELF.prepNewNode(SELF.selQueuePos + 1)
! check the position inside the queue
! move to the temporary queue
! change yPos values
!sst.Trace('check the position inside the queue')
IF (SELF.selQueuePos + 1) < (allPos# + 1) THEN
! in the middle of queue
!sst.Trace('in the middle of queue')
!sst.Trace('CALL:SELF.moveNodesToTmp(SELF.selQueuePos + 1, allPos#)')
SELF.moveNodesToTmp(SELF.selQueuePos + 1, allPos#)
! add empty record
!sst.Trace('add empty record')
!sst.Trace('CALL:SELF.addEmptyNode()')
SELF.addEmptyNode()
! insert current record
!sst.Trace('insert current record')
!sst.Trace('CALL:SELF.insertCurrentNode(SELF.selQueuePos + 1)')
SELF.insertCurrentPrepNode(SELF.selQueuePos + 1)
! copy back records
!sst.Trace('copy back records')
IF POINTER(SELF.tmpul) > 0 THEN
!sst.Trace('CALL:SELF.moveNodesBackFromTmp(SELF.selQueuePos + 2)')
SELF.moveNodesBackFromTmp(SELF.selQueuePos + 2)
END
! get new current Position
!sst.Trace('get new current Position')
SELF.selQueuePos = SELF.selQueuePos + 1
GET(SELF.ul, SELF.selQueuePos + 1)
IF NOT ERRORCODE() THEN
SELF.selTreePos = SELF.ul.TreePos
END
ELSE
! last on queue
!sst.Trace('last on queue')
!sst.Trace('CALL:SELF.insertLastNode()')
SELF.insertLastNode()
END
END
!sst.Trace('SELF.selTreePos = ' & SELF.selTreePos)
!sst.Trace('SELF.maxTreePos = ' & SELF.maxTreePos)
!sst.Trace('SELF.selQueuePos = ' & SELF.selQueuePos)
!sst.Trace('END:UnitsCollection.InsertNode')
UnitsCollection.InsertNode PROCEDURE(*UnitBasicRecord pURec)
tmpUnitName STRING(100)
CODE
! do something
tmpUnitName = ''
LOOP 10 TIMES
tmpUnitName = CLIP(tmpUnitName) & CHR(RANDOM(97, 122))
END
IF RECORDS(SELF.ul) = 0 THEN
! 1st records
SELF.ul.UnitName = pUrec.UnitName
SELF.ul.UnitType = pURec.UnitType
SELF.ul.UnitTypeCode = pURec.UnitTypeCode
SELF.ul.Echelon = pUrec.Echelon
SELF.ul.Hostility = pUrec.Hostility
SELF.ul.IsHQ = pUrec.IsHQ
SELF.ul.xPos = 1
SELF.ul.yPos = 1
SELF.ul.TreePos = 1
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
ADD(SELF.ul)
SELF.selTreePos = 1
SELF.maxTreePos = 1
SELF.selQueuePos = 1
ELSE
! inside the queue
! increment Tree Position
SELF.selTreePos = SELF.ul.TreePos + 1
IF SELF.selTreePos > SELF.maxTreePos THEN
SELF.maxTreePos = SELF.selTreePos
END
curentPos# = POINTER(SELF.ul)
allPos# = RECORDS(SELF.ul)
SELF.selQueuePos = curentPos#
! prepare the new record
CLEAR(SELF.urec)
SELF.urec.TreePos = SELF.selTreePos
SELF.urec.UnitName = pUrec.UnitName
! Unit Type, Echelon and IsHQ are similare as the current ones
SELF.urec.UnitType = pUrec.UnitType
SELF.urec.UnitTypeCode = pUrec.UnitTypeCode
SELF.urec.Echelon = pUrec.Echelon
SELF.urec.Hostility = pUrec.Hostility
SELF.urec.IsHQ = pUrec.IsHQ
SELF.urec.xPos = (SELF.urec.TreePos-1)*50 + 1
SELF.urec.yPos = curentPos#*30 + 1
! move to temporary queue
! move yPos
IF curentPos# < allPos# THEN
! in the middle of queue
FREE(SELF.tmpul)
LOOP i# = (curentPos#+1) TO allPos#
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
SELF.tmpul.TreePos = SELF.ul.TreePos
SELF.tmpul.UnitName = SELF.ul.UnitName
SELF.tmpul.UnitType = SELF.ul.UnitType
SELF.tmpul.UnitTypeCode = SELF.ul.UnitTypeCode
SELF.tmpul.Echelon = SELF.ul.Echelon
SELF.tmpul.Hostility = SELF.ul.Hostility
SELF.tmpul.IsHQ = SELF.ul.IsHQ
SELF.tmpul.xPos = SELF.ul.xPos
SELF.tmpul.yPos = SELF.ul.yPos + 30
ADD(SELF.tmpul)
END
END
! add empty record
ADD(SELF.ul)
! insert current record
GET(SELF.ul, curentPos#+1)
IF NOT ERRORCODE() THEN
SELF.ul.TreePos = SELF.urec.TreePos
SELF.ul.UnitName = SELF.urec.UnitName
SELF.ul.UnitType = SELF.urec.UnitType
SELF.ul.UnitTypeCode = SELF.urec.UnitTypeCode
SELF.ul.Echelon = SELF.urec.Echelon
SELF.ul.Hostility = SELF.urec.Hostility
SELF.ul.xPos = SELF.urec.xPos
SELF.ul.yPos = SELF.urec.yPos
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
PUT(SELF.ul)
END
! copy back records
IF POINTER(SELF.tmpul)>0 THEN
j# = 0
LOOP i# = (curentPos#+2) TO RECORDS(SELF.ul)
j# = j# + 1
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
GET(SELF.tmpul, j#)
IF NOT ERRORCODE() THEN
SELF.ul.TreePos = SELF.tmpul.TreePos
SELF.ul.UnitName = SELF.tmpul.UnitName
SELF.ul.UnitType = SELF.tmpul.UnitType
SELF.ul.UnitTypeCode = SELF.tmpul.UnitTypeCode
SELF.ul.Echelon = SELF.tmpul.Echelon
SELF.ul.Hostility = SELF.tmpul.Hostility
SELF.ul.xPos = SELF.tmpul.xPos
SELF.ul.yPos = SELF.tmpul.yPos
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
PUT(SELF.ul)
END
END
END
END
! current Position
GET(SELF.ul, curentPos# + 1)
IF NOT ERRORCODE() THEN
SELF.selTreePos = SELF.ul.TreePos
END
ELSE
! last on queue
SELF.ul.TreePos = SELF.urec.TreePos
SELF.ul.UnitName = SELF.urec.UnitName
SELF.ul.UnitType = SELF.urec.UnitType
SELF.ul.UnitTypeCode = SELF.urec.UnitTypeCode
SELF.ul.Echelon = SELF.urec.Echelon
SELF.ul.Hostility = SELF.urec.Hostility
SELF.ul.xPos = SELF.urec.xPos
SELF.ul.yPos = SELF.urec.yPos
SELF.ul.markForDel = FALSE
SELF.ul.markForDisbl = FALSE
ADD(SELF.ul)
END
SELF.selQueuePos = POINTER(SELF.ul)
SELF.selTreePos = SELF.ul.TreePos
END
RETURN TRUE
UnitsCollection.InsertNode PROCEDURE(*BSO pBSO)
CODE
UnitsCollection.AddNode PROCEDURE(*UnitBasicRecord pUrec)
CODE
SELF.ul.UnitName = pUrec.UnitName
SELF.ul.UnitType = pURec.UnitType
SELF.ul.UnitTypeCode = pURec.UnitTypeCode
SELF.ul.Echelon = pUrec.Echelon
SELF.ul.Hostility = pUrec.Hostility
SELF.ul.IsHQ = pUrec.IsHQ
SELF.ul.xPos = pUrec.xPos
SELF.ul.yPos = pUrec.yPos
!SELF.ul.TreePos = 1
!SELF.ul.markForDel = FALSE
!SELF.ul.markForDisbl = FALSE
ADD(SELF.ul)
SELF.selQueuePos = POINTER(SELF.ul)
!MESSAGE('Units = ' & RECORDS(SELF.ul))
RETURN TRUE
UnitsCollection.GetNode PROCEDURE(*UnitBasicRecord pURec)
CODE
! get current node
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
pUrec.UnitName = SELF.ul.UnitName
pUrec.UnitType = SELF.ul.UnitType
pUrec.UnitTypeCode = SELF.ul.UnitTypeCode
pUrec.Echelon = SELF.ul.Echelon
pURec.Hostility = SELF.ul.Hostility
pUrec.IsHQ = SELF.ul.IsHQ
pUrec.xPos = SELF.ul.xPos
pUrec.yPos = SELF.ul.yPos
pUrec.TreePos = SELF.ul.TreePos
RETURN TRUE
ELSE
RETURN FALSE
END
UnitsCollection.GetNode PROCEDURE(LONG nPointer, *UnitBasicRecord pURec)
CODE
! get current node
currPos# = POINTER(SELF.ul)
GET(SELF.ul, nPointer)
IF NOT ERRORCODE() THEN
pUrec.UnitName = SELF.ul.UnitName
pUrec.UnitType = SELF.ul.UnitType
pUrec.UnitTypeCode = SELF.ul.UnitTypeCode
pUrec.Echelon = SELF.ul.Echelon
pURec.Hostility = SELF.ul.Hostility
pUrec.IsHQ = SELF.ul.IsHQ
pUrec.xPos = SELF.ul.xPos
pUrec.yPos = SELF.ul.yPos
pUrec.TreePos = SELF.ul.TreePos
ret# = TRUE
ELSE
ret# = FALSE
END
GET(SELF.ul, currPos#)
RETURN ret#
UnitsCollection.GetNode PROCEDURE()
CODE
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
RETURN TRUE
ELSE
RETURN FALSE
END
Action.Construct PROCEDURE()
CODE
SELF.arec.ActionPoints &= NEW(PosList)
Action.Init PROCEDURE(*ActionBasicRecord pARec)
CODE
SELF.arec.ActionName = pArec.ActionName
SELF.arec.ActionPointsNumber = pArec.ActionPointsNumber
SELF.arec.ActionType = pArec.ActionType
SELF.arec.ActionTypeCode = pArec.ActionTypeCode
! action points
!SELF.arec.ActionPoints &= NEW(PosList)
LOOP i# = 1 TO RECORDS(pArec.ActionPoints)
GET(pArec.ActionPoints, i#)
IF NOT ERRORCODE() THEN
SELF.arec.ActionPoints.xPos = pArec.ActionPoints.xPos
SELF.arec.ActionPoints.yPos = pArec.ActionPoints.yPos
ADD(SELF.arec.ActionPoints)
! usual Position records
CASE i#
OF 1
SELF.xPos1 = pArec.ActionPoints.xPos
SELF.yPos1 = pArec.ActionPoints.yPos
SELF.lowestX = SELF.xPos1
SELF.lowestY = SELF.yPos1
OF 2
SELF.xPos2 = pArec.ActionPoints.xPos
SELF.yPos2 = pArec.ActionPoints.yPos
IF SELF.xPos2 < SELF.lowestX THEN
SELF.lowestX = SELF.xPos2
ELSE
SELF.highestX = SELF.xPos2
END
IF SELF.yPos2 < SELF.lowestY THEN
SELF.lowestY = SELF.yPos2
ELSE
SELF.highestY = SELF.yPos2
END
ELSE
! lowest & highest
IF pArec.ActionPoints.xPos < SELF.lowestX THEN
SELF.lowestX = pArec.ActionPoints.xPos
END
IF pArec.ActionPoints.xPos > SELF.highestX THEN
SELF.highestX = pArec.ActionPoints.xPos
END
IF pArec.ActionPoints.yPos < SELF.lowestY THEN
SELF.lowestY = pArec.ActionPoints.yPos
END
IF pArec.ActionPoints.yPos > SELF.highestY THEN
SELF.highestY = pArec.ActionPoints.yPos
END
END
END
END
!SELF.arec.xPos = pArec.xPos
!SELF.arec.yPos = pArec.yPos
RETURN TRUE
Action.Destruct PROCEDURE()
CODE
DISPOSE(SELF.arec.ActionPoints)
Action.ComputeSelectRectangle PROCEDURE()
CODE
LOOP i# = 1 TO RECORDS(SELF.arec.ActionPoints)
GET(SELF.arec.ActionPoints, i#)
IF NOT ERRORCODE() THEN
x# = SELF.arec.ActionPoints.xPos
y# = SELF.arec.ActionPoints.yPos
! usual Position records
CASE i#
OF 1
SELF.lowestX = x#
SELF.lowestY = y#
OF 2
IF x# < SELF.lowestX THEN
SELF.lowestX = x#
ELSE
SELF.highestX = x#
END
IF y# < SELF.lowestY THEN
SELF.lowestY = y#
ELSE
SELF.highestY = y#
END
ELSE
! lowest & highest
IF x# < SELF.lowestX THEN
SELF.lowestX = x#
END
IF x# > SELF.highestX THEN
SELF.highestX = x#
END
IF y# < SELF.lowestY THEN
SELF.lowestY = y#
END
IF y# > SELF.highestY THEN
SELF.highestY = y#
END
END
END
END
Action.GetAnchorPoints PROCEDURE(*LONG pLowestX, *LONG pLowestY, *LONG pHighestX, *LONG pHighestY)
CODE
SELF.ComputeSelectRectangle()
pLowestX = SELF.lowestX
pLowestY = SELF.lowestY
pHighestX = SELF.highestX
pHighestY = SELF.highestY
RETURN TRUE
Action.SetText PROCEDURE(STRING sText)
CODE
SELF.arec.editableText = sText
RETURN TRUE
Action.CheckLineByMouse PROCEDURE(LONG nXPos, LONG nYPos)
CODE
currentSlope$ = (SELF.xPos1 - SELF.xPos2) / (SELF.yPos1 - SELF.yPos2)
computedSlope$ = (SELF.xPos1 - nXPos) / (SELF.yPos1 - nYPos)
!MESSAGE('slopes ' & currentSlope$ & ' vs. ' & computedSlope$)
IF ROUND(ABS(currentSlope$), 0.1) = ROUND(ABS(computedSlope$), 0.1) THEN
RETURN TRUE
ELSE
RETURN FALSE
END
Action.CheckRectangleByMouse PROCEDURE(LONG nXPos, LONG nYPos)
CODE
!sst.Trace('Action.CheckRectangleByMouse BEGIN')
IF (SELF.xPos1 <= nXPOs) AND (nXPos <= SELF.xPos2) AND |
(SELF.yPos1 <= nYPos) AND (nYPos <= SELF.yPos2) THEN
RETURN TRUE
ELSE
RETURN FALSE
END
!sst.Trace('Action.CheckRectangleByMouse END')
Action.CheckFreeHandByMouse PROCEDURE(LONG nXPos, LONG nYPos)
CODE
retVal# = FALSE
IF (SELF.lowestX <= nXPos) AND |
(nXPos <= SELF.highestX) AND |
(SELF.lowestY <= nYPos) AND |
(nYPos <= SELF.highestY) THEN
retVal# = TRUE
END
OMIT('_noCompile')
LOOP i# = 1 TO RECORDS(SELF.arec.ActionPoints)
GET(SELF.arec.ActionPoints, i#)
IF NOT ERRORCODE() THEN
IF i# = 1 THEN
xPos1# = SELF.arec.ActionPoints.xPos
yPos1# = SELF.arec.ActionPoints.yPos
END
IF i# = 2 THEN
xPos2# = SELF.arec.ActionPoints.xPos
yPos2# = SELF.arec.ActionPoints.yPos
currentSlope$ = (xPos1# - xPos2#) / (yPos1# - yPos2#)
computedSlope$ = (xPos1# - nXPos) / (yPos1# - nYPos)
IF ROUND(ABS(currentSlope$), 0.1) = ROUND(ABS(computedSlope$), 0.1) THEN
retVal# = TRUE
BREAK
END
END
IF i# > 2 THEN
xPos1# = xPos2#
yPos1# = yPos2#
xPos2# = SELF.arec.ActionPoints.xPos
yPos2# = SELF.arec.ActionPoints.yPos
currentSlope$ = (xPos1# - xPos2#) / (yPos1# - yPos2#)
computedSlope$ = (xPos1# - nXPos) / (yPos1# - nYPos)
IF ROUND(ABS(currentSlope$), 0.1) = ROUND(ABS(computedSlope$), 0.1) THEN
retVal# = TRUE
BREAK
END
END
END
END
_noCompile
RETURN retVal#
UnitsCollection.DeleteNode PROCEDURE
CODE
! do something
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
! Mark for deletion current record
currentTreePos# = SELF.ul.TreePos
SELF.ul.markForDel = TRUE
PUT(SELF.ul)
!DELETE(SELF.ul)
! Mark for deletion all below records in deeper tree postions
LOOP i# = POINTER(SELF.ul)+1 TO RECORDS(SELF.ul)
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
IF SELF.ul.TreePos > currentTreePos# THEN
SELF.ul.markForDel = TRUE
PUT(SELF.ul)
ELSE
BREAK
END
END
END
END
! Remove all marked for deletion records
i# = 1
LOOP
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
IF SELF.ul.markForDel = TRUE THEN
DELETE(SELF.ul)
IF ERRORCODE() THEN
BREAK
END
i# = 1
ELSE
SELF.ul.yPos = (POINTER(SELF.ul)-1)*30 + 1
PUT(SELF.ul)
i# = i# + 1
END
ELSE
BREAK
END
END
UnitsCollection.DisableNode PROCEDURE
CODE
! do something
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
! Mark for disableling for new drag&drop selection
SELF.ul.markForDisbl = TRUE
PUT(SELF.ul)
END
UnitsCollection.SelUp PROCEDURE
CODE
! do something
IF SELF.selQueuePos>1 THEN
SELF.selQueuePos = SELF.selQueuePos-1
RETURN TRUE
ELSE
RETURN FALSE
END
UnitsCollection.SelDown PROCEDURE
CODE
! do something
IF SELF.selQueuePos<RECORDS(SELF.ul) THEN
SELF.selQueuePos = SELF.selQueuePos+1
RETURN TRUE
ELSE
RETURN FALSE
END
UnitsCollection.SelLeft PROCEDURE
CODE
! do something
RETURN TRUE
UnitsCollection.SelRight PROCEDURE
CODE
! do something
RETURN TRUE
UnitsCollection.Records PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.Records')
!sst.Trace('RECORDS(SELF.ul) = ' & RECORDS(SELF.ul))
!sst.Trace('END:UnitsCollection.Records')
RETURN RECORDS(SELF.ul)
UnitsCollection.Pointer PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.Pointer')
!sst.Trace('POINTER(SELF.ul) = ' & POINTER(SELF.ul))
!sst.Trace('END:UnitsCollection.Pointer')
RETURN POINTER(SELF.ul)
UnitsCollection.GetCurrentSelPos PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.GetCurrentSelPos')
!sst.Trace('SELF.selQueuePos = ' & SELF.selQueuePos)
!sst.Trace('END:UnitsCollection.GetCurrentSelPos')
RETURN SELF.selQueuePos
UnitsCollection.Get PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.Get()')
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
success# = TRUE
ELSE
success# = FALSE
END
!sst.Trace('END:UnitsCollection.Get')
RETURN success#
UnitsCollection.UnitTypeCode PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.UnitTypeCode')
!sst.Trace('SELF.ul.UnitTypeCode = ' & SELF.ul.UnitTypeCode)
!sst.Trace('END:UnitsCollection.UnitTypeCode')
RETURN SELF.ul.UnitTypeCode
UnitsCollection.SetUnitTypeCode PROCEDURE(STRING sUnitTypeCode)
CODE
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
SELF.ul.UnitTypeCode = sUnitTypeCode
PUT(SELF.ul)
IF NOT ERRORCODE() THEN
RETURN TRUE
ELSE
RETURN FALSE
END
ELSE
RETURN FALSE
END
UnitsCollection.Echelon PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.Echelon')
!sst.Trace('SELF.ul.Echelon = ' & SELF.ul.Echelon)
!sst.Trace('END:UnitsCollection.Echelon')
RETURN SELF.ul.Echelon
UnitsCollection.SetEchelon PROCEDURE(LONG nEchelon)
CODE
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
SELF.ul.Echelon = nEchelon
PUT(SELF.ul)
IF NOT ERRORCODE() THEN
RETURN TRUE
ELSE
RETURN FALSE
END
ELSE
RETURN FALSE
END
UnitsCollection.xPos PROCEDURE()
CODE
RETURN SELF.ul.xPos
UnitsCollection.yPos PROCEDURE()
CODE
RETURN SELF.ul.yPos
UnitsCollection.Hostility PROCEDURE()
CODE
!sst.Trace('BEGIN:UnitsCollection.Hostility')
!sst.Trace('SELF.ul.Hostility = ' & SELF.ul.Hostility)
!sst.Trace('END:UnitsCollection.Hostility')
RETURN SELF.ul.Hostility
UnitsCollection.SetHostility PROCEDURE(LONG nHostility)
CODE
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
SELF.ul.Hostility = nHostility
PUT(SELF.ul)
IF NOT ERRORCODE() THEN
RETURN TRUE
ELSE
RETURN FALSE
END
ELSE
RETURN FALSE
END
UnitsCollection.markForDisbl PROCEDURE()
CODE
RETURN SELF.ul.markForDel
UnitsCollection.IsHQ PROCEDURE()
CODE
! do something
RETURN SELF.ul.IsHQ
UnitsCollection.SetHQ PROCEDURE(BOOL bIsHQ)
CODE
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
SELF.ul.IsHQ = bIsHQ
PUT(SELF.ul)
IF NOT ERRORCODE() THEN
RETURN SELF.ul.IsHQ
ELSE
RETURN FALSE
END
ELSE
RETURN FALSE
END
UnitsCollection.UnitName PROCEDURE
CODE
RETURN SELF.ul.UnitName
UnitsCollection.SetUnitName PROCEDURE(STRING sUnitName)
CODE
!MESSAGE('selQPos = ' & SELF.selQueuePos)
GET(SELF.ul, SELF.selQueuePos)
IF NOT ERRORCODE() THEN
SELF.ul.UnitName = sUnitName
PUT(SELF.ul)
IF NOT ERRORCODE() THEN
RETURN TRUE
ELSE
MESSAGE('error PUT')
RETURN FALSE
END
ELSE
!MESSAGE('error GET')
RETURN FALSE
END
UnitsCollection.TreePos PROCEDURE
CODE
RETURN SELF.ul.TreePos
UnitsCollection.SelectByMouse PROCEDURE(LONG nXPos, LONG nYPos)
CODE
LOOP i# = 1 TO RECORDS(SELF.ul)
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
IF (SELF.ul.xPos < nXPos) AND (nXPos < SELF.ul.xPos + 50) THEN
IF (SELF.ul.yPos < nYPos) AND (nYPos < SELF.ul.yPos + 30) THEN
! found Unit selection
sst.Trace('UnitsCollection.SelectByMouse = ' & i#)
SELF.selTreePos = SELF.ul.TreePos
SELF.selQueuePos = i#
RETURN TRUE
END
END
END
END
RETURN FALSE
UnitsCollection.CheckByMouse PROCEDURE(LONG nXPos, LONG nYPos)
CODE
currentSelTreePos# = SELF.selTreePos
currentSelQueuePos# = SELF.selQueuePos
LOOP i# = 1 TO RECORDS(SELF.ul)
GET(SELF.ul, i#)
IF NOT ERRORCODE() THEN
IF (SELF.ul.xPos < nXPos) AND (nXPos < SELF.ul.xPos + 50) THEN