Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 72 for names (0.3 sec)

  1. schema/constraint.go

    		if chk := field.TagSettings["CHECK"]; chk != "" {
    			names := strings.Split(chk, ",")
    			if len(names) > 1 && regEnLetterAndMidline.MatchString(names[0]) {
    				checks[names[0]] = CheckConstraint{Name: names[0], Constraint: strings.Join(names[1:], ","), Field: field}
    			} else {
    				if names[0] == "" {
    					chk = strings.Join(names[1:], ",")
    				}
    				name := schema.namer.CheckerName(schema.Table, field.DBName)
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Mon Mar 18 07:33:54 GMT 2024
    - 1.9K bytes
    - Viewed (0)
  2. callbacks.go

    		return false
    	})
    
    	for _, c := range cs {
    		// show warning message the callback name already exists
    		if idx := getRIndex(names, c.name); idx > -1 && !c.replace && !c.remove && !cs[idx].remove {
    			c.processor.db.Logger.Warn(context.Background(), "duplicated callback `%s` from %s\n", c.name, utils.FileWithLineNum())
    		}
    		names = append(names, c.name)
    	}
    
    	sortCallback = func(c *callback) error {
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Tue Mar 26 03:33:36 GMT 2024
    - 8.6K bytes
    - Viewed (1)
  3. scan.go

    						}
    					} else if names := utils.SplitNestedRelationName(column); len(names) > 1 { // has nested relation
    						if rel, ok := sch.Relationships.Relations[names[0]]; ok {
    							subNameCount := len(names)
    							// nested relation fields
    							relFields := make([]*schema.Field, 0, subNameCount-1)
    							relFields = append(relFields, rel.Field)
    							for _, name := range names[1 : subNameCount-1] {
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Fri Apr 26 09:53:11 GMT 2024
    - 9.8K bytes
    - Viewed (0)
  4. cmd/metacache-entries.go

    	for i, entry := range m {
    		if entry.name != "" {
    			n++
    			if first == nil {
    				first = &m[i]
    			}
    		}
    	}
    	return first, n
    }
    
    // names will return all names in order.
    // Since this allocates it should not be used in critical functions.
    func (m metaCacheEntries) names() []string {
    	res := make([]string, 0, len(m))
    	for _, obj := range m {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Fri Apr 19 16:43:43 GMT 2024
    - 23.2K bytes
    - Viewed (0)
  5. lib/time/mkzip.go

    		if err != nil {
    			log.Fatal(err)
    		}
    		if strings.HasSuffix(path, ".zip") {
    			log.Fatalf("unexpected file during walk: %s", path)
    		}
    		name := filepath.ToSlash(path)
    		w, err := zw.CreateRaw(&zip.FileHeader{
    			Name:               name,
    			Method:             zip.Store,
    			CompressedSize64:   uint64(len(data)),
    			UncompressedSize64: uint64(len(data)),
    			CRC32:              crc32.ChecksumIEEE(data),
    		})
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Mar 04 17:32:07 GMT 2024
    - 2.1K bytes
    - Viewed (0)
  6. cmd/encryption-v1.go

    				metadata = append(metadata, object.UserDefined)
    				buckets = append(buckets, object.Bucket)
    				names = append(names, object.Name)
    			}
    		}
    
    		// If there are no SSE-S3 single-part objects
    		// we can skip the decryption process. However,
    		// we still have to adjust the size and ETag
    		// of SSE-C and SSE-KMS objects.
    		if len(SSES3SinglePartObjects) == 0 {
    			for i := range batch {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Apr 04 12:04:40 GMT 2024
    - 36.5K bytes
    - Viewed (0)
  7. cmd/object-api-utils.go

    	// to return object name invalid rather than
    	// a cryptic error from the file system.
    	return !strings.ContainsRune(object, 0)
    }
    
    // checkObjectNameForLengthAndSlash -check for the validity of object name length and prefis as slash
    func checkObjectNameForLengthAndSlash(bucket, object string) error {
    	// Check for the length of object name
    	if len(object) > 1024 {
    		return ObjectNameTooLong{
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Mon Mar 11 11:55:34 GMT 2024
    - 35.6K bytes
    - Viewed (1)
  8. chainable_api.go

    	return
    }
    
    // Group specify the group method on the find
    //
    //	// Select the sum age of users with given names
    //	db.Model(&User{}).Select("name, sum(age) as total").Group("name").Find(&results)
    func (db *DB) Group(name string) (tx *DB) {
    	tx = db.getInstance()
    
    	fields := strings.FieldsFunc(name, utils.IsValidDBNameChar)
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Wed Apr 17 03:38:55 GMT 2024
    - 14.3K bytes
    - Viewed (1)
  9. internal/event/name.go

    		return []Name{
    			ObjectManyVersions,
    			ObjectLargeVersions,
    			PrefixManyFolders,
    		}
    	case Everything:
    		res := make([]Name, objectSingleTypesEnd-1)
    		for i := range res {
    			res[i] = Name(i + 1)
    		}
    		return res
    	default:
    		return []Name{name}
    	}
    }
    
    // Mask returns the type as mask.
    // Compound "All" types are expanded.
    func (name Name) Mask() uint64 {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Wed May 01 01:11:10 GMT 2024
    - 10.4K bytes
    - Viewed (0)
  10. cmd/metrics-v3-handler.go

    // metricDisplay - contains info on a metric for display purposes.
    type metricDisplay struct {
    	Name   string   `json:"name"`
    	Help   string   `json:"help"`
    	Type   string   `json:"type"`
    	Labels []string `json:"labels"`
    }
    
    func (md metricDisplay) String() string {
    	return fmt.Sprintf("Name: %s\nType: %s\nHelp: %s\nLabels: {%s}\n", md.Name, md.Type, md.Help, strings.Join(md.Labels, ","))
    }
    
    func (md metricDisplay) TableRow() string {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu May 02 17:37:57 GMT 2024
    - 7.5K bytes
    - Viewed (0)
Back to top