Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 29 for struct (0.04 seconds)

  1. tests/migrate_test.go

    	type UserStat struct {
    		GroundDestroyCount int
    	}
    
    	type GameUser struct {
    		gorm.Model
    		StatAb UserStat `gorm:"embedded;embeddedPrefix:stat_ab_"`
    	}
    
    	type UserStat1 struct {
    		GroundDestroyCount string
    	}
    
    	type GroundRate struct {
    		GroundDestroyCount int
    	}
    
    	type GameUser1 struct {
    		gorm.Model
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Wed Aug 20 04:51:17 GMT 2025
    - 65.2K bytes
    - Click Count (0)
  2. src/bytes/bytes_test.go

    	out := slices.Collect(seq)
    	out1 := slices.Collect(seq)
    	if !slices.Equal(sliceOfString(out), sliceOfString(out1)) {
    		t.Fatalf("inconsistent seq:\n%s\n%s", out, out1)
    	}
    	return out
    }
    
    type LinesTest struct {
    	a string
    	b []string
    }
    
    var linesTests = []LinesTest{
    	{a: "abc\nabc\n", b: []string{"abc\n", "abc\n"}},
    	{a: "abc\r\nabc", b: []string{"abc\r\n", "abc"}},
    	{a: "abc\r\n", b: []string{"abc\r\n"}},
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 23 23:54:14 GMT 2025
    - 62.9K bytes
    - Click Count (0)
  3. src/bufio/bufio_test.go

    			t.Fatalf("on line %d/2; ReadLine=%#v, %v; want non-nil line or Error, but not both",
    				i+1, l, err)
    		}
    	}
    }
    
    type readLineResult struct {
    	line     []byte
    	isPrefix bool
    	err      error
    }
    
    var readLineNewlinesTests = []struct {
    	input  string
    	expect []readLineResult
    }{
    	{"012345678901234\r\n012345678901234\r\n", []readLineResult{
    		{[]byte("012345678901234"), true, nil},
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 07 01:08:54 GMT 2025
    - 51.6K bytes
    - Click Count (0)
  4. cmd/xl-storage_test.go

    )
    
    func TestCheckPathLength(t *testing.T) {
    	// Check path length restrictions are not same on windows/darwin
    	if runtime.GOOS == "windows" || runtime.GOOS == "darwin" {
    		t.Skip()
    	}
    
    	testCases := []struct {
    		path        string
    		expectedErr error
    	}{
    		{".", errFileAccessDenied},
    		{"/", errFileAccessDenied},
    		{"..", errFileAccessDenied},
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 66K bytes
    - Click Count (0)
  5. internal/bucket/lifecycle/lifecycle_test.go

    	}
    	var lc1 Lifecycle
    	err = xml.Unmarshal(b, &lc1)
    	if err != nil {
    		t.Fatal(err)
    	}
    
    	ruleSet := make(map[string]struct{})
    	for _, rule := range lc.Rules {
    		ruleBytes, err := xml.Marshal(rule)
    		if err != nil {
    			t.Fatal(err)
    		}
    		ruleSet[string(ruleBytes)] = struct{}{}
    	}
    	for _, rule := range lc1.Rules {
    		ruleBytes, err := xml.Marshal(rule)
    		if err != nil {
    			t.Fatal(err)
    		}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 55.5K bytes
    - Click Count (0)
  6. cmd/xl-storage-format-v2.go

    					// We are either strict, or don't have enough information to match.
    					// Switch to a pure counting algo.
    					x := make(map[xlMetaV2VersionHeader]int, len(tops))
    					for _, a := range tops {
    						if a.header.VersionID != ver.header.VersionID {
    							continue
    						}
    						if !strict {
    							// we must match EC, when we are not strict.
    							if !a.header.matchesEC(ver.header) {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 65.6K bytes
    - Click Count (1)
  7. tests/query_test.go

    	user.UpdatedAt = time.Time{}
    	if err := DB.Where(&user).First(&User{}).Error; err != nil {
    		t.Errorf("search with struct with association should returns no error, but got %v", err)
    	}
    
    	if err := DB.Where(user).First(&User{}).Error; err != nil {
    		t.Errorf("search with struct with association should returns no error, but got %v", err)
    	}
    }
    
    func TestFindInBatches(t *testing.T) {
    	users := []User{
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Tue Jul 22 06:21:04 GMT 2025
    - 51K bytes
    - Click Count (0)
  8. tensorflow/c/c_api.h

    // invalidate old TF_Operation* pointers.
    typedef struct TF_Operation TF_Operation;
    
    // Represents a specific input of an operation.
    typedef struct TF_Input {
      TF_Operation* oper;
      int index;  // The index of the input within oper.
    } TF_Input;
    
    // Represents a specific output of an operation.
    typedef struct TF_Output {
      TF_Operation* oper;
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Thu Oct 26 21:08:15 GMT 2023
    - 82.3K bytes
    - Click Count (0)
  9. internal/s3select/select_test.go

    		_, err := r.Seek(offset, io.SeekStart)
    		if err != nil {
    			return nil, err
    		}
    		return io.NopCloser(r), nil
    	}
    	return NewObjectReadSeekCloser(segmentReader, int64(len(b)))
    }
    
    type testResponseWriter struct {
    	statusCode int
    	response   []byte
    }
    
    func (w *testResponseWriter) Header() http.Header {
    	return nil
    }
    
    func (w *testResponseWriter) Write(p []byte) (int, error) {
    	w.response = append(w.response, p...)
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 76.1K bytes
    - Click Count (0)
  10. cmd/erasure-server-pool.go

    }
    
    // GetDisksID will return disks by their ID.
    func (z *erasureServerPools) GetDisksID(ids ...string) []StorageAPI {
    	idMap := make(map[string]struct{}, len(ids))
    	for _, id := range ids {
    		idMap[id] = struct{}{}
    	}
    	res := make([]StorageAPI, 0, len(idMap))
    	for _, s := range z.serverPools {
    		for _, set := range s.sets {
    			for _, disk := range set.getDisks() {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 89.2K bytes
    - Click Count (0)
Back to Top