1 // Permission is hereby granted, free of charge, to any person obtaining
2 // a copy of this software and associated documentation files (the
3 // "Software"), to deal in the Software without restriction, including
4 // without limitation the rights to use, copy, modify, merge, publish,
5 // distribute, sublicense, and/or sell copies of the Software, and to
6 // permit persons to whom the Software is furnished to do so, subject to
7 // the following conditions:
9 // The above copyright notice and this permission notice shall be
10 // included in all copies or substantial portions of the Software.
12 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
13 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
14 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
15 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
16 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
17 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
18 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
20 // Copyright (c) 2004 Novell, Inc.
23 // Jackson Harper (jackson@ximian.com)
27 using System.Collections;
29 namespace System.Windows.Forms {
31 internal class OpenTreeNodeEnumerator : IEnumerator {
33 private TreeNode start;
34 private TreeNode current;
37 public OpenTreeNodeEnumerator (TreeNode start)
42 public object Current {
43 get { return current; }
46 public TreeNode CurrentNode {
47 get { return current; }
50 public bool MoveNext ()
55 return (current != null);
58 if (current.IsExpanded && current.Nodes.Count > 0) {
59 current = current.Nodes [0];
63 TreeNode prev = current;
64 TreeNode next = current.NextNode;
65 while (next == null) {
66 // The next node is null so we need to move back up the tree until we hit the top
67 if (prev.parent == null)
70 if (prev.parent != null)
77 public bool MovePrevious ()
82 return (current != null);
85 if (current.PrevNode != null) {
86 // Drill down as far as possible
87 TreeNode prev = current.PrevNode;
89 while (walk != null) {
99 if (current.Parent == null)
102 current = current.Parent;