Log a large bisection about to run (the slow steps). `&self` so it can be shared across the parallel recursion.
(&self, n: usize, k: usize)
| 612 | |
| 613 | impl PartitionProgress { |
| 614 | fn new(total: usize) -> Self { |
| 615 | PartitionProgress { |
| 616 | total, |
| 617 | finalized: AtomicUsize::new(0), |
| 618 | start: Instant::now(), |
| 619 | enabled: std::env::var("IX_SHARD_QUIET").is_err(), |
| 620 | } |
| 621 | } |
| 622 | |
| 623 | /// Log a large bisection about to run (the slow steps). `&self` so it can be |
| 624 | /// shared across the parallel recursion. |
| 625 | fn bisecting(&self, n: usize, k: usize) { |
| 626 | if self.enabled && n >= PROGRESS_BISECT_LOG { |