return hasCycle(network.asGraph());
  }

  /**
   * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node
   * we've already visited (following only outgoing edges and without reusing edges), we know
   * there's a cycle in the graph.
   */
  private static <N> boolean subgraphHasCycle(
      Graph<N> graph, Map<Object, NodeVisitState> visitedNodes, N startNode) {

                        logger.debug("Reusing existing session (both userId null). sessionId={}", sessionId);
                    }
                    return session;
                } else if (userId != null && userId.equals(sessionUserId)) {
                    session.touch();
                    if (logger.isDebugEnabled()) {
                        logger.debug("Reusing existing session. sessionId={}, userId={}", sessionId, userId);

      long lastEntry = entries[srcIndex];
      entries[dstIndex] = lastEntry;
      entries[srcIndex] = UNSET;

      // also need to update whoever's "next" pointer was pointing to the last entry place
      // reusing "tableIndex" and "next"; these variables were no longer needed
      int tableIndex = getHash(lastEntry) & hashTableMask();
      int lastNext = table[tableIndex];
      if (lastNext == srcIndex) {

import org.codelibs.core.misc.Base64Util;

/**
 * A high-performance utility class for encrypting and decrypting data using cached {@link Cipher} instances.
 * <p>
 * This class provides efficient encryption/decryption by pooling and reusing cipher instances,
 * reducing the overhead of repeated cipher initialization. It supports both string-based keys

                LeaseEntry entry = leases.get(existingKey);
                if (entry != null && !entry.breaking) {
                    entry.lastAccessTime = System.currentTimeMillis();
                    log.debug("Reusing existing lease for path: {}", path);
                    return existingKey;
                }
            }

            // Check if we've reached max leases

   *     {@link #get(Object)}; may contain duplicates), in an increasing index order.
   */
  public Iterable<L> bulkGet(Iterable<? extends Object> keys) {
    // Initially using the list to store the keys, then reusing it to store the respective L's
    List<Object> result = newArrayList(keys);
    if (result.isEmpty()) {
      return ImmutableList.of();
    }
    int[] stripes = new int[result.size()];

                    log.debug("Error while checking for reuse", e);
                    continue;
                }

                if (log.isTraceEnabled()) {
                    log.trace("Reusing transport connection " + conn);
                }
                return conn.acquire();
            }
        }

        return null;
    }

    @Override

 * group, and symbolic links.
 *
 * <p>
 * The class uses Apache Commons Net library for FTP communication. It maintains a queue of FTPClient
 * instances to improve performance by reusing connections.
 * </p>
 *
 * <p>
 * The client can be configured with FTP-specific settings via init parameters, such as:
 * </p>
 * <ul>

        while (iter.hasNext()) {
            final SmbSessionImpl ssn = iter.next();
            if (ssn.matches(tf, targetHost, targetDomain)) {
                if (log.isTraceEnabled()) {
                    log.trace("Reusing existing session " + ssn);
                }
                return ssn.acquire();
            }
            if (log.isTraceEnabled()) {

 *
 * OkHttp performs best when you create a single `OkHttpClient` instance and reuse it for all of
 * your HTTP calls. This is because each client holds its own connection pool and thread pools.
 * Reusing connections and threads reduces latency and saves memory. Conversely, creating a client
 * for each request wastes resources on idle pools.
 *
 * Use `new OkHttpClient()` to create a shared instance with the default settings:
 *