Inserts given item with given value in heap
(self, item: int, item_value: int)
| 103 | self._heapify_down(index) |
| 104 | |
| 105 | def insert_item(self, item: int, item_value: int) -> None: |
| 106 | """Inserts given item with given value in heap""" |
| 107 | arr_len = len(self.arr) |
| 108 | if arr_len == self.size: |
| 109 | self.arr.append([item, self.key(item_value)]) |
| 110 | else: |
| 111 | self.arr[self.size] = [item, self.key(item_value)] |
| 112 | self.pos_map[item] = self.size |
| 113 | self.size += 1 |
| 114 | self._heapify_up(self.size - 1) |
| 115 | |
| 116 | def get_top(self) -> tuple | None: |
| 117 | """Returns top item tuple (Calculated value, item) from heap if present""" |
nothing calls this directly
no test coverage detected