Hello,
the documentation of some flat_map operations has a misleading complexity guarantee. For instance, operator[] or insert_or_assign say "logarithmic", but while the number of comparisons is logarithmic, the number of move/copy can be linear. emplace kind of acknowledges this ("Logarithmic search time plus linear insertion to the elements with bigger keys than x"), although it is still wrong if the capacity is exceeded.
igaztanaga
commented
4 years ago
Hello, the documentation of some flat_map operations has a misleading complexity guarantee. For instance,
operator[]orinsert_or_assignsay "logarithmic", but while the number of comparisons is logarithmic, the number of move/copy can be linear.emplacekind of acknowledges this ("Logarithmic search time plus linear insertion to the elements with bigger keys than x"), although it is still wrong if the capacity is exceeded.