- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 142 for crand (0.02 sec)
-
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} /** Returns the minimum child or {@code -1} if no child exists. */ int findMinChild(int index) { return findMin(getLeftChildIndex(index), 2); } /** Returns the minimum grand child or -1 if no grand child exists. */ int findMinGrandChild(int index) { int leftChildIndex = getLeftChildIndex(index); if (leftChildIndex < 0) { return -1; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 34.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/IntMathTest.java
for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); } } private static int force32(int value) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 23.1K bytes - Viewed (0) -
src/bytes/buffer_test.go
var buf Buffer s := "" for i := 0; i < 50; i++ { wlen := rand.Intn(len(testString)) if i%2 == 0 { s = fillString(t, "TestMixedReadsAndWrites (1)", &buf, s, 1, testString[0:wlen]) } else { s = fillBytes(t, "TestMixedReadsAndWrites (1)", &buf, s, 1, testBytes[0:wlen]) } rlen := rand.Intn(len(testString)) fub := make([]byte, rlen) n, _ := buf.Read(fub) s = s[n:] }
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Sep 03 20:55:15 UTC 2024 - 18.6K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/advance.jsp
${fe:facetForm()}${fe:geoForm()} <header> <nav class="navbar navbar-expand-md navbar-dark fixed-top bg-dark"> <div class="container"> <la:link styleClass="navbar-brand d-inline-flex" href="/"> <img src="${fe:url('/images/logo-head.png')}" alt="<la:message key="labels.header_brand_name" />" class="align-items-center" /> </la:link>
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 14.9K bytes - Viewed (0) -
cmd/erasure-server-pool-rebalance.go
// Save rebalance.bin periodically. go func() { // Update rebalance.bin periodically once every 5-10s, chosen randomly // to avoid multiple pool leaders herding to update around the same // time. r := rand.New(rand.NewSource(time.Now().UnixNano())) randSleepFor := func() time.Duration { return 5*time.Second + time.Duration(float64(5*time.Second)*r.Float64()) } timer := time.NewTimer(randSleepFor())
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 13:20:19 UTC 2024 - 28.4K bytes - Viewed (0) -
cmd/erasure-healing_test.go
data := make([]byte, 1*humanize.MiByte) length := int64(len(data)) _, err = rand.Read(data) if err != nil { t.Fatal(err) } oi1, err := obj.PutObject(ctx, bucket, object, mustGetPutObjReader(t, bytes.NewReader(data), length, "", ""), ObjectOptions{}) if err != nil { t.Fatal(err) } // 2nd version. _, _ = rand.Read(data)
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 49K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/IntMathTest.java
for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); } } private static int force32(int value) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 23.1K bytes - Viewed (0) -
cmd/erasure-server-pool-decom.go
go func() { // Resume decommissioning of pools, but wait 3 minutes for cluster to stabilize. if err := sleepContext(ctx, 3*time.Minute); err != nil { return } r := rand.New(rand.NewSource(time.Now().UnixNano())) for { if err := z.Decommission(ctx, poolIndices...); err != nil { if errors.Is(err, errDecommissionAlreadyRunning) { // A previous decommission running found restart it.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 13:20:19 UTC 2024 - 42.2K bytes - Viewed (0) -
docs/de/docs/tutorial/security/oauth2-jwt.md
Um einen sicheren zufälligen geheimen Schlüssel zu generieren, verwenden Sie den folgenden Befehl: <div class="termy"> ```console $ openssl rand -hex 32 09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7 ``` </div> Und kopieren Sie die Ausgabe in die Variable `SECRET_KEY` (verwenden Sie nicht die im Beispiel).
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 15K bytes - Viewed (0) -
cmd/xl-storage-disk-id-check.go
if skipIfSuccessBefore <= 0 { skipIfSuccessBefore = globalDriveConfig.GetMaxTimeout() } } t := time.NewTicker(checkEvery) defer t.Stop() fn := mustGetUUID() rng := rand.New(rand.NewSource(time.Now().UnixNano())) monitor := func() bool { if contextCanceled(ctx) { return false } if p.health.status.Load() != diskHealthOK { return true }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat Oct 26 09:56:26 UTC 2024 - 34.5K bytes - Viewed (0)