Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 5,454 for Rand (0.04 sec)

  1. cmd/erasure-common.go

    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package cmd
    
    import (
    	"context"
    	"math/rand"
    	"sync"
    	"time"
    )
    
    func (er erasureObjects) getOnlineDisks() (newDisks []StorageAPI) {
    	disks := er.getDisks()
    	var wg sync.WaitGroup
    	var mu sync.Mutex
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	for _, i := range r.Perm(len(disks)) {
    		wg.Add(1)
    		go func() {
    			defer wg.Done()
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 2.3K bytes
    - Viewed (0)
  2. 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
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 24 20:54:27 UTC 2024
    - 7.7K bytes
    - Viewed (0)
  3. cmd/dynamic-timeouts_test.go

    	var wg sync.WaitGroup
    	for i := 0; i < runtime.GOMAXPROCS(0); i++ {
    		wg.Add(1)
    		rng := rand.New(rand.NewSource(int64(i)))
    		go func() {
    			defer wg.Done()
    			for range 100 {
    				for range 100 {
    					timeout.LogSuccess(time.Duration(float64(time.Second) * rng.Float64()))
    				}
    				to := timeout.Timeout()
    				if to < time.Millisecond || to > time.Second {
    					panic(to)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  4. tests/tests_test.go

    }
    
    func RunMigrations() {
    	var err error
    	allModels := []interface{}{&User{}, &Account{}, &Pet{}, &Company{}, &Toy{}, &Language{}, &Coupon{}, &CouponProduct{}, &Order{}, &Parent{}, &Child{}, &Tools{}}
    	rand.Seed(time.Now().UnixNano())
    	rand.Shuffle(len(allModels), func(i, j int) { allModels[i], allModels[j] = allModels[j], allModels[i] })
    
    	DB.Migrator().DropTable("user_friends", "user_speaks")
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Jul 21 02:46:58 UTC 2025
    - 3.7K bytes
    - Viewed (0)
  5. 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() {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  6. cmd/erasure-metadata-utils_test.go

    	testShuffleDisks(t, z)
    }
    
    func Test_hashOrder(t *testing.T) {
    	for x := 1; x < 17; x++ {
    		t.Run(fmt.Sprintf("%d", x), func(t *testing.T) {
    			var first [17]int
    			rng := rand.New(rand.NewSource(0))
    			var tmp [16]byte
    			rng.Read(tmp[:])
    			prefix := hex.EncodeToString(tmp[:])
    			for range 10000 {
    				rng.Read(tmp[:])
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  7. cmd/site-replication-utils.go

    		peerResyncMap: make(map[string]resyncState),
    	}
    	go s.save(ctx)
    	go s.init(ctx)
    	return &s
    }
    
    // init site resync metrics
    func (sm *siteResyncMetrics) init(ctx context.Context) {
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	// Run the site resync metrics load in a loop
    	for {
    		if err := sm.load(ctx, newObjectLayerFn()); err == nil {
    			<-ctx.Done()
    			return
    		}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.8K bytes
    - Viewed (0)
  8. cmd/benchmark-utils_test.go

    	// seeding the random number generator.
    	rand.Seed(UTCNow().UnixNano())
    	// pick a character randomly.
    	return []byte{letterBytes[rand.Intn(len(letterBytes))]}
    }
    
    // picks a random byte and repeats it to size bytes.
    func generateBytesData(size int) []byte {
    	// repeat the random character chosen size
    	return bytes.Repeat(getRandomByte(), size)
    }
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.1K bytes
    - Viewed (0)
  9. docs/sts/web-identity.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 main
    
    import (
    	"bytes"
    	"context"
    	"crypto/rand"
    	"encoding/base64"
    	"encoding/json"
    	"errors"
    	"flag"
    	"fmt"
    	"log"
    	"net/http"
    	"net/url"
    	"strings"
    	"time"
    
    	"golang.org/x/oauth2"
    
    	"github.com/minio/minio-go/v7"
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri May 19 09:13:33 UTC 2023
    - 7.8K bytes
    - Viewed (0)
  10. cmd/erasure-heal_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"
    	"crypto/rand"
    	"io"
    	"os"
    	"testing"
    )
    
    var erasureHealTests = []struct {
    	dataBlocks, disks int
    
    	// number of offline disks is also number of staleDisks for
    	// erasure reconstruction in this test
    	offDisks int
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 7.9K bytes
    - Viewed (0)
Back to top