Insert a new item. If equal keys are found, add to the right
(self, item)
| 152 | self._items.insert(i, item) |
| 153 | |
| 154 | def insert_right(self, item): |
| 155 | 'Insert a new item. If equal keys are found, add to the right' |
| 156 | k = self._key(item) |
| 157 | i = bisect_right(self._keys, k) |
| 158 | self._keys.insert(i, k) |
| 159 | self._items.insert(i, item) |
| 160 | |
| 161 | def remove(self, item): |
| 162 | 'Remove first occurence of item. Raise ValueError if not found' |
no test coverage detected