By default, MinIO shards the objects across N/2 data and N/2 parity drives. Though, you can use [storage classes](https://github.com/minio/minio/tree/master/docs/erasure/storage-class) to use a custom configuration. We recommend N/2 data and parity blocks, as it ensures the best protection from drive failures.

private void requestDirectoryLease() {
    if (!isDirectory() || !context.getConfig().isUseDirectoryLeasing()) {
        return;
    }
    
    if (!tree.getSession().supports(SMB3_0)) {
        return;  // Directory leasing requires SMB3
    }
    
    directoryLeaseManager = tree.getSession().getDirectoryLeaseManager();
    if (directoryLeaseManager != null) {

         * transformation however contradicts the other use case of precisely obeying the repository's layout. The below
         * flag tries to detect which use case applies to make both plugins happy.
         */
        realLocalRepo = (layout instanceof DefaultRepositoryLayout) && "local".equals(delegate.getId());
    }

    @Override

}

// erasureSelfTest performs a self-test to ensure that erasure
// algorithms compute expected erasure codes. If any algorithm
// produces an incorrect value it fails with a hard error.
//
// erasureSelfTest tries to catch any issue in the erasure implementation
// early instead of silently corrupting data.
func erasureSelfTest() {
	// Approx runtime ~1ms
	var testConfigs [][2]uint8
	for total := uint8(4); total < 16; total++ {

            // Act + Assert (no exception)
            assertDoesNotThrow(() -> SmbCopyUtil.copyFile(src, dest, buffers, 8, new WriterThread(), sh, dh));
        }
    }

    // --- Server-side copy path (SMB2 + same tree) for zero-length files ---

    @Test
    @DisplayName("copyFile uses server-side copy for zero-length and returns")
    void copyFile_serverSide_zeroLength_happyPath() throws Exception {
        // Arrange

	// updateCurrentPath should be called whenever a new path is scanned.
	updateCurrentPath func(string)
}

// Cache structure and compaction:
//
// A cache structure will be kept with a tree of usages.
// The cache is a tree structure where each keeps track of its children.
//
// An uncompacted branch contains a count of the files only directly at the
// branch level, and contains link to children branches or leaves.
//

- GZIP or BZIP2 - CSV and JSON files can be compressed using GZIP, BZIP2, [ZSTD](https://facebook.github.io/zstd/), and streaming formats of [LZ4](https://lz4.github.io/lz4/), [S2](https://github.com/klauspost/compress/tree/master/s2#s2-compression) and [SNAPPY](http://google.github.io/snappy/).
- Parquet API supports columnar compression for  using GZIP, Snappy, LZ4. Whole object compression is not supported for Parquet objects.

                    e);
          }
        }
      } finally {
        if (stillRunning) {
          // An Error is bubbling up. We should mark ourselves as no longer running. That way, if
          // anyone tries to keep using us, we won't be corrupted.
          synchronized (PerListenerQueue.this) {
            isThreadScheduled = false;
          }
        }
      }
    }
  }

    int FLAGS_COPY_TARGET_MODE_ASCII = 0x0004;
    /** Copy source mode ASCII flag */
    int FLAGS_COPY_SOURCE_MODE_ASCII = 0x0008;
    /** Verify all writes flag */
    int FLAGS_VERIFY_ALL_WRITES = 0x0010;
    /** Tree copy flag */
    int FLAGS_TREE_COPY = 0x0020;

    // open function
    /** Open function fail if exists */
    int OPEN_FUNCTION_FAIL_IF_EXISTS = 0x0000;
    /** Open function overwrite if exists */

    skip(buffer.size)
  }
}

/**
 * Attempts to exhaust this, returning true if successful. This is useful when reading a complete
 * source is helpful, such as when doing so completes a cache body or frees a socket connection for
 * reuse.
 */
internal fun Source.discard(
  timeout: Int,
  timeUnit: TimeUnit,
): Boolean =
  try {
    this.skipAll(timeout, timeUnit)
  } catch (_: IOException) {