*/
    @Override
    public int read(final byte[] b) throws IOException {
        return inputStream.read(b);
    }

    /**
     * Repositions this stream to the position at the time the mark method was last called.
     *
     * @throws IOException if this stream has not been marked or if the mark has been invalidated
     */
    @Override
    public synchronized void reset() throws IOException {

            b.append('"').append(StringEscapeUtils.escapeJson(c.getName())).append("\":{");
            append(b, "count", () -> c.getCollectionCount()).append(',');
            append(b, "time", () -> c.getCollectionTime().getMillis()).append('}');
            return b.toString();
        }).collect(Collectors.joining(",")));
        buf.append("},");
        final Threads threads = jvmStats.getThreads();

    /**
     * Crawling information ID.
     */
    public String id;

    /**
     * Session ID for the crawling session.
     */
    public String sessionId;

    /**
     * Creation time of the crawling information.
     */
    public String createdTime;

    /**
     * Clears all pagination state and crawling information fields.

    public String id;

    /** Name of the thread that encountered the failure. */
    public String threadName;

    /** Number of errors encountered for this URL. */
    public String errorCount;

    /** Last time this URL was accessed. */
    public String lastAccessTime;

    /**
     * Clears all pager data and resets to default values.
     * This method resets pagination state and search filters.
     */

   * the fact that everything is still technically awaiting execution. The {@code getDelay} method
   * of any {@link ScheduledFuture} returned by the executor will always return the max long value
   * instead of the time until the user-specified delay.
   */
  public static ListeningScheduledExecutorService noOpScheduledExecutor() {
    return new NoOpScheduledExecutorService();
  }

  /**

 */
abstract class AbstractBaseGraph<N> implements BaseGraph<N> {

  /**
   * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}.
   * This implementation requires O(|N|) time. Classes extending this one may manually keep track of
   * the number of edges as the graph is updated, and override this method for better performance.
   */
  protected long edgeCount() {
    long degreeSum = 0L;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import com.google.errorprone.annotations.CanIgnoreReturnValue;
import java.time.Duration;
import java.util.concurrent.Executor;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.TimeoutException;

/**

    }

    private final Map<String, Integer> batchLimits = new HashMap<>();

    /** Local process ID for SMB messages */
    protected int localPid = -1;
    /** Local timezone for time calculations */
    protected TimeZone localTimeZone;
    /** Secure random generator for cryptographic operations */
    protected SecureRandom random;
    /** Whether to use command batching for improved performance */

 * dataset contains no finite values).
 *
 * <h3>Performance</h3>
 *
 * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a
 * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on
 * randomly ordered data (the probability decreases faster than exponentially in N), but if you are

excluded.  In such case, this License incorporates the limitation as if
written in the body of this License.

  13. The Free Software Foundation may publish revised and/or new
versions of the Lesser General Public License from time to time.
Such new versions will be similar in spirit to the present version,
but may differ in detail to address new problems or concerns.

Each version is given a distinguishing version number.  If the Library