Subject: RE: Detecting Infinite Looping From: "Pawson, David" <DPawson@xxxxxxxxxxx> Date: Thu, 29 Jan 1998 08:06:32 -0000 |
Eliot wrote: > My logic constructs a node list by recursively processing each > location > address found. How would I compare each new node to the node list at > that > point to see if it's already in it (if it's a location address)? > Surely the plain English answer is I am the 'nth' descendent of myself? The C solution would be to compare the (value) of the address with the backwards chain value up to the root. (Hop back up the linked list looking for an equality). I'll let you translate that into DSSSL! regards, DaveP DSSSList info and archive: http://www.mulberrytech.com/dsssl/dssslist
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: Detecting Infinite Looping, Henry Thompson | Thread | RE: Detecting Infinite Looping, Gavin Nicol |
RE: DSSSL side effect-freeness - an, Pawson, David | Date | Re: Detecting Infinite Looping, Richard Light |
Month |