Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1021 - 1030 of 2,461 for errors (0.04 sec)

  1. callbacks/query.go

    		db.Statement.AddClauseIfNotExists(clauseSelect)
    
    		db.Statement.Build(db.Statement.BuildClauses...)
    	}
    }
    
    func Preload(db *gorm.DB) {
    	if db.Error == nil && len(db.Statement.Preloads) > 0 {
    		if db.Statement.Schema == nil {
    			db.AddError(fmt.Errorf("%w when using preload", gorm.ErrModelValueRequired))
    			return
    		}
    
    		joins := make([]string, 0, len(db.Statement.Joins))
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 10.1K bytes
    - Viewed (1)
  2. cmd/xl-storage-free-version.go

    	return false
    }
    
    // AddFreeVersion adds a free-version if needed for fi.VersionID version.
    // Free-version will be added if fi.VersionID has transitioned.
    func (x *xlMetaV2) AddFreeVersion(fi FileInfo) error {
    	var uv uuid.UUID
    	var err error
    	switch fi.VersionID {
    	case "", nullVersionID:
    	default:
    		uv, err = uuid.Parse(fi.VersionID)
    		if err != nil {
    			return err
    		}
    	}
    
    	for i, version := range x.versions {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Mar 02 05:11:03 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  3. cmd/metacache-stream_test.go

    		if entry.name != want[i] {
    			t.Errorf("entry %d, want %q, got %q", i, want[i], entry.name)
    		}
    	}
    }
    
    func Test_metacacheReader_readFn(t *testing.T) {
    	r := loadMetacacheSample(t)
    	defer r.Close()
    	i := 0
    	err := r.readFn(func(entry metaCacheEntry) bool {
    		want := loadMetacacheSampleNames[i]
    		if entry.name != want {
    			t.Errorf("entry %d, want %q, got %q", i, want, entry.name)
    		}
    		i++
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 15K bytes
    - Viewed (0)
  4. cmd/os-dirent_namelen_linux.go

    	}
    	// Avoid bugs in long file names
    	// https://github.com/golang/tools/commit/5f9a5413737ba4b4f692214aebee582b47c8be74
    	nameLen := bytes.IndexByte(nameBuf[:limit], 0)
    	if nameLen < 0 {
    		return 0, fmt.Errorf("failed to find terminating 0 byte in dirent")
    	}
    	return uint64(nameLen), nil
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 19 01:35:22 UTC 2021
    - 1.5K bytes
    - Viewed (0)
  5. cmd/erasure-decode_test.go

    		closeBitrotReaders(bitrotReaders)
    		if err != nil && !test.shouldFail {
    			t.Errorf("Test %d: should pass but failed with: %v", i, err)
    		}
    		if err == nil && test.shouldFail {
    			t.Errorf("Test %d: should fail but it passed", i)
    		}
    		if err == nil {
    			if content := writer.Bytes(); !bytes.Equal(content, data[test.offset:test.offset+test.length]) {
    				t.Errorf("Test %d: read returns wrong file content.", i)
    			}
    		}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jan 30 20:43:25 UTC 2024
    - 21.1K bytes
    - Viewed (0)
  6. internal/s3select/csv/reader.go

    	dst   chan [][]string // result of block decode
    	err   error           // any error encountered will be set here
    }
    
    // Read - reads single record.
    // Once Read is called the previous record should no longer be referenced.
    func (r *Reader) Read(dst sql.Record) (sql.Record, error) {
    	// If we have have any records left, return these before any error.
    	for len(r.current) <= r.recordsRead {
    		if r.err != nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Feb 22 06:26:06 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  7. src/bytes/bytes_test.go

    		a := Repeat(tin, tt.count)
    		if !Equal(a, tout) {
    			t.Errorf("Repeat(%q, %d) = %q; want %q", tin, tt.count, a, tout)
    			continue
    		}
    	}
    }
    
    func repeat(b []byte, count int) (err error) {
    	defer func() {
    		if r := recover(); r != nil {
    			switch v := r.(type) {
    			case error:
    				err = v
    			default:
    				err = fmt.Errorf("%s", v)
    			}
    		}
    	}()
    
    	Repeat(b, count)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Aug 19 19:09:04 UTC 2024
    - 61.2K bytes
    - Viewed (0)
  8. docs/sts/client-grants.go

    		},
    	}
    	hclient := http.Client{
    		Transport: t,
    	}
    	resp, err := hclient.Do(req)
    	if err != nil {
    		return nil, err
    	}
    	defer resp.Body.Close()
    	if resp.StatusCode != http.StatusOK {
    		return nil, fmt.Errorf("%s", resp.Status)
    	}
    
    	var idpToken JWTToken
    	if err = json.NewDecoder(resp.Body).Decode(&idpToken); err != nil {
    		return nil, err
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 19 01:35:22 UTC 2021
    - 3.3K bytes
    - Viewed (0)
  9. docs/debugging/inspect/decrypt-v1.go

    func extractInspectV1(keyHex string, r io.Reader, w io.Writer, okMsg string) error {
    	id, err := hex.DecodeString(keyHex[:8])
    	if err != nil {
    		return err
    	}
    	key, err := hex.DecodeString(keyHex[8:])
    	if err != nil {
    		return err
    	}
    	// Verify that CRC is ok.
    	want := binary.LittleEndian.Uint32(id)
    	got := crc32.ChecksumIEEE(key)
    	if want != got {
    		return fmt.Errorf("Invalid key checksum, want %x, got %x", want, got)
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Apr 11 21:22:47 UTC 2024
    - 1.6K bytes
    - Viewed (0)
  10. cmd/endpoint-ellipses_test.go

    			if err != nil && testCase.success {
    				t.Errorf("Expected success but failed instead %s", err)
    			}
    			if err == nil && !testCase.success {
    				t.Errorf("Expected failure but passed instead")
    			}
    			if !reflect.DeepEqual(testCase.indexes, gotIndexes) {
    				t.Errorf("Expected %v, got %v", testCase.indexes, gotIndexes)
    			}
    		})
    	}
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 15.2K bytes
    - Viewed (0)
Back to top