}
			dds = append(dds, obj.ObjectV1.DataDir)
		}
	}
	return dds, nil
}

// sortByModTime will sort versions by modtime in descending order,
// meaning index 0 will be latest version.
func (x *xlMetaV2) sortByModTime() {
	// Quick check
	if len(x.versions) <= 1 || sort.SliceIsSorted(x.versions, func(i, j int) bool {

	VSMULVV		V1, V2, V3			// d781209e
	VSMULVV		V1, V2, V0, V3			// d781209c
	VSMULVX		X10, V2, V3			// d741259e
	VSMULVX		X10, V2, V0, V3			// d741259c

	// 31.12.4: Vector Single-Width Scaling Shift Instructions
	VSSRLVV		V1, V2, V3			// d78120aa
	VSSRLVV		V1, V2, V0, V3			// d78120a8
	VSSRLVX		X10, V2, V3			// d74125aa
	VSSRLVX		X10, V2, V0, V3			// d74125a8
	VSSRLVI		$15, V2, V3			// d7b127aa

                tailIndex = newIndex;
                tail = e;
              }
            }
            newTable.set(tailIndex, tail);

            // Clone nodes leading up to the tail.
            for (E e = head; e != tail; e = e.getNext()) {
              int newIndex = e.getHash() & newMask;
              E newNext = newTable.get(newIndex);

     * ValueReference instance.
     */
    boolean isLoading();

    /**
     * Returns true if this reference contains an active value, meaning one that is still considered
     * present in the cache. Active values consist of live values, which are returned by cache
     * lookups, and dead values, which have been evicted but awaiting removal. Non-active values

	}
	return false
}

// CopyObjectHandler - Copy Object
// ----------
// This implementation of the PUT operation adds an object to a bucket
// while reading the object from another source.
// Notice: The S3 client can send secret keys in headers for encryption related jobs,
// the handler should ensure to remove these keys before sending them to the object layer.

      return map().lowerKey(e);
    }

    @Override
    public @Nullable K floor(@ParametricNullness K e) {
      return map().floorKey(e);
    }

    @Override
    public @Nullable K ceiling(@ParametricNullness K e) {
      return map().ceilingKey(e);
    }

    @Override
    public @Nullable K higher(@ParametricNullness K e) {
      return map().higherKey(e);
    }

      return map().lowerKey(e);
    }

    @Override
    public @Nullable K floor(@ParametricNullness K e) {
      return map().floorKey(e);
    }

    @Override
    public @Nullable K ceiling(@ParametricNullness K e) {
      return map().ceilingKey(e);
    }

    @Override
    public @Nullable K higher(@ParametricNullness K e) {
      return map().higherKey(e);
    }

(xLimbs[i] ^ dLimbs[i])) xLimbs[i], carry = bits.Add(l, l, carry) dLimbs[i], borrow = bits.Sub(xLimbs[i], mLimbs[i], borrow) } // Like in maybeSubtractModulus, we need the subtraction if either it // didn't underflow (meaning 2x + b > m) or if computing 2x + b // overflowed (meaning 2x + b > 2^_W*n > m). needSubtraction = not(choice(borrow)) | choice(carry) } return x.assign(needSubtraction, d) } // Mod calculates out = x mod m. // // This works regardless how large the value of x is. // // The output...

	c.Assert(err, nil)
	// executing the HTTP request.
	response, err = s.client.Do(request)
	c.Assert(err, nil)
	// validating the response status code.
	c.Assert(response.StatusCode, http.StatusOK)
	// reading the response body.
	// response body is expected to have the copied content of the first uploaded object.
	object, err := io.ReadAll(response.Body)
	c.Assert(err, nil)
	c.Assert(string(object), "hello world")
}

</pre>

<p>
For backward compatibility, an imaginary literal's integer part consisting
entirely of decimal digits (and possibly underscores) is considered a decimal
integer, even if it starts with a leading <code>0</code>.
</p>

<pre>
0i
0123i         // == 123i for backward-compatibility
0o123i        // == 0o123 * 1i == 83i
0xabci        // == 0xabc * 1i == 2748i
0.i
2.71828i
1.e+0i