- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 244 for ridx (0.05 sec)
-
clause/locking_test.go
"SELECT * FROM `users` FOR UPDATE SKIP LOCKED", nil, }, } for idx, result := range results { t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) { checkBuildClauses(t, result.Clauses, result.Result, result.Vars) }) }
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Fri Dec 15 08:32:56 UTC 2023 - 1.2K bytes - Viewed (0) -
clause/delete_test.go
"DELETE FROM `users`", nil, }, { []clause.Interface{clause.Delete{Modifier: "LOW_PRIORITY"}, clause.From{}}, "DELETE LOW_PRIORITY FROM `users`", nil, }, } for idx, result := range results { t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) { checkBuildClauses(t, result.Clauses, result.Result, result.Vars) }) }
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Tue Jun 02 01:18:01 UTC 2020 - 608 bytes - Viewed (0) -
tests/hooks_test.go
} } DB.Model(&products2).Update("Name", "product-name") // will set all product's price to last product's price + 10 for idx, value := range []int64{410, 410, 410} { if products2[idx].Price != value { t.Errorf("invalid price for product #%v, expects: %v, got %v", idx, value, products2[idx].Price) } } } type Product4 struct { gorm.Model Name string
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Mon Jun 17 03:59:06 UTC 2024 - 16.7K bytes - Viewed (0) -
clause/insert_test.go
}, { []clause.Interface{clause.Insert{Table: clause.Table{Name: "products"}, Modifier: "LOW_PRIORITY"}}, "INSERT LOW_PRIORITY INTO `products`", nil, }, } for idx, result := range results { t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) { checkBuildClauses(t, result.Clauses, result.Result, result.Vars) }) }
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Tue Jun 02 01:18:01 UTC 2020 - 737 bytes - Viewed (0) -
clause/returning_test.go
}, clause.Returning{ []clause.Column{{Name: "name"}, {Name: "age"}}, }}, "SELECT * FROM `users` RETURNING `users`.`id`,`name`,`age`", nil, }, } for idx, result := range results { t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) { checkBuildClauses(t, result.Clauses, result.Result, result.Vars) }) }
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Tue Jun 02 01:18:01 UTC 2020 - 845 bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/msrpc/MsrpcSamrOpenAlias.java
public class MsrpcSamrOpenAlias extends samr.SamrOpenAlias { public MsrpcSamrOpenAlias(SamrDomainHandle handle, int access, int rid, SamrAliasHandle aliasHandle) { super(handle, access, rid, aliasHandle); ptype = 0; flags = DCERPC_FIRST_FRAG | DCERPC_LAST_FRAG; }
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 1.2K bytes - Viewed (0) -
clause/order_by_test.go
}, }, "SELECT * FROM `users` ORDER BY FIELD(id, ?,?,?)", []interface{}{1, 2, 3}, }, } for idx, result := range results { t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) { checkBuildClauses(t, result.Clauses, result.Result, result.Vars) }) }
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Thu Jan 06 07:02:53 UTC 2022 - 1.6K bytes - Viewed (0) -
callbacks/helper.go
columns = append(columns, k) } else { continue } } result[k][idx] = v } } sort.Strings(columns) values.Values = make([][]interface{}, len(mapValues)) values.Columns = make([]clause.Column, len(columns)) for idx, column := range columns { values.Columns[idx] = clause.Column{Name: column} for i, v := range result[column] { if len(values.Values[i]) == 0 {
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Thu Apr 14 12:32:57 UTC 2022 - 3.7K bytes - Viewed (0) -
tests/joins_test.go
sort.Slice(users, func(i, j int) bool { return users[i].ID > users[j].ID }) for idx, user := range users { // user CheckUser(t, user, users2[idx]) if users2[idx].Manager == nil { t.Fatalf("Failed to load Manager") } // manager CheckUser(t, *user.Manager, *users2[idx].Manager) // user pet if users2[idx].NamedPet == nil { t.Fatalf("Failed to load NamedPet") }
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Mon Jun 17 03:58:13 UTC 2024 - 15K bytes - Viewed (0) -
src/test/java/org/codelibs/opensearch/extension/analysis/NGramSynonymTokenizer.java
for (int idx = 0; idx < synonyms.size(); idx++) { final MyToken synonym = synonyms.get(idx); tokenizePartialBlock(nextStart, synonym.startOffset, afterSynonymProduced); // enqueue prev-synonym processPrevSynonym(synonym.startOffset, idx > 0 ? synonyms.get(idx - 1).endOffset : 0); if (expand) {
Registered: Fri Nov 08 09:08:12 UTC 2024 - Last Modified: Thu Feb 22 01:36:54 UTC 2024 - 17K bytes - Viewed (0)