2 // System.Web.UI.WebControls.TreeNodeCollection.cs
5 // Lluis Sanchez Gual (lluis@novell.com)
7 // (C) 2004 Novell, Inc (http://www.novell.com)
9 // Permission is hereby granted, free of charge, to any person obtaining
10 // a copy of this software and associated documentation files (the
11 // "Software"), to deal in the Software without restriction, including
12 // without limitation the rights to use, copy, modify, merge, publish,
13 // distribute, sublicense, and/or sell copies of the Software, and to
14 // permit persons to whom the Software is furnished to do so, subject to
15 // the following conditions:
17 // The above copyright notice and this permission notice shall be
18 // included in all copies or substantial portions of the Software.
20 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
21 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
22 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
24 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
25 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
26 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
28 // Copyright (C) 2004 Novell, Inc (http://www.novell.com)
35 using System.Collections;
37 namespace System.Web.UI.WebControls
39 public sealed class TreeNodeCollection: ICollection, IEnumerable, IStateManager
41 ArrayList items = new ArrayList ();
47 public TreeNodeCollection ()
51 public TreeNodeCollection (TreeNode owner)
54 this.tree = owner.Tree;
57 internal TreeNodeCollection (TreeView tree)
62 internal void SetTree (TreeView tree)
65 foreach (TreeNode node in items)
69 public TreeNode this [int i] {
70 get { return (TreeNode) items [i]; }
73 public void Add (TreeNode child)
78 internal void Add (TreeNode child, bool updateParent)
80 int index = items.Add (child);
86 child.SetParent (parent);
89 ((IStateManager)child).TrackViewState ();
94 public void AddAt (int index, TreeNode child)
96 items.Insert (index, child);
98 child.SetParent (parent);
100 for (int n=index+1; n<items.Count; n++)
101 ((TreeNode)items[n]).Index = n;
103 ((IStateManager)child).TrackViewState ();
108 internal void SetDirty () {
109 for (int n = 0; n < Count; n++)
110 this [n].SetDirty ();
116 if (tree != null || parent != null) {
117 foreach (TreeNode nod in items) {
119 nod.SetParent (null);
128 public bool Contains (TreeNode child)
130 return items.Contains (child);
133 public void CopyTo (TreeNode[] nodeArray, int index)
135 items.CopyTo (nodeArray, index);
138 public IEnumerator GetEnumerator ()
140 return items.GetEnumerator ();
143 public int IndexOf (TreeNode node)
145 return items.IndexOf (node);
148 public void Remove (TreeNode node)
150 int i = IndexOf (node);
160 public void RemoveAt (int index)
162 TreeNode node = (TreeNode) items [index];
163 items.RemoveAt (index);
172 get { return items.Count; }
175 public bool IsSynchronized {
176 get { return false; }
179 public object SyncRoot {
180 get { return items; }
183 void System.Collections.ICollection.CopyTo (Array array, int index)
185 items.CopyTo (array, index);
188 void IStateManager.LoadViewState (object state)
190 if (state == null) return;
191 object[] its = (object[]) state;
193 dirty = (bool)its [0];
198 for (int n = 1; n < its.Length; n++) {
199 TreeNode item = new TreeNode ();
203 ((IStateManager) item).LoadViewState (ns);
207 for (int n = 1; n < its.Length; n++) {
208 Pair pair = (Pair) its [n];
209 int oi = (int) pair.First;
210 TreeNode node = (TreeNode) items [oi];
211 ((IStateManager) node).LoadViewState (pair.Second);
217 object IStateManager.SaveViewState ()
219 object[] state = null;
220 bool hasData = false;
223 if (items.Count > 0) {
225 state = new object [items.Count + 1];
227 for (int n = 0; n < items.Count; n++) {
228 TreeNode node = items [n] as TreeNode;
229 object ns = ((IStateManager) node).SaveViewState ();
234 ArrayList list = new ArrayList ();
235 for (int n=0; n<items.Count; n++) {
236 TreeNode node = items[n] as TreeNode;
237 object ns = ((IStateManager)node).SaveViewState ();
240 list.Add (new Pair (n, ns));
244 list.Insert (0, false);
245 state = list.ToArray ();
255 void IStateManager.TrackViewState ()
258 for (int n=0; n<items.Count; n++) {
259 ((IStateManager) items [n]).TrackViewState ();
263 bool IStateManager.IsTrackingViewState {
264 get { return marked; }