public ForwardAxis(DoubleLinkAxis axis, bool isdesorself) { this.isDss = isdesorself; this.isAttribute = Asttree.IsAttribute(axis); this.topNode = axis; this.rootNode = axis; while (this.rootNode.Input != null) { this.rootNode = (DoubleLinkAxis)(this.rootNode.Input); } // better to calculate it out, since it's used so often, and if the top is self then the whole tree is self this.isSelfAxis = Asttree.IsSelf(this.topNode); }
// equal & ! attribute then move // "a/b/c" pointer from a move to b // return true if reach c and c is an element and c is the axis internal bool MoveToChild(string name, string URN, int depth, ForwardAxis parent) { // an attribute can never be the same as an element if (Asttree.IsAttribute(this.curNode)) { return(false); } // either moveToParent or moveToChild status will have to be changed into unmatch... if (this.isMatch) { this.isMatch = false; } if (!AxisStack.Equal(this.curNode.Name, this.curNode.URN, name, URN)) { return(false); } if (this.curDepth == -1) { SetDepth(depth); } else if (depth > this.curDepth) { return(false); } // matched ... if (this.curNode == parent.TopNode) { this.isMatch = true; return(true); } // move down this.curNode DoubleLinkAxis nowNode = (DoubleLinkAxis)(this.curNode.Next); if (Asttree.IsAttribute(nowNode)) { this.isMatch = true; // for attribute return(false); } this.curNode = nowNode; this.curDepth++; return(false); }