Insert a new item. If equal keys are found, add to the left
(self, item)
| 145 | return self._items[i:j].count(item) |
| 146 | |
| 147 | def insert(self, item): |
| 148 | 'Insert a new item. If equal keys are found, add to the left' |
| 149 | k = self._key(item) |
| 150 | i = bisect_left(self._keys, k) |
| 151 | self._keys.insert(i, k) |
| 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' |
no outgoing calls
no test coverage detected