Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 56 for AsSlice (0.03 sec)

  1. src/cmd/asm/internal/lex/slice.go

    	"cmd/internal/src"
    )
    
    // A Slice reads from a slice of Tokens.
    type Slice struct {
    	tokens []Token
    	base   *src.PosBase
    	line   int
    	pos    int
    }
    
    func NewSlice(base *src.PosBase, line int, tokens []Token) *Slice {
    	return &Slice{
    		tokens: tokens,
    		base:   base,
    		line:   line,
    		pos:    -1, // Next will advance to zero.
    	}
    }
    
    func (s *Slice) Next() ScanToken {
    	s.pos++
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Jun 29 22:49:50 UTC 2023
    - 1.6K bytes
    - Viewed (0)
  2. tests/associations_has_one_test.go

    		t.Errorf("account's number should not be saved")
    	}
    }
    
    func TestHasOneAssociationForSlice(t *testing.T) {
    	users := []User{
    		*GetUser("slice-hasone-1", Config{Account: true}),
    		*GetUser("slice-hasone-2", Config{Account: false}),
    		*GetUser("slice-hasone-3", Config{Account: true}),
    	}
    
    	DB.Create(&users)
    
    	// Count
    	AssertAssociationCount(t, users, "Account", 2, "")
    
    	// Find
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Wed Jun 12 10:49:45 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  3. tests/associations_belongs_to_test.go

    		&Company{Name: "company-slice-append-1"},
    		&Company{Name: "company-slice-append-2"},
    		&Company{Name: "company-slice-append-3"},
    	)
    
    	AssertAssociationCount(t, users, "Company", 3, "After Append")
    
    	DB.Model(&users).Association("Manager").Append(
    		GetUser("manager-slice-belongs-to-1", Config{}),
    		GetUser("manager-slice-belongs-to-2", Config{}),
    		GetUser("manager-slice-belongs-to-3", Config{}),
    	)
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Mon Oct 30 09:15:49 UTC 2023
    - 9.3K bytes
    - Viewed (0)
  4. src/bytes/reader.go

    // a byte slice.
    // Unlike a [Buffer], a Reader is read-only and supports seeking.
    // The zero value for Reader operates like a Reader of an empty slice.
    type Reader struct {
    	s        []byte
    	i        int64 // current reading index
    	prevRune int   // index of previous rune; or < 0
    }
    
    // Len returns the number of bytes of the unread portion of the
    // slice.
    func (r *Reader) Len() int {
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Jul 16 18:17:37 UTC 2024
    - 3.9K bytes
    - Viewed (0)
  5. tests/helper_test.go

    		if len(user.Pets) != len(expect.Pets) {
    			t.Fatalf("pets should equal, expect: %v, got %v", len(expect.Pets), len(user.Pets))
    		}
    
    		sort.Slice(user.Pets, func(i, j int) bool {
    			return user.Pets[i].ID > user.Pets[j].ID
    		})
    
    		sort.Slice(expect.Pets, func(i, j int) bool {
    			return expect.Pets[i].ID > expect.Pets[j].ID
    		})
    
    		for idx, pet := range user.Pets {
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Tue Mar 19 03:50:28 UTC 2024
    - 8K bytes
    - Viewed (0)
  6. src/test/java/jcifs/EncodableTest.java

                    Arguments.of(makeSeq(8), 0, 8, 0), // full copy at index 0
                    Arguments.of(makeSeq(10), 2, 5, 3), // middle slice, non-zero dst index
                    Arguments.of(makeSeq(4), 4, 0, 0), // zero-length slice at end
                    Arguments.of(makeSeq(16), 7, 3, 0), // small slice from middle
                    Arguments.of(makeSeq(16), 0, 0, 5) // zero-length with non-zero dst index
            );
        }
    
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.6K bytes
    - Viewed (0)
  7. src/bytes/iter.go

    // but without constructing a new slice containing the subslices.
    // It returns a single-use iterator.
    func SplitSeq(s, sep []byte) iter.Seq[[]byte] {
    	return splitSeq(s, sep, 0)
    }
    
    // SplitAfterSeq returns an iterator over subslices of s split after each instance of sep.
    // The iterator yields the same subslices that would be returned by [SplitAfter](s, sep),
    // but without constructing a new slice containing the subslices.
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  8. docs/en/docs/js/custom.js

                                console.error("Custom prompt found but no end delimiter", line)
                            }
                            const prompt = line.slice(0, promptStart).replace(customPromptLiteralStart, "")
                            let value = line.slice(promptStart + promptLiteralStart.length);
                            useLines.push({
                                type: "input",
                                value: value,
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Mon Sep 22 15:11:52 UTC 2025
    - 6.3K bytes
    - Viewed (2)
  9. cmd/os-readdir_test.go

    	sort.Strings(entries)
    
    	// Add entries slice for this test directory.
    	testResults = append(testResults, result{dir, entries})
    	return testResults
    }
    
    // checkResult - checks whether entries are got are same as expected entries.
    func checkResult(expected []string, got []string) bool {
    	// If length of expected and got slice are different, the test actually failed.
    	if len(expected) != len(got) {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue May 27 15:19:03 UTC 2025
    - 7.5K bytes
    - Viewed (0)
  10. schema/utils.go

    				result := reflect.Indirect(rel.Field.ReflectValueOf(ctx, value))
    				switch result.Kind() {
    				case reflect.Struct:
    					reflectResults = reflect.Append(reflectResults, result.Addr())
    				case reflect.Slice, reflect.Array:
    					for i := 0; i < result.Len(); i++ {
    						if elem := result.Index(i); elem.Kind() == reflect.Ptr {
    							reflectResults = reflect.Append(reflectResults, elem)
    						} else {
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Thu Oct 30 11:15:36 UTC 2025
    - 5.9K bytes
    - Viewed (0)
Back to top