interface Callback {
    fun onEvent(
      id: String?,
      type: String?,
      data: String,
    )

    fun onRetryChange(timeMs: Long)
  }

  /**
   * Process the next event. This will result in a single call to [Callback.onEvent] *unless* the
   * data section was empty. Any number of calls to [Callback.onRetryChange] may occur while
   * processing an event.
   *

    private boolean isLoggedInAsGuest;
    private byte[] blob = null;

    /**
     * Constructs a session setup AndX response.
     *
     * @param config the configuration to use
     * @param andx the next command in the AndX chain, or null
     */
    public SmbComSessionSetupAndXResponse(final Configuration config, final ServerMessageBlock andx) {
        super(config, andx);
    }

    /**

        return tempFile;
    }

    public void cleanUp() throws IOException {
        for (Iterator it = filesToDelete.iterator(); it.hasNext(); ) {
            File file = (File) it.next();

            if (file.exists()) {
                if (file.isDirectory()) {
                    FileUtils.deleteDirectory(file);
                } else {
                    file.delete();
                }

        Iterator<TransferResourceAndSize> entries = transfers.values().iterator();
        while (entries.hasNext()) {
            TransferResourceAndSize entry = entries.next();
            // just in case, make sure 0 <= complete <= total
            long complete = Math.max(0, entry.transferredBytes);
            long total = Math.max(complete, entry.resource.getContentLength());

    Iterator<String> iterator = splitter.split(builder).iterator();

    builder.append("A,");
    assertThat(iterator.next()).isEqualTo("A");
    builder.append("B,");
    assertThat(iterator.next()).isEqualTo("B");
    builder.append("C");
    assertThat(iterator.next()).isEqualTo("C");
    assertFalse(iterator.hasNext());
  }

  public void testFixedLengthSimpleSplit() {
    String simple = "abcde";

		t.Fatalf("tw.Write: %v", err)
	}
	if err := tw.Close(); err != nil {
		t.Fatalf("tw.Close: %v", err)
	}

	// Read it back.
	tr := NewReader(&b)
	rHdr, err := tr.Next()
	if err != nil {
		t.Fatalf("tr.Next: %v", err)
	}
	if !reflect.DeepEqual(rHdr, hdr) {
		t.Errorf("Header mismatch.\n got %+v\nwant %+v", rHdr, hdr)
	}
	rData, err := io.ReadAll(tr)
	if err != nil {

            final StringBuilder value = new StringBuilder();
            final Iterator<String> values = property.getValue().iterator();
            while (values.hasNext()) {
                value.append(values.next());
                if (values.hasNext()) {
                    value.append(", ");
                }
            }
            this.setRequestProperty(key, value.toString());
        }

         */
        public boolean isExistPrePage() {
            return currentPageNumber != 1;
        }

        /**
         * Checks if a next page exists.
         *
         * @return true if there is a next page, false otherwise
         */
        public boolean isExistNextPage() {
            return currentPageNumber != allPageCount;
        }

        /**

      true
    } else {
      scheduleCloser()
      false
    }
  }

  fun evictAll() {
    val i = connections.iterator()
    while (i.hasNext()) {
      val connection = i.next()
      val socketToClose =
        connection.withLock {
          if (connection.calls.isEmpty()) {
            i.remove()
            connection.noNewExchanges = true

   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
   * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
   */
  @VisibleForTesting transient long @Nullable [] links;