-
Notifications
You must be signed in to change notification settings - Fork 36
/
resolver.rs
845 lines (790 loc) · 31.1 KB
/
resolver.rs
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
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
// Copyright (c) 2017-2018 ETH Zurich
// Fabian Schuiki <fschuiki@iis.ee.ethz.ch>
//! A dependency resolver.
#![deny(missing_docs)]
use std::fmt;
use std::fmt::Write as _;
use std::fs;
use std::mem;
use futures::future::join_all;
use indexmap::{IndexMap, IndexSet};
use tokio::runtime::Runtime;
use itertools::Itertools;
use is_terminal::IsTerminal;
use std::io::{self, Write};
use crate::config::{self, Manifest};
use crate::error::*;
use crate::sess::{
self, DependencyConstraint, DependencyRef, DependencyVersion, DependencyVersions, Session,
SessionIo,
};
/// A dependency resolver.
pub struct DependencyResolver<'ctx> {
/// The session within which resolution occurs.
sess: &'ctx Session<'ctx>,
/// The version table which is used to perform resolution.
table: IndexMap<&'ctx str, Dependency<'ctx>>,
/// A cache of decisions made by the user during the resolution.
decisions: IndexMap<&'ctx str, DependencyConstraint>,
/// Checkout Directory overrides in case checkout_dir is defined and contains folders.
checked_out: IndexMap<String, config::Dependency>,
}
impl<'ctx> DependencyResolver<'ctx> {
/// Create a new dependency resolver.
pub fn new(sess: &'ctx Session<'ctx>) -> DependencyResolver<'ctx> {
// TODO: Populate the table with the contents of the lock file.
DependencyResolver {
sess,
table: IndexMap::new(),
decisions: IndexMap::new(),
checked_out: IndexMap::new(),
}
}
fn any_open(&self) -> bool {
self.table.values().any(|dep| {
dep.sources
.values()
.any(|src| matches!(src.state, State::Open))
})
}
/// Resolve dependencies.
pub fn resolve(mut self) -> Result<config::Locked> {
let rt = Runtime::new()?;
let io = SessionIo::new(self.sess);
// Store path dependencies already in checkout_dir
if let Some(checkout) = self.sess.manifest.workspace.checkout_dir.clone() {
if checkout.exists() {
for dir in fs::read_dir(checkout).unwrap() {
self.checked_out.insert(
dir.as_ref()
.unwrap()
.path()
.file_name()
.unwrap()
.to_str()
.unwrap()
.to_string(),
config::Dependency::Path(dir.unwrap().path()),
);
}
}
}
// Load the plugin dependencies.
self.register_dependencies_in_manifest(
&self.sess.config.plugins,
self.sess.manifest,
&rt,
&io,
)?;
// Load the dependencies in the root manifest.
self.register_dependencies_in_manifest(
&self.sess.manifest.dependencies,
self.sess.manifest,
&rt,
&io,
)?;
let mut iteration = 0;
let mut any_changes = true;
while any_changes {
debugln!(
"resolve: iteration {} table {:#?}",
iteration,
TableDumper(&self.table)
);
iteration += 1;
// Fill in dependencies with state `Open`.
self.init()?;
// Go through each dependency's versions and apply the constraints
// imposed by the others.
self.mark(&rt, &io)?;
// Pick a version for each dependency.
any_changes = self.pick()?;
// Close the dependency set.
self.close(&rt, &io)?;
}
debugln!("resolve: resolved after {} iterations", iteration);
// Convert the resolved dependencies into a lockfile.
let sess = self.sess;
let packages = self
.table
.into_iter()
.map(|(name, dep)| {
let deps = match dep.manifest {
Some(manifest) => manifest.dependencies.keys().cloned().collect(),
None => Default::default(),
};
let src = dep.source();
let sess_src = sess.dependency_source(src.id);
let pkg = match src.versions {
DependencyVersions::Path => {
let path = match sess_src {
sess::DependencySource::Path(p) => p,
_ => unreachable!(),
};
config::LockedPackage {
revision: None,
version: None,
source: config::LockedSource::Path(path),
dependencies: deps,
}
}
DependencyVersions::Registry(ref _rv) => {
return Err(Error::new(format!(
"Registry dependencies such as `{}` not yet supported.",
name
)));
}
DependencyVersions::Git(ref gv) => {
let url = match sess_src {
sess::DependencySource::Git(u) => u,
_ => unreachable!(),
};
let pick = src.state.pick().unwrap();
let rev = gv.revs[pick];
let version = gv
.versions
.iter()
.filter(|&&(_, r)| r == rev)
.map(|(v, _)| v)
.max()
.map(|v| v.to_string());
config::LockedPackage {
revision: Some(String::from(rev)),
version,
source: config::LockedSource::Git(url),
dependencies: deps,
}
}
};
Ok((name.to_string(), pkg))
})
.collect::<Result<_>>()?;
Ok(config::Locked { packages })
}
fn register_dependency(
&mut self,
name: &'ctx str,
dep: DependencyRef,
versions: DependencyVersions<'ctx>,
) {
let entry = self
.table
.entry(name)
.or_insert_with(|| Dependency::new(name));
entry
.sources
.entry(dep)
.or_insert_with(|| DependencySource::new(dep, versions));
}
fn register_dependencies_in_manifest(
&mut self,
deps: &'ctx IndexMap<String, config::Dependency>,
manifest: &'ctx config::Manifest,
rt: &Runtime,
io: &SessionIo<'ctx, 'ctx>,
) -> Result<()> {
// Map the dependencies to unique IDs.
let names: IndexMap<&str, DependencyRef> = deps
.iter()
.map(|(name, dep)| {
let name = name.as_str();
let dep = self.checked_out.get(name).unwrap_or(dep);
let dep = self.sess.config.overrides.get(name).unwrap_or(dep);
(name, self.sess.load_dependency(name, dep, manifest))
})
.collect();
let ids: IndexSet<DependencyRef> = names.iter().map(|(_, &id)| id).collect();
// debugln!("resolve: dep names {:?}", names);
// debugln!("resolve: dep ids {:?}", ids);
// Determine the available versions for the dependencies.
let versions: Vec<_> = ids
.iter()
.map(|&id| async move {
io.dependency_versions(id, false)
.await
.map(move |v| (id, v))
})
.collect();
let versions: IndexMap<_, _> = rt
.block_on(join_all(versions))
.into_iter()
.collect::<Result<Vec<_>>>()?
.into_iter()
.collect::<IndexMap<_, _>>();
// debugln!("resolve: versions {:#?}", versions);
// Register the versions.
for (name, id) in names {
if name == self.sess.manifest.package.name {
return Err(Error::new(format!(
"Please ensure no packages with same name as top package\n\
\tCurrently {} is called in {}",
name, manifest.package.name
)));
}
if name == manifest.package.name {
return Err(Error::new(format!(
"Please ensure no packages with same name as calling package\n\
\tCurrently {} is called in {}",
name, manifest.package.name
)));
}
self.register_dependency(name, id, versions[&id].clone());
}
Ok(())
}
/// Initialize dependencies with state `Open`.
///
/// This populates the dependency's set of possible versions with all
/// available versions, such that they may then be constrained.
fn init(&mut self) -> Result<()> {
for dep in self.table.values_mut() {
for src in dep.sources.values_mut() {
if !src.state.is_open() {
continue;
}
debugln!("resolve: initializing `{}[{}]`", dep.name, src.id);
let ids = match src.versions {
DependencyVersions::Path => (0..1).collect(),
DependencyVersions::Registry(ref _rv) => {
return Err(Error::new(format!(
"Resolution of registry dependency `{}` not yet implemented",
dep.name
)));
}
DependencyVersions::Git(ref gv) => (0..gv.revs.len()).collect(),
};
src.state = State::Constrained(ids);
}
}
Ok(())
}
/// Apply constraints to each dependency's versions.
fn mark(&mut self, rt: &Runtime, io: &SessionIo<'ctx, 'ctx>) -> Result<()> {
use std::iter::once;
// Gather the constraints from the available manifests. Group them by
// constraint.
let cons_map = {
let mut map = IndexMap::<&str, Vec<(&str, DependencyConstraint)>>::new();
let dep_iter = once(self.sess.manifest)
.chain(self.table.values().filter_map(|dep| dep.manifest))
.flat_map(|m| {
let pkg_name = self.sess.intern_string(m.package.name.clone());
m.dependencies.iter().map(move |(n, d)| (n, (pkg_name, d)))
})
.map(|(name, (pkg_name, dep))| {
(name, (pkg_name, self.checked_out.get(name).unwrap_or(dep)))
})
.map(|(name, (pkg_name, dep))| {
(
name,
pkg_name,
self.sess.config.overrides.get(name).unwrap_or(dep),
)
});
for (name, pkg_name, dep) in dep_iter {
let v = map.entry(name.as_str()).or_default();
v.push((pkg_name, DependencyConstraint::from(dep)));
}
map
};
// // Gather the constraints from locked and picked dependencies.
// for dep in self.table.values_mut() {
// for src in dep.sources.values_mut() {
// let _pick = match src.state.pick() {
// Some(i) => i,
// None => continue,
// };
// // TODO: Ask session for manifest at the picked version.
// // TODO: Map dependencies in manifest to constraints.
// // TODO: Add to `cons_map` map.
// }
// }
debugln!(
"resolve: gathered constraints {:#?}",
ConstraintsDumper(&cons_map)
);
// Impose the constraints on the dependencies.
let mut table = mem::take(&mut self.table);
for (name, cons) in cons_map {
for (_, con) in &cons {
debugln!("resolve: impose `{}` on `{}`", con, name);
for src in table.get_mut(name).unwrap().sources.values_mut() {
self.impose(name, con, src, &cons, rt, io)?;
}
}
}
self.table = table;
Ok(())
}
fn req_indices(
&self,
name: &str,
con: &DependencyConstraint,
src: &DependencySource<'ctx>,
) -> Result<Option<indexmap::IndexSet<usize>>> {
use self::DependencyConstraint as DepCon;
use self::DependencyVersions as DepVer;
match (con, &src.versions) {
(&DepCon::Path, &DepVer::Path) => Ok(None),
(DepCon::Version(con), DepVer::Git(gv)) => {
// TODO: Move this outside somewhere. Very inefficient!
let hash_ids: IndexMap<&str, usize> = gv
.revs
.iter()
.enumerate()
.map(|(id, &hash)| (hash, id))
.collect();
let mut revs_tmp: IndexMap<_, _> = gv
.versions
.iter()
.sorted()
.filter_map(
|&(ref v, h)| {
if con.matches(v) {
Some((v, h))
} else {
None
}
},
)
.collect();
revs_tmp.reverse();
let revs: IndexSet<usize> = revs_tmp
.iter()
.filter_map(|(v, h)| {
if con.matches(v) {
Some(hash_ids[h])
} else {
None
}
})
.collect();
// debugln!("resolve: `{}` matches version requirement `{}` for revs {:?}", name, con, revs);
Ok(Some(revs))
}
(DepCon::Revision(con), DepVer::Git(gv)) => {
// TODO: Move this outside somewhere. Very inefficient!
let mut revs: IndexSet<usize> = gv
.refs
.get(con.as_str())
.map(|rf| {
gv.revs
.iter()
.position(|rev| rev == rf)
.into_iter()
.collect()
})
.unwrap_or_else(|| {
gv.revs
.iter()
.enumerate()
.filter_map(
|(i, rev)| if rev.starts_with(con) { Some(i) } else { None },
)
.collect()
});
revs.sort();
// debugln!("resolve: `{}` matches revision `{}` for revs {:?}", name, con, revs);
Ok(Some(revs))
}
(DepCon::Version(_con), DepVer::Registry(_rv)) => Err(Error::new(format!(
"Constraints on registry dependency `{}` not implemented",
name
))),
// Handle the error cases.
// TODO: These need to improve a lot!
(con, &DepVer::Git(..)) => Err(Error::new(format!(
"Requirement `{}` cannot be applied to git dependency `{}`",
con, name
))),
(con, &DepVer::Registry(..)) => Err(Error::new(format!(
"Requirement `{}` cannot be applied to registry dependency `{}`",
con, name
))),
(_, &DepVer::Path) => Err(Error::new(format!(
"`{}` is not declared as a path dependency everywhere.",
name
))),
}
}
/// Impose a constraint on a dependency.
fn impose(
&mut self,
name: &'ctx str,
con: &DependencyConstraint,
src: &mut DependencySource<'ctx>,
all_cons: &[(&str, DependencyConstraint)],
rt: &Runtime,
io: &SessionIo<'ctx, 'ctx>,
) -> Result<()> {
let indices = match self.req_indices(name, con, src) {
Ok(o) => match o {
Some(v) => v,
None => return Ok(()),
},
Err(e) => return Err(e),
};
// debugln!("resolve: restricting `{}` to versions {:?}", name, indices);
if indices.is_empty() {
src.versions = rt.block_on(io.dependency_versions(src.id, true))?;
let indices = match self.req_indices(name, con, src) {
Ok(o) => match o {
Some(v) => v,
None => return Ok(()),
},
Err(e) => return Err(e),
};
if indices.is_empty() {
return Err(Error::new(format!(
"Dependency `{}` from {} cannot satisfy requirement `{}`",
name,
self.sess.dependency(src.id).source,
con
)));
}
}
// Mark all other versions of the dependency as invalid.
let new_ids = match src.state {
State::Open => unreachable!(),
State::Locked(_) => unreachable!(), // TODO: This needs to do something.
State::Constrained(ref ids) | State::Picked(_, ref ids) => {
let is_ids = indices
.intersection(ids)
.copied()
.collect::<IndexSet<usize>>();
if is_ids.is_empty() {
let mut msg = format!(
"Requirement `{}` conflicts with other requirements on dependency `{}`.\n",
con, name
);
let mut cons = Vec::new();
for &(pkg_name, ref con) in all_cons {
let _ = write!(msg, "\n- package `{}` requires `{}`", pkg_name, con);
cons.push(con);
}
cons = cons.into_iter().unique().collect();
// Let user resolve conflict if both stderr and stdin go to a TTY.
if std::io::stderr().is_terminal() && std::io::stdin().is_terminal() {
let decision = if let Some(d) = self.decisions.get(name) {
d.clone()
} else {
eprintln!(
"{}\n\nTo resolve this conflict manually, \
select a revision for `{}` among:",
msg, name
);
for (idx, e) in cons.iter().enumerate() {
eprintln!("{}) `{}`", idx, e);
}
loop {
eprint!("Enter a number or hit enter to abort: ");
io::stdout().flush().unwrap();
let mut buffer = String::new();
io::stdin().read_line(&mut buffer).unwrap();
if buffer.starts_with('\n') {
break Err(Error::new(msg));
}
let choice = match buffer.trim().parse::<usize>() {
Ok(u) => u,
Err(_) => {
eprintln!("Invalid input!");
continue;
}
};
let decision = match cons.get(choice) {
Some(c) => c,
None => {
eprintln!("Choice out of bounds!");
continue;
}
};
self.decisions.insert(name, (*decision).clone());
break Ok((*decision).clone());
}?
};
match self.req_indices(name, &decision, src) {
Ok(o) => match o {
Some(v) => Ok(v),
None => unreachable!(),
},
Err(e) => Err(e),
}
} else {
Err(Error::new(msg))
}
} else {
Ok(is_ids)
}
}
};
match src.state {
State::Open => unreachable!(),
State::Locked(_) => unreachable!(),
State::Constrained(ref mut ids) | State::Picked(_, ref mut ids) => match new_ids {
Err(e) => Err(e),
Ok(is) => {
*ids = is;
Ok(())
}
},
}
}
/// Pick a version for each dependency.
fn pick(&mut self) -> Result<bool> {
let mut any_changes = false;
let mut open_pending = IndexSet::<&'ctx str>::new();
for dep in self.table.values_mut() {
for src in dep.sources.values_mut() {
src.state = match src.state {
State::Open => unreachable!(),
State::Locked(id) => State::Locked(id),
State::Constrained(ref ids) => {
any_changes = true;
match src.versions {
DependencyVersions::Path => {
debugln!(
"resolve: picking path version `{}[{}]`",
dep.name,
src.id
);
State::Picked(0, IndexSet::new())
}
DependencyVersions::Git(..) => {
debugln!("resolve: picking version for `{}[{}]`", dep.name, src.id);
State::Picked(ids.first().copied().unwrap(), ids.clone())
}
DependencyVersions::Registry(..) => {
return Err(Error::new(format!("Version picking for registry dependency `{}` not yet implemented", dep.name)));
}
}
}
State::Picked(id, ref ids) => {
if !src.is_path() && !ids.contains(&id) {
debugln!(
"resolve: picked version for `{}[{}]` no longer valid, resetting",
dep.name,
src.id
);
if let Some(manifest) = dep.manifest {
open_pending
.extend(manifest.dependencies.keys().map(String::as_str));
}
any_changes = true;
State::Open
} else {
State::Picked(id, ids.clone())
}
}
}
}
}
// Recursively open up dependencies.
while !open_pending.is_empty() {
use std::mem::swap;
let mut open = IndexSet::new();
swap(&mut open_pending, &mut open);
for dep_name in open {
debugln!("resolve: resetting `{}`", dep_name);
let dep = self.table.get_mut(dep_name).unwrap();
for src in dep.sources.values_mut() {
if !src.state.is_open() {
any_changes = true;
if let Some(manifest) = dep.manifest {
open_pending.extend(manifest.dependencies.keys().map(String::as_str));
}
src.state = State::Open;
}
}
}
}
Ok(any_changes)
}
/// Close the set of dependencies.
fn close(&mut self, rt: &Runtime, io: &SessionIo<'ctx, 'ctx>) -> Result<()> {
debugln!("resolve: computing closure over dependencies");
let manifests: Vec<(&str, Option<&Manifest>)> = {
let mut sub_deps = Vec::new();
for dep in self.table.values() {
let src = dep.source();
let version = match src.pick() {
Some(v) => v,
None => continue,
};
let manifest = io.dependency_manifest_version(src.id, version);
sub_deps.push(async move { manifest.await.map(move |m| (dep.name, m)) });
}
rt.block_on(join_all(sub_deps))
.into_iter()
.collect::<Result<Vec<(&str, Option<&Manifest>)>>>()?
};
for (name, manifest) in manifests {
if let Some(m) = manifest {
debugln!("resolve: for `{}` loaded manifest {:#?}", name, m);
self.register_dependencies_in_manifest(&m.dependencies, m, rt, io)?;
}
let existing = &mut self.table.get_mut(name).unwrap().manifest;
*existing = manifest;
}
Ok(())
}
}
/// A dependency in the version table.
///
/// One such entry exists per dependency name. Note that multiple sources may
/// exist for each dependency. This happens if two packages specify the same
/// dependency name, but two different sources:
///
/// ```ignore
/// # a/Bender.yml
/// dependencies:
/// foo: { git: "alpha@example.com:foo", version: "1.0.0" }
///
/// # b/Bender.yml
/// dependencies:
/// foo: { git: "beta@example.com:foo", version: "1.0.0" }
/// ```
///
/// Note that despite the different sources, they might refer to the same
/// dependency and be compatible, e.g. via the git hash.
#[derive(Debug)]
struct Dependency<'ctx> {
/// The name of the dependency.
name: &'ctx str,
/// The set of sources for this dependency.
sources: IndexMap<DependencyRef, DependencySource<'ctx>>,
/// The picked manifest for this dependency.
manifest: Option<&'ctx config::Manifest>,
}
impl<'ctx> Dependency<'ctx> {
/// Create a new dependency.
fn new(name: &'ctx str) -> Dependency<'ctx> {
Dependency {
name,
sources: IndexMap::new(),
manifest: None,
}
}
/// Return the main source for this dependency.
///
/// This is currently defined as the very first source found for this
/// dependency.
fn source(&self) -> &DependencySource<'ctx> {
let min = self.sources.keys().min().unwrap();
&self.sources[min]
}
}
/// A source for a dependency.
///
/// A dependency may have multiple sources. See `Dependency`.
#[derive(Debug)]
struct DependencySource<'ctx> {
/// The ID of this dependency.
id: DependencyRef,
/// The available versions of the dependency.
versions: DependencyVersions<'ctx>,
/// The currently picked version.
pick: Option<usize>,
/// The available version options. These are indices into `versions`.
options: Option<IndexSet<usize>>,
/// The current resolution state.
state: State,
}
impl<'ctx> DependencySource<'ctx> {
/// Create a new dependency source.
fn new(id: DependencyRef, versions: DependencyVersions<'ctx>) -> DependencySource<'ctx> {
DependencySource {
id,
versions,
pick: None,
options: None,
state: State::Open,
}
}
/// Return the picked version, if any.
///
/// In case the state is `Locked` or `Picked`, returns the version that was
/// picked. Otherwise returns `None`.
fn pick(&self) -> Option<DependencyVersion<'ctx>> {
match self.state {
State::Open | State::Constrained(..) => None,
State::Locked(id) | State::Picked(id, _) => match self.versions {
DependencyVersions::Path => Some(DependencyVersion::Path),
DependencyVersions::Registry(ref _rv) => None,
DependencyVersions::Git(ref gv) => Some(DependencyVersion::Git(gv.revs[id])),
},
}
}
/// Check whether this is a path dependency.
fn is_path(&self) -> bool {
matches!(self.versions, DependencyVersions::Path)
}
}
#[derive(Debug)]
enum State {
/// The dependency has never been seen before and is not constrained.
Open,
/// The dependency has been locked in the lockfile.
Locked(usize),
/// The dependency may assume any of the listed versions.
Constrained(IndexSet<usize>),
/// The dependency had a version picked.
Picked(usize, IndexSet<usize>),
}
impl State {
/// Check whether the state is `Open`.
fn is_open(&self) -> bool {
matches!(*self, State::Open)
}
/// Return the index of the picked version, if any.
///
/// In case the state is `Locked` or `Picked`, returns the version that was
/// picked. Otherwise returns `None`.
fn pick(&self) -> Option<usize> {
match *self {
State::Locked(i) | State::Picked(i, _) => Some(i),
_ => None,
}
}
}
struct TableDumper<'a>(&'a IndexMap<&'a str, Dependency<'a>>);
impl<'a> fmt::Debug for TableDumper<'a> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let mut names: Vec<_> = self.0.keys().collect();
names.sort();
write!(f, "{{")?;
for name in names {
let dep = self.0.get(name).unwrap();
write!(f, "\n \"{}\":", name)?;
for (&id, src) in &dep.sources {
write!(f, "\n [{}]:", id)?;
match src.state {
State::Open => write!(f, " open")?,
State::Locked(idx) => write!(f, " locked {}", idx)?,
State::Constrained(ref idcs) => write!(f, " {} possible", idcs.len())?,
State::Picked(idx, ref idcs) => {
write!(f, " picked #{} out of {} possible", idx, idcs.len())?
}
}
}
}
write!(f, "\n}}")?;
Ok(())
}
}
struct ConstraintsDumper<'a>(&'a IndexMap<&'a str, Vec<(&'a str, DependencyConstraint)>>);
impl<'a> fmt::Debug for ConstraintsDumper<'a> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let mut names: Vec<_> = self.0.keys().collect();
names.sort();
write!(f, "{{")?;
for name in names {
let cons = self.0.get(name).unwrap();
write!(f, "\n \"{}\":", name)?;
for &(pkg_name, ref con) in cons {
write!(f, " {} ({});", con, pkg_name)?;
}
}
write!(f, "\n}}")?;
Ok(())
}
}