- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for Kamner (0.25 sec)
-
tests/table_test.go
} AssertEqual(t, r.Statement.Vars, []interface{}{2, 4, 1, 3}) } type UserWithTableNamer struct { gorm.Model Name string } func (UserWithTableNamer) TableName(namer schema.Namer) string { return namer.TableName("user") } func TestTableWithNamer(t *testing.T) { db, _ := gorm.Open(tests.DummyDialector{}, &gorm.Config{ NamingStrategy: schema.NamingStrategy{ TablePrefix: "t_", },
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Sat Mar 09 09:31:28 GMT 2024 - 10.6K bytes - Viewed (0) -
schema/relationship.go
Tag: `gorm:"-"`, }) if relation.JoinTable, err = Parse(reflect.New(reflect.StructOf(joinTableFields)).Interface(), schema.cacheStore, schema.namer); err != nil { schema.err = err } relation.JoinTable.Name = many2many relation.JoinTable.Table = schema.namer.JoinTableName(many2many) relation.JoinTable.PrimaryFields = make([]*Field, 0, len(relation.JoinTable.Fields)) relName := relation.Schema.Name
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Mon Apr 15 03:20:20 GMT 2024 - 22.4K bytes - Viewed (0) -
cmd/server-main.go
} if !globalEndpoints.HTTPS() && globalIsTLS { logger.Fatal(config.ErrCertsAndHTTPEndpoints(nil), "Unable to start the server") } } // Check for updates in non-blocking manner. go func() { if !globalServerCtxt.Quiet && !globalInplaceUpdateDisabled { // Check for new updates from dl.min.io. bootstrapTrace("checkUpdate", func() { checkUpdate(getMinioMode()) }) }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 34.9K bytes - Viewed (1) -
docs/fr/docs/async.md
Et vous deviez attendre 🕙 dans la file pendant un long moment ou vous perdiez votre place. Vous n'auriez donc probablement pas envie d'amener votre crush 😍 avec vous à la banque 🏦. #### Conclusion Dans ce scénario des "burgers du fast-food avec votre crush", comme il y a beaucoup d'attente 🕙, il est très logique d'avoir un système concurrent ⏸🔀⏯.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Sun Mar 31 23:52:53 GMT 2024 - 24K bytes - Viewed (0) -
schema/field.go
field.Readable = false cacheStore := &sync.Map{} cacheStore.Store(embeddedCacheKey, true) if field.EmbeddedSchema, err = getOrParse(fieldValue.Interface(), cacheStore, embeddedNamer{Table: schema.Table, Namer: schema.namer}); err != nil { schema.err = err } for _, ef := range field.EmbeddedSchema.Fields { ef.Schema = schema ef.OwnerSchema = field.EmbeddedSchema
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Mon Apr 15 03:20:20 GMT 2024 - 32K bytes - Viewed (1) -
cmd/metacache-server-pool.go
// skip latest object from listing only for regular // listObjects calls, versioned based listing cannot // filter out between versions 'obj' cannot be truncated // in such a manner, so look for skipping an object only // for regular ListObjects() call only. if !o.Versioned && !o.V1 { fi, err := obj.fileInfo(o.Bucket) if err != nil { return }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 12.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Equivalence.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * A strategy for determining whether two instances are considered equivalent, and for computing * hash codes in a manner consistent with that equivalence. Two examples of equivalences are the * {@linkplain #identity() identity equivalence} and the {@linkplain #equals "equals" equivalence}. * * @author Bob Lee * @author Ben Yu
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Equivalence.java
import org.checkerframework.checker.nullness.qual.Nullable; /** * A strategy for determining whether two instances are considered equivalent, and for computing * hash codes in a manner consistent with that equivalence. Two examples of equivalences are the * {@linkplain #identity() identity equivalence} and the {@linkplain #equals "equals" equivalence}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 01:41:50 GMT 2024 - 14.1K bytes - Viewed (0) -
README.md
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu May 02 22:37:31 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
*/ public static HashFunction fingerprint2011() { return Fingerprint2011.FINGERPRINT_2011; } /** * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner * that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0)