- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 3,030 for rand (0.13 sec)
-
internal/auth/credentials.go
accessKey, err = GenerateAccessKey(accessKeyMaxLen, rand.Reader) if err != nil { return "", "", err } secretKey, err = GenerateSecretKey(secretKeyMaxLen, rand.Reader) if err != nil { return "", "", err } return accessKey, secretKey, nil } // GenerateAccessKey returns a new access key generated randomly using // the given io.Reader. If random is nil, crypto/rand.Reader is used.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 12:41:13 GMT 2024 - 11.7K bytes - Viewed (0) -
api/go1.22.txt
pkg math/rand/v2, method (*Rand) Int32() int32 #61716 pkg math/rand/v2, method (*Rand) Int32N(int32) int32 #61716 pkg math/rand/v2, method (*Rand) Int64() int64 #61716 pkg math/rand/v2, method (*Rand) Int64N(int64) int64 #61716 pkg math/rand/v2, method (*Rand) IntN(int) int #61716 pkg math/rand/v2, method (*Rand) NormFloat64() float64 #61716 pkg math/rand/v2, method (*Rand) Perm(int) []int #61716
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Wed Jan 24 20:54:27 GMT 2024 - 7.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
* input bit(i) and output bit(j), two pairs of keys must be found with all bits identical except * bit(i). One pair must differ in output bit(j), and one pair must not. This proves that input * bit(i) can alter output bit(j). */ static void checkNoFunnels(HashFunction function) { Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
internal/http/dial_dnscache.go
// // You can use returned dial function for `http.Transport.DialContext`. // // In this function, it uses functions from `rand` package. To make it really random, // you MUST call `rand.Seed` and change the value from the default in your application func DialContextWithLookupHost(lookupHost LookupHost, baseDialCtx DialContext) DialContext { if lookupHost == nil { lookupHost = net.DefaultResolver.LookupHost }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Jul 03 19:30:51 GMT 2023 - 2.6K bytes - Viewed (0) -
internal/s3select/select_benchmark_test.go
package s3select import ( "bytes" "encoding/csv" "math/rand" "net/http" "strconv" "testing" "time" humanize "github.com/dustin/go-humanize" ) const charset = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789" func newRandString(length int) string { randSrc := rand.New(rand.NewSource(time.Now().UnixNano())) b := make([]byte, length) for i := range b {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 14 13:54:47 GMT 2022 - 5K bytes - Viewed (0) -
cmd/erasure-decode_test.go
// You should have received a copy of the GNU Affero General Public License // along with this program. If not, see <http://www.gnu.org/licenses/>. package cmd import ( "bytes" "context" crand "crypto/rand" "io" "math/rand" "testing" "github.com/dustin/go-humanize" ) func (a badDisk) ReadFile(ctx context.Context, volume string, path string, offset int64, buf []byte, verifier *BitrotVerifier) (n int64, err error) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Jan 30 20:43:25 GMT 2024 - 21.1K bytes - Viewed (1) -
internal/lsync/lrwmutex.go
// timing randomized back-off algorithm to try again until successful func (lm *LRWMutex) lockLoop(ctx context.Context, id, source string, timeout time.Duration, isWriteLock bool) (locked bool) { r := rand.New(rand.NewSource(time.Now().UnixNano())) retryCtx, cancel := context.WithTimeout(ctx, timeout) defer cancel() for { select { case <-retryCtx.Done(): // Caller context canceled or we timedout,
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Jan 02 17:15:06 GMT 2022 - 4.8K bytes - Viewed (0) -
cmd/callhome.go
if !globalCallhomeConfig.Enabled() { return } go func() { r := rand.New(rand.NewSource(time.Now().UnixNano())) // Leader node (that successfully acquires the lock inside runCallhome) // will keep performing the callhome. If the leader goes down for some reason, // the lock will be released and another node will acquire it and take over // because of this loop. for { if !globalCallhomeConfig.Enabled() {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 5.1K bytes - Viewed (1) -
guava-tests/test/com/google/common/math/LongMathTest.java
Random rand = new Random(1); for (int bits = 10; bits < 63; bits++) { for (int i = 0; i < 100; i++) { long p = BigInteger.probablePrime(bits, rand).longValue(); assertTrue(LongMath.isPrime(p)); } } } @GwtIncompatible // isPrime is GWT-incompatible public void testIsPrimeOnRandomComposites() { Random rand = new Random(1);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
cmd/license-update.go
import ( "context" "fmt" "math/rand" "time" "github.com/tidwall/gjson" ) const ( licUpdateCycle = 24 * time.Hour * 30 licRenewPath = "/api/cluster/renew-license" ) // initlicenseUpdateJob start the periodic license update job in the background. func initLicenseUpdateJob(ctx context.Context, objAPI ObjectLayer) { go func() { r := rand.New(rand.NewSource(time.Now().UnixNano()))
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 3.3K bytes - Viewed (0)