* <strong>Performance</strong>).
 *
 * <p><strong>Cycle Detection</strong>
 *
 * <p>Deadlocks can arise when locks are acquired in an order that forms a cycle. In a simple
 * example involving two locks and two threads, deadlock occurs when one thread acquires Lock A, and
 * then Lock B, while another thread acquires Lock B, and then Lock A:
 *
 * <pre>
 * Thread1: acquire(LockA) --X acquire(LockB)

     */
    public void test_concurrentPatternAdditions() throws InterruptedException {
        String sessionId = "test-session-023";
        urlFilter.init(sessionId);

        // Create multiple threads adding patterns
        Thread thread1 = new Thread(() -> {
            for (int i = 0; i < 100; i++) {
                urlFilter.addInclude("https://site" + i + ".com/.*");
            }
        });

        this.dataConfigIds = dataConfigIds;
        return this;
    }

    /**
     * Sets the hot thread monitoring interval for performance analysis.
     * Hot threads help identify performance bottlenecks in the crawler process.
     *
     * @param hotThreadInterval monitoring interval in seconds, -1 to disable
     * @return this CrawlJob instance for method chaining
     */

    // ----------------------------------------------------------------------------
    // We need to allow per execution user and global settings as the embedder
    // might be running in a mode where it's executing many threads with totally
    // different settings.
    // ----------------------------------------------------------------------------

    private File userSettingsFile;

    private File projectSettingsFile;

/**
 * Base class for implementing services that can handle {@link #doStart} and {@link #doStop}
 * requests, responding to them with {@link #notifyStarted()} and {@link #notifyStopped()}
 * callbacks. Its subclasses must manage threads manually; consider {@link
 * AbstractExecutionThreadService} if you need only a single execution thread.
 *
 * @author Jesse Wilson
 * @author Luke Sandberg
 * @since 1.0
 */
@GwtIncompatible
@J2ktIncompatible

labels.includedDocPaths=Pad(en) om op te nemen in zoeken
labels.includedDocUrls=URL(s) om op te nemen in zoeken
labels.maxAccessCount=Maximaal aantal toegangspogingen
labels.name=Naam
labels.numOfThread=Aantal threads
labels.duplicateHostName=Dubbele naam
labels.pageNumber=Paginanummer
labels.password=Wachtwoord
labels.paths=Paden
labels.port=Poort
labels.regex=Reguliere expressie
labels.regularName=Reguliere naam

labels.includedUrls=Included URLs for Crawling
labels.includedDocPaths=Included Paths for Searching
labels.includedDocUrls=Included URLs for Searching
labels.maxAccessCount=Max Access Count
labels.name=Name
labels.numOfThread=Number of Threads
labels.duplicateHostName=Duplicate Host Name
labels.pageNumber=Page Number
labels.password=Password
labels.paths=Paths
labels.port=Port
labels.regex=Regex
labels.regularName=Regular Name

   * one from the pool. We must take the pooled connection because by taking it from the pool, we've
   * fully acquired it.
   *
   * This test yields threads to force the decision of plan1 to be deliberate and not lucky. In
   * particular, we set up this sequence of events:
   *
   *  1. take plan 0
   *  3. plan 0 connects
   *  4. finish taking plan 1
   *

labels.includedDocPaths=Chemins inclus pour la recherche
labels.includedDocUrls=URL incluses pour la recherche
labels.maxAccessCount=Nombre d'accès maximum
labels.name=Nom
labels.numOfThread=Nombre de threads
labels.duplicateHostName=Nom d'hôte en double
labels.pageNumber=Numéro de page
labels.password=Mot de passe
labels.paths=Chemins
labels.port=Port
labels.regex=Expression régulière
labels.regularName=Nom régulier

    }

    if (sendOnClosed) {
      listener.onClosed(this, code, reason!!)
    }

    readerToClose?.closeQuietly()
  }

  /** For testing: force this web socket to release its threads. */
  @Throws(InterruptedException::class)
  fun tearDown() {
    taskQueue.shutdown()
    taskQueue.idleLatch().await(10, TimeUnit.SECONDS)
  }

  @Synchronized fun sentPingCount(): Int = sentPingCount