return transferElement(nextElements, previousElements);
    }

    @Override
    public int nextIndex() {
      return previousElements.size();
    }

    @Override
    public E previous() {
      return transferElement(previousElements, nextElements);
    }

    @Override
    public int previousIndex() {
      return nextIndex() - 1;
    }

    @Override
    public void remove() {

  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

  private final Random random = new Random();

  @BeforeExperiment
  void setUp() {
    queue = heap.create(comparator.get());
    for (int i = 0; i < size; i++) {
      queue.add(random.nextInt());
    }
  }

  @Benchmark
  void pollAndAdd(int reps) {
    for (int i = 0; i < reps; i++) {

    void size_returnsAlignedValue() {
        // Arrange
        Smb2LogoffRequest req = newRequest();
        int base = Smb2Constants.SMB2_HEADER_LENGTH + 4; // structure size
        int expected = ((base + 7) / 8) * 8; // expected 8-byte alignment

        // Act
        int actual = req.size();

        // Assert
        assertEquals(expected, actual, "size() must be 8-byte aligned");
    }

     * @param statement
     *            {@link Statement}. Must not be {@literal null}.
     * @param fetchSize
     *            Fetch size.
     * @see Statement#setFetchSize(int)
     */
    public static void setFetchSize(final Statement statement, final int fetchSize) {
        assertArgumentNotNull("statement", statement);

        try {
            statement.setFetchSize(fetchSize);
        } catch (final SQLException ex) {

        for (int i = 0; i < num; i++) {
          list.add(counter.getAndIncrement());
        }
        builder.addAll(list);
      }
    },
    ADD_ITERABLE {
      @Override
      void doIt(ImmutableLongArray.Builder builder, AtomicLong counter) {
        List<Long> list = new ArrayList<>();
        long num = random.nextInt(10);
        for (int i = 0; i < num; i++) {

        final int threadCount = 10;
        final int operationsPerThread = 100;
        final ExecutorService executor = Executors.newFixedThreadPool(threadCount);

        final List<Long> timings = Collections.synchronizedList(new ArrayList<>());

        try {
            for (int t = 0; t < threadCount; t++) {
                executor.submit(() -> {

     */
    public int getValue() {
        return version;
    }

    /**
     * Gets the major version number.
     *
     * @return the major version
     */
    public int getMajorVersion() {
        return (version >> 16) & 0xFFFF;
    }

    /**
     * Gets the minor version number.
     *
     * @return the minor version
     */
    public int getMinorVersion() {

  }

  private static final ImmutableList<Range<Integer>> RANGES;
  private static final int MIN_BOUND = -1;
  private static final int MAX_BOUND = 1;

  static {
    ImmutableList.Builder<Range<Integer>> builder = ImmutableList.builder();

    builder.add(Range.<Integer>all());

    // Add one-ended ranges
    for (int i = MIN_BOUND; i <= MAX_BOUND; i++) {
      for (BoundType type : BoundType.values()) {

        
        // Data (16 bytes of reserved)
        int dataOffset = offset + 16 + nameLen;
        dataOffset = (dataOffset + 7) & ~7;  // 8-byte alignment
        
        for (int i = 0; i < 16; i++) {
            buffer[dataOffset + i] = 0;
        }
    }
    
    @Override
    public int size() {
        int nameLen = getName().length();

                valid = false;
            }
        }
    }

    @Override
    protected int generateLocalKey() {
        // In real implementation, this would get the local key from DiSNI:
        // return memoryRegister.getLkey();
        return keyGenerator.getAndIncrement();
    }

    @Override
    protected int generateRemoteKey() {
        // In real implementation, this would get the remote key from DiSNI: