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
|
// TreeViewState.cs
//
// Author:
// Lluis Sanchez Gual <lluis@novell.com>
//
// Copyright (c) 2007 Novell, Inc (http://www.novell.com)
//
// 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 Gtk;
using System.Linq;
using System.Collections.Generic;
namespace MonoDevelop.Components
{
public class TreeViewState
{
List<NodeInfo> state;
TreeView tree;
int idColumn;
class NodeInfo {
public object Id;
public bool Expanded;
public bool Selected;
public List<NodeInfo> ChildInfo;
}
public TreeViewState (TreeView tree, int idColumn)
{
this.tree = tree;
this.idColumn = idColumn;
}
public void Save ()
{
TreeIter iter;
state = new List<NodeInfo> ();
if (!tree.Model.GetIterFirst (out iter))
return;
Save (state, iter);
}
void Save (ICollection<NodeInfo> collection, TreeIter iter)
{
do {
TreeIter child;
var node = new NodeInfo {
Expanded = tree.GetRowExpanded (tree.Model.GetPath (iter)),
Selected = tree.Selection.IterIsSelected (iter),
Id = tree.Model.GetValue (iter, idColumn)
};
collection.Add (node);
if (tree.Model.IterChildren (out child, iter)) {
node.ChildInfo = new List<NodeInfo> ();
Save (node.ChildInfo, child);
}
} while (tree.Model.IterNext (ref iter));
}
public void Load ()
{
if (state == null)
throw new InvalidOperationException ("State not saved");
TreeIter iter;
if (!tree.Model.GetIterFirst (out iter))
return;
Load (state, iter);
state = null;
}
void Load (List<NodeInfo> info, TreeIter iter)
{
var nodes = new Dictionary<NodeInfo, TreeIter> ();
var infoCopy = new List<NodeInfo> (info);
bool oneSelected = false;
do {
object id = tree.Model.GetValue (iter, idColumn);
NodeInfo ni = ExtractNodeInfo (info, id);
if (ni != null) {
nodes[ni] = iter;
if (ni.Expanded)
tree.ExpandRow (tree.Model.GetPath (iter), false);
else
tree.CollapseRow (tree.Model.GetPath (iter));
if (ni.Selected) {
oneSelected = true;
tree.Selection.SelectIter (iter);
} else {
tree.Selection.UnselectIter (iter);
}
if (ni.ChildInfo != null) {
TreeIter child;
if (tree.Model.IterChildren (out child, iter))
Load (ni.ChildInfo, child);
}
}
} while (tree.Model.IterNext (ref iter));
// If this tree level had a selected node and this node has been deleted, then
// try to select and adjacent node
if (!oneSelected) {
// 'info' contains the nodes that have not been inserted
if (info.Any (n => n.Selected)) {
NodeInfo adjacent = FindAdjacentNode (infoCopy, nodes, info[0]);
if (adjacent != null) {
iter = nodes [adjacent];
tree.Selection.SelectIter (iter);
}
}
}
}
static NodeInfo FindAdjacentNode (IList<NodeInfo> infos, IDictionary<NodeInfo,TreeIter> nodes, NodeInfo referenceNode)
{
int index = infos.IndexOf (referenceNode);
for (int i = index; i < infos.Count; i++) {
if (nodes.ContainsKey (infos[i]))
return infos[i];
}
for (int i = index - 1; i >= 0; i--) {
if (nodes.ContainsKey (infos[i]))
return infos[i];
}
return null;
}
static NodeInfo ExtractNodeInfo (IList<NodeInfo> info, object id)
{
for (int i = 0; i < info.Count; i++) {
var ni = info[i];
if (object.Equals (ni.Id, id)) {
info.RemoveAt (i);
return ni;
}
}
return null;
}
}
}
|
