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
|
#include <apt-front/predicate/combinators.h>
#include <apt-front/predicate/factory.h>
#include <adept/quickfilter.h>
#include <adept/statefilter.h>
#include <adept/tagfilter.h>
#include <adept/packagedetails.h>
#include <adept/view.h>
#include <adept/filtersidebar.h>
using namespace adept;
View::View( TQWidget *p, const char *n )
: TQSplitter( p, n )
{
setOrientation( Qt::Vertical );
m_flist = new FilterList( this );
m_bottom = new TQSplitter( this );
m_bottom->setOrientation( Qt::Horizontal );
m_lister = new Lister( m_bottom );
m_flist->plugLister( m_lister );
m_sidebar = new FilterSidebar( m_bottom );
connect( m_lister, TQT_SIGNAL( cardinalityChanged( const Lister::Cardinality & ) ),
m_sidebar, TQT_SLOT( setCardinality( const Lister::Cardinality & ) ) );
m_flist->setHiddenPredicate(
predicate::adapt< entity::Entity >(
predicate::Package::member( &entity::Package::hasVersion ) ) );
m_flist->appendPredicate(
predicate::adapt< entity::Entity >(
StateFilter< entity::Package >() ) );
m_flist->appendPredicate(
predicate::adapt< entity::Entity >(
TagFilter< entity::Package >() ) );
m_flist->appendPredicate(
predicate::adapt< entity::Entity >(
QuickFilter< entity::Package >() ) );
m_lister->setRangeProvider( this );
TQTimer::singleShot( 0, this, TQT_SLOT( delayed() ) );
}
Lister::Range View::listerRange() {
component::Packages &cp = cache::Global::get().packages();
return cp.sorted();
// return range( cp.packagesBegin(), cp.packagesEnd() );
}
void View::hideTags() {
TQValueList< int > szl;
szl.append( 0 ); szl.append( 1 );
setSizes( szl );
}
void View::hideFilters() {
TQValueList< int > szl;
szl.append( 1 ); szl.append( 0 );
m_bottom->setSizes( szl );
}
predicate::Predicate< entity::Entity > View::previewPredicate()
{
return predicate::adapt< entity::Entity >(
(not predicate::Package::member( &entity::Package::markedKeep ))
or predicate::Package::member( &entity::Package::isBroken )
or predicate::Package::member( &entity::Package::willBreak ) );
}
void View::setUpgradeMode()
{
setPreviewMode();
filterList()->setHiddenPredicate(
previewPredicate() or predicate::adapt< entity::Entity >(
predicate::Package::member( &entity::Package::isUpgradable ) ) );
}
void View::setPreviewMode()
{
filterList()->setHiddenPredicate( previewPredicate() );
hideFilters();
hideTags();
}
void View::delayed()
{
// cleanRebuild();
}
Browser::Browser( TQWidget *p, const char *n )
: TQWidgetStack( p, n ), m_currentValid( false )
{
m_current = entity::Entity();
addWidget( m_view = new View( this ) );
addWidget( m_details = new PackageDetails( this ) );
connect( m_view->lister(), TQT_SIGNAL( detailsRequested( Lister::Entity ) ),
this, TQT_SLOT( show( Lister::Entity ) ) );
connect( m_details, TQT_SIGNAL( showList() ),
this, TQT_SLOT( showList() ) );
connect( m_details, TQT_SIGNAL( back() ),
this, TQT_SLOT( back() ) );
connect( m_details, TQT_SIGNAL( forward() ),
this, TQT_SLOT( forward() ) );
connect( m_details, TQT_SIGNAL( detailsRequested( Lister::Entity ) ),
this, TQT_SLOT( show( Lister::Entity ) ) );
}
void Browser::showList()
{
raiseWidget( m_view );
}
void Browser::back()
{
m_forward.push_back( m_current );
m_current = m_back.back();
m_back.pop_back();
doShow( m_current );
}
void Browser::forward()
{
m_back.push_back( m_current );
m_current = m_forward.back();
m_forward.pop_back();
doShow( m_current );
}
void Browser::doShow( Lister::Entity e )
{
m_details->setHasForward( !m_forward.empty() );
m_details->setHasBack( !m_back.empty() );
raiseWidget( m_details );
m_details->setPackage( downcast< entity::Package >( e ) );
}
void Browser::show( Lister::Entity e )
{
m_forward.clear();
if ( m_currentValid )
m_back.push_back( m_current );
m_currentValid = true;
m_current = e.stable();
doShow( e );
}
/* Kolik existencialistu je potreba k zasroubovani zarovky?
Dva. Jeden sroubuje zarovku, a druhy premysli jak zarovka
sama o sobe predstavuje jednotlivy zarivy bod v subjektivni
realite v podsveti nekonecne absurdity dosahujici neuprimny
vesmir nicoty. */
|
