Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 38 of 38 for shuffle (0.07 sec)

  1. cmd/test-utils_test.go

    	}
    	return rand.New(rand.NewSource(seed)).Intn(maxN-minN) + minN
    }
    
    // Randomizes the order of bytes in the byte array
    // using Knuth Fisher-Yates shuffle algorithm.
    func randomizeBytes(s []byte, seed int64) []byte {
    	// special value -1 means no explicit seeding.
    	if seed != -1 {
    		rand.Seed(seed)
    	}
    	n := len(s)
    	var j int
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 77K bytes
    - Viewed (0)
  2. cmd/erasure-server-pool.go

    					askDisks = len(disks) // use all available drives
    				}
    
    				var fallbackDisks []StorageAPI
    				if askDisks > 0 && len(disks) > askDisks {
    					rand.Shuffle(len(disks), func(i, j int) {
    						disks[i], disks[j] = disks[j], disks[i]
    					})
    					fallbackDisks = disks[askDisks:]
    					disks = disks[:askDisks]
    				}
    
    				requestedVersions := 0
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 89.2K bytes
    - Viewed (0)
  3. build-logic/build-update-utils/src/test/groovy/gradlebuild/buildutils/tasks/UpdateAgpVersionsTest.groovy

                "9.11.0-alpha01", "9.11.0-beta01", "9.11.0-rc01",
                "9.12.0-alpha01", "9.12.0-beta01",
                "9.13.0-alpha01",
            ].shuffled()
    
            when:
            def selected = UpdateAgpVersions.selectVersionsFrom(gradleVersion, minimumSupported, allVersions)
    
            then:
            selected == selection
    
            where:
    Registered: Wed Dec 31 11:36:14 UTC 2025
    - Last Modified: Fri Oct 24 09:10:28 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  4. cmd/erasure-metadata-utils_test.go

    	if err != nil {
    		removeRoots(disks)
    		t.Fatal(err)
    	}
    	defer removeRoots(disks)
    	z := objLayer.(*erasureServerPools)
    	testShuffleDisks(t, z)
    }
    
    // Test shuffleDisks which returns shuffled slice of disks for their actual distribution.
    func testShuffleDisks(t *testing.T, z *erasureServerPools) {
    	disks := z.serverPools[0].GetDisks(0)()
    	distribution := []int{16, 14, 12, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 13, 15}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  5. src/main/webapp/css/font-awesome.min.css

    :"\f214"}.fa-shoe-prints:before{content:"\f54b"}.fa-shopping-bag:before{content:"\f290"}.fa-shopping-basket:before{content:"\f291"}.fa-shopping-cart:before{content:"\f07a"}.fa-shopware:before{content:"\f5b5"}.fa-shower:before{content:"\f2cc"}.fa-shuttle-van:before{content:"\f5b6"}.fa-sign:before{content:"\f4d9"}.fa-sign-in-alt:before{content:"\f2f6"}.fa-sign-language:before{content:"\f2a7"}.fa-sign-out-alt:before{content:"\f2f5"}.fa-signal:before{content:"\f012"}.fa-signature:before{content:"\f5...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (2)
  6. src/main/webapp/css/admin/font-awesome.min.css

    :"\f214"}.fa-shoe-prints:before{content:"\f54b"}.fa-shopping-bag:before{content:"\f290"}.fa-shopping-basket:before{content:"\f291"}.fa-shopping-cart:before{content:"\f07a"}.fa-shopware:before{content:"\f5b5"}.fa-shower:before{content:"\f2cc"}.fa-shuttle-van:before{content:"\f5b6"}.fa-sign:before{content:"\f4d9"}.fa-sign-in-alt:before{content:"\f2f6"}.fa-sign-language:before{content:"\f2a7"}.fa-sign-out-alt:before{content:"\f2f5"}.fa-signal:before{content:"\f012"}.fa-signature:before{content:"\f5...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (0)
  7. lib/fips140/v1.0.0-c2097c7c.zip

    := byteorder.BEUint32(src[0:4]) s1 := byteorder.BEUint32(src[4:8]) s2 := byteorder.BEUint32(src[8:12]) s3 := byteorder.BEUint32(src[12:16]) // First round just XORs input with key. s0 ^= xk[0] s1 ^= xk[1] s2 ^= xk[2] s3 ^= xk[3] // Middle rounds shuffle using tables. k := 4 var t0, t1, t2, t3 uint32 for r := 0; r < c.rounds-1; r++ { t0 = xk[k+0] ^ te0[uint8(s0>>24)] ^ te1[uint8(s1>>16)] ^ te2[uint8(s2>>8)] ^ te3[uint8(s3)] t1 = xk[k+1] ^ te0[uint8(s1>>24)] ^ te1[uint8(s2>>16)] ^ te2[uint8(s3>>8)]...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  8. lib/fips140/v1.1.0-rc1.zip

    := byteorder.BEUint32(src[0:4]) s1 := byteorder.BEUint32(src[4:8]) s2 := byteorder.BEUint32(src[8:12]) s3 := byteorder.BEUint32(src[12:16]) // First round just XORs input with key. s0 ^= xk[0] s1 ^= xk[1] s2 ^= xk[2] s3 ^= xk[3] // Middle rounds shuffle using tables. k := 4 var t0, t1, t2, t3 uint32 for r := 0; r < c.rounds-1; r++ { t0 = xk[k+0] ^ te0[uint8(s0>>24)] ^ te1[uint8(s1>>16)] ^ te2[uint8(s2>>8)] ^ te3[uint8(s3)] t1 = xk[k+1] ^ te0[uint8(s1>>24)] ^ te1[uint8(s2>>16)] ^ te2[uint8(s3>>8)]...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top