public final void readFully(final byte b[], final int off, final int len) throws SmbException {
        int n = 0, count;

        do {
            count = this.read(b, off + n, len - n);
            if (count < 0) {
                throw new SmbException("EOF");
            }
            n += count;
            fp += count;
        } while (n < len);
    }

    @Override

    /** URL filter for searching failure URLs. */
    //@Maxbytelength(maxbytelength = 1000)
    public String url;

    /** Minimum error count filter for searching failure URLs. */
    //@IntRange(min = 0, max = 2147483647)
    public String errorCountMin;

    /** Maximum error count filter for searching failure URLs. */
    //@IntRange(min = 0, max = 2147483647)
    public String errorCountMax;

    }

    /**
     * Gets the total number of records.
     *
     * @return The total record count.
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records.
     *
     * @param allRecordCount The total record count.
     */
    public void setAllRecordCount(final int allRecordCount) {

    return multiset;
  }

  private HashMultiset() {
    super(new HashMap<E, Count>());
  }

  private HashMultiset(int distinctElements) {
    super(Maps.<E, Count>newHashMapWithExpectedSize(distinctElements));
  }

  /**
   * @serialData the number of distinct elements, the first element, its count, the second element,
   *     its count, and so on
   */
  @GwtIncompatible
  @J2ktIncompatible

    }

    /** The incremental crawling setting. */
    public String incrementalCrawling;

    /** The day for cleanup setting. */
    public String dayForCleanup;

    /** The crawling thread count setting. */
    public String crawlingThreadCount;

    /** The search log setting. */
    public String searchLog;

    /** The user info setting. */
    public String userInfo;

     */
    public FileEntry[] getEntries() {
        final netdfs.DfsEnumArray200 a200 = (netdfs.DfsEnumArray200) this.info.e;
        final SmbShareInfo[] entries = new SmbShareInfo[a200.count];
        for (int i = 0; i < a200.count; i++) {
            entries[i] = new SmbShareInfo(a200.s[i].dfs_name, 0, null);
        }
        return entries;
    }

        when(mockNdrBuffer.dec_ndr_long()).thenReturn(2, 1); // count, array pointer
        when(mockDeferredBuffer.dec_ndr_long()).thenReturn(2); // array size
        mockDeferredBuffer.index = 0; // Set field directly
        mockDeferredBuffer.deferred = mockDeferredBuffer;

        ctr0.decode(mockNdrBuffer);

        assertEquals(2, ctr0.count);
        assertNotNull(ctr0.array);

}

func TestCountNearPageBoundary(t *testing.T) {
	t.Parallel()
	b := dangerousSlice(t)
	for i := range b {
		c := Count(b[i:], []byte{1})
		if c != 0 {
			t.Fatalf("Count(b[%d:], {1})=%d, want 0\n", i, c)
		}
		c = Count(b[:i], []byte{0})
		if c != i {
			t.Fatalf("Count(b[:%d], {0})=%d, want %d\n", i, c, i)
		}
	}

     *
     * @return the total record count
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records available across all pages.
     *
     * @param allRecordCount the total record count to set
     */
    public void setAllRecordCount(final int allRecordCount) {

        // Process multiple elements
        int count = 1;
        while (transaction.hasMoreElements() && count < 10) {
            transaction.nextElement();
            count++;
        }

        assertTrue(count > 1, "Large data should require multiple elements");
    }

    @Test
    @DisplayName("Test transaction name handling")