Files
mono/mcs/class/System.XML/System.Xml/XmlNodeListChildren.cs
T
Atsushi Eno a38d31d473 2003-03-21 Atsushi Enomoto <[email protected]>
* XmlNodeArrayList.cs, XmlNodeListChildren.cs : bugzilla #39920 fix.

svn path=/trunk/mcs/; revision=12707
2003-03-20 18:11:44 +00:00

151 lines
2.8 KiB
C#

//
// System.Xml.XmlNodeList
//
// Author:
// Kral Ferch <[email protected]>
//
// (C) 2002 Kral Ferch
//
using System;
using System.Collections;
namespace System.Xml
{
internal class XmlNodeListChildren : XmlNodeList
{
#region Enumerator
private class Enumerator : IEnumerator
{
XmlNode parent;
XmlLinkedNode currentChild;
bool passedLastNode;
internal Enumerator (XmlNode parent)
{
currentChild = null;
this.parent = parent;
passedLastNode = false;
}
public virtual object Current {
get {
if ((currentChild == null) ||
(parent.LastLinkedChild == null) ||
(passedLastNode == true))
throw new InvalidOperationException();
return currentChild;
}
}
public virtual bool MoveNext()
{
bool movedNext = true;
if (parent.LastLinkedChild == null) {
movedNext = false;
}
else if (currentChild == null) {
currentChild = parent.LastLinkedChild.NextLinkedSibling;
}
else {
if (Object.ReferenceEquals(currentChild, parent.LastLinkedChild)) {
movedNext = false;
passedLastNode = true;
}
else {
currentChild = currentChild.NextLinkedSibling;
}
}
return movedNext;
}
public virtual void Reset()
{
currentChild = null;
}
}
#endregion
#region Fields
XmlNode parent;
#endregion
#region Constructors
public XmlNodeListChildren(XmlNode parent)
{
this.parent = parent;
}
#endregion
#region Properties
public override int Count {
get {
int count = 0;
if (parent.LastLinkedChild != null) {
XmlLinkedNode currentChild = parent.LastLinkedChild.NextLinkedSibling;
count = 1;
while (!Object.ReferenceEquals(currentChild, parent.LastLinkedChild)) {
currentChild = currentChild.NextLinkedSibling;
count++;
}
}
return count;
}
}
#endregion
#region Methods
public override IEnumerator GetEnumerator ()
{
return new Enumerator(parent);
}
public override XmlNode Item (int index)
{
XmlNode requestedNode = null;
// Return null if index is out of range. by DOM design.
if (Count <= index)
return null;
// Instead of checking for && index < Count which has to walk
// the whole list to get a count, we'll just keep a count since
// we have to walk the list anyways to get to index.
if ((index >= 0) && (parent.LastLinkedChild != null)) {
XmlLinkedNode currentChild = parent.LastLinkedChild.NextLinkedSibling;
int count = 0;
while ((count < index) && !Object.ReferenceEquals(currentChild, parent.LastLinkedChild))
{
currentChild = currentChild.NextLinkedSibling;
count++;
}
if (count == index) {
requestedNode = currentChild;
}
}
return requestedNode;
}
#endregion
}
}