Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 20 for regulations (0.09 sec)

  1. schema/schema_helper_test.go

    			if len(relations.Relations) != len(rs.Relations) {
    				t.Errorf("schema relations count don't match, expects %d, got %d", len(rs.Relations), len(relations.Relations))
    			}
    			if len(relations.EmbeddedRelations) != len(rs.EmbeddedRelations) {
    				t.Errorf("schema embedded relations count don't match, expects %d, got %d", len(rs.EmbeddedRelations), len(relations.EmbeddedRelations))
    			}
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Aug 28 02:57:17 UTC 2025
    - 7.5K bytes
    - Viewed (0)
  2. callbacks/preload.go

    	}
    	names := make([]string, 0, len(embeddedRelations.Relations)+len(embeddedRelations.EmbeddedRelations))
    	for _, relation := range embeddedRelations.Relations {
    		// skip first struct name
    		names = append(names, strings.Join(relation.Field.EmbeddedBindNames[1:], "."))
    	}
    	for _, relations := range embeddedRelations.EmbeddedRelations {
    		names = append(names, embeddedValues(relations)...)
    	}
    	return names
    }
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 11.7K bytes
    - Viewed (0)
  3. callbacks/query.go

    			for _, join := range db.Statement.Joins {
    				if db.Statement.Schema != nil {
    					var isRelations bool // is relations or raw sql
    					var relations []*schema.Relationship
    					relation, ok := db.Statement.Schema.Relationships.Relations[join.Name]
    					if ok {
    						isRelations = true
    						relations = append(relations, relation)
    					} else {
    						// handle nested join like "Manager.Company"
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 10.4K bytes
    - Viewed (1)
  4. schema/relationship.go

    	defer schema.Relationships.Mux.Unlock()
    
    	// set non-embedded relation
    	if rel := schema.Relationships.Relations[relation.Name]; rel != nil {
    		if len(rel.Field.BindNames) > 1 {
    			schema.Relationships.Relations[relation.Name] = relation
    		}
    	} else {
    		schema.Relationships.Relations[relation.Name] = relation
    	}
    
    	// set embedded relation
    	if len(relation.Field.EmbeddedBindNames) <= 1 {
    		return
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Aug 18 11:44:52 UTC 2025
    - 23.1K bytes
    - Viewed (1)
  5. schema/relationship_test.go

    	if err != nil {
    		t.Fatalf("failed to parse schema, got error %v", err)
    	}
    
    	if len(userSchema.Relationships.Relations) != 1 {
    		t.Fatalf("expects 1 relations, but got %v", len(userSchema.Relationships.Relations))
    	}
    
    	if createdByRel, ok := userSchema.Relationships.Relations["CreatedBy"]; ok {
    		if createdByRel.FieldSchema != userSchema {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Aug 18 11:44:52 UTC 2025
    - 26.5K bytes
    - Viewed (0)
  6. schema/schema_test.go

    	}
    
    	for i := range fields {
    		checkSchemaField(t, user, &fields[i], func(f *schema.Field) {
    			f.Creatable = true
    			f.Updatable = true
    			f.Readable = true
    		})
    	}
    
    	// check relations
    	relations := []Relation{
    		{
    			Name: "Account", Type: schema.HasOne, Schema: "User", FieldSchema: "Account",
    			References: []Reference{{"ID", "User", "UserID", "Account", "", true}},
    		},
    		{
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Aug 28 02:57:17 UTC 2025
    - 13.3K bytes
    - Viewed (0)
  7. scan.go

    							}
    						}
    
    						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] {
    								rel = rel.FieldSchema.Relationships.Relations[name]
    								relFields = append(relFields, rel.Field)
    							}
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  8. gorm.go

    		if f.Size == 0 {
    			f.Size = ref.ForeignKey.Size
    		}
    		ref.ForeignKey = f
    	}
    
    	for name, rel := range relation.JoinTable.Relationships.Relations {
    		if _, ok := joinSchema.Relationships.Relations[name]; !ok {
    			rel.Schema = joinSchema
    			joinSchema.Relationships.Relations[name] = rel
    		}
    	}
    	relation.JoinTable = joinSchema
    
    	return nil
    }
    
    // Use use plugin
    func (db *DB) Use(plugin Plugin) error {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Tue Aug 26 06:24:29 UTC 2025
    - 12.8K bytes
    - Viewed (0)
  9. tests/multi_primary_keys_test.go

    		t.Fatalf("Should find 3 tags")
    	}
    
    	var blog1 Blog
    	DB.Preload("Tags").Find(&blog1)
    	if !compareTags(blog1.Tags, []string{"tag1", "tag2", "tag3"}) {
    		t.Fatalf("Preload many2many relations")
    	}
    
    	// Replace
    	tag5 := &Tag{Locale: "ZH", Value: "tag5"}
    	tag6 := &Tag{Locale: "ZH", Value: "tag6"}
    	DB.Model(&blog).Association("Tags").Replace(tag5, tag6)
    	var tags2 []Tag
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Jul 21 02:46:58 UTC 2025
    - 13.1K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/SortedMultisets.java

     */
    @GwtCompatible
    final class SortedMultisets {
      private SortedMultisets() {}
    
      /** A skeleton implementation for {@link SortedMultiset#elementSet}. */
      @SuppressWarnings("JdkObsolete") // TODO(b/6160855): Switch GWT emulations to NavigableSet.
      static class ElementSet<E extends @Nullable Object> extends Multisets.ElementSet<E>
          implements SortedSet<E> {
        @Weak private final SortedMultiset<E> multiset;
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 5.5K bytes
    - Viewed (0)
Back to top