following hold: // // u = A*a - B*m // v = D*m - C*a // 0 < u <= a // 0 <= v <= m // 0 <= A < m // 0 <= B <= a // 0 <= C < m // 0 <= D <= a // // After each loop iteration, u and v only get smaller, and at least one of // them shrinks by at least a factor of two. for { // If both u and v are odd, subtract the smaller from the larger. // If u = v, we need to subtract from v to hit the modified exit condition. if u.IsOdd() == yes && v.IsOdd() == yes { if v.cmpGeq(u) == no { u.sub(v) A.Add(C, &Modulus{nat:...

Russ Cox <******@****.***> 1410149331 -0400

Russ Cox <******@****.***> 1410149331 -0400

small.txt Kilts small2.txt Google.com...

small.txt Kilts small2.txt Google.com...

small.txt Kilts small2.txt Google.com link.txt...

It includes built in muxing of concurrent requests as well as congestion handling for streams.

Requests can be "Single Payload" or "Streamed".

Use the MinIO Grid for:

* Small, frequent requests with low latency requirements.
* Long-running requests with small/medium payloads.

Do *not* use the MinIO Grid for:

* Large payloads.

Only a single connection is ever made between two servers.

small.txt Kilts small2.txt Google.com...

	}{{
		file: "testdata/gnu.tar",
		headers: []*Header{{
			Name:     "small.txt",
			Mode:     0640,
			Uid:      73025,
			Gid:      5000,
			Size:     5,
			ModTime:  time.Unix(1244428340, 0),
			Typeflag: '0',
			Uname:    "dsymonds",
			Gname:    "eng",
			Format:   FormatGNU,
		}, {
			Name:     "small2.txt",
			Mode:     0640,
			Uid:      73025,
			Gid:      5000,
			Size:     11,

func getStorageInfo(disks []StorageAPI, endpoints []Endpoint, metrics bool) StorageInfo {
	disksInfo := getDisksInfo(disks, endpoints, metrics)

	// Sort so that the first element is the smallest.
	sort.Slice(disksInfo, func(i, j int) bool {
		return disksInfo[i].TotalSpace < disksInfo[j].TotalSpace
	})

	storageInfo := StorageInfo{
		Disks: disksInfo,
	}