- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 51 for order (0.34 sec)
-
tests/connpool_test.go
"INSERT INTO `users` (`created_at`,`updated_at`,`deleted_at`,`name`,`age`,`birthday`,`company_id`,`manager_id`,`active`) VALUES (?,?,?,?,?,?,?,?,?)", "SELECT * FROM `users` WHERE name = ? AND `users`.`deleted_at` IS NULL ORDER BY `users`.`id` LIMIT ?", "SELECT * FROM `users` WHERE name = ? AND `users`.`deleted_at` IS NULL ORDER BY `users`.`id` LIMIT ?",
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Tue Feb 06 02:54:40 GMT 2024 - 5.5K bytes - Viewed (0) -
clause/locking.go
builder.WriteString(" OF ") builder.WriteQuoted(locking.Table) } if locking.Options != "" { builder.WriteByte(' ') builder.WriteString(locking.Options) } } // MergeClause merge order by clauses func (locking Locking) MergeClause(clause *Clause) { clause.Expression = locking
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Fri Dec 15 08:32:56 GMT 2023 - 773 bytes - Viewed (0) -
cmd/erasure-sets_test.go
{"SHØRT", 49}, {"There are far too many object names, and far too few bucket names!", 8}, {"a/b/c/", 159}, {"/a/b/c", 96}, {string([]byte{0xff, 0xfe, 0xfd}), 147}, } // Tests hashing order to be consistent. for i, testCase := range testCases { if sipHashElement := hashKey("SIPMOD", testCase.objectName, 200, testUUID); sipHashElement != testCase.sipHash {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Feb 12 07:21:56 GMT 2024 - 6.9K bytes - Viewed (0) -
callbacks/create_test.go
Dest: dest, } stmt.Schema = s values := ConvertToCreateValues(stmt) expected := clause.Values{ // column has value + defaultValue column has value (which should have a stable order) Columns: []clause.Column{{Name: "name"}, {Name: "email"}, {Name: "age"}, {Name: "id"}}, Values: [][]interface{}{ {"alice", "email", 18, 1}, {"bob", "email", 19, 2}, }, }
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Mon Mar 18 05:48:42 GMT 2024 - 1.4K bytes - Viewed (0) -
docs/debugging/hash-set/main.go
sum64 := siphash.Hash(k0, k1, []byte(key)) return int(sum64 % uint64(cardinality)) } // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned. func hashOrder(key string, cardinality int) []int { if cardinality <= 0 {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Sep 19 18:05:16 GMT 2022 - 3.7K bytes - Viewed (0) -
operator/cmd/mesh/manifest-generate.go
} } manifests = filteredManifests } if mgArgs.OutFilename == "" { ordered, err := orderedManifests(manifests) if err != nil { return fmt.Errorf("failed to order manifests: %v", err) } for _, m := range ordered { l.Print(m + object.YAMLSeparator) } } else { if err := os.MkdirAll(mgArgs.OutFilename, os.ModePerm); err != nil { return err }
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Fri Mar 15 01:18:49 GMT 2024 - 8.5K bytes - Viewed (0) -
clause/benchmarks_test.go
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Fri Oct 07 12:14:14 GMT 2022 - 1.9K bytes - Viewed (0) -
utils/tests/models.go
} type CouponProduct struct { CouponId int `gorm:"primarykey;size:255"` ProductId string `gorm:"primarykey;size:255"` Desc string } type Order struct { gorm.Model Num string Coupon *Coupon CouponID string } type Parent struct { gorm.Model FavChildID uint FavChild *Child Children []*Child } type Child struct {
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Fri Dec 15 08:36:08 GMT 2023 - 2.1K bytes - Viewed (0) -
internal/handlers/proxy.go
protoRegex = regexp.MustCompile(`(?i)^(;|,| )+(?:proto=)(https|http)`) ) // GetSourceScheme retrieves the scheme from the X-Forwarded-Proto and RFC7239 // Forwarded headers (in that order). func GetSourceScheme(r *http.Request) string { var scheme string // Retrieve the scheme from X-Forwarded-Proto. if proto := r.Header.Get(xForwardedProto); proto != "" { scheme = strings.ToLower(proto)
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Dec 22 00:56:55 GMT 2023 - 5.1K bytes - Viewed (0) -
clause/limit.go
} if limit.Offset > 0 { if limit.Limit != nil && *limit.Limit >= 0 { builder.WriteByte(' ') } builder.WriteString("OFFSET ") builder.AddVar(builder, limit.Offset) } } // MergeClause merge order by clauses func (limit Limit) MergeClause(clause *Clause) { clause.Name = "" if v, ok := clause.Expression.(Limit); ok { if (limit.Limit == nil || *limit.Limit == 0) && v.Limit != nil { limit.Limit = v.Limit
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Tue Feb 06 02:54:40 GMT 2024 - 942 bytes - Viewed (0)