Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 336 for OK (0.01 sec)

  1. internal/lru/lru.go

    func (c *LRU[K, V]) Contains(key K) (ok bool) {
    	c.mu.Lock()
    	defer c.mu.Unlock()
    	_, ok = c.items[key]
    	return ok
    }
    
    // Peek returns the key value (or undefined if not found) without updating
    // the "recently used"-ness of the key.
    func (c *LRU[K, V]) Peek(key K) (value V, ok bool) {
    	c.mu.Lock()
    	defer c.mu.Unlock()
    	var ent *Entry[K, V]
    	if ent, ok = c.items[key]; ok {
    		// Expired item check
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Fri Apr 25 08:22:26 UTC 2025
    - 12.5K bytes
    - Viewed (0)
  2. cmd/bucket-replication-stats.go

    		r.srUpdate(rs)
    	}
    
    	r.Lock()
    	defer r.Unlock()
    
    	// update bucket replication in-memory stats
    	bs, ok := r.Cache[bucket]
    	if !ok {
    		bs = newBucketReplicationStats()
    		r.Cache[bucket] = bs
    	}
    	b, ok := bs.Stats[ri.Arn]
    	if !ok {
    		b = &BucketReplicationStat{
    			XferRateLrg: newXferStats(),
    			XferRateSml: newXferStats(),
    		}
    		bs.Stats[ri.Arn] = b
    	}
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Feb 18 16:25:55 UTC 2025
    - 13.6K bytes
    - Viewed (0)
  3. src/cmd/asm/internal/asm/parse.go

    // including forms involving multiple registers such as R1:R2.
    func (p *Parser) register(name string, prefix rune) (r1, r2 int16, scale int8, ok bool) {
    	// R1 or R(1) R1:R2 R1,R2 R1+R2, or R1*scale.
    	r1, ok = p.registerReference(name)
    	if !ok {
    		return
    	}
    	if prefix != 0 && prefix != '*' { // *AX is OK.
    		p.errorf("prefix %c not allowed for register: %c%s", prefix, prefix, name)
    	}
    	c := p.peek()
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 14 15:13:11 UTC 2025
    - 37.3K bytes
    - Viewed (0)
  4. schema/constraint_test.go

    		"chk_user_checks_name3": {
    			Name:       "chk_user_checks_name3",
    			Constraint: "name <> 'jinzhu'",
    		},
    	}
    
    	checks := user.ParseCheckConstraints()
    
    	for k, result := range results {
    		v, ok := checks[k]
    		if !ok {
    			t.Errorf("Failed to found check %v from parsed checks %+v", k, checks)
    		}
    
    		for _, name := range []string{"Name", "Constraint"} {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun Feb 04 07:49:19 UTC 2024
    - 2.2K bytes
    - Viewed (0)
  5. cmd/bootstrap-peer-server.go

    	var missing []string
    	var mismatching []string
    	for k, v := range s1.MinioEnv {
    		ev, ok := s2.MinioEnv[k]
    		if !ok {
    			missing = append(missing, k)
    		} else if v != ev {
    			mismatching = append(mismatching, k)
    		}
    	}
    	var extra []string
    	for k := range s2.MinioEnv {
    		_, ok := s1.MinioEnv[k]
    		if !ok {
    			extra = append(extra, k)
    		}
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Oct 01 22:13:18 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  6. cmd/auth-handler.go

    }
    
    // Verify if request has AWS PreSign Version '4'.
    func isRequestPresignedSignatureV4(r *http.Request) bool {
    	_, ok := r.Form[xhttp.AmzCredential]
    	return ok
    }
    
    // Verify request has AWS PreSign Version '2'.
    func isRequestPresignedSignatureV2(r *http.Request) bool {
    	_, ok := r.Form[xhttp.AmzAccessKeyID]
    	return ok
    }
    
    // Verify if request has AWS Post policy Signature Version '4'.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 25.4K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/asm/endtoend_test.go

    	pList := new(obj.Plist)
    	var ok bool
    	testOut = new(strings.Builder) // The assembler writes test output to this buffer.
    	ctxt.Bso = bufio.NewWriter(os.Stdout)
    	ctxt.IsAsm = true
    	defer ctxt.Bso.Flush()
    	failed := false
    	ctxt.DiagFunc = func(format string, args ...interface{}) {
    		failed = true
    		t.Errorf(format, args...)
    	}
    	pList.Firstpc, ok = parser.Parse()
    	if !ok || failed {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Mar 26 01:02:50 UTC 2025
    - 11.9K bytes
    - Viewed (0)
  8. cmd/bitrot_test.go

    		t.Fatal(err)
    	}
    	_, err = writer.Write([]byte("aaaaaaaaaa"))
    	if err != nil {
    		t.Fatal(err)
    	}
    	_, err = writer.Write([]byte("aaaaa"))
    	if err != nil {
    		t.Fatal(err)
    	}
    	if bw, ok := writer.(io.Closer); ok {
    		bw.Close()
    	}
    
    	reader := newBitrotReader(disk, nil, volume, filePath, 35, bitrotAlgo, bitrotWriterSum(writer), 10)
    	b := make([]byte, 10)
    	if _, err = reader.ReadAt(b, 0); err != nil {
    		t.Fatal(err)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 09 14:28:39 UTC 2025
    - 2K bytes
    - Viewed (0)
  9. tensorflow/c/c_api_experimental.cc

                    /*noutputs*/ 1,
                    /*targets*/ nullptr, /*ntargets*/ 0,
                    /*run_metadata*/ nullptr, status);
      if (VLOG_IS_ON(1) && status->status.ok()) {
        tensorflow::Tensor tensor;
        if (tensorflow::TF_TensorToTensor(ret, &tensor).ok()) {
          VLOG(1) << "Dequeued tensor content: " << tensor.DebugString();
        }
      }
      return ret;
    }
    
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 03:53:25 UTC 2025
    - 29.5K bytes
    - Viewed (0)
  10. cmd/bucket-replication.go

    	}
    	if disp, ok := lkMap.Lookup(xhttp.ContentDisposition); ok {
    		putOpts.ContentDisposition = disp
    	}
    	if cc, ok := lkMap.Lookup(xhttp.CacheControl); ok {
    		putOpts.CacheControl = cc
    	}
    	if mode, ok := lkMap.Lookup(xhttp.AmzObjectLockMode); ok {
    		rmode := minio.RetentionMode(mode)
    		putOpts.Mode = rmode
    	}
    	if retainDateStr, ok := lkMap.Lookup(xhttp.AmzObjectLockRetainUntilDate); ok {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 118K bytes
    - Viewed (0)
Back to top