lastName = e.filename;
                resumeKey = e.fileIndex;
            }

            bufferIndex += e.nextEntryOffset;
        }

        /* last nextEntryOffset for NT 4(but not 98) is 0 so we must
         * use dataCount or our accounting will report an error for NT :~(
         */

        //return bufferIndex - start;

        return dataCount;
    }

        if (now - lastLoadedTime > 60000L) {
            final List<String> nameList = loadDataStoreNameList();
            dataStoreNames = nameList.toArray(n -> new String[nameList.size()]);
            lastLoadedTime = now;
        }
        return dataStoreNames;
    }

    /**
     * Loads the list of available data store names by scanning plugin JAR files.

        final List<LlmMessage> history = new ArrayList<>();
        for (int i = 1; i <= 8; i++) {
            history.add(LlmMessage.user("Question " + i));
        }

        final LlmChatRequest request = client.testBuildIntentRequest("Question 9", history);
        final List<LlmMessage> messages = request.getMessages();

        // system + 6 history (last 6) + user = 8 messages

	// Compute endEncOffset with one additional DARE package (so
	// we read the package containing the last desired byte).
	endEncOffset := encCumulativeSum + (endPkgNum+1)*sseDAREEncPackageBlockSize
	// Check if the DARE package containing the end offset is a
	// full sized package (as the last package in the part may be
	// smaller)
	lastPartSize, _ := sio.EncryptedSize(uint64(sizes[partEnd]))

        return collection.isEmpty() ? null : collection.getFirst();
    }

    /**
     * Returns the last element of a sequenced collection.
     *
     * @param <E> the element type
     * @param collection the sequenced collection
     * @return the last element, or null if the collection is empty
     * @since Java 21
     */

        // Arrange: program send() to simulate first, next, next(NO_MORE_FILES)
        List<String[]> batches = new ArrayList<>();
        batches.add(new String[] { ".", "..", "a", "b" }); // first batch, dot entries filtered
        batches.add(new String[] { "c" }); // second batch
        batches.add(new String[] {}); // last -> NO_MORE_FILES

        // send() answer that mutates the provided response

    }
  }

  private static final class PermutationIterator<E> extends AbstractIterator<List<E>> {
    final List<E> list;
    final int[] c;
    final int[] o;
    int j;

    PermutationIterator(List<E> list) {
      this.list = new ArrayList<>(list);
      int n = list.size();
      c = new int[n];
      o = new int[n];
      Arrays.fill(c, 0);
      Arrays.fill(o, 1);

         * distinct elements, and add the last element over again many times over. We don't want a
         * situation where we re-sort the entire buffer every time the last element is re-added.
         *
         * <p>The solution is to ensure there are O(n) spaces left over in the buffer after
         * sortAndDedup -- that is, at least c*n for some constant c > 0. Ensuring the buffer size

				},
			},
		},

		// listMultipartResults - 31.
		// checking listing with marker set to 3.
		// `NextUploadIDMarker` is expected to be set on last uploadID in the result.
		// `NextKeyMarker` is expected to be set on the last object key in the list.
		{
			MaxUploads:         3,
			IsTruncated:        true,
			NextUploadIDMarker: uploadIDs[6],
			NextKeyMarker:      objectNames[2],

    this.chunkSize = chunkSize;
  }

  /** Processes the available bytes of the buffer (at most {@code chunk} bytes). */
  protected abstract void process(ByteBuffer bb);

  /**
   * This is invoked for the last bytes of the input, which are not enough to fill a whole chunk.
   * The passed {@code ByteBuffer} is guaranteed to be non-empty.
   *
   * <p>This implementation simply pads with zeros and delegates to {@link #process(ByteBuffer)}.