*/
  protected void processRemaining(ByteBuffer bb) {
    Java8Compatibility.position(bb, bb.limit()); // move at the end
    Java8Compatibility.limit(bb, chunkSize + 7); // get ready to pad with longs
    while (bb.position() < chunkSize) {
      bb.putLong(0);
    }
    Java8Compatibility.limit(bb, chunkSize);
    Java8Compatibility.flip(bb);
    process(bb);
  }

            int[] positions = { 0, 50, 100, 500, 800 };

            for (int position : positions) {
                SMBUtil.writeInt2(4, buffer, position);

                int result = echoResponse.readBytesWireFormat(buffer, position);
                assertEquals(0, result, "Failed at position " + position);
            }
        }

        @Test

        byte[] fileNameBytes1 = fileName1.getBytes("UTF-16LE");
        buffer.putInt(fileNameBytes1.length);
        buffer.put(fileNameBytes1);

        // Align to secondOffset
        buffer.position(secondOffset);

        // Second notification with zero nextEntryOffset (last entry)
        buffer.putInt(0); // nextEntryOffset = 0 (last entry)
        buffer.putInt(FileNotifyInformation.FILE_ACTION_REMOVED);

     * This is required for tracking and analytics purposes.
     */
    @Required
    public String queryId;

    /**
     * Order or ranking position of the document in search results.
     * This optional field helps track which result position was clicked.
     */
    public Integer order;

    // for error page

    /**
     * Query string parameter for error page fallback.

     */
    private void ensureCapacity(int needed) {
      if (buffer.remaining() >= needed) {
        return;
      }

      int currentCapacity = buffer.capacity();
      int requiredCapacity = buffer.position() + needed;
      int newCapacity = Math.max(currentCapacity * 2, requiredCapacity);

      ByteBuffer newBuffer = ByteBuffer.allocate(newCapacity).order(ByteOrder.LITTLE_ENDIAN);

  @Override
  int indexOf(@Nullable Object target) {
    if (target == null) {
      return -1;
    }
    int position;
    try {
      position = Collections.binarySearch(elements, target, unsafeComparator());
    } catch (ClassCastException e) {
      return -1;
    }
    return (position >= 0) ? position : -1;
  }

  @Override
  ImmutableList<E> createAsList() {

        assertEquals('B', stream.read());

        // Mark current position
        stream.mark(10);

        assertEquals('C', stream.read());
        assertEquals('D', stream.read());

        // Reset to marked position
        stream.reset();

        // Should read from marked position again
        assertEquals('C', stream.read());
        assertEquals('D', stream.read());
    }

     */
    void addRule(Rule rule);

    /**
     * Adds a rule to the specified index.
     *
     * @param index the position at which the rule should be added
     * @param rule the rule to be added
     */
    /**
     * Adds a rule to the specified index.
     *
     * @param index the position at which the rule should be added
     * @param rule the rule to be added
     */
    void addRule(int index, Rule rule);

significant limb, // we can insert each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need to reduce every time we shift. i := len(x.limbs) - 1 // For the first N - 1 limbs we can skip the actual shifting and position // them at the shifted position, which starts at min(N - 2, i). start := len(m.nat.limbs) - 2 if i <...

     * @param rule the rule to add
     */
    @Override
    public void addRule(final Rule rule) {
        ruleList.add(rule);
    }

    /**
     * Adds a rule at the specified position in the rule list.
     * @param index the position to insert the rule
     * @param rule the rule to add
     */
    @Override
    public void addRule(final int index, final Rule rule) {
        ruleList.add(index, rule);
    }

    /*