}

        int start = bufferIndex;

        // Read compression count
        int compressionCount = SMBUtil.readInt2(buffer, bufferIndex);
        bufferIndex += 2;

        // Validate compression count
        if (compressionCount < 0 || compressionCount > 16) {
            throw new SMBProtocolDecodingException("Invalid compression count: " + compressionCount);
        }

        // Skip padding

# Middleware

There are several middlewares available provided by Starlette directly.

Read more about them in the [FastAPI docs for Middleware](https://fastapi.tiangolo.com/advanced/middleware/).

::: fastapi.middleware.cors.CORSMiddleware

It can be imported from `fastapi`:

```python
from fastapi.middleware.cors import CORSMiddleware
```

::: fastapi.middleware.gzip.GZipMiddleware

It can be imported from `fastapi`:

         * The number of deleted items.
         */
        protected long count = 1;

        /**
         * Sets the count of deleted items.
         * @param count The number of deleted items.
         * @return The ApiDeleteResponse instance.
         */
        public ApiDeleteResponse count(final long count) {
            this.count = count;
            return this;
        }

        @Override

blank_issues_enabled: false
contact_links:
  - name: MinIO Community Support
    url: https://slack.min.io
    about: Join here for Community Support
  - name: MinIO SUBNET Support
    url: https://min.io/pricing

	flag.IntVar(&setCount, "set-count", 0, "Total set count")
	flag.IntVar(&shards, "shards", 0, "Total shards count")
	flag.BoolVar(&verbose, "v", false, "Display all objects")

	flag.Parse()

	if deploymentID == "" {
		log.Fatalln("deployment ID is mandatory")
	}

	if setCount == 0 {
		log.Fatalln("set count cannot be zero")
	}

	id := uuid.MustParse(deploymentID)

/**
 * GWT emulated version of {@link com.google.common.collect.ImmutableSet}. For the unsorted sets,
 * they are thin wrapper around {@link java.util.Collections#emptySet()}, {@link
 * Collections#singleton(Object)} and {@link java.util.LinkedHashSet} for empty, singleton and
 * regular sets respectively. For the sorted sets, it's a thin wrapper around {@link
 * java.util.TreeSet}.
 *
 * @see ImmutableSortedSet
 * @author Hayward Chan
 */

public class SearchLogService {

    /** Date format pattern for parsing time ranges. */
    private static final String YYYY_MM_DD_HH_MM = "yyyy-MM-dd HH:mm";

    /** Field name for count values in aggregation results. */
    private static final String COUNT = "count";

    /** Field name for key values in aggregation results. */
    private static final String KEY = "key";

    /** Field name for ID values in aggregation results. */

        return 1;
    }

    /**
     * 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) {
        this.allRecordCount = allRecordCount;

    public void testSessionLifecycle() throws Exception {
        SmbSessionImpl session = new SmbSessionImpl(mockContext, "testhost", "testdomain", mockTransport);

        // Test initial state - session starts with usage count > 0 due to transport.acquire()
        assertTrue(session.isInUse(), "New session should be in use due to transport acquisition");

        // Test additional acquire
        session.acquire();

    private final AtomicInteger count = new AtomicInteger();
    private volatile RemovalNotification<K, V> lastNotification;

    @Override
    public void onRemoval(RemovalNotification<K, V> notification) {
      count.incrementAndGet();
      lastNotification = notification;
    }

    public int getCount() {
      return count.get();
    }

    public K getLastEvictedKey() {