Method SwapAndPop

eval/eval/evaluator_stack.h:284–296

Swaps the `n - i` element (from the top of the stack) with the `n` element, and pops `n - 1` elements. This results in the `n - i` element being at the top of the stack.

  // and pops `n - 1` elements. This results in the `n - i` element being at the
  // top of the stack.
  void SwapAndPop(size_t n, size_t i) {
    ABSL_DCHECK_GT(n, 0);
    ABSL_DCHECK_LT(i, n);
    ABSL_DCHECK(HasEnough(n - 1));

    using std::swap;

    if (i > 0) {
      swap(*(values_ - n), *(values_ - n + i));
      swap(*(attributes_ - n), *(attributes_ - n + i));
    }
    Pop(n - 1);
  }

  // Update the max size of the stack and update capacity if needed.
  void SetMaxSize(size_t size) { Reserve(size); }