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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
|
// pkg_tree.cc
//
// Copyright 1999-2005, 2007 Daniel Burrows
//
// 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; either version 2 of the License, or
// (at your option) any later version.
//
// 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; see the file COPYING. If not, write to
// the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// A package-tree displayer.
#include "pkg_tree.h"
#include "aptitude.h"
#include "load_grouppolicy.h"
#include "load_sortpolicy.h"
#include "pkg_columnizer.h"
#include "pkg_grouppolicy.h"
#include "pkg_node.h"
#include "pkg_sortpolicy.h"
#include "pkg_subtree.h"
#include "ui.h"
#include "widgets::progress.h"
#include <vscreen/columnify.h>
#include <cwidget/generic/util/transcode.h>
#include <cwidget/widgets/treeitem.h>
#include <generic/apt/apt.h>
#include <generic/apt/config_signal.h>
#include <generic/apt/matchers.h>
#include <apt-pkg/progress.h>
#include <apt-pkg/configuration.h>
#include <apt-pkg/algorithms.h>
#include <sigc++/adaptors/retype_return.h>
#include <sigc++/functors/mem_fun.h>
keybindings *pkg_tree::bindings=NULL;
widgets::editline::history_list pkg_tree::limit_history, pkg_tree::grouping_history,
pkg_tree::sorting_history;
void pkg_tree::init_bindings()
{
bindings=new keybindings(widgets::tree::bindings);
}
pkg_tree::pkg_tree(const std::string &def_grouping,
pkg_grouppolicy_factory *_grouping,
const std::wstring &def_limit)
:initialized(false),
grouping(_grouping), groupingstr(def_grouping),
sorting(parse_sortpolicy(aptcfg->Find(PACKAGE "::UI::Default-Sorting",
"name"))),
limit(NULL),
limitstr(def_limit)
{
if(!limitstr.empty())
limit=parse_pattern(transcode(limitstr));
}
pkg_tree::pkg_tree(const std::string &def_grouping,
pkg_grouppolicy_factory *_grouping)
:initialized(false),
grouping(_grouping), groupingstr(def_grouping),
sorting(parse_sortpolicy(aptcfg->Find(PACKAGE "::UI::Default-Sorting",
"name"))),
limit(NULL),
limitstr(transcode(aptcfg->Find(PACKAGE "::Pkg-Display-Limit", "")))
{
if(!limitstr.empty())
limit=parse_pattern(transcode(limitstr));
}
void pkg_tree::handle_cache_close()
{
set_root(NULL);
}
pkg_tree::~pkg_tree()
{
delete sorting;
}
void pkg_tree::set_grouping(pkg_grouppolicy_factory *_grouping)
{
// Reject NULL groupings (should never happen!)
if(!_grouping)
return;
pkg_grouppolicy_factory *oldgrouping=grouping;
grouping=_grouping;
build_tree();
delete oldgrouping;
}
void pkg_tree::set_grouping(const std::wstring &s)
{
// FIXME: push wstrings down into the parsing code.
groupingstr=transcode(s);
pkg_grouppolicy_factory *grp=parse_grouppolicy(groupingstr);
if(grp)
set_grouping(grp);
}
void pkg_tree::set_sorting(pkg_sortpolicy *_sorting)
{
delete sorting;
sorting=_sorting;
// ummmm
if(grouping)
build_tree();
}
void pkg_tree::set_sorting(const std::wstring &s)
{
// FIXME: push wstrings down into the parsing code.
pkg_sortpolicy *policy=parse_sortpolicy(transcode(s));
if(policy)
set_sorting(policy);
}
bool pkg_tree::build_tree(OpProgress &progress)
{
bool rval;
if(!initialized)
{
cache_closed.connect(sigc::mem_fun(*this, &pkg_tree::handle_cache_close));
cache_reloaded.connect(sigc::hide_return(sigc::mem_fun<bool, pkg_tree, pkg_tree>(*this, &pkg_tree::build_tree)));
initialized=true;
}
reset_incsearch();
set_root(NULL);
reset_incsearch();
if(grouping && apt_cache_file)
{
bool empty=true, cache_empty=true;
pkg_subtree *mytree=new pkg_subtree(transcode(_("All Packages")), true);
pkg_grouppolicy *grouper=grouping->instantiate(&selected_signal,
&selected_desc_signal);
mytree->set_depth(-1);
int num=0;
int total=(*apt_cache_file)->Head().PackageCount;
for(pkgCache::PkgIterator i=(*apt_cache_file)->PkgBegin(); !i.end(); i++)
{
cache_empty=false;
progress.OverallProgress(num, total, 1, _("Building view"));
++num;
// Filter useless packages up-front.
if(i.VersionList().end() && i.ProvidesList().end())
continue;
if((!limit) || limit->matches(i, *apt_cache_file, *apt_package_records))
{
empty=false;
grouper->add_package(i, mytree);
}
}
progress.OverallProgress(total, total, 1, _("Building view"));
pkg_sortpolicy_wrapper sorter(sorting);
mytree->sort(sorter);
set_root(mytree);
delete grouper;
rval=cache_empty || !empty;
}
else
rval=true;
toplevel::update();
return rval;
}
bool pkg_tree::build_tree()
{
widgets::progress_ref p=gen_progress_bar();
bool rval=build_tree(*p.unsafe_get_ref());
p->destroy();
return rval;
}
void pkg_tree::set_limit(const std::wstring &_limit)
{
pkg_matcher *old_limit=limit;
std::wstring old_limitstr=limitstr;
pkg_matcher *new_limit=parse_pattern(transcode(_limit));
if(_limit.empty() || new_limit)
{
limit=new_limit;
limitstr=_limit;
if(!build_tree() && !aptcfg->FindB(PACKAGE "::UI::Allow-Unmatched-Limit", false))
{
wchar_t buf[512];
swprintf(buf, 512, transcode(_("No packages matched the pattern \"%ls\".")).c_str(),
_limit.c_str());
show_message(buf);
delete new_limit;
limit=old_limit;
limitstr=old_limitstr;
build_tree();
}
else
delete old_limit;
}
}
bool pkg_tree::find_limit_enabled()
{
return get_visible();
}
bool pkg_tree::find_limit()
{
prompt_string(transcode(_("Enter the new package tree limit: ")),
limitstr,
arg(sigc::mem_fun(*this, &pkg_tree::set_limit)),
NULL,
NULL,
&limit_history);
return true;
}
bool pkg_tree::find_reset_limit_enabled()
{
return get_visible() && limit!=NULL;
}
bool pkg_tree::find_reset_limit()
{
if(!get_visible())
return false;
delete limit;
limit=NULL;
limitstr=L"";
build_tree();
return true;
}
bool pkg_tree::handle_key(const key &k)
{
if(bindings->key_matches(k, "ChangePkgTreeLimit"))
find_limit();
else if(bindings->key_matches(k, "ChangePkgTreeGrouping"))
prompt_string(_("Enter the new package grouping mechanism for this display: "),
groupingstr,
arg(sigc::mem_fun(*this,
(void (pkg_tree::*) (const std::wstring &)) &pkg_tree::set_grouping)),
NULL,
NULL,
&grouping_history);
else if(bindings->key_matches(k, "ChangePkgTreeSorting"))
prompt_string(_("Enter the new package sorting mechanism for this display: "),
"",
arg(sigc::mem_fun(*this,
(void (pkg_tree::*) (const std::wstring &)) &pkg_tree::set_sorting)),
NULL,
NULL,
&sorting_history);
else
return menu_tree::handle_key(k);
return true;
}
|