* Get the value for the key 'logging.search.max.queue.size'. <br>
     * The value is, e.g. 10000 <br>
     * comment: Maximum queue size for search logging.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getLoggingSearchMaxQueueSize();

    /**
     * Get the value for the key 'logging.search.max.queue.size' as {@link Integer}. <br>

            urlFilterService.delete(sid);
        } catch (final Exception e) {
            logger.warn("Failed to delete UrlFilter: sessionId={}", sid, e);
        }

        try {
            // clear queue
            urlQueueService.clearCache();
            urlQueueService.delete(sid);
        } catch (final Exception e) {
            logger.warn("Failed to delete UrlQueue: sessionId={}", sid, e);
        }

 * <p>When {@code post} is called, all registered subscribers for an event are run in sequence, so
 * subscribers should be reasonably quick. If an event may trigger an extended process (such as a
 * database load), spawn a thread or queue it for later. (For a convenient way to do this, use an
 * {@link AsyncEventBus}.)
 *
 * <h2>Subscriber Methods</h2>
 *
 * <p>Event subscriber methods must accept only one argument: the event.
 *

            CopyUtil.copy(in, out);
            asyncImport(fileName, tempFile);

            if (logger.isInfoEnabled()) {
                logger.info("Backup file uploaded successfully and queued for import: fileName={}, tempFile={}", fileName,
                        tempFile.getAbsolutePath());
            }
        } catch (final IOException e) {

    /** Array of supported file protocols for URL classification. */
    protected String[] fileProtocols = { "file:", "smb:", "smb1:", "ftp:", "storage:" };

    /** Queue to track the current XML element hierarchy during parsing. */
    protected LinkedList<String> tagQueue;

    /** List to store parsed label types for access control. */
    protected List<LabelType> labelList;

```
~ mc admin config set alias/ heal
KEY:

    waiter1.start();
    waiter1.awaitWaiting();

    WaiterThread waiter2 = new WaiterThread(future);
    waiter2.start();
    waiter2.awaitWaiting();
    // The waiter queue should be waiter2->waiter1

    // This should wake up waiter1 and cause the waiter1 node to be removed.
    waiter1.interrupt();

    waiter1.join();
    waiter2.awaitWaiting(); // should still be blocked

	for {
		select {
		case entry := <-traceCh:
			if _, err := w.Write(entry); err != nil {
				return
			}
			grid.PutByteBuffer(entry)
			if len(traceCh) == 0 {
				// Flush if nothing is queued
				xhttp.Flush(w)
			}
		case <-keepAliveTicker.C:
			if len(traceCh) > 0 {
				continue
			}
			if _, err := w.Write([]byte(" ")); err != nil {
				return
			}
			xhttp.Flush(w)

			sz += t.Size
		}
	}
	return sz
}

// ReplicationAttempted returns true if replication was attempted on any of the targets for the object version
// queued
func (ri replicatedInfos) ReplicationResynced() bool {
	for _, t := range ri.Targets {
		if t.Empty() || !t.ReplicationResynced {
			continue
		}
		return true
	}
	return false
}

    threadPool.shutdown();
    threadPool.awaitTermination(300, SECONDS);

    // Since we're not doing any more cache operations, and the cache only expires/evicts when doing
    // other operations, the cache and the removal queue won't change from this point on.

    // Verify that each received removal notification was valid
    for (RemovalNotification<String, String> notification : removalListener) {