assertEquals(100L, t.delay, "Default delay should be 100");
        }

        @Test
        @DisplayName("Multiple flags are parsed correctly")
        void multipleFlags() {
            TestLocking t = new TestLocking();

            // Parse multiple flags
            String[] args = { "-t", "3", "-i", "7", "-d", "200", "smb://test/file.txt" };
            for (int ai = 0; ai < args.length; ai++) {

     * found in the cache. This method should be called by the loading thread, as well as by threads
     * blocking on the load. Multiple concurrent calls to {@link Cache} lookup methods with the same
     * key on an absent value should result in a single call to either {@code recordLoadSuccess} or
     * {@code recordLoadException} and multiple calls to this method, despite all being served by
     * the results of a single load operation.
     *

import org.codelibs.fess.crawler.entity.ResponseData;

/**
 * RegexRule is a rule implementation that uses regular expressions to match against the ResponseData.
 * It allows defining multiple regular expressions for different fields of the ResponseData.
 * The rule can be configured to require all regular expressions to match (allRequired = true) or

            assertFalse("validateCalled should be false as exception thrown before flag set", extractor.isValidateCalled());
        }
    }

    /**
     * Test that validateInputStream is consistent across multiple calls.
     */
    public void test_validateInputStream_consistentAcrossMultipleCalls() {
        final InputStream in1 = new ByteArrayInputStream("data1".getBytes());

 * This class handles DFS referral responses that redirect clients to alternate servers for accessing
 * distributed file system resources, supporting multiple DFS versions and referral types.
 */
public class Referral implements Decodable {

    /**
     * Default constructor for Referral.
     */
    public Referral() {
        // Default constructor
    }

        writeLittleEndianInt(baos, PacConstants.LOGON_INFO); // type
        writeLittleEndianInt(baos, 10); // size
        writeLittleEndianLong(baos, 25); // Unaligned offset (not multiple of 8)
        // Add enough data to avoid array bounds issues
        while (baos.size() < 35) {
            baos.write(0);
        }
        byte[] pacData = baos.toByteArray();

              fail("Should not have been invoked again");
            }
            alreadyCalledEndOfData = true;
            return endOfData();
          }
        };

    /*
     * We test multiple calls to peek() to make sure that one bad call doesn't interfere with its
     * ability to throw the correct exception in the future.
     */
    assertThrows(NoSuchElementException.class, empty::peek);

 * reduce contention. Method {@link #sum} (or, equivalently, {@link #longValue}) returns the current
 * total combined across the variables maintaining the sum.
 *
 * <p>This class is usually preferable to {@link AtomicLong} when multiple threads update a common
 * sum that is used for purposes such as collecting statistics, not for fine-grained synchronization
 * control. Under low update contention, the two classes have similar characteristics. But under

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.crawler.exception;

import java.io.PrintStream;
import java.io.PrintWriter;

/**
 * An exception that indicates multiple crawling access exceptions occurred.
 * This exception holds an array of Throwable objects representing the individual causes.
 * It extends CrawlingAccessException and provides methods to print the stack traces of all causes.
 *

 */
package org.codelibs.fess.suggest.normalizer;

import java.util.ArrayList;
import java.util.List;

/**
 * The NormalizerChain class implements the Normalizer interface and allows chaining multiple normalizers together.
 * It applies each normalizer in the order they were added to the chain.
 *
 * <p>Usage example:</p>
 * <pre>
 * NormalizerChain chain = new NormalizerChain();
 * chain.add(new SomeNormalizer());