* added.
     *
     * @throws IllegalArgumentException if duplicate key pairs were added
     * @since 31.0
     */
    public ImmutableTable<R, C, V> buildOrThrow() {
      int size = cells.size();
      switch (size) {
        case 0:
          return of();
        case 1:
          return new SingletonImmutableTable<>(getOnlyElement(cells));
        default:

    /**
     * The DCERPC binding configuration for this handle
     */
    protected DcerpcBinding binding;
    /**
     * Maximum transmit buffer size for DCERPC messages
     */
    protected int max_xmit = 4280;
    /**
     * Maximum receive buffer size for DCERPC messages
     */
    protected int max_recv = max_xmit;
    /**
     * The current state of the DCERPC connection
     */

        final SitemapUrl sitemapUrl = (SitemapUrl) sitemaps[0];
        assertEquals("http://www.example.com/sample.html", sitemapUrl.getLoc());
        assertEquals(1, sitemapUrl.getImages().size());

        final SitemapImage image = sitemapUrl.getImages().get(0);
        assertEquals("http://www.example.com/image.jpg", image.getLoc());
        assertEquals("Sample image caption", image.getCaption());

        }

        if (_specification != null) {
            builder.setFetchSource(_specification.columnList.toArray(new String[_specification.columnList.size()]), null);
        }

        return builder;
    }

    // ===================================================================================

        this.structureSize = SMBUtil.readInt2(buffer, bufferIndex);
        if (this.structureSize != 36) {
            throw new SMBProtocolDecodingException("Invalid lease break response structure size: " + this.structureSize);
        }
        bufferIndex += 2;

        // Reserved (2 bytes)
        bufferIndex += 2;

        // Flags (4 bytes)
        this.flags = SMBUtil.readInt4(buffer, bufferIndex);

                  }
                });

    // To start, fill up the cache.
    // Each miss both increments the counter and causes the map to grow by one,
    // so until evictions begin, the size of the map is the greatest return
    // value seen so far
    while (cache.getUnchecked(nextRandomKey()) < maximumSize) {}

    requests.set(0);
    misses.set(0);
  }

  @Benchmark
  int time(int reps) {

    assertThat(testTable.get('A', 2)).isNull();
  }

  public void testIsEmpty() {
    assertFalse(testTable.isEmpty());
  }

  public void testSize() {
    assertEquals(1, testTable.size());
  }

  public void testValues() {
    assertThat(testTable.values()).contains("blah");
  }

  @Override
  Iterable<ImmutableTable<Character, Integer, String>> getTestInstances() {

    assertThrows(IllegalArgumentException.class, () -> getMultiset().add(e3()));
    assertEquals(Integer.MAX_VALUE, getMultiset().count(e3()));
    assertEquals(Integer.MAX_VALUE, getMultiset().size());
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddAll_emptySet() {
    assertFalse(getMultiset().addAll(Collections.emptySet()));
    expectUnchanged();
  }

     */
    @Nonnull
    default Optional<Version> getHighestVersion() {
        return getVersions().isEmpty()
                ? Optional.empty()
                : Optional.of(getVersions().get(getVersions().size() - 1));
    }

    /**
     * Gets the repository from which the specified version was resolved.
     *
     * @param version The version whose source repository should be retrieved, must not be {@code null}

pkg crypto/sha1, const Size ideal-int
pkg crypto/sha1, func New() hash.Hash
pkg crypto/sha256, const BlockSize ideal-int
pkg crypto/sha256, const Size ideal-int
pkg crypto/sha256, const Size224 ideal-int
pkg crypto/sha256, func New() hash.Hash
pkg crypto/sha256, func New224() hash.Hash
pkg crypto/sha512, const BlockSize ideal-int
pkg crypto/sha512, const Size ideal-int
pkg crypto/sha512, const Size384 ideal-int