Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for Utimes (0.07 seconds)

  1. cmd/testdata/xl-many-parts.meta

    �`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�`�&�m�Size�
    6m:M�MTime�|>���e��MetaSys��6X-Minio-Internal-Server-Side-Encryption-Seal-Algorithm�DAREv2-HMAC-SHA256�&x-minio-internal-replication-timestamp�2023-08-18T00:09:42.389168293Z�#x-minio-internal-replication-status�^arn:minio:replication::36280125-1e9d-414e-b...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sat Sep 02 21:40:38 GMT 2023
    - 808.8K bytes
    - Click Count (0)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    false positives for adversarially chosen values. // // isPrime is not constant-time. func isPrime(w []byte) bool { mr, err := millerRabinSetup(w) if err != nil { // w is zero, one, or even. return false } primes, err := bigmod.NewNat().SetBytes(productOfPrimes, mr.w) // If w is too small for productOfPrimes, key generation is // going to be fast enough anyway. if err == nil { _, hasInverse := primes.InverseVarTime(primes, mr.w) if !hasInverse { // productOfPrimes doesn't have an inverse mod w, // so...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  3. lib/fips140/v1.1.0-rc1.zip

    return false } iterations-- if iterations == 0 { return true } } } // primes are the first prime numbers (except 2), such that the product of any // three primes fits in a uint32. // // More primes cause fewer Miller-Rabin tests of composites (nothing can help // with the final test on the actual prime) but have diminishing returns: these // 255 primes catch 84.9% of composites, the next 255 would catch 1.5% more. // Adding primes can still be marginally useful since they only compete with the // (much...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  4. RELEASE.md

            values every time they are called (for a given variable shape). For
            unseeded initializers (`seed=None`), a random seed will be created and
            assigned at initializer creation (different initializer instances get
            different seeds).
        *   An unseeded initializer will raise a warning if it is reused (called)
            multiple times. This is because it would produce the same values each
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  5. api/go1.20.txt

    pkg testing, method (*B) Elapsed() time.Duration #43620
    pkg time, const DateOnly = "2006-01-02" #52746
    pkg time, const DateOnly ideal-string #52746
    pkg time, const DateTime = "2006-01-02 15:04:05" #52746
    pkg time, const DateTime ideal-string #52746
    pkg time, const TimeOnly = "15:04:05" #52746
    pkg time, const TimeOnly ideal-string #52746
    pkg time, method (Time) Compare(Time) int #50770
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 17 21:23:32 GMT 2023
    - 602.6K bytes
    - Click Count (0)
  6. api/go1.14.txt

    pkg syscall (freebsd-arm64), const VSTOP ideal-int
    pkg syscall (freebsd-arm64), const VSUSP = 10
    pkg syscall (freebsd-arm64), const VSUSP ideal-int
    pkg syscall (freebsd-arm64), const VTIME = 17
    pkg syscall (freebsd-arm64), const VTIME ideal-int
    pkg syscall (freebsd-arm64), const VWERASE = 4
    pkg syscall (freebsd-arm64), const VWERASE ideal-int
    pkg syscall (freebsd-arm64), const WCONTINUED = 4
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 17 20:31:46 GMT 2023
    - 508.9K bytes
    - Click Count (0)
Back to Top