My understanding from looking at the code is that the groupby operator implementation uses a std::map to map each key to the grouped_observable for aggregating values corresponding to the key. If that is the case, why do we use std::map? Why do we need to have ordering on the keys and incur the extra find/insert cost when all we are doing is a groupby?
My understanding from looking at the code is that the groupby operator implementation uses a std::map to map each key to the grouped_observable for aggregating values corresponding to the key. If that is the case, why do we use std::map? Why do we need to have ordering on the keys and incur the extra find/insert cost when all we are doing is a groupby?