I would like to use IndexMap as a BTreeMap with faster reads and slower writes.
But calling sort_keys() after every insert() is pretty slow.
Would it be possible to have a insert_sorted() method that would just insert the element before the next bigger one?