Do a DFS on dependencies to complete the list

[?]
Dec 11, 2020, 9:44 PM
6WFOU7UXCYM5UWA5WVZ72XFRJWJA5GWCIAC5PI5NOEFHNFD3VKNAC

Dependencies

  • [2] Q45QHPO4 Feedback on network stuff
  • [3] BE7GUCI2 Completing dependencies only with changes the remote does not have
  • [4] I52XSRUH Massive cleanup, and simplification
  • [5] M5FK3ABT Complete dependencies when pushing and pulling
  • [*] SXEYMYF7 Fixing the bad changes in history (unfortunately, by rebooting).

Change contents

  • replacement in pijul/src/commands/pushpull.rs at line 497
    [4.1054][4.1054:1141]()
    let mut now_ = HashSet::new();
    let mut result = Vec::new();
    for n in now {
    [4.1054]
    [4.1141]
    let mut now_ = HashSet::with_capacity(original.len());
    let mut result = Vec::with_capacity(original.len());
    for &h in now {
    now_.insert(h);
    result.push(h);
    }
    let mut stack = now.to_vec();
    stack.reverse();
    while let Some(n) = stack.pop() {
  • replacement in pijul/src/commands/pushpull.rs at line 507
    [4.1213][4.1213:1255]()
    for d in c.get_dependencies(n)? {
    [4.1213]
    [3.298]
    for d in c.get_dependencies(&n)? {
  • edit in pijul/src/commands/pushpull.rs at line 516
    [4.1390]
    [4.1390]
    stack.push(d);
  • replacement in pijul/src/commands/pushpull.rs at line 519
    [4.1414][2.2229:2286]()
    if now_.insert(*n) {
    result.push(*n)
    [4.1414]
    [2.2286]
    if now_.insert(n) {
    result.push(n)