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
|
/**************************************************************************
* Copyright (C) 2012 by Eugene V. Lyubimkin *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License *
* (version 3 or above) as published by the Free Software Foundation. *
* *
* 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 GPL *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA *
**************************************************************************/
#include "common.hpp"
#include <cupt/system/state.hpp>
#include <cupt/cache/binarypackage.hpp>
#include <cupt/cache/sourcepackage.hpp>
bool isPackageInstalled(const Cache& cache, const string& packageName)
{
auto&& installedInfo = cache.getSystemState()->getInstalledInfo(packageName);
return (installedInfo && installedInfo->status != system::State::InstalledRecord::Status::ConfigFiles);
}
template < typename VersionT >
ReverseDependsIndex< VersionT >::ReverseDependsIndex(const Cache& cache)
: __cache(cache), __architecture(cache.getSystemState()->getArchitecture())
{}
template < typename VersionT >
void ReverseDependsIndex< VersionT >::add(RelationTypeT relationType)
{
auto insertResult = __data.insert({ relationType, PerRelationType() });
if (insertResult.second)
{
__add(relationType, &insertResult.first->second);
}
}
namespace {
template < typename T > struct TraitsPlus;
template<> struct TraitsPlus< BinaryVersion >
{
static Range< Cache::PackageNameIterator > getPackageNames(const Cache& cache) { return cache.getBinaryPackageNames(); };
static const BinaryPackage* getPackage(const Cache& cache, const string& packageName)
{ return cache.getBinaryPackage(packageName); }
};
template<> struct TraitsPlus< SourceVersion >
{
static Range< Cache::PackageNameIterator > getPackageNames(const Cache& cache) { return cache.getSourcePackageNames(); };
static const SourcePackage* getPackage(const Cache& cache, const string& packageName)
{ return cache.getSourcePackage(packageName); };
};
}
template < typename VersionT >
const RelationLine& ReverseDependsIndex< VersionT >::__getRelationLine(const RelationLine& rl) const
{
return rl;
}
template < typename VersionT >
RelationLine ReverseDependsIndex< VersionT >::__getRelationLine(const ArchitecturedRelationLine& arl) const
{
return arl.toRelationLine(__architecture);
}
template < typename VersionT >
void ReverseDependsIndex< VersionT >::__add(RelationTypeT relationType, PerRelationType* storage)
{
typedef TraitsPlus< VersionT > TP;
for (const string& packageName: TP::getPackageNames(__cache))
{
auto package = TP::getPackage(__cache, packageName);
for (const auto& version: *package)
{
auto&& relationLine = __getRelationLine(version->relations[relationType]);
for (const auto& relationExpression: relationLine)
{
auto satisfyingVersions = __cache.getSatisfyingVersions(relationExpression);
for (const auto& satisfyingVersion: satisfyingVersions)
{
const string& satisfyingPackageName = satisfyingVersion->packageName;
auto& packageList = (*storage)[satisfyingPackageName];
if (packageList.back() != package)
{
packageList.push_back(package);
}
}
}
}
}
}
template < typename VersionT >
void ReverseDependsIndex< VersionT >::foreachReverseDependency(
const BinaryVersion* version, RelationTypeT relationType,
const std::function< void (const VersionT*, const RelationExpression&) > callback)
{
auto storageIt = __data.find(relationType);
if (storageIt == __data.end()) return;
const auto& storage = storageIt->second;
auto packageCandidatesIt = storage.find(version->packageName);
if (packageCandidatesIt != storage.end())
{
const auto& packageCandidates = packageCandidatesIt->second;
for (auto packageCandidate: packageCandidates)
{
for (const auto& candidateVersion: *packageCandidate)
{
auto&& relationLine = __getRelationLine(candidateVersion->relations[relationType]);
for (const auto& relationExpression: relationLine)
{
auto satisfyingVersions = __cache.getSatisfyingVersions(relationExpression);
for (const auto& satisfyingVersion: satisfyingVersions)
{
if (satisfyingVersion == version)
{
callback(candidateVersion, relationExpression);
goto candidate;
}
}
}
candidate:
;
}
}
}
}
template class ReverseDependsIndex< BinaryVersion >;
template class ReverseDependsIndex< SourceVersion >;
|
