@env bash $(PWD)/docs/distributed/decom.sh
	@env bash $(PWD)/docs/distributed/decom-encrypted.sh
	@env bash $(PWD)/docs/distributed/decom-encrypted-sse-s3.sh
	@env bash $(PWD)/docs/distributed/decom-compressed-sse-s3.sh
	@env bash $(PWD)/docs/distributed/decom-encrypted-kes.sh

test-versioning: install-race
	@echo "Running minio versioning tests"
	@env bash $(PWD)/docs/bucket/versioning/versioning-tests.sh

    /**
     * Files is marked to be archived
     */
    int ATTR_ARCHIVE = 0x20;

    // extended file attribute encoding(others same as above)
    /**
     * File is compressed.
     */
    int ATTR_COMPRESSED = 0x800;
    /**
     * File is a normal file.
     */
    int ATTR_NORMAL = 0x080;
    /**
     * File is temporary.
     */
    int ATTR_TEMPORARY = 0x100;

	in := x.afterVersion()
	sz, buf, _ := msgp.ReadMapHeaderBytes(in)
	newKeys := make([][]byte, 0, sz)
	newVals := make([][]byte, 0, sz)
	var removeKey func(s []byte) bool

	// Copy if big number of compares...
	if len(keys) > 5 && sz > 5 {
		mKeys := make(map[string]struct{}, len(keys))
		for _, key := range keys {
			mKeys[key] = struct{}{}
		}
		removeKey = func(s []byte) bool {
			_, ok := mKeys[string(s)]

<img src="/img/tutorial/path-params/image02.png">

De la même façon, il existe bien d'autres outils compatibles, y compris des outils de génération de code
pour de nombreux langages.

## Pydantic

func (z *Int) Abs(x *Int) *Int {
	x.doinit()
	z.doinit()
	C.mpz_abs(&z.i[0], &x.i[0])
	return z
}

/*
 * functions without a clear receiver
 */

// CmpInt compares x and y. The result is
//
//	-1 if x <  y
//	 0 if x == y
//	+1 if x >  y
func CmpInt(x, y *Int) int {
	x.doinit()
	y.doinit()
	switch cmp := C.mpz_cmp(&x.i[0], &y.i[0]); {
	case cmp < 0:

	VADDPD 15(CX)(AX*2), X29, X28 // 6261950058a4410f000000
	VADDPD 15(CX)(AX*2), X29, X10 // 627195005894410f000000
	VADDPD 15(CX)(AX*2), X10, X28 // 6261ad0858a4410f000000
	// EVEX: compressed displacement (Disp8).
	VADDPD 2032(DX), X29, X0        // 62f1950058427f
	VADDPD 2032(DX), X1, X29        // 6261f508586a7f
	VADDPD 2032(DX), X29, X28       // 6261950058627f

         * @return the priority length
         */
        public int getPriorityLength() {
            return priorityLength;
        }

        /**
         * Compares this pattern with another for priority ordering.
         * Longer patterns (higher priority length) come first.
         * @param other the other pattern to compare with

// will return during reading. It returns -1 for unlimited
// data.
func (r *Reader) Size() int64 { return r.size }

// ActualSize returns the pre-modified size of the object.
// DecompressedSize - For compressed objects.
func (r *Reader) ActualSize() int64 { return r.actualSize }

// ETag returns the ETag computed by an underlying etag.Tagger.
// If the underlying io.Reader does not implement etag.Tagger
// it returns nil.

-73.950569152832031 40.792312622070313 -73.868507385253906 40.688491821289063 2 16.10 46 0 0.5 0 5.33 51.83 2 75 63 green 0.04 0.0 0.0 62 37 5.37 1267 168 1 Manhattan 016800 1016800 E MN33 East Harlem South 3804 1544 1182.02 3 Brooklyn 118202 3118202 E BK83 Cypress Hills-City Line 4008 3389229 2 2014-03-07 09:46:32 2014-03-07 09:55:01 N 1 -73.952301025390625 40.789798736572266 -73.935806274414062 40.794448852539063 1 1.67 8 0 0.5 2 0 10.5 1 1 75 74 green 0.00 3.9 0.0 37 26 7.83 1267 168 1 Manhattan 016800 1016800...

    Comparator<? super K> keyComparator = (Comparator<? super K>) (o1, o2) -> o1.compareTo(o2);
    sort(insertionOrder, entryComparator(keyComparator));
    return insertionOrder;
  }

  /**
   * Compares strings in natural order except that null comes immediately before a given value. This
   * works better than Ordering.natural().nullsFirst() because, if null comes before all other