| 575 | } |
| 576 | |
| 577 | void RemoveAt(intptr idx) |
| 578 | { |
| 579 | BF_ASSERT((uintptr)idx < (uintptr)this->mSize); |
| 580 | |
| 581 | this->mVals[idx].~T(); |
| 582 | |
| 583 | // If we're removing the last element then we don't have to move anything |
| 584 | if (idx != this->mSize - 1) |
| 585 | { |
| 586 | intptr moveCount = this->mSize - idx - 1; |
| 587 | MoveArray(this->mVals + idx, this->mVals + idx + 1, moveCount); |
| 588 | } |
| 589 | this->mSize--; |
| 590 | } |
| 591 | |
| 592 | // 'Fast' because it's allowed to change item order |
| 593 | void RemoveAtFast(intptr idx) |
no outgoing calls
no test coverage detected