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
|
// pkg_sortpolicy.h (-*-c++-*-)
//
// Copyright (C) 2001, 2005 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.
//
#ifndef PKG_SORTPOLICY_H
#define PKG_SORTPOLICY_H
#include <apt-pkg/pkgcache.h>
#include <cwidget/widgets/treeitem.h>
/** \brief Package sorting policies
*
*
* Currently they just handle PkgIterator/VerIterator pairs and
* a wrapper class integrates them with cwidget::widgets::tree. If this can handle
* everything useful, I'd like to keep it as is, since it's simpler than the
* alternatives.
*
* \file pkg_sortpolicy.h
*/
class pkg_tree_node;
class pkg_sortpolicy
{
pkg_sortpolicy *chain;
bool reversed;
protected:
const pkg_sortpolicy *get_chain() const {return chain;}
bool get_reversed() const {return reversed;}
public:
pkg_sortpolicy(pkg_sortpolicy *_chain, bool _reversed)
:chain(_chain), reversed(_reversed) {}
virtual ~pkg_sortpolicy() {delete chain;}
virtual int compare(const pkgCache::PkgIterator &pkg1, const pkgCache::VerIterator &ver1,
const pkgCache::PkgIterator &pkg2, const pkgCache::VerIterator &ver2) const=0;
};
// This is an experiment..I'm using factories to avoid a massively oversized
// header file. We'll see how it works..
//
// Each of these instantiates a corresponding class and returns an instance of
// it.
pkg_sortpolicy *pkg_sortpolicy_name(pkg_sortpolicy *chain, bool reversed);
pkg_sortpolicy *pkg_sortpolicy_ver(pkg_sortpolicy *chain, bool reversed);
pkg_sortpolicy *pkg_sortpolicy_installed_size(pkg_sortpolicy *chain, bool reversed);
pkg_sortpolicy *pkg_sortpolicy_priority(pkg_sortpolicy *chain, bool reversed);
// ewwwwwwww.
//
// IMPORTANT: this does NOT, repeat NOT delete its "contents". It wouldn't
// work if it did without all sorts of evil. You have been warned.
//
// Having the operator() be virtual is a bit of an ick..
class pkg_sortpolicy_wrapper : public cwidget::widgets::sortpolicy
{
pkg_sortpolicy *chain;
public:
pkg_sortpolicy_wrapper(pkg_sortpolicy *_chain):chain(_chain) {}
int compare(cwidget::widgets::treeitem *item1, cwidget::widgets::treeitem *item2) const;
bool operator()(cwidget::widgets::treeitem *item1, cwidget::widgets::treeitem *item2)
{
return (compare(item1, item2)<0);
}
};
#endif
|
