|
|
1.1 ! root 1: INTEGER FUNCTION MATCH(HEAD, INCR, N) ! 2: INTEGER PLAT, HEAD ! 3: COMMON /GRAPH/ LLAT, PLAT, LAT(6000) ! 4: C ! 5: C ROUTINE READS DOEN A LINEAR LINKED LIST IN LAT TO FIND ENTRY ! 6: C WHOSE FIRST WORD CONTAINS N; EACH LIST ELEMENT IS INCR+1 LONG; ! 7: C HEAD IS POINTER TO FIRST LIST ELEMENT ! 8: C RETURNS 0 FOR NO MATCH ON LIST OR THE EMPTY LIST ! 9: C ! 10: IF (HEAD) 40, 40, 10 ! 11: 10 MATCH = HEAD ! 12: 20 IF (LAT(MATCH).EQ.N) GO TO 50 ! 13: MATCH = MATCH + INCR ! 14: IF (LAT(MATCH)) 40, 40, 30 ! 15: 30 MATCH = LAT(MATCH) ! 16: GO TO 20 ! 17: 40 MATCH = 0 ! 18: 50 RETURN ! 19: END
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.