public void Visit(JsMember node) { // if there's a root node, recurse into it if (node != null && node.Root != null) { node.Root.Accept(this); } }
public void Visit(JsMember node) { // need to recurse the collection if (node != null) { node.Root.Accept(this); } }
public void Visit(JsMember node) { if (node != null) { if (node.Root != null) { node.Root.Accept(this); } node.Index = NextOrderIndex; } }
public void Visit(JsMember node) { // only interested if the index is greater than zero, since the zero-index // needs to be a lookup. if (node != null && m_index > 0) { // check the Name property against the current part if (string.CompareOrdinal(node.Name, m_parts[m_index--]) == 0) { // match! recurse the root after decrementing the index node.Root.Accept(this); } } }
public override void Visit(JsMember node) { // same logic for most nodes TypicalHandler(node); }
public void Visit(JsMember node) { // invalid! ignore IsValid = false; }