Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for pts2 (0.03 sec)

  1. src/main/java/org/codelibs/core/lang/StringUtil.java

            int pos = 0;
            int pos2 = 0;
            while (true) {
                pos = text.indexOf(fromText, pos2);
                if (pos == 0) {
                    buf.append(toText);
                    pos2 = fromText.length();
                } else if (pos > 0) {
                    buf.append(text.substring(pos2, pos));
                    buf.append(toText);
                    pos2 = pos + fromText.length();
                } else {
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Thu Jul 31 08:16:49 UTC 2025
    - 21.9K bytes
    - Viewed (0)
  2. tests/associations_has_many_test.go

    	CheckUser(t, user2, user)
    
    	AssertAssociationCount(t, user, "Pets", 3, "AfterAppend")
    
    	pets2 := []Pet{{Name: "pet-has-many-append-1-1"}, {Name: "pet-has-many-append-1-1"}}
    
    	if err := DB.Model(&user2).Association("Pets").Append(&pets2); err != nil {
    		t.Fatalf("Error happened when append pet, got %v", err)
    	}
    
    	for _, pet := range pets2 {
    		pet := pet
    		if pet.ID == 0 {
    			t.Fatalf("Pet's ID should be created")
    		}
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Wed Jun 12 10:49:45 UTC 2024
    - 16K bytes
    - Viewed (0)
  3. tests/create_test.go

    		}
    
    		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])
    		}
    	})
    
    	t.Run("SliceOfPtr", func(t *testing.T) {
    		pets := []*Pet{{
    			Name: "PolymorphicHasOne-Slice-1",
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Jul 21 09:55:20 UTC 2025
    - 26.8K bytes
    - Viewed (0)
  4. src/archive/tar/reader.go

    		pos1, err := sr.Seek(0, io.SeekCurrent)
    		if pos1 >= 0 && err == nil {
    			// Seek seems supported, so perform the real Seek.
    			pos2, err := sr.Seek(n-1, io.SeekCurrent)
    			if pos2 < 0 || err != nil {
    				return err
    			}
    			seekSkipped = pos2 - pos1
    		}
    	}
    
    	copySkipped, err := io.CopyN(io.Discard, r, n-seekSkipped)
    	if err == io.EOF && seekSkipped+copySkipped < n {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Mar 08 01:59:14 UTC 2024
    - 26.8K bytes
    - Viewed (0)
Back to top