stdfwd VS quickcpplib

It would be interesting to see how bitwise tries compare (https://github.com/ned14/quickcpplib/blob/master/include/quickcpplib/algorithm/bitwise_trie.hpp). I would expect bitwise tries to be much faster than a bitwise binary tree.

Ok, so I found this apparent implementation of start_lifetime_as here https://github.com/ned14/quickcpplib/blob/master/include/quickcpplib/start_lifetime_as.hpp

I know the right design in my opinion here: customisable accessor based, like how https://github.com/ned14/quickcpplib/blob/master/include/quickcpplib/algorithm/bitwise_trie.hpp does things. Then you get application flexibility, rather than the rigidity a STL container forces you into (which BTW is great if that suits you, but it sucks if it doesn't). Obviously one can implement a corresponding STL container from the same algorithm easily,

As I await F2F meetings to resume at WG21, I’ve been trying to find the non-work time to do more coding for future WG21 papers. I am pleased to announce that I have finally gotten around to a long and oft promised to many of you high quality implementation of bitwise Fredkin trie indexing for C++ 14 which you can find at https://github.com/ned14/quickcpplib/blob/master/include/quickcpplib/algorithm/bitwise_trie.hpp (doxygen: https://ned14.github.io/quickcpplib/classquickcpplib_1_1__xxx_1_1algorithm_1_1bitwise__trie_1_1bitwise__trie.html).

(Before anyone asks for that clang AST tool, here it is: https://github.com/ned14/quickcpplib/tree/cdfb750ecb2b145d34c0175cc94116bf36af4032. No it's not production quality, no nobody should use it in anger)