Matthias
Matthias
But when playing with it, keep in mind that a templated list of pairs does not sort the items thus lookup is still O(n) but (because of zserio runtime internals)...
Maybe we should think about adding a registered callback which can be called before writing which could be used to resort, but still you need to implement the optimized lookup...
Allowing basetypes as keys only is not only "simpler" but also the only possible thing to do. Structs and/or choices are not guaranteed to be sortable in any way...
Tested fine, thanks!