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
|
//
// Copyright (c) 2020-2021 science+computing ag and other contributors
//
// This program and the accompanying materials are made
// available under the terms of the Eclipse Public License 2.0
// which is available at https://www.eclipse.org/legal/epl-2.0/
//
// SPDX-License-Identifier: EPL-2.0
//
use std::collections::BTreeMap;
use std::path::Path;
use std::path::PathBuf;
use anyhow::Context;
use anyhow::Result;
use resiter::Map;
use crate::package::Package;
use crate::package::PackageName;
use crate::package::PackageVersion;
use crate::package::PackageVersionConstraint;
/// A repository represents a collection of packages
pub struct Repository {
inner: BTreeMap<(PackageName, PackageVersion), Package>,
}
#[cfg(test)]
impl From<BTreeMap<(PackageName, PackageVersion), Package>> for Repository {
fn from(inner: BTreeMap<(PackageName, PackageVersion), Package>) -> Self {
Repository { inner }
}
}
impl Repository {
pub fn load(path: &Path, progress: &indicatif::ProgressBar) -> Result<Self> {
fn all_subdirs(p: &Path) -> Result<Vec<PathBuf>> {
let mut v = Vec::new();
for de in p.read_dir()? {
let de = de?;
let is_dir = de.file_type()?.is_dir();
let is_hidden = de.path()
.file_name()
.and_then(|s| s.to_str())
.map(|s| s.starts_with('.'))
.unwrap_or(false);
if is_dir && !is_hidden {
v.push(de.path());
}
}
Ok(v)
}
fn load_recursive(path: &Path, mut config: config::Config, progress: &indicatif::ProgressBar) -> Result<Vec<Result<Package>>> {
let pkg_file = path.join("pkg.toml");
if pkg_file.is_file() {
let buf = std::fs::read_to_string(&pkg_file)
.with_context(|| format!("Reading {}", pkg_file.display()))?;
config.merge(config::File::from_str(&buf, config::FileFormat::Toml))
.with_context(|| format!("Loading contents of {}", pkg_file.display()))?;
}
let subdirs = all_subdirs(path).with_context(|| format!("Finding subdirs for {}", pkg_file.display()))?;
if subdirs.is_empty() {
progress.tick();
if pkg_file.is_file() {
let package = config
.try_into()
.with_context(|| format!("Failed to parse {} into package", path.display()));
Ok(vec![package])
} else {
Ok(vec![])
}
} else {
subdirs
.into_iter()
.fold(Ok(Vec::new()), |vec, dir| {
vec.and_then(|mut v| {
let mut loaded = load_recursive(&dir, config.clone(), progress)
.with_context(|| format!("Recursing for {}", pkg_file.display()))?;
v.append(&mut loaded);
Ok(v)
})
})
}
}
let inner = load_recursive(path, config::Config::default(), progress)
.with_context(|| format!("Recursing for {}", path.display()))?
.into_iter()
.map_ok(|p| ((p.name().clone(), p.version().clone()), p))
.collect::<Result<_>>()?;
Ok(Repository { inner })
}
pub fn find_by_name<'a>(&'a self, name: &PackageName) -> Vec<&'a Package> {
self.inner
.iter()
.filter(|((n, _), _)| name == n)
.map(|(_, pack)| pack)
.collect()
}
pub fn find<'a>(&'a self, name: &PackageName, version: &PackageVersion) -> Vec<&'a Package> {
self.inner
.iter()
.filter(|((n, v), _)| n == name && v == version)
.map(|(_, p)| p)
.collect()
}
pub fn find_with_version<'a>(&'a self, name: &PackageName, vc: &PackageVersionConstraint) -> Vec<&'a Package> {
self.inner
.iter()
.filter(|((n, v), _)| n == name && vc.matches(v))
.map(|(_, p)| p)
.collect()
}
pub fn packages(&self) -> impl Iterator<Item = &Package> {
self.inner.values()
}
}
#[cfg(test)]
pub mod tests {
use super::*;
use crate::package::tests::pname;
use crate::package::tests::pversion;
use crate::package::tests::package;
#[test]
fn test_finding_by_name() {
let mut btree = BTreeMap::new();
{
let name = "a";
let vers = "1";
let pack = package(name, vers, "https://rust-lang.org", "123");
btree.insert((pname(name), pversion(vers)), pack);
}
let repo = Repository::from(btree);
let ps = repo.find_by_name(&pname("a"));
assert_eq!(ps.len(), 1);
let p = ps.get(0).unwrap();
assert_eq!(*p.name(), pname("a"));
assert_eq!(*p.version(), pversion("1"));
assert!(!p.version_is_semver());
}
#[test]
fn test_find() {
let mut btree = BTreeMap::new();
{
let name = "a";
let vers = "1";
let pack = package(name, vers, "https://rust-lang.org", "123");
btree.insert((pname(name), pversion(vers)), pack);
}
{
let name = "a";
let vers = "2";
let pack = package(name, vers, "https://rust-lang.org", "124");
btree.insert((pname(name), pversion(vers)), pack);
}
let repo = Repository::from(btree);
let ps = repo.find(&pname("a"), &pversion("2"));
assert_eq!(ps.len(), 1);
let p = ps.get(0).unwrap();
assert_eq!(*p.name(), pname("a"));
assert_eq!(*p.version(), pversion("2"));
assert!(!p.version_is_semver());
}
#[test]
fn test_find_with_vers_constr_exact() {
let mut btree = BTreeMap::new();
{
let name = "a";
let vers = "1";
let pack = package(name, vers, "https://rust-lang.org", "123");
btree.insert((pname(name), pversion(vers)), pack);
}
{
let name = "a";
let vers = "2";
let pack = package(name, vers, "https://rust-lang.org", "124");
btree.insert((pname(name), pversion(vers)), pack);
}
{
let name = "a";
let vers = "3";
let pack = package(name, vers, "https://rust-lang.org", "125");
btree.insert((pname(name), pversion(vers)), pack);
}
let repo = Repository::from(btree);
let constraint = PackageVersionConstraint::from_version(String::from("="), pversion("2"));
let ps = repo.find_with_version(&pname("a"), &constraint);
assert_eq!(ps.len(), 1);
let p = ps.get(0).unwrap();
assert_eq!(*p.name(), pname("a"));
assert_eq!(*p.version(), pversion("2"));
assert!(!p.version_is_semver());
}
}
|
