Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 470 for ok (0.01 seconds)

  1. tests/lru_test.go

    	if v != "val1" {
    		t.Fatalf("value differs from expected")
    	}
    	if !ok {
    		t.Fatalf("should be true")
    	}
    
    	for {
    		result, ok := lc.Get("key1")
    		if ok && result == "" {
    			t.Fatalf("ok should return a result")
    		}
    		if !ok {
    			break
    		}
    	}
    
    	time.Sleep(time.Millisecond * 100) // wait for expiration reaper
    	if lc.Len() != 0 {
    		t.Fatalf("length differs from expected")
    	}
    
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Mon Sep 08 09:19:22 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  2. cmd/bucket-policy.go

    	for k, v := range claims {
    		vStr, ok := v.(string)
    		if ok {
    			// Trim any LDAP specific prefix
    			args[strings.ToLower(strings.TrimPrefix(k, "ldap"))] = []string{vStr}
    		}
    	}
    
    	// Add groups claim which could be a list. This will ensure that the claim
    	// `jwt:groups` works.
    	if grpsVal, ok := claims["groups"]; ok {
    		if grpsIs, ok := grpsVal.([]any); ok {
    			grps := []string{}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 7.9K bytes
    - Click Count (0)
  3. schema/schema.go

    	if field, ok := schema.FieldsByDBName[name]; ok {
    		return field
    	}
    	if field, ok := schema.FieldsByName[name]; ok {
    		return field
    	}
    
    	// Lookup field using namer-driven ColumnName
    	if schema.namer == nil {
    		return nil
    	}
    	namerColumnName := schema.namer.ColumnName(schema.Table, name)
    	if field, ok := schema.FieldsByDBName[namerColumnName]; ok {
    		return field
    	}
    
    	return nil
    }
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Fri Oct 31 12:13:56 GMT 2025
    - 13.1K bytes
    - Click Count (0)
  4. callbacks/delete.go

    func BeforeDelete(db *gorm.DB) {
    	if db.Error == nil && db.Statement.Schema != nil && !db.Statement.SkipHooks && db.Statement.Schema.BeforeDelete {
    		callMethod(db, func(value interface{}, tx *gorm.DB) bool {
    			if i, ok := value.(BeforeDeleteInterface); ok {
    				db.AddError(i.BeforeDelete(tx))
    				return true
    			}
    
    			return false
    		})
    	}
    }
    
    func DeleteBeforeAssociations(db *gorm.DB) {
    	if db.Error == nil && db.Statement.Schema != nil {
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Sun May 25 07:40:40 GMT 2025
    - 5.8K bytes
    - Click Count (0)
  5. internal/bucket/bandwidth/monitor.go

    		NodeCount:             numNodes,
    	}
    	go m.trackEWMA()
    	return m
    }
    
    func (m *Monitor) updateMeasurement(opts BucketOptions, bytes uint64) {
    	m.mlock.Lock()
    	defer m.mlock.Unlock()
    
    	tm, ok := m.bucketsMeasurement[opts]
    	if !ok {
    		tm = &bucketMeasurement{}
    	}
    	tm.incrementBytes(bytes)
    	m.bucketsMeasurement[opts] = tm
    }
    
    // SelectionFunction for buckets
    type SelectionFunction func(bucket string) bool
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 6K bytes
    - Click Count (0)
  6. cmd/user-provider-utils.go

    		return madmin.BuiltinProvider // regular users are always internal
    	}
    
    	claims := credentials.Claims
    	if _, ok := claims[ldapUser]; ok {
    		return madmin.LDAPProvider // ldap users
    	}
    
    	if _, ok := claims[subClaim]; ok {
    		providerPrefix, _, found := strings.Cut(credentials.ParentUser, getKeySeparator())
    		if found {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 4.1K bytes
    - Click Count (0)
  7. cmd/iam-store.go

    		}
    
    		subClaimValue := cred.ParentUser
    		if v, ok := claims.Lookup(subClaim); ok {
    			subClaimValue = v
    		}
    		if v, ok := claims.Lookup(ldapActualUser); ok {
    			subClaimValue = v
    		}
    
    		roleArn := openid.DummyRoleARN.String()
    		s, ok := claims.Lookup(roleArnClaim)
    		if ok {
    			roleArn = s
    		}
    		v, ok := res[cred.ParentUser]
    		if ok {
    			res[cred.ParentUser] = ParentUserInfo{
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 87.1K bytes
    - Click Count (0)
  8. src/archive/zip/register.go

    		panic("compressor already registered")
    	}
    }
    
    func compressor(method uint16) Compressor {
    	ci, ok := compressors.Load(method)
    	if !ok {
    		return nil
    	}
    	return ci.(Compressor)
    }
    
    func decompressor(method uint16) Decompressor {
    	di, ok := decompressors.Load(method)
    	if !ok {
    		return nil
    	}
    	return di.(Decompressor)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Oct 13 18:36:46 GMT 2023
    - 3.7K bytes
    - Click Count (0)
  9. soft_delete.go

    }
    
    func (sd SoftDeleteQueryClause) ModifyStatement(stmt *Statement) {
    	if _, ok := stmt.Clauses["soft_delete_enabled"]; !ok && !stmt.Statement.Unscoped {
    		if c, ok := stmt.Clauses["WHERE"]; ok {
    			if where, ok := c.Expression.(clause.Where); ok && len(where.Exprs) >= 1 {
    				for _, expr := range where.Exprs {
    					if orCond, ok := expr.(clause.OrConditions); ok && len(orCond.Exprs) == 1 {
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Wed Feb 01 06:40:55 GMT 2023
    - 4.5K bytes
    - Click Count (1)
  10. internal/s3select/sql/stringfuncs.go

    				return true, nil
    			}
    
    		case underscore:
    			if len(s) == 0 {
    				text, ok = dropRune(text)
    				if !ok {
    					return false, nil
    				}
    				continue
    			}
    
    			text, ok = matcher(text, string(s), hasLeadingPercent)
    			if !ok {
    				return false, nil
    			}
    			hasLeadingPercent = false
    
    			text, ok = dropRune(text)
    			if !ok {
    				return false, nil
    			}
    			s = []rune{}
    
    		case escape:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 4.2K bytes
    - Click Count (0)
Back to Top