bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Remove unused hashset.

Browse Source
This commit is contained in:
Bert Peters
2018-12-07 18:13:40 +01:00
parent 3deb4ceb9a
commit 0c07cbda24
1 changed files with 0 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
2018/src/day07.rs
View File

@@ -2,7 +2,6 @@ use std::cmp::Ordering;
use std::cmp::Reverse;
use std::collections::BinaryHeap;
use std::collections::HashMap;
use std::collections::HashSet;
use std::io::BufRead;
use std::io::BufReader;
use std::io::Read;
@@ -63,7 +62,6 @@ impl Day07 {
.map(|&x| Reverse(x)).collect();
let mut workers: BinaryHeap<Worker> = BinaryHeap::new();
let mut finished = HashSet::new();
let mut time = 0;
while !starting_points.is_empty() || !workers.is_empty() {
@@ -80,7 +78,6 @@ impl Day07 {
while let Some(worker) = workers.pop() {
if worker.time == time {
let c = worker.work;
finished.insert(c);
if let Some(dependents) = self.forward.get(&c) {
for d in dependents {
@@ -108,14 +105,12 @@ impl Solution for Day07 {
self.read_edges(input);
let mut result = String::new();
let mut finished = HashSet::new();
let mut starting_points: BinaryHeap<_> = self.forward.keys().filter(|&x| !self.dep_count.contains_key(x))
.map(|&x| Reverse(x)).collect();
while let Some(Reverse(c)) = starting_points.pop() {
result.push(c);
finished.insert(c);
if let Some(dependents) = self.forward.get(&c) {
for d in dependents {