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
|
// 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.
//
// Copyright (c) 2004 Novell, Inc.
//
// Authors:
// Jackson Harper ([email protected])
using System;
using System.Collections;
namespace ShiftUI {
internal class OpenTreeNodeEnumerator : IEnumerator {
private TreeNode start;
private TreeNode current;
private bool started;
public OpenTreeNodeEnumerator (TreeNode start)
{
this.start = start;
}
public object Current {
get { return current; }
}
public TreeNode CurrentNode {
get { return current; }
}
public bool MoveNext ()
{
if (!started) {
started = true;
current = start;
return (current != null);
}
if (current.is_expanded && current.Nodes.Count > 0) {
current = current.Nodes [0];
return true;
}
TreeNode prev = current;
TreeNode next = current.NextNode;
while (next == null) {
// The next node is null so we need to move back up the tree until we hit the top
if (prev.parent == null)
return false;
prev = prev.parent;
if (prev.parent != null)
next = prev.NextNode;
}
current = next;
return true;
}
public bool MovePrevious ()
{
if (!started) {
started = true;
current = start;
return (current != null);
}
if (current.PrevNode != null) {
// Drill down as far as possible
TreeNode prev = current.PrevNode;
TreeNode walk = prev;
while (walk != null) {
prev = walk;
if (!walk.is_expanded)
break;
walk = walk.LastNode;
}
current = prev;
return true;
}
if (current.Parent == null)
return false;
current = current.Parent;
return true;
}
public void Reset ()
{
started = false;
}
}
}
|
