summaryrefslogtreecommitdiff
path: root/support/rnototex/treeandlistops.pas
blob: 3a99d610a06b194755ca2f0e74b5bd61e83a7c72 (plain)
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
{ TREE AND LIST OPERATIONS - VERSION CVF01A
  	                     RANDALL VENHOLA JUNE 30, 1987 
	                     DOCUMENTED IN MODULEAREA:TREEOPS.TEX }



[INHERIT('SCREENHANDLERS','ARGOPS','UTILITYOPS'), environment('treeandlistops')]
MODULE TREEANDLISTOPS;              

{ list and tree operations - requires the external declarations for
  data structures                                                 

	        ARGUMENT           - the item of the list
	        COMPARISONS        - possible results of comparisons
	        SETOFCOMPARISONS - set of above ordinal type      

  the package is to be copied to the area of the source code and
  recompiled.  It expects to find the environment file for the above
  data structures and at least the following routines :     

    function compareargs( leftarg, rightarg : argument ) : comparisons;
    function argtexindex( arg : argument ) : integer;  
	                                                    }

CONST               

    nulllist = NIL;
    nulltree = NIL;                                   

TYPE

arglist     = ^listnode;                 
         
argtree     = ^treenode;

          treenode   = record
	                   parentnode : argtree;
	                   contents    : arglist
	                end;

         listnode    = record
	                   field       : argument;
	                   next        : arglist;    
	                   subtree     : argtree
	                end;


                   

[GLOBAL] FUNCTION nextinlist( list : arglist ) : arglist;
begin
   if list = nulllist then
      errorexit('nextinlist','empty list')
   else
     nextinlist := list^.next
end;                                                         




[GLOBAL] FUNCTION firstarg( list : arglist ) : argument;
begin
   if list = nulllist then
      errorexit('firstlistpointer','empty list')
   else
     firstarg := list^.field
end;
                                          

[GLOBAL] FUNCTION arglistlength( list : arglist ) : integer;
begin
    if list = nulllist then
        arglistlength := 0
    else
        arglistlength := arglistlength(nextinlist(list)) + 1
end;                                            
                                        

                                      

                                          
[GLOBAL] FUNCTION leadingnodesubtree( list : arglist ) : argtree;
begin
   if list = nulllist then
      errorexit('listsubtree','empty list')
   else
      leadingnodesubtree := list^.subtree
end;




                                                  
[GLOBAL] FUNCTION listofargsattree( tree : argtree ) : arglist;
begin
  if tree = nulltree then
     errorexit('listofargsattree','empty tree')
  else
     listofargsattree := tree^.contents
end;



[GLOBAL] FUNCTION treeisroot( tree : argtree ) : boolean;
begin
   if tree = nulltree then
     treeisroot := TRUE
   else
     treeisroot := tree^.parentnode = nulltree 
end;
                                                                 
                  


[GLOBAL] FUNCTION parenttree( tree : argtree ) : argtree;
begin
   if treeisroot( tree ) then
      errorexit('parenttree','tree is root')
   else
      parenttree := tree^.parentnode
end;
                   

              

[GLOBAL] PROCEDURE insertarginsortedlist( var list : arglist; 
	 arg : argument; var pointertoarg : arglist );
	                   
type
   scanstates = (searching, atfrontoflist, positionfound, endoflist);
var
   state : scanstates;
   p, prevp, newp : arglist;
   comp : comparisons;
   
   procedure allocatenewp;
   begin
      new( newp );
      newp^.next := nulllist;            
      newp^.subtree := nulltree;
      newp^.field := arg;
      pointertoarg := newp
   end;
                                                            
begin                                                                   
    if list = nulllist then                                                 
    begin
       allocatenewp;
       list := newp
    end
    else
    begin                       
       p := list;                
       comp := compareargs(arg, firstarg(list));
       if (comp = lessthan) or (comp = equal) then
       	 state := atfrontoflist
       else
       begin     
         state := searching;
         repeat         
           prevp := p;
           p := nextinlist(p);                    
	   if p = nulllist then
	      state := endoflist
	   else
	   begin
	     comp := compareargs(arg, firstarg(p));
	     if (comp = lessthan) or (comp = equal) then
	        state := positionfound
	   end
         until state <> searching
       end;    
       if comp = equal then
          warningmessage('insertarginsortedlist','already in list')
       else
         case state of          
         atfrontoflist : begin
	                       allocatenewp;
	                       newp^.next := list;
	                       list := newp
	                    end;
         positionfound   : begin
	                      allocatenewp;
       	                      newp^.next := p;
	                      prevp^.next := newp
       	                    end;        
	 endoflist      : begin
	                      allocatenewp;
	                      prevp^.next := newp
	                    end                    
       end {case}
    end {else}
end;
    	  



[GLOBAL] PROCEDURE appendargonlist( var list : arglist; arg : argument );
var
  p, prevp, newp : arglist;
begin
    if list = nulllist then
    begin
        new( newp );
	newp^.subtree := nulltree;	
        newp^.field := arg;
        newp^.next := nulllist;
        list := newp
    end     
    else
    begin
 	p := list;
        repeat
	   prevp := p;         
           p := nextinlist(p)
        until p = nulllist;
        new( newp );
        newp^.subtree := nulltree;
        newp^.field := arg;
	newp^.next := nulllist;
        prevp^.next := newp
     end
end;                  
         



[GLOBAL] PROCEDURE preceedargonlist( var list : arglist; arg : argument );
var
  newl : arglist;
begin
   new(newl);
   newl^.subtree := nulltree;
   newl^.field := arg;
   newl^.next := list;
   list := newl
end;


            
[GLOBAL] FUNCTION listcopy( list: arglist ) : arglist;
var      
   l : arglist;
   
   procedure prec( list : arglist );
   begin
     if list = nulllist then
       l := nulllist
     else
     begin  
         prec( nextinlist(l) );
         preceedargonlist( l, firstarg(l))
     end
   end;

begin
   if list = nulllist then
     listcopy := nulllist
   else
   begin
     prec( list );
     listcopy := l
   end
end;

              
         
[GLOBAL] FUNCTION reverseoflist( list: arglist ) : arglist;
var 
   l : arglist;
   
   procedure app( list : arglist );
   begin
     if list = nulllist then               
       l := nulllist
     else
     begin  
         app( nextinlist(l) );
         appendargonlist( l, firstarg(l))
     end
   end;

begin
   if list = nulllist then
     reverseoflist := nulllist
   else
   begin
     app( list );
     reverseoflist := l
   end
end;




[GLOBAL] FUNCTION leadingnodehassubtree( list : arglist ) : boolean;
begin
   if list = nulllist then
     leadingnodehassubtree := false
   else
     leadingnodehassubtree := list^.subtree <> nulltree
end;
         



                   

[GLOBAL] PROCEDURE findarginsortedlist( list : arglist; arg : argument; 
	                           var found : boolean; 
	                           var pointertoarg : arglist );

type
  searchstates = (searching, positionfound, foundlessthanlocation, endoflist);
var       
  p : arglist;                                     
  state : searchstates;
  currentarg : argument;                  
  comp : comparisons;
begin
   found := false;      
   if list <> nulllist then
   begin
      p := list;
      state:= searching;
      repeat
         currentarg := firstarg(p);
	 comp := compareargs(arg, currentarg);
	 case comp of
         notvalid     : errorexit('findarginsortedlist','invalid-comparison');
	 lessthan     : state := foundlessthanlocation;
         equal         : begin
	                   state := positionfound;
	                   pointertoarg := p;
		           found := true
                         end;
         greaterthan  : nullstatement
         end; {case}
         if not found then
         begin
	    p := nextinlist(p);
            if p = nulllist then 
	      state := endoflist
	 end
      until state <> searching
   end
end;         
          
          

                            
[GLOBAL] PROCEDURE findarginlist( list : arglist; arg : argument;
	                    var found : boolean; 
	                    var pointertoarg : arglist );
var
   p : arglist;
   compare : comparisons;
begin
    found := false;                                                           
    if list <> nulllist then
    begin       
      p := list;
      repeat                 
         compare := compareargs( arg, firstarg(p) );
         if compare = equal then                 
         begin
            found := true; 
	    pointertoarg := p
         end
         else                                       
            p := nextinlist(p)
       until (p = nulllist) or (found)
     end
end;





[GLOBAL] FUNCTION nargsattreenode( tree : argtree ) : integer;
begin
   if tree = nulltree then
     nargsattreenode := 0
   else
     nargsattreenode := arglistlength( tree^.contents )
end;                                     

                                           
    



        


[GLOBAL] PROCEDURE insertlistintotree( list : arglist; var tree : argtree);
	
procedure subinsert( list : arglist; var tree : argtree;
	              parentpointer : arglist );
label
  routineexit;                         
var
   newtree : argtree;                                          
   found : boolean;                                                           
   arg : argument;
   pointertoarg : arglist;
begin
   if list = nulllist then
      goto routineexit;                  
   arg := firstarg(list);
   if tree = nulltree then
   begin
      new( newtree );
      newtree^.contents := nulllist;
      appendargonlist(newtree^.contents, arg);         
      if parentpointer = nulllist then
        newtree^.parentnode := nulltree
      else
        newtree^.parentnode := parentpointer^.subtree;
      subinsert(nextinlist(list), newtree^.contents^.subtree, newtree^.contents);
      if parentpointer = nulllist then
        tree := newtree
      else
	parentpointer^.subtree := newtree;
      goto routineexit
   end;
   findarginsortedlist( tree^.contents, arg, found, pointertoarg);
   if not found then
      insertarginsortedlist(tree^.contents, arg, pointertoarg);
   subinsert( nextinlist(list), pointertoarg^.subtree, pointertoarg);
   routineexit : nullstatement
end;
                                       
begin
   subinsert( list, tree, nulllist)
end;
  
                                         

[GLOBAL] PROCEDURE searchtreeforlist( tree : argtree; list : arglist;
          var found : boolean; var indexfound, depthfoundat : integer);

   procedure subsearch( tree : argtree; list : arglist );
   label 
      routineexit;
   var                                         
      findsuccessful : boolean;
      arg: argument;                                                
      pointertoarg : arglist;
   begin
      if tree = nulltree then
         goto routineexit;
      if list = nulllist then
         goto routineexit;
      arg := firstarg(list);
      depthfoundat := depthfoundat + 1;
      findarginsortedlist(listofargsattree(tree), arg, findsuccessful, pointertoarg);
      if findsuccessful then 
      begin        
        found := true;
        indexfound := argtexindex(firstarg(pointertoarg));   
        if leadingnodehassubtree(pointertoarg) then
          subsearch(leadingnodesubtree(pointertoarg), nextinlist(list))
      end;
      routineexit : nullstatement
   end;
    
begin {searchtree}
   found := false;                                      
   indexfound := indexofunknowntexcommand;
   if list = nulllist then
     warningmessage('searchtree','given empty list')
   else                            
      subsearch(tree, list)
end;
                          
                           




[GLOBAL] PROCEDURE padwithnullarguments( var list : arglist; index : integer;
	                            requiredlength : integer );
var
  arg : argument;
  i, ntoappend : integer;
begin
   initarg(arg, [nulltype], blank, index, TRUE);
   ntoappend := requiredlength - arglistlength(list);
   for i := 1 to ntoappend do
      appendargonlist(list, arg)
end;


                             

[GLOBAL] PROCEDURE listtoarray(var list : arglist; index : integer;
                                 var arr  : argarray; requiredlength :integer );
var                                                   
  l : arglist;
  i : integer;
begin                                                                          
  if requiredlength > maxargsinarray then
    errorexit('listtoarray','array size exceeded');
  padwithnullarguments( list, index, requiredlength);                 
  l := list;
  for i := 1 to requiredlength do                  
  begin
   arr[i] := firstarg(l);
   l := nextinlist(l)
  end
end;                                                  

                          


[GLOBAL] PROCEDURE dlist( var f : text; l : arglist );
const
  linelength = 75;
var
  nchars : integer;

 procedure dl( l : arglist );
 var
   s : pckstr;
 begin
   if l = nulllist then
     writeln(f)
   else
   begin      
      s := argliteral(firstarg(l), true);
      if (length(s) + nchars + 1) > linelength then
      begin
         writeln(f);
         nchars := 0
      end;
      nchars := nchars + length(s) + 1;
      write(f, s, blank);
      dl( nextinlist(l))                                 
   end
end;                           

begin
  nchars := 0;
  dl( l )
end;


[GLOBAL] PROCEDURE dtree( var f : text; tree : argtree);

  procedure dt( name : pckstr; tree : argtree );
  var
    l : arglist;
    s : pckstr;
  begin        
    if tree <> nulltree then
    begin            
      writeln(f);                
      writeln(f,'**** "',name,'" NODE HAS ****');
      l := listofargsattree(tree);
      dlist(f,l);
      writeln(f,'**** ',name,' *************');
      while l <> nulllist do
      begin      
        if leadingnodehassubtree(l) then
        begin 
          s := argliteral(firstarg(l), true);
          dt(s, leadingnodesubtree(l))
        end;
        l := nextinlist(l)
      end
    end
  end;
                              
 begin
   dt('<ROOT>', tree)
end;
       


[HIDDEN] PROCEDURE texwritearg( var f : text; arg : argument);
EXTERN;



[GLOBAL] PROCEDURE writeargarray( var f : text; arr : argarray );
var
  i : integer;
begin         
  for i := 1 to maxargsinarray do
    if argclass(arr[i]) <> [nulltype] then
       texwritearg(f, arr[i])
end;

                              
              

[GLOBAL] PROCEDURE makenullarray( var arr : argarray );
var
  templist : arglist;
begin                  
  templist := nulllist;
  padwithnullarguments(templist, indexofunknowntexcommand, maxargsinarray);
  listtoarray( templist, indexofunknowntexcommand, arr, maxargsinarray)
end;
  
    
   
END.