minio-3.6.6.tar minio/Chart.yaml apiVersion: v1 appVersion: RELEASE.2022-04-16T04-26-02Z description: Multi-Cloud Object Storage home: https://min.io icon: https://min.io/resources/img/logo/MINIO_wordmark.png keywords: - minio - storage - object-storage - s3 - cluster maintainers: - email: ******@****.*** name: MinIO, Inc name: minio sources: - https://github.com/minio/minio version: 3.6.6 minio/values.yaml ## Provide a name in place of minio for `app:` labels ## nameOverride: "" ## Provide a name...

minio-4.0.0.tar minio/Chart.yaml apiVersion: v1 appVersion: RELEASE.2022-04-26T01-20-24Z description: Multi-Cloud Object Storage home: https://min.io icon: https://min.io/resources/img/logo/MINIO_wordmark.png keywords: - minio - storage - object-storage - s3 - cluster maintainers: - email: ******@****.*** name: MinIO, Inc name: minio sources: - https://github.com/minio/minio version: 4.0.0 minio/values.yaml ## Provide a name in place of minio for `app:` labels ## nameOverride: "" ## Provide a name...

minio-4.0.6.tar minio/Chart.yaml apiVersion: v1 appVersion: RELEASE.2022-05-08T23-50-31Z description: Multi-Cloud Object Storage home: https://min.io icon: https://min.io/resources/img/logo/MINIO_wordmark.png keywords: - minio - storage - object-storage - s3 - cluster maintainers: - email: ******@****.*** name: MinIO, Inc name: minio sources: - https://github.com/minio/minio version: 4.0.6 minio/values.yaml ## Provide a name in place of minio for `app:` labels ## nameOverride: "" ## Provide a name...

 *   <li>Project setup, execution, and teardown phases management</li>
 * </ol>
 *
 * <h2>Thread Management:</h2>
 * <p>The number of threads used is determined by:</p>
 * <pre>
 * min(degreeOfConcurrency, numberOfProjects)
 * </pre>
 * where degreeOfConcurrency is set via the -T command-line option.
 *
 * <h2>Build Step States:</h2>
 * <ul>
 *   <li>CREATED: Initial state of a build step</li>

    INSTANCE;

    @Override
    public int compare(boolean[] left, boolean[] right) {
      // do not static import Math.min due to https://bugs.openjdk.org/browse/JDK-8357219
      @SuppressWarnings("StaticImportPreferred")
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        int result = Boolean.compare(left[i], right[i]);
        if (result != 0) {

    INSTANCE;

    @Override
    public int compare(boolean[] left, boolean[] right) {
      // do not static import Math.min due to https://bugs.openjdk.org/browse/JDK-8357219
      @SuppressWarnings("StaticImportPreferred")
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        int result = Boolean.compare(left[i], right[i]);
        if (result != 0) {

import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.collect.CollectPreconditions.checkNonnegative;
import static java.lang.Math.min;
import static java.util.Objects.requireNonNull;

import com.google.common.annotations.GwtCompatible;
import com.google.common.base.Function;
import com.google.common.base.Predicate;

                                    }
                                }
                            },
                        },
                    },
                    "summary": "Get Path Param Min Length",
                    "operationId": "get_path_param_min_length_path_param_minlength__item_id__get",
                    "parameters": [
                        {
                            "required": True,

                            const string& op_device, TF_Status* s,
                            const char* name) {
  TF_Operation* op;
  BinaryOpHelper("Min", l, r, graph, s, name, &op, op_device, true);
  return op;
}

TF_Operation* Min(TF_Operation* l, TF_Operation* r, TF_Graph* graph,
                  TF_Status* s, const char* name) {
  return MinWithDevice(l, r, graph, /*op_device=*/"", s, name);
}

func (e *Erasure) ShardFileOffset(startOffset, length, totalLength int64) int64 {
	shardSize := e.ShardSize()
	shardFileSize := e.ShardFileSize(totalLength)
	endShard := (startOffset + length) / e.blockSize
	tillOffset := min(endShard*shardSize+shardSize, shardFileSize)
	return tillOffset
}

// erasureSelfTest performs a self-test to ensure that erasure
// algorithms compute expected erasure codes. If any algorithm