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
|
/*
* Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; version 2 of the
* License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#include "wb_history_tree.h"
#include "workbench/wb_context.h"
#include "base/string_utilities.h"
using namespace wb;
using namespace bec;
using namespace grt;
HistoryTree::HistoryTree(bec::GRTManager *grtm, UndoManager *undom)
: mforms::TreeNodeView(mforms::TreeFlatList|mforms::TreeSidebar|mforms::TreeNoHeader), _grtm(grtm), _undom(undom), _refresh_pending(false)
{
add_column(mforms::IconStringColumnType, "Action", 200);
end_columns();
_icon = bec::IconManager::get_instance()->get_icon_path("history.png");
scoped_connect(undom->signal_redo(),boost::bind(&HistoryTree::handle_redo, this, _1));
scoped_connect(undom->signal_undo(),boost::bind(&HistoryTree::handle_undo, this, _1));
scoped_connect(undom->signal_changed(),boost::bind(&HistoryTree::handle_change, this));
scoped_connect(signal_node_activated(),boost::bind(&HistoryTree::activate_node, this, _1, _2));
}
void HistoryTree::refresh()
{
_undom->lock();
std::deque<UndoAction*> undostack(_undom->get_undo_stack());
std::deque<UndoAction*> redostack(_undom->get_redo_stack());
_refresh_pending = false;
int new_count = (int)(undostack.size() + redostack.size());
while (count() < new_count)
add_node();
while (count() > new_count)
node_at_row(count()-1)->remove_from_parent();
// just update the captions of the existing nodes
int row = 0;
for (std::deque<UndoAction*>::const_iterator iter = undostack.begin(); iter != undostack.end(); ++iter)
{
mforms::TreeNodeRef node = node_at_row(row++);
node->set_icon_path(0, _icon);
node->set_string(0, (*iter)->description());
}
for (std::deque<UndoAction*>::const_reverse_iterator iter = redostack.rbegin(); iter != redostack.rend(); ++iter)
{
mforms::TreeNodeRef node = node_at_row(row++);
node->set_icon_path(0, _icon);
node->set_string(0, "("+(*iter)->description()+")");
}
_undom->unlock();
}
void HistoryTree::activate_node(mforms::TreeNodeRef node, int column)
{
std::deque<UndoAction*> &undostack(_undom->get_undo_stack());
std::deque<UndoAction*> &redostack(_undom->get_redo_stack());
if (!node)
return;
int row = row_for_node(node);
// undo
if (row < (int)undostack.size())
{
while ((int)undostack.size() > row)
_undom->undo();
}
// redo
else if (row <= (int)(undostack.size() + redostack.size()))
{
while ((int)undostack.size() <= row)
_undom->redo();
}
}
void HistoryTree::handle_redo(grt::UndoAction* action)
{
refresh();
}
void HistoryTree::handle_undo(grt::UndoAction* action)
{
refresh();
}
void HistoryTree::handle_change()
{
if (!_refresh_pending)
{
_refresh_pending = true;
_grtm->run_once_when_idle(this, boost::bind(&HistoryTree::refresh, this));
}
}
|
