(container)
| 11124 | return new Uint8Array(buffer); |
| 11125 | } |
| 11126 | function DequeueValue(container) { |
| 11127 | const pair = container._queue.shift(); |
| 11128 | container._queueTotalSize -= pair.size; |
| 11129 | if (container._queueTotalSize < 0) { |
| 11130 | container._queueTotalSize = 0; |
| 11131 | } |
| 11132 | return pair.value; |
| 11133 | } |
| 11134 | function EnqueueValueWithSize(container, value, size) { |
| 11135 | if (!IsNonNegativeNumber(size) || size === Infinity) { |
| 11136 | throw new RangeError("Size must be a finite, non-NaN, non-negative number."); |
no test coverage detected
searching dependent graphs…