The C++ version of TimeInterpolatableBuffer uses std::vector<std::pair<units::second_t, T>> for internal storage. The vector in is sorted for binary search, but old elements are removed from the front, which causes a copy cascade.Using wpi::DenseMap<units::second_t, T> instead would avoid the extra copies and have the same access time complexity.
All examples seems to put all code in the main() function, and demonstrate some static condition happening once. However, this does not reflect any real use cases, and I struggle really hard to implement anything actually useful using the HAL (unless of course I would put all logic into the main() function). There should be some examples which shows actual useful use-cases, and not just PoCs.
The C++ version of TimeInterpolatableBuffer uses
std::vector<std::pair<units::second_t, T>>for internal storage. The vector in is sorted for binary search, but old elements are removed from the front, which causes a copy cascade.Usingwpi::DenseMap<units::second_t, T>instead would avoid the extra copies and have the same access time complexity.Normally, using a map here would make the me