- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 18 for pet2 (0.43 sec)
-
tests/create_test.go
}} if err := DB.Create(&pets).Error; err != nil { t.Fatalf("errors happened when create: %v", err) } var petIDs []uint for _, pet := range pets { petIDs = append(petIDs, pet.ID) CheckPet(t, pet, pet) } var pets2 []Pet DB.Preload("Toy").Find(&pets2, "id IN ?", petIDs) for idx, pet := range pets2 { CheckPet(t, pet, pets[idx]) } })
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Jul 21 09:55:20 UTC 2025 - 26.8K bytes - Viewed (0) -
tests/table_test.go
} r = dryDB.Table("(?) as u, (?) as p", DB.Model(&User{}).Select("name"), DB.Model(&Pet{}).Select("name")).Find(&User{}).Statement if !regexp.MustCompile("SELECT \\* FROM \\(SELECT .name. FROM .users. WHERE .users.\\..deleted_at. IS NULL\\) as u, \\(SELECT .name. FROM .pets. WHERE .pets.\\..deleted_at. IS NULL\\) as p WHERE .u.\\..deleted_at. IS NULL").MatchString(r.Statement.SQL.String()) {
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Jul 21 02:46:58 UTC 2025 - 12.7K bytes - Viewed (0) -
tests/generics_test.go
} } else if len(result.Pets) != 5 { t.Fatalf("Preload user %v pets should be 5, but got %+v", result.Name, result.Pets) } for i := 1; i < len(result.Pets); i++ { if result.Pets[i-1].Name < result.Pets[i].Name { t.Fatalf("Preload user %v pets not ordered correctly, last %v, cur %v", result.Name, result.Pets[i-1], result.Pets[i]) } } }
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Thu Sep 04 13:13:16 UTC 2025 - 28K bytes - Viewed (0) -
schema/schema_test.go
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Thu Aug 28 02:57:17 UTC 2025 - 13.3K bytes - Viewed (0) -
tests/update_test.go
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Jul 21 02:46:58 UTC 2025 - 30.4K bytes - Viewed (0) -
tests/delete_test.go
*GetUser("delete_slice_with_associations1", Config{Account: true, Pets: 4, Toys: 1, Company: true, Manager: true, Team: 1, Languages: 1, Friends: 4}), *GetUser("delete_slice_with_associations2", Config{Account: true, Pets: 3, Toys: 2, Company: true, Manager: true, Team: 2, Languages: 2, Friends: 3}), *GetUser("delete_slice_with_associations3", Config{Account: true, Pets: 2, Toys: 3, Company: true, Manager: true, Team: 3, Languages: 3, Friends: 2}),
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Jul 21 02:46:58 UTC 2025 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 81.6K bytes - Viewed (0) -
tests/upsert_test.go
} DB.Where(&User{Name: "find or create embedded struct"}).Assign(User{Age: 44, Account: Account{Number: "1231231231"}, Pets: []*Pet{{Name: "first_or_create_pet1"}, {Name: "first_or_create_pet2"}}}).FirstOrCreate(&user8) if err := DB.Where("name = ?", "first_or_create_pet1").First(&Pet{}).Error; err != nil { t.Errorf("has many association should be saved") }
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Tue Jul 29 11:06:13 UTC 2025 - 13.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetViewTest.java
Set<Integer> set2 = newHashSet(2, 3); Set<Integer> intersection = intersection(set1, set2); assertThat(intersection).containsExactly(2); set1.add(3); assertThat(intersection).containsExactly(2, 3); set2.add(1); assertThat(intersection).containsExactly(1, 2, 3); } public void testDifference_isView() { Set<Integer> set1 = newHashSet(1, 2); Set<Integer> set2 = newHashSet(2, 3);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 29.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableSortedSetTest.java
BiPredicate<ImmutableSortedSet<String>, ImmutableSortedSet<String>> equivalence = (set1, set2) -> set1.equals(set2) && set1.asList().equals(set2.asList()) && set1.comparator().equals(set2.comparator()); ImmutableSortedSet<String> expected = ImmutableSortedSet.orderedBy(String.CASE_INSENSITIVE_ORDER).add("a", "B", "c", "d").build();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 46.7K bytes - Viewed (0)