contentSize += head.getOriginalSize();
                if (maxContentSize != -1 && contentSize > maxContentSize) {
                    throw new MaxLengthExceededException("Extracted size is " + contentSize + " > " + maxContentSize);
                }
                final String filename = head.getPath();
                final String mimeType = mimeTypeHelper.getContentType(null, filename);

* `write(data)`: escreve dados (`data`) em `str` ou `bytes` no arquivo.
* `read(size)`: Lê um número de bytes/caracteres de acordo com a quantidade `size` (`int`).
* `seek(offset)`: Navega para o byte na posição `offset` (`int`) do arquivo.
    * E.g., `await myfile.seek(0)` navegaria para o ínicio do arquivo.

   * Parses a serialized trie representation of a map of reversed public suffixes into an immutable
   * map of public suffixes. The encoded trie string may be broken into multiple chunks to avoid the
   * 64k limit on string literal size. In-memory strings can be much larger (2G).
   */
  static ImmutableMap<String, PublicSuffixType> parseTrie(CharSequence... encodedChunks) {
    String encoded = DIRECT_JOINER.join(encodedChunks);

}

// WidthCap returns the cap width of the byte arrays in this pool.
func (bp *BytePoolCap) WidthCap() (n int) {
	if bp == nil {
		return 0
	}
	return bp.wcap
}

// CurrentSize returns current size of buffer pool
func (bp *BytePoolCap) CurrentSize() int {
	if bp == nil {
		return 0
	}
	return len(bp.c) * bp.w

  public void testValuesRemove() {
    resetContainer(mapEntry(k0(), v0()), mapEntry(k1(), v0()), mapEntry(k0(), v3()));
    assertTrue(multimap().asMap().values().remove(singletonList(v0())));
    assertEquals(2, multimap().size());
    assertEquals(singletonMap(k0(), Lists.newArrayList(v0(), v3())), multimap().asMap());
  }

    }
  }

  static char[] randomChars(Random rand, int size) {
    Set<Character> chars = new HashSet<>(size);
    for (int i = 0; i < size; i++) {
      char c;
      do {
        c = (char) rand.nextInt(Character.MAX_VALUE - Character.MIN_VALUE + 1);
      } while (chars.contains(c));
      chars.add(c);
    }
    char[] retValue = new char[chars.size()];
    int i = 0;
    for (char c : chars) {

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

        transfers.put(
                new TransferResourceIdentifier(resource),
                new TransferResourceAndSize(resource, event.getTransferredBytes()));

        buffer.append("Progress (").append(transfers.size()).append("): ");

        Iterator<TransferResourceAndSize> entries = transfers.values().iterator();
        while (entries.hasNext()) {
            TransferResourceAndSize entry = entries.next();

        }

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

        return builder;
    }

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

        @Override
        public long getContentLengthLong() {
            if (minioClient == null) {
                return -1;
            }
            try {
                return getStatObject().size();
            } catch (InvalidKeyException | ErrorResponseException | IllegalArgumentException | InsufficientDataException | InternalException