![Erasure](https://github.com/minio/minio/blob/master/docs/screenshots/erasure-code.jpg?raw=true)

## What is Bit Rot protection?

 * differently in GWT. Namely:
 *
 * <ul>
 *   <li>Lazily initializes a set of seen exceptions
 *   <li>Decrements a counter atomically
 * </ul>
 */
@GwtCompatible
@ReflectionSupport(value = ReflectionSupport.Level.FULL)
abstract class AggregateFutureState<OutputT extends @Nullable Object>
    extends AbstractFuture.TrustedFuture<OutputT> {
  /*
   * The following fields are package-private, even though we intend never to use them outside this

      if (r == null) {
        continue;
      }

      int rlen = r.length;
      int charsSkipped = index - lastEscape;

      // This is the size needed to add the replacement, not the full size
      // needed by the string. We only regrow when we absolutely must, and
      // when we do grow, grow enough to avoid excessive growing. Grow.
      int sizeNeeded = destIndex + charsSkipped + rlen;

/**
 * Represents the FILE_BOTH_DIR_INFORMATION structure used in SMB directory enumeration operations.
 * This structure contains comprehensive file information including timestamps, attributes, sizes,
 * short name (8.3 format), and full filename for directory entries.
 */
public class FileBothDirectoryInfo implements FileEntry, Decodable {

    private int nextEntryOffset;
    private int fileIndex;
    private long creationTime;

            "The process cannot access the file because it is being used by another process.",
            "The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
            "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",
            "The parameter is incorrect.", "Too many Uids active on this session.",

            "The process cannot access the file because it is being used by another process.",
            "The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
            "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",
            "The parameter is incorrect.", "Too many Uids active on this session.",

    // Confirm that the connection pool was not corrupted by making another call.
    makeSimpleCall()
  }

  /**
   * If the server returns a full response, it doesn't really matter if the HTTP/2 stream is reset.
   * Attempts to write the request body fails fast.
   */
  @Test
  fun serverTruncatesRequestHttp2OnDuplexRequest() {
    enableProtocol(Protocol.HTTP_2)

     */
    if (!isJava8()) {
      runTestMethod(NO_VAR_HANDLE);
    }

    runTestMethod(NO_UNSAFE);

    runTestMethod(NO_ATOMIC_REFERENCE_FIELD_UPDATER);
    // TODO(lukes): assert that the logs are full of errors
  }

  /**
   * Runs the corresponding {@link AbstractFutureTest} test method in a new classloader that
   * disallows certain core JDK classes.
   */

  // array. The top bits of this value are the remaining bits of the hash value that were not used
  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`

    } catch (ClassCastException e) {
      e.initCause(throwable);
      throw e;
    }
  }

  /**
   * Returns a string containing the result of {@link Throwable#toString() toString()}, followed by
   * the full, recursive stack trace of {@code throwable}. Note that you probably should not be
   * parsing the resulting string; if you need programmatic access to the stack frames, you can call
   * {@link Throwable#getStackTrace()}.
   */