if (handle != null) {
            handle.setActive(false);
            // Cancel any pending notifications
            cancelNotification(handle);
            // Clean up failure count to prevent memory leak
            failureCounts.remove(directoryPath);
        }
    }

    /**
     * Start asynchronous notification monitoring
     *
     * @param handle notification handle
     */

 *
 * ### The response body must be closed.
 *
 * Each response body is backed by a limited resource like a socket (live network responses) or
 * an open file (for cached responses). Failing to close the response body will leak resources and
 * may ultimately cause the application to slow down or crash.
 *
 * Both this class and [Response] implement [Closeable]. Closing a response simply

   * {@code lexicographical(Collections.reverseOrder(comparator))} (consider how each would order
   * {@code [1]} and {@code [1, 1]}).
   */
  // Note: 90% of the time we don't add type parameters or wildcards that serve only to "tweak" the
  // desired return type. However, *nested* generics introduce a special class of problems that we
  // think tip it over into being worthwhile.

  }

  /**
   * Prunes any leaked calls and then returns the number of remaining live calls on [connection].
   * Calls are leaked if the connection is tracking them but the application code has abandoned
   * them. Leak detection is imprecise and relies on garbage collection.
   */
  private fun pruneAndGetAllocationCount(
    connection: RealConnection,
    now: Long,
  ): Int {
    connection.assertLockHeld()

    }

    var networkResponse: Response? = null
    try {
      networkResponse = chain.proceed(networkRequest)
    } finally {
      // If we're crashing on I/O or otherwise, don't leak the cache body.
      if (networkResponse == null && cacheCandidate != null) {
        cacheCandidate.body.closeQuietly()
      }
    }

    // If we have a cache response too, then we're doing a conditional get.

labels.search_result_cache=Cache
labels.search_result_similar=Similar Results ({0})
labels.facet_label_title=Label
labels.facet_timestamp_title=Time
labels.facet_timestamp_1day=Within 24 hours
labels.facet_timestamp_1week=Within a week
labels.facet_timestamp_1month=Within a month
labels.facet_timestamp_1year=Within a year
labels.facet_timestamp_3month=Within 3 months
labels.facet_timestamp_6month=Within 6 months

         * The current month (1-12).
         */
        public int month;
        /**
         * The current year.
         */
        public int year;
        /**
         * The current day of the week (0-6, where 0 is Sunday).
         */
        public int weekday;

        @Override
        public void encode(final NdrBuffer _dst) throws NdrException {
            _dst.align(4);

              && ((RegularImmutableSortedSet) result).isSubset;
      if (!isSubset) {
        // Only return the original copy if this immutable sorted set isn't
        // a subset of another, to avoid memory leak.
        return result;
      }
    }
    return copyOfInternal(comparator, elements.iterator());
  }

  private static <E> ImmutableSortedSet<E> copyOfInternal(

   * 9.0], [9.0, 10.0] (and so on), no matter what the function is. This guarantees that we handle
   * correctly requests of varying weight (permits), /no matter/ what the actual function is - so we
   * can tweak the latter freely. (The only requirement, obviously, is that we can compute its
   * integrals).
   *
   * Note well that if, for this function, we chose a horizontal line, at height of exactly (1/QPS),

labels.search_result_similar=Vergelijkbare resultaten ({0})
labels.facet_label_title=Label
labels.facet_timestamp_title=Periode
labels.facet_timestamp_1day=Afgelopen 24 uur
labels.facet_timestamp_1week=Afgelopen week
labels.facet_timestamp_1month=Afgelopen maand
labels.facet_timestamp_1year=Afgelopen jaar
labels.facet_timestamp_3month=Afgelopen 3 maanden
labels.facet_timestamp_6month=Afgelopen 6 maanden