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
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
#![warn(clippy::all)]
#![warn(rust_2018_idioms)]
pub use cargo_metadata as cm;
pub use cfg_expr;
#[cfg(feature = "targets")]
pub use cfg_expr::target_lexicon;
pub use petgraph;
pub use semver;
use petgraph::{graph::NodeIndex, Direction};
mod builder;
mod errors;
mod pkgspec;
pub use builder::{Builder, Cmd, NoneFilter, Scope, Target};
pub use errors::Error;
pub use pkgspec::PkgSpec;
pub type Kid = cargo_metadata::PackageId;
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
pub enum DepKind {
Normal,
Build,
Dev,
}
impl From<cm::DependencyKind> for DepKind {
fn from(dk: cm::DependencyKind) -> Self {
match dk {
cm::DependencyKind::Normal => Self::Normal,
cm::DependencyKind::Build => Self::Build,
cm::DependencyKind::Development => Self::Dev,
_ => unreachable!(),
}
}
}
impl PartialEq<cm::DependencyKind> for DepKind {
fn eq(&self, other: &cm::DependencyKind) -> bool {
match (self, *other) {
(Self::Normal, cm::DependencyKind::Normal) => true,
(Self::Build, cm::DependencyKind::Build) => true,
(Self::Dev, cm::DependencyKind::Development) => true,
_ => false,
}
}
}
use std::fmt;
impl fmt::Display for DepKind {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Self::Normal => Ok(()),
Self::Build => f.write_str("build"),
Self::Dev => f.write_str("dev"),
}
}
}
pub type NodeId = NodeIndex<u32>;
pub struct Node<N> {
pub id: Kid,
pub krate: N,
}
impl<N> fmt::Display for Node<N>
where
N: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "{}", self.krate)
}
}
impl<N> fmt::Debug for Node<N>
where
N: fmt::Debug,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "{} {:?}", self.id.repr, self.krate)
}
}
#[derive(Debug, Clone)]
pub struct Edge {
pub kind: DepKind,
pub cfg: Option<String>,
}
impl fmt::Display for Edge {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self.kind {
DepKind::Normal => {}
DepKind::Build => f.write_str("(build)")?,
DepKind::Dev => f.write_str("(dev)")?,
};
if let Some(cfg) = &self.cfg {
write!(f, " '{}'", cfg)?;
}
Ok(())
}
}
pub struct Krates<N = cm::Package, E = Edge> {
graph: petgraph::Graph<Node<N>, E>,
workspace_members: Vec<Kid>,
lock_file: std::path::PathBuf,
}
#[allow(clippy::len_without_is_empty)]
impl<N, E> Krates<N, E> {
#[inline]
pub fn len(&self) -> usize {
self.graph.node_count()
}
#[inline]
pub fn lock_path(&self) -> &std::path::PathBuf {
&self.lock_file
}
#[inline]
pub fn graph(&self) -> &petgraph::Graph<Node<N>, E> {
&self.graph
}
#[inline]
pub fn krates(&self) -> impl Iterator<Item = &Node<N>> {
self.graph.node_indices().map(move |nid| &self.graph[nid])
}
#[inline]
pub fn get_deps(&self, id: NodeId) -> impl Iterator<Item = (&Node<N>, &E)> {
use petgraph::visit::EdgeRef;
self.graph
.edges_directed(id, Direction::Outgoing)
.map(move |edge| {
let krate = &self.graph[edge.target()];
(krate, edge.weight())
})
}
#[inline]
pub fn nid_for_kid(&self, kid: &Kid) -> Option<NodeId> {
self.graph
.raw_nodes()
.binary_search_by(|rn| rn.weight.id.cmp(kid))
.ok()
.map(NodeId::new)
}
#[inline]
pub fn node_for_kid(&self, kid: &Kid) -> Option<&Node<N>> {
self.nid_for_kid(kid).map(|nid| &self.graph[nid])
}
#[inline]
pub fn workspace_members(&self) -> impl Iterator<Item = &Node<N>> {
self.workspace_members
.iter()
.filter_map(move |pid| self.nid_for_kid(pid).map(|ind| &self.graph[ind]))
}
}
pub trait KrateDetails {
fn name(&self) -> &str;
fn version(&self) -> &semver::Version;
}
impl KrateDetails for cm::Package {
fn name(&self) -> &str {
&self.name
}
fn version(&self) -> &semver::Version {
&self.version
}
}
impl<N, E> Krates<N, E>
where
N: KrateDetails,
{
pub fn search_matches<'a: 'b, 'b>(
&'b self,
name: &'a str,
req: &'a semver::VersionReq,
) -> impl Iterator<Item = (NodeId, &Node<N>)> {
self.krates_by_name(name)
.filter(move |(_, n)| req.matches(n.krate.version()))
}
pub fn krates_by_name(&self, name: &str) -> impl Iterator<Item = (NodeId, &Node<N>)> {
let lowest = semver::Version::new(0, 0, 0);
let raw_nodes = self.graph.raw_nodes();
let range =
match raw_nodes.binary_search_by(|node| match node.weight.krate.name().cmp(&name) {
std::cmp::Ordering::Equal => node.weight.krate.version().cmp(&lowest),
o => o,
}) {
Ok(i) | Err(i) => {
#[allow(clippy::reversed_empty_ranges)]
if i >= raw_nodes.len() || raw_nodes[i].weight.krate.name() != name {
0..0
} else {
let mut begin = i;
while begin > 0 && raw_nodes[begin - 1].weight.krate.name() == name {
begin -= 1;
}
let end = raw_nodes[begin..]
.iter()
.take_while(|kd| kd.weight.krate.name() == name)
.count()
+ begin;
begin..end
}
}
};
let begin = range.start;
raw_nodes[range]
.iter()
.enumerate()
.map(move |(i, n)| (NodeId::new(begin + i), &n.weight))
}
}
impl<N, E> std::ops::Index<NodeId> for Krates<N, E> {
type Output = N;
#[inline]
fn index(&self, id: NodeId) -> &Self::Output {
&self.graph[id].krate
}
}
impl<N, E> std::ops::Index<usize> for Krates<N, E> {
type Output = N;
#[inline]
fn index(&self, idx: usize) -> &Self::Output {
&self.graph.raw_nodes()[idx].weight.krate
}
}