def insert_right(self, item):
        k = self._key(item)
        i = bisect_right(self._keys, k)
        self._keys.insert(i, k)
        self._items.insert(i, item)
Insert a new item.  If equal keys are found, add to the right
dataset/ETHPy150Open tanghaibao/jcvi/utils/orderedcollections.py/SortedCollection.insert_right