@Suppress("UNCHECKED_CAST")
internal fun Array<String>.concat(value: String): Array<String> {
  val result = copyOf(size + 1)
  result[result.lastIndex] = value
  return result as Array<String>
}

/** Increments [startIndex] until this string is not ASCII whitespace. Stops at [endIndex]. */
internal fun String.indexOfFirstNonAsciiWhitespace(
  startIndex: Int = 0,
  endIndex: Int = length,
): Int {

        assertEquals(250L, t.delay, "delay should be configurable");
        assertEquals("smb://custom/path/file.txt", t.url, "url should be configurable");
    }

    @Test
    @DisplayName("TestLocking increments numComplete")
    void testNumCompleteIncrement() {
        TestLocking t = new TestLocking();
        t.url = "smb://test/file.txt";
        t.numIter = 0; // Set to 0 so run() exits immediately

///

## Reduce duplication { #reduce-duplication }

Reducing code duplication is one of the core ideas in **FastAPI**.

As code duplication increments the chances of bugs, security issues, code desynchronization issues (when you update in one place but not in the others), etc.

And these models are all sharing a lot of the data and duplicating attribute names and types.

        int written = trans2SetFileInfo.writeDataWireFormat(buffer, 0);

        // Should report 26 bytes written (20 from encode + 6 increment)
        assertEquals(26, written);

        // Check that padding bytes are zeros
        // The implementation writes 8 bytes with writeInt8 but only increments by 6
        // This means bytes 20-27 will be zero (8 bytes written by writeInt8)
        for (int i = 20; i < 28; i++) {

	atomic.AddInt64(&v.nowCount, -1)
	r.qCache.bucketStats[bucket] = v

	atomic.AddInt64(&r.qCache.srQueueStats.nowBytes, -1*sz)
	atomic.AddInt64(&r.qCache.srQueueStats.nowCount, -1)
}

// incProxy increments proxy metrics for proxied calls
func (r *ReplicationStats) incProxy(bucket string, api replProxyAPI, isErr bool) {
	if r != nil {
		r.pCache.inc(bucket, api, isErr)
	}
}

     */
    protected boolean noWaitOnFolder = false;

    /**
     * Increments the active thread count.
     */
    protected void startCrawling() {
        synchronized (crawlerContext.activeThreadCountLock) {
            crawlerContext.activeThreadCount++;
        }
    }

    /**
     * Decrements the active thread count.
     */
    protected void finishCrawling() {

        assertEquals(1L, crawlerContext.decrementAndGetAccessCount());

        // Test large increments
        for (int i = 0; i < 1000; i++) {
            crawlerContext.incrementAndGetAccessCount();
        }
        assertEquals(1001L, crawlerContext.getAccessCount());

        // Test large decrements
        for (int i = 0; i < 500; i++) {
            crawlerContext.decrementAndGetAccessCount();
        }

            }
        }
        return true;
    }

    /**
     * Stores child URLs from the given set into the crawling queue for future processing.
     * This method filters out blank URLs and increments the depth for child URLs.
     *
     * @param urlQueue the parent URL queue item
     * @param childUrlSet the set of child URLs to be queued for crawling
     */

	}
	return l.root.prev
}

// lazyInit lazily initializes a zero List Value.
func (l *LruList[K, V]) lazyInit() {
	if l.root.next == nil {
		l.Init()
	}
}

// insert inserts e after at, increments l.len, and returns e.
func (l *LruList[K, V]) insert(e, at *Entry[K, V]) *Entry[K, V] {
	e.prev = at
	e.next = at.next
	e.prev.next = e
	e.next.prev = e
	e.list = l
	l.len++
	return e
}

         *
         * @return The directory context.
         */
        public DirContext get() {
            return context;
        }

        /**
         * Increments the counter.
         */
        public void inc() {
            counter++;
        }

        @Override
        public void close() {
            if (counter > 1) {