Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 772 for func_ (0.02 sec)

  1. clause/set_test.go

    		t.Run(fmt.Sprintf("case #%v", idx), func(t *testing.T) {
    			checkBuildClauses(t, result.Clauses, result.Result, result.Vars)
    		})
    	}
    }
    
    func TestAssignments(t *testing.T) {
    	set := clause.Assignments(map[string]interface{}{
    		"name": "jinzhu",
    		"age":  18,
    	})
    
    	assignments := []clause.Assignment(set)
    
    	sort.Slice(assignments, func(i, j int) bool {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Jan 06 07:02:53 UTC 2022
    - 1.4K bytes
    - Viewed (0)
  2. src/cmd/asm/internal/asm/endtoend_test.go

    		}
    	}
    }
    
    func TestGoBuildErrors(t *testing.T) {
    	testErrors(t, "amd64", "buildtagerror")
    }
    
    func TestGenericErrors(t *testing.T) {
    	testErrors(t, "amd64", "duperror")
    }
    
    func TestARMErrors(t *testing.T) {
    	testErrors(t, "arm", "armerror")
    }
    
    func TestARM64EndToEnd(t *testing.T) {
    	testEndToEnd(t, "arm64", "arm64")
    }
    
    func TestARM64Encoder(t *testing.T) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Mar 26 01:02:50 UTC 2025
    - 11.9K bytes
    - Viewed (0)
  3. internal/lru/lru.go

    }
    
    // Init initializes or clears list l.
    func (l *LruList[K, V]) Init() *LruList[K, V] {
    	l.root.next = &l.root
    	l.root.prev = &l.root
    	l.len = 0
    	return l
    }
    
    // NewList returns an initialized list.
    func NewList[K comparable, V any]() *LruList[K, V] { return new(LruList[K, V]).Init() }
    
    // Length returns the number of elements of list l.
    // The complexity is O(1).
    func (l *LruList[K, V]) Length() int { return l.len }
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Fri Apr 25 08:22:26 UTC 2025
    - 12.5K bytes
    - Viewed (0)
  4. cmd/utils.go

    )
    
    // isMaxObjectSize - verify if max object size
    func isMaxObjectSize(size int64) bool {
    	return size > globalMaxObjectSize
    }
    
    // Check if part size is more than or equal to minimum allowed size.
    func isMinAllowedPartSize(size int64) bool {
    	return size >= globalMinPartSize
    }
    
    // isMaxPartNumber - Check if part ID is greater than the maximum allowed ID.
    func isMaxPartID(partID int) bool {
    	return partID > globalMaxPartID
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 33K bytes
    - Viewed (0)
  5. cmd/bucket-replication-utils.go

    }
    
    // Empty returns true if no targets with resync decision present
    func (r ResyncDecision) Empty() bool {
    	return r.targets == nil
    }
    
    func (r ResyncDecision) mustResync() bool {
    	for _, v := range r.targets {
    		if v.Replicate {
    			return true
    		}
    	}
    	return false
    }
    
    func (r ResyncDecision) mustResyncTarget(tgtArn string) bool {
    	if r.targets == nil {
    		return false
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 26K bytes
    - Viewed (0)
  6. cmd/xl-storage-errors.go

    	"errors"
    	"os"
    	"runtime"
    	"syscall"
    )
    
    // No space left on device error
    func isSysErrNoSpace(err error) bool {
    	return errors.Is(err, syscall.ENOSPC)
    }
    
    // Invalid argument, unsupported flags such as O_DIRECT
    func isSysErrInvalidArg(err error) bool {
    	return errors.Is(err, syscall.EINVAL)
    }
    
    // Input/output error
    func isSysErrIO(err error) bool {
    	return errors.Is(err, syscall.EIO)
    }
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Mar 06 16:56:29 UTC 2023
    - 3.8K bytes
    - Viewed (0)
  7. cmd/untar.go

    	r  io.Reader
    	mu sync.Mutex
    }
    
    func (d *disconnectReader) Read(p []byte) (n int, err error) {
    	d.mu.Lock()
    	defer d.mu.Unlock()
    	if d.r != nil {
    		return d.r.Read(p)
    	}
    	return 0, errors.New("reader closed")
    }
    
    func (d *disconnectReader) Close() error {
    	d.mu.Lock()
    	d.r = nil
    	d.mu.Unlock()
    	return nil
    }
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Feb 18 16:25:55 UTC 2025
    - 6K bytes
    - Viewed (2)
  8. src/cmd/asm/internal/lex/stack.go

    		tok = s.Next()
    	}
    	return tok
    }
    
    func (s *Stack) Text() string {
    	return s.tr[len(s.tr)-1].Text()
    }
    
    func (s *Stack) File() string {
    	return s.Base().Filename()
    }
    
    func (s *Stack) Base() *src.PosBase {
    	return s.tr[len(s.tr)-1].Base()
    }
    
    func (s *Stack) SetBase(base *src.PosBase) {
    	s.tr[len(s.tr)-1].SetBase(base)
    }
    
    func (s *Stack) Line() int {
    	return s.tr[len(s.tr)-1].Line()
    }
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jan 09 22:33:23 UTC 2017
    - 1.2K bytes
    - Viewed (0)
  9. cmd/callhome.go

    )
    
    var callhomeLeaderLockTimeout = newDynamicTimeout(30*time.Second, 10*time.Second)
    
    // initCallhome will start the callhome task in the background.
    func initCallhome(ctx context.Context, objAPI ObjectLayer) {
    	if !globalCallhomeConfig.Enabled() {
    		return
    	}
    
    	go func() {
    		r := rand.New(rand.NewSource(time.Now().UnixNano()))
    		// Leader node (that successfully acquires the lock inside runCallhome)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  10. src/bufio/scan_test.go

    type endlessZeros struct{}
    
    func (endlessZeros) Read(p []byte) (int, error) {
    	return 0, nil
    }
    
    func TestBadReader(t *testing.T) {
    	scanner := NewScanner(endlessZeros{})
    	for scanner.Scan() {
    		t.Fatal("read should fail")
    	}
    	err := scanner.Err()
    	if err != io.ErrNoProgress {
    		t.Errorf("unexpected error: %v", err)
    	}
    }
    
    func TestScanWordsExcessiveWhiteSpace(t *testing.T) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Sep 22 16:22:42 UTC 2023
    - 14.3K bytes
    - Viewed (0)
Back to top