98 return (
QilNode)MemberwiseClone();
128 for (
int i = 0; i <
list.Count; i++)
136 for (
int num =
Count - 1; num >= 0; num--)
149 for (
int i = 0; i <
Count; i++)
168 for (
int i = 0; i <
Count; i++)
170 if (
node.Equals(
this[i]))
QilNode Clone(QilNode node)
virtual bool Remove(QilNode node)
IEnumerator< QilNode > GetEnumerator()
ISourceLineInfo SourceLine
virtual bool Contains(QilNode node)
virtual XmlQueryType XmlType
virtual QilNode ShallowClone(QilFactory f)
virtual int IndexOf(QilNode node)
QilNode(QilNodeType nodeType)
virtual void Add(IList< QilNode > list)
QilNode(QilNodeType nodeType, XmlQueryType xmlType)
virtual QilNode DeepClone(QilFactory f)
virtual void Insert(int index, QilNode node)
virtual void CopyTo(QilNode[] array, int index)
virtual void RemoveAt(int index)
ISourceLineInfo sourceLine
virtual void Add(QilNode node)
new IEnumerator< T > GetEnumerator()