13this.node = n;

153int initialDepth = location.node.depth; 183} while ((location != null) && (location.node.depth >= initialDepth)); 196if (wireUriSegments.Length <= currentLocation.node.depth) 201if (currentLocation.node.endOfPath.Items.Count != 0) 204success = currentLocation.node.endOfPath; 207else if (currentLocation.node.star.Items.Count != 0) 210success = currentLocation.node.star; 215nextStep = new SingleLocationOrLocationsSet(currentLocation.node.onFailure); 221UriTemplateLiteralPathSegment curWireSeg = wireUriSegments[currentLocation.node.depth]; 260if (considerLiteral && currentLocation.node.nextLiteralSegment != null && 261currentLocation.node.nextLiteralSegment.ContainsKey(curWireSeg)) 263nextStep = new SingleLocationOrLocationsSet(currentLocation.node.nextLiteralSegment[curWireSeg]); 266else if (considerCompound && currentLocation.node.nextCompoundSegment != null && 267AscendingSortedCompoundSegmentsCollection<UriTemplateTrieLocation>.Lookup(currentLocation.node.nextCompoundSegment, curWireSeg, out compoundLocationsSet)) 272else if (considerVariable && currentLocation.node.nextVariableSegment != null && 275nextStep = new SingleLocationOrLocationsSet(currentLocation.node.nextVariableSegment); 278else if (considerStar && currentLocation.node.star.Items.Count != 0) 281success = currentLocation.node.star; 286nextStep = new SingleLocationOrLocationsSet(currentLocation.node.onFailure); 296if (considerLiteral && currentLocation.node.finalLiteralSegment != null && 297currentLocation.node.finalLiteralSegment.ContainsKey(curWireSeg)) 300success = currentLocation.node.finalLiteralSegment[curWireSeg]; 303else if (considerCompound && currentLocation.node.finalCompoundSegment != null && 304AscendingSortedCompoundSegmentsCollection<UriTemplatePathPartiallyEquivalentSet>.Lookup(currentLocation.node.finalCompoundSegment, curWireSeg, out compoundPathEquivalentSets)) 316success = new UriTemplatePathPartiallyEquivalentSet(currentLocation.node.depth + 1); 324else if (considerVariable && currentLocation.node.finalVariableSegment.Items.Count != 0) 327success = currentLocation.node.finalVariableSegment; 330else if (considerStar && currentLocation.node.star.Items.Count != 0) 333success = currentLocation.node.star; 338nextStep = new SingleLocationOrLocationsSet(currentLocation.node.onFailure); 352return locationsSet[0][0].node.onFailure; 398Fx.Assert(kvp.Value.node.depth == current.depth + 1, "kvp.Value.node.depth == current.depth + 1"); 399Fx.Assert(kvp.Value.node.onFailure.node == current, "back pointer should point back to here"); 400Fx.Assert(kvp.Value.node.onFailure.locationWithin == UriTemplateTrieIntraNodeLocation.AfterLiteral, "back-pointer should be AfterLiteral"); 401nodesQueue.Enqueue(kvp.Value.node); 413UriTemplate firstTemplate = FindAnyUriTemplate(locations[i][0].node); 414UriTemplate secondTemplate = FindAnyUriTemplate(locations[i][1].node); 422Fx.Assert(location.node.depth == current.depth + 1, "kvp.Value.node.depth == current.depth + 1"); 423Fx.Assert(location.node.onFailure.node == current, "back pointer should point back to here"); 424Fx.Assert(location.node.onFailure.locationWithin == UriTemplateTrieIntraNodeLocation.AfterCompound, "back-pointer should be AfterCompound"); 425nodesQueue.Enqueue(location.node); 432Fx.Assert(current.nextVariableSegment.node.depth == current.depth + 1, "current.nextVariableSegment.node.depth == current.depth + 1"); 433Fx.Assert(current.nextVariableSegment.node.onFailure.node == current, "back pointer should point back to here"); 434Fx.Assert(current.nextVariableSegment.node.onFailure.locationWithin == UriTemplateTrieIntraNodeLocation.AfterVariable, "back-pointer should be AfterVariable"); 435nodesQueue.Enqueue(current.nextVariableSegment.node); 513node = location.node; 518node = location.node; 522node = node.nextVariableSegment.node; 589return nextLocation.node; 596return this.nextLiteralSegment[lps].node; 614return this.nextVariableSegment.node;