blob: c26df84de059cabf4892aa70cc46169754134012 (
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
|
//------------------------------------------------------------------------------
// <copyright file="followingsibling.cs" company="Microsoft">
// Copyright (c) Microsoft Corporation. All rights reserved.
// </copyright>
// <owner current="true" primary="true">Microsoft</owner>
//------------------------------------------------------------------------------
namespace MS.Internal.Xml.XPath {
using System;
using System.Xml;
using System.Xml.XPath;
using System.Diagnostics;
using System.Collections.Generic;
using StackNav = ClonableStack<System.Xml.XPath.XPathNavigator>;
internal sealed class FollSiblingQuery : BaseAxisQuery {
StackNav elementStk;
List<XPathNavigator> parentStk;
XPathNavigator nextInput;
public FollSiblingQuery(Query qyInput, string name, string prefix, XPathNodeType type) : base (qyInput, name, prefix, type) {
this.elementStk = new StackNav();
this.parentStk = new List<XPathNavigator>();
}
private FollSiblingQuery(FollSiblingQuery other) : base(other) {
this.elementStk = other.elementStk.Clone();
this.parentStk = new List<XPathNavigator>(other.parentStk);
this.nextInput = Clone(other.nextInput);
}
public override void Reset() {
elementStk.Clear();
parentStk.Clear();
nextInput = null;
base.Reset();
}
private bool Visited(XPathNavigator nav) {
XPathNavigator parent = nav.Clone();
parent.MoveToParent();
for (int i = 0; i < parentStk.Count; i++) {
if (parent.IsSamePosition(parentStk[i])) {
return true;
}
}
parentStk.Add(parent);
return false;
}
private XPathNavigator FetchInput() {
XPathNavigator input;
do {
input = qyInput.Advance();
if (input == null) {
return null;
}
} while (Visited(input));
return input.Clone();
}
public override XPathNavigator Advance() {
while (true) {
if (currentNode == null) {
if (nextInput == null) {
nextInput = FetchInput(); // This can happen at the begining and at the end
}
if (elementStk.Count == 0) {
if (nextInput == null) {
return null;
}
currentNode = nextInput;
nextInput = FetchInput();
} else {
currentNode = elementStk.Pop();
}
}
while (currentNode.IsDescendant(nextInput)) {
elementStk.Push(currentNode);
currentNode = nextInput;
nextInput = qyInput.Advance();
if (nextInput != null) {
nextInput = nextInput.Clone();
}
}
while (currentNode.MoveToNext()) {
if (matches(currentNode)) {
position++;
return currentNode;
}
}
currentNode = null;
}
} // Advance
public override XPathNodeIterator Clone() { return new FollSiblingQuery(this); }
}
}
|
