Temporal complexity specification and AVL trees

[pavel-kirienko]

I am currently refactoring libcanard to get rid of linear-complexity linked lists in favor of logarithmic-complexity AVL trees and it occurred to me that this library would benefit from adopting logarithmic pipelines from the start. There seem to be some decent-looking implementations of fast containers in Rust although I'm not sure if there is one that suits this project. I couldn't find one in C so I had to craft one myself, however, I don't expect this specific implementation to be easily portable to Rust as-is due to lifetime issues.

Related discussion:

• Transfer reception dataflow is all wrong, performance is a nightmare, determinism went out the window, everything is terrible libcyphal#185
• IO performance is highly dependent on the size of the TX queue libcyphal#189