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 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204
|
//
// System.Xml.XmlIteratorNodeList
//
// Author:
// Atsushi Enomoto <atsushi@ximian.com>
//
// (C) 2006 Novell Inc.
//
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
using System;
using System.Collections;
using System.Xml.XPath;
namespace System.Xml
{
internal class XmlIteratorNodeList : XmlNodeList//, IDisposable
{
//XmlDocument doc;
XPathNodeIterator source;
XPathNodeIterator iterator;
ArrayList list;
bool finished;
#region Constructors
public XmlIteratorNodeList (XmlDocument doc, XPathNodeIterator iter)
{
if (doc == null)
throw new Exception ("huh?");
//this.doc = doc;
//doc.NodeRemoving += SaveNodeList;
source = iter;
iterator = iter.Clone ();
list = new ArrayList ();
}
#endregion
#region Properties
public override int Count {
get {
/*
// The performance on Count depends on the
// iterator which is actually used. In some
// iterators, getting iterator.Count is much
// faster.
// With (current) implementation in general,
// those iterators that requires sorting is
// likely to have already-computed arrays, so
// for them getting Count does not impact on
// performance.
// But by default, getting iterator.Count means
// it internally iterates all the nodes. That
// might result in duplicate iteration (so
// ineffective). So here I decided that it
// just collects all the nodes to the list.
if (!finished) {
BaseIterator iter = iterator as BaseIterator;
if (iter != null && iter.ReverseAxis || iter is SlashIterator)
return iter.Count;
while (iterator.MoveNext ())
list.Add (((IHasXmlNode) iterator.Current).GetNode ());
finished = true;
}
return list.Count;
*/
// anyways such code that uses
// XmlNodeList.Count already gives up
// performance. Also, storing things in the
// list causes extra memory consumption.
return iterator.Count;
}
}
#endregion
#region Methods
/*
void IDisposable.Dispose ()
{
if (!event_detached) {
event_detached = true;
doc.NodeRemoving -= SaveNodeList;
}
}
void SaveNodeList (object o, XmlNodeChangedEventArgs e)
{
if (Item (Count) != null || !finished)
throw new Exception (); // dummy. It accesses to the end of the list
doc.NodeRemoving -= SaveNodeList;
event_detached = true;
}
*/
public override IEnumerator GetEnumerator ()
{
if (finished)
return list.GetEnumerator ();
else
return new XPathNodeIteratorNodeListIterator (source);
//return new XPathNodeIteratorNodeListIterator2 (this);
}
public override XmlNode Item (int index)
{
if (index < 0)
return null;
if (index < list.Count)
return (XmlNode) list [index];
index++;
while (iterator.CurrentPosition < index) {
if (!iterator.MoveNext ()) {
finished = true;
return null;
}
list.Add (((IHasXmlNode) iterator.Current).GetNode ());
}
return (XmlNode) list [index - 1];
}
#endregion
// FIXME: switch to XPathNodeIteratorNodeListIterator2.
class XPathNodeIteratorNodeListIterator : IEnumerator
{
XPathNodeIterator iter;
XPathNodeIterator source;
public XPathNodeIteratorNodeListIterator (XPathNodeIterator source)
{
this.source = source;
Reset ();
}
public bool MoveNext ()
{
return iter.MoveNext ();
}
public object Current {
get { return ((IHasXmlNode) iter.Current).GetNode (); }
}
public void Reset ()
{
iter = source.Clone ();
}
}
/*
class XPathNodeIteratorNodeListIterator2 : IEnumerator
{
int current = -1;
XmlIteratorNodeList source;
public XPathNodeIteratorNodeListIterator2 (XmlIteratorNodeList source)
{
this.source = source;
}
public bool MoveNext ()
{
return source [++current] != null;
}
public object Current {
get { return source [current]; }
}
public void Reset ()
{
current = -1;
}
}
*/
}
}
|