return globalLockServer
	}
	return newlockRESTClient(endpoint)
}

// Returns a lock rest client.
func newlockRESTClient(ep Endpoint) *lockRESTClient {
	return &lockRESTClient{globalLockGrid.Load().Connection(ep.GridHost())}

		bi := BucketInfo{
			Name:    volInfo.Name,
			Created: volInfo.Created,
		}
		if vi, ok := deletedBuckets.Load(volInfo.Name); ok {
			bi.Deleted = vi.Created
		}
		buckets = append(buckets, bi)
		return true
	})

	deletedBuckets.Range(func(_ string, v VolInfo) bool {
		if _, ok := healBuckets.Load(v.Name); !ok {
			buckets = append(buckets, BucketInfo{
				Name:    v.Name,
				Deleted: v.Created,
			})

        updateProperties(fetchedVersions)
    }

    private
    fun getPluginIds(): List<String> {
        val props = Properties()
        propertiesFile.get().asFile.reader().use { input ->
            props.load(input)
        }
        return props.keys.map { it as String }.sorted()
    }

    private
    fun fetchLatestVersions(pluginIds: List<String>): List<TestedVersion> =
        pluginIds

  healthcheck:
    test: ["CMD", "mc", "ready", "local"]
    interval: 5s
    timeout: 5s
    retries: 5

# starts 4 docker containers running minio server instances.
# using nginx reverse proxy, load balancing, you can access
# it through port 9000.
services:
  minio1:
    <<: *minio-common
    hostname: minio1
    volumes:
      - pdata1-1:/pdata1
      - pdata1-2:/pdata2

  minio2:

        Properties props = new Properties();
        InputStream is = new FileInputStream(input);
        try {
            props.load(is);
        } finally {
            is.close();
        }
        loadBuildSrcVersion(props, providerFactory);
        return props;
    }

	req.Header.Set(xhttp.MinIOPeerCall, "true")

	resp, err := httpClient.Do(req)
	if err != nil {
		return err
	}
	xhttp.DrainBody(resp.Body)

	return nil
}

// connect to list of endpoints and load all Erasure disk formats, validate the formats are correct
// and are in quorum, if no formats are found attempt to initialize all of them for the first
// time. additionally make sure to close all the disks used in this attempt.

     *
     * @param <K> the key type of {@link ConcurrentHashMap}
     * @param <V> the value type of {@link ConcurrentHashMap}
     * @param initialCapacity the initial capacity
     * @param loadFactor the load factor threshold for resizing
     * @param concurrencyLevel the estimated number of threads for concurrent updates
     * @return a new instance of {@link ConcurrentHashMap}

            .concurrencyLevel(segments)
            .maximumSize(maximumSize)
            .build(
                new CacheLoader<Integer, Integer>() {
                  @Override
                  public Integer load(Integer from) {
                    return (int) misses.incrementAndGet();
                  }
                });

    // To start, fill up the cache.

  private GraphConstants() {}

  static final int EXPECTED_DEGREE = 2;

  static final int DEFAULT_NODE_COUNT = 10;
  static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE;

  // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps
  static final float INNER_LOAD_FACTOR = 1.0f;
  static final int INNER_CAPACITY = 2; // ceiling(EXPECTED_DEGREE / INNER_LOAD_FACTOR)

	// Hence an immediate Read() on the file can return incorrect data.
	if b.canClose != nil {
		b.canClose.Wait()
	}

	// Recycle the buffer.
	if b.byteBuf != nil {
		globalBytePoolCap.Load().Put(b.byteBuf)
		b.byteBuf = nil
	}
	return err
}

// newStreamingBitrotWriterBuffer returns streaming bitrot writer implementation.
// The output is written to the supplied writer w.