Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 601 - 610 of 763 for len2 (0.07 seconds)

  1. internal/bucket/bandwidth/reader.go

    	if r.throttle == nil {
    		return r.r.Read(buf)
    	}
    	if r.lastErr != nil {
    		err = r.lastErr
    		return n, err
    	}
    	b := r.throttle.Burst()  // maximum available tokens
    	need := len(buf)         // number of bytes requested by caller
    	hdr := r.opts.HeaderSize // remaining header bytes
    	var tokens int           // number of tokens to request
    
    	if hdr > 0 { // available tokens go towards header first
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3.3K bytes
    - Click Count (0)
  2. tests/migrate_test.go

    	}
    	typ := reflect.Indirect(reflect.ValueOf(&UserMigrateColumn2{})).Type()
    	numField := typ.NumField()
    	if numField != len(columnTypes) {
    		t.Fatalf("column's number not match struct and ddl, %d != %d", numField, len(columnTypes))
    	}
    	namer := schema.NamingStrategy{}
    	for i := 0; i < numField; i++ {
    		expectName := namer.ColumnName("", typ.Field(i).Name)
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Wed Aug 20 04:51:17 GMT 2025
    - 65.2K bytes
    - Click Count (0)
  3. docs/debugging/hash-set/main.go

    			set := sipHashMod(prefix+object, setCount, id)
    			distrib[set] = append(distrib[set], prefix+object)
    		}
    		for set, files := range distrib {
    			fmt.Println("Set:", set+1, "Objects:", len(files))
    			if !verbose {
    				continue
    			}
    			for _, s := range files {
    				fmt.Printf("\t%s\n", s)
    			}
    		}
    		os.Exit(0)
    	}
    
    	if object == "" {
    		log.Fatalln("object name is mandatory")
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Sep 19 18:05:16 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  4. cmd/metrics-v3-replication.go

    	qa := qs.ActiveWorkers
    	m.Set(replicationAverageActiveWorkers, float64(qa.Avg))
    	m.Set(replicationCurrentActiveWorkers, float64(qa.Curr))
    	m.Set(replicationMaxActiveWorkers, float64(qa.Max))
    
    	if len(qs.XferStats) > 0 {
    		tots := qs.XferStats[Total]
    		m.Set(replicationAverageDataTransferRate, tots.Avg)
    		m.Set(replicationCurrentDataTransferRate, tots.Curr)
    		m.Set(replicationMaxDataTransferRate, tots.Peak)
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Thu Aug 15 12:04:40 GMT 2024
    - 4.6K bytes
    - Click Count (0)
  5. internal/config/storageclass/storage-class.go

    	s := strings.Split(storageClassEnv, ":")
    
    	// only two elements allowed in the string - "scheme" and "number of parity drives"
    	if len(s) > 2 {
    		return StorageClass{}, config.ErrStorageClassValue(nil).Msg("Too many sections in " + storageClassEnv)
    	} else if len(s) < 2 {
    		return StorageClass{}, config.ErrStorageClassValue(nil).Msg("Too few sections in " + storageClassEnv)
    	}
    
    	// only allowed scheme is "EC"
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12.3K bytes
    - Click Count (0)
  6. internal/config/errors-utils.go

    func (u Err) Msg(m string) Err {
    	e := u.Clone()
    	e.msg = m
    	return e
    }
    
    // Msgf - Replace the current error's message
    func (u Err) Msgf(m string, args ...any) Err {
    	e := u.Clone()
    	if len(args) == 0 {
    		e.msg = m
    	} else {
    		e.msg = fmt.Sprintf(m, args...)
    	}
    	return e
    }
    
    // Hint - Replace the current error's message
    func (u Err) Hint(m string, args ...any) Err {
    	e := u.Clone()
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  7. internal/kms/stub.go

    func NewStub(defaultKeyName string) *KMS {
    	return &KMS{
    		Type:           Builtin,
    		DefaultKey:     defaultKeyName,
    		latencyBuckets: defaultLatencyBuckets,
    		latency:        make([]atomic.Uint64, len(defaultLatencyBuckets)),
    		conn: &StubKMS{
    			KeyNames: []string{defaultKeyName},
    		},
    	}
    }
    
    // StubKMS is a KMS implementation for tests
    type StubKMS struct {
    	KeyNames []string
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Aug 18 06:43:03 GMT 2024
    - 3.6K bytes
    - Click Count (0)
  8. cmd/api-resources.go

    	errCode = ErrNone
    
    	// The continuation-token cannot be empty.
    	if val, ok := values["continuation-token"]; ok {
    		if len(val[0]) == 0 {
    			errCode = ErrIncorrectContinuationToken
    			return prefix, token, startAfter, delimiter, fetchOwner, maxkeys, encodingType, errCode
    		}
    	}
    
    	if values.Get("max-keys") != "" {
    		var err error
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 5.2K bytes
    - Click Count (0)
  9. migrator/migrator.go

    					createTableSQL += ","
    				}
    			}
    
    			if !hasPrimaryKeyInDataType && len(stmt.Schema.PrimaryFields) > 0 {
    				createTableSQL += "PRIMARY KEY ?,"
    				primaryKeys := make([]interface{}, 0, len(stmt.Schema.PrimaryFields))
    				for _, field := range stmt.Schema.PrimaryFields {
    					primaryKeys = append(primaryKeys, clause.Column{Name: field.DBName})
    				}
    
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Sun Oct 26 12:31:09 GMT 2025
    - 29.7K bytes
    - Click Count (0)
  10. tests/tests_test.go

    	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")
    
    	if err = DB.Migrator().DropTable(allModels...); err != nil {
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Mon Jul 21 02:46:58 GMT 2025
    - 3.7K bytes
    - Click Count (0)
Back to Top