docs: private int findMaxElementIndex()
    {
      switch (heapSize) {
        case 1:
          return 0; // The lone element in the queue is the maximum.
        case 2:
          return 1; // The lone element in the maxHeap is the maximum.
        default:
          // The max element must sit on the first level of the maxHeap. It is
          // actually the *lesser* of the two from the maxHeap's perspective.
          int offset1 = buf.getInt(1 * Integer.BYTES);
          int offset2 = buf.getInt(2 * Integer.BYTES);
          return maxComparator.compare(offset1, offset2) <= 0 ? 1 : 2;
      }
    }