Push |item| into bottom side of this queue. If the queue is full, pop topmost item first.
| 109 | // Push |item| into bottom side of this queue. If the queue is full, |
| 110 | // pop topmost item first. |
| 111 | void elim_push(const T& item) { |
| 112 | if (_count < _cap) { |
| 113 | new ((T*)_items + _mod(_start + _count, _cap)) T(item); |
| 114 | ++_count; |
| 115 | } else { |
| 116 | ((T*)_items)[_start] = item; |
| 117 | _start = _mod(_start + 1, _cap); |
| 118 | } |
| 119 | } |
| 120 | |
| 121 | // Push a default-constructed item into bottom side of this queue |
| 122 | // Returns address of the item inside this queue |
no outgoing calls
no test coverage detected