Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 139 for Briand (0.16 sec)

  1. cmd/erasure-common.go

    package cmd
    
    import (
    	"context"
    	"fmt"
    	"io"
    	"math/rand"
    	"sync"
    	"time"
    
    	"github.com/minio/pkg/v2/sync/errgroup"
    )
    
    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)) {
    		i := i
    		wg.Add(1)
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Apr 28 17:53:50 GMT 2024
    - 4.6K bytes
    - Viewed (0)
  2. 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")
    
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Fri Dec 15 08:36:08 GMT 2023
    - 3.3K bytes
    - Viewed (1)
  3. cmd/erasure.go

    	var wg sync.WaitGroup
    	disks := er.getDisks()
    	infos := make([]DiskInfo, len(disks))
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	for _, i := range r.Perm(len(disks)) {
    		i := i
    		wg.Add(1)
    		go func() {
    			defer wg.Done()
    
    			disk := disks[i]
    			if disk == nil {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Fri Apr 26 06:32:14 GMT 2024
    - 16K bytes
    - Viewed (1)
  4. internal/crypto/key_test.go

    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package crypto
    
    import (
    	"bytes"
    	"crypto/rand"
    	"encoding/hex"
    	"io"
    	"testing"
    
    	"github.com/minio/minio/internal/logger"
    )
    
    var shortRandom = func(limit int64) io.Reader { return io.LimitReader(rand.Reader, limit) }
    
    func recoverTest(i int, shouldPass bool, t *testing.T) {
    	if err := recover(); err == nil && !shouldPass {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Fri Feb 02 00:13:57 GMT 2024
    - 6.8K bytes
    - Viewed (0)
  5. cmd/batch-rotate.go

    	}
    
    	globalBatchJobsMetrics.save(job.ID, ri)
    	lastObject := ri.Object
    
    	delay := job.KeyRotate.Flags.Retry.Delay
    	if delay == 0 {
    		delay = batchKeyRotateJobDefaultRetryDelay
    	}
    
    	rnd := rand.New(rand.NewSource(time.Now().UnixNano()))
    
    	selectObj := func(info FileInfo) (ok bool) {
    		if r.Flags.Filter.OlderThan > 0 && time.Since(info.ModTime) < r.Flags.Filter.OlderThan {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Apr 04 12:04:40 GMT 2024
    - 14.2K bytes
    - Viewed (0)
  6. internal/dsync/drwmutex.go

    // Indicator if logging is enabled.
    var dsyncLog bool
    
    // Retry unit interval
    var lockRetryMinInterval time.Duration
    
    var lockRetryBackOff func(*rand.Rand, uint) time.Duration
    
    func init() {
    	// Check for MINIO_DSYNC_TRACE env variable, if set logging will be enabled for failed REST operations.
    	dsyncLog = env.Get("_MINIO_DSYNC_TRACE", "0") == "1"
    
    	lockRetryMinInterval = 250 * time.Millisecond
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Feb 22 06:26:06 GMT 2024
    - 19.7K bytes
    - Viewed (0)
  7. 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)
  8. doc/godebug.md

    A future version of Go may change the defaults to
    `tarinsecurepath=0` and `zipinsecurepath=0`.
    
    Go 1.20 introduced automatic seeding of the
    [`math/rand`](/pkg/math/rand) global random number generator,
    controlled by the [`randautoseed` setting](/pkg/math/rand/#Seed).
    
    Go 1.20 introduced the concept of fallback roots for use during certificate verification,
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Tue Apr 16 17:29:58 GMT 2024
    - 13.5K bytes
    - Viewed (0)
  9. 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)
  10. cmd/callhome.go

    func initCallhome(ctx context.Context, objAPI ObjectLayer) {
    	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 {
    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)
Back to top