competitive-programming-rs VS pdc

I have this question because, as practice, I'm trying to implement a struct Scanner based on this repo, and as an extra, I'd like to be able to handle errors instead of just panicking. However, unlike map(), the skip_while() and take_while() won't handle errors. If the Errs wouldn't happen unless in situations when the program were going very wrong, then I could just panic. Alternatively, is there a way to break and just return an error once bytes() gives an Err, with just iterator function chaining and without having to write loops myself?

This week I read about FnMut and FnOnce. I also found some amazing Rust code for parsing input/output for competitive programming , and solved all the google kickstart problems using it. I made two one hour video of my efforts starting here: https://youtu.be/EvL5YfPw8Ts

I'm working on the interface for my load testing tool pdc! Right now it has a simple `rust-tui`/`crossterm` interface that shows a graph of the current send rate of `pdc`. It feels a little tacked on (because it is), and a refactor would go a long way.

I'm building an HTTP load tester called pdc! I have run out of obvious (to me at least) places to look for performance gains. I'm achieving around 45,000 requests per second, per core. Right now I'm using hyper with a separate tokio runtime (in current thread mode) running on each core. So far having runtime on each core/NUMA node has really helped with cache coherency. Any recommendations for profiling beyond tokio console or tokio metrics (Convenient timing amirite!)?