var serverMaxWindowBits: Int? = null
      var serverNoContextTakeover = false
      var unexpectedValues = false

      // Parse each header.
      for (i in 0 until responseHeaders.size) {
        if (!responseHeaders.name(i).equals(HEADER_WEB_SOCKET_EXTENSION, ignoreCase = true)) {
          continue // Not a header we're interested in.
        }
        val header = responseHeaders.value(i)

    when (command) {
      COMMAND_CONNECT -> {
        val toSocket = Socket(toAddress, port)
        val localAddress = toSocket.localAddress.address
        if (localAddress.size != 4) {
          throw ProtocolException("unexpected address: " + toSocket.localAddress)
        }

        // Write the reply.
        fromSink.writeByte(VERSION_5)
        fromSink.writeByte(REPLY_SUCCEEDED)

            fail();
        } catch (final ChildUrlsException e) {
            final Set<RequestData> urlSet = e.getChildUrlList();
            for (final RequestData requestData : urlSet.toArray(new RequestData[urlSet.size()])) {
                String url = requestData.getUrl();
                if (url.indexOf(".svn") < 0) {
                    assertTrue(url.contains("test/dir1") || url.contains("test/dir2") || url.contains("test/text1.txt")

            }

            @Override
            public void storeInfo(List<CrawlingInfoParam> crawlingInfoParamList) {
                assertEquals(2, crawlingInfoParamList.size());
                assertEquals("info-123", crawlingInfoParamList.get(0).getCrawlingInfoId());
            }
        }, CrawlingInfoService.class.getCanonicalName());

        // Add info to map

  public void testOptimalNumOfHashFunctionsRounding() {
    assertEquals(5, BloomFilter.optimalNumOfHashFunctions(0.03));
  }

  /** Tests that we always get a non-negative optimal size. */
  public void testOptimalSize() {
    for (int n = 1; n < 1000; n++) {
      for (double fpp = Double.MIN_VALUE; fpp < 1.0; fpp += 0.001) {
        assertTrue(BloomFilter.optimalNumOfBits(n, fpp) >= 0);
      }

    assertNull(ArbitraryInstances.get(NonPublicClass.class));
  }

  public void testGet_mutable() {
    assertEquals(0, ArbitraryInstances.get(ArrayList.class).size());
    assertEquals(0, ArbitraryInstances.get(HashMap.class).size());
    assertThat(ArbitraryInstances.get(Appendable.class).toString()).isEmpty();
    assertThat(ArbitraryInstances.get(StringBuilder.class).toString()).isEmpty();

        }

        // Verify state
        assertEquals(3, transformer.getState());
        List<String> processedUrls = transformer.getProcessedUrls();
        assertEquals(3, processedUrls.size());
        assertEquals("http://example1.com", processedUrls.get(0));
        assertEquals("http://example2.com", processedUrls.get(1));
        assertEquals("http://example3.com", processedUrls.get(2));

              protected Set<String> create(String[] elements) {
                String[] deduped = dedupe(elements);
                return new AbstractSet<String>() {
                  @Override
                  public int size() {
                    return deduped.length;
                  }

                  @Override
                  public Iterator<String> iterator() {

      Java8Compatibility.clear(buf);
    }
    return total;
  }

  // TODO(lukes): consider allowing callers to pass in a buffer to use, some callers would be able
  // to reuse buffers, others would be able to size them more appropriately than the constant
  // defaults

  /**
   * Copies all characters between the {@link Reader} and {@link StringBuilder} objects. Does not
   * close or flush the reader.
   *

 * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs
 * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer,
 * since an iteration across all row keys occurs.
 *
 * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code