Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 355 for Decrement (0.4 sec)

  1. pkg/controller/replicaset/replica_set_test.go

    	pod.DeletionTimestamp = &metav1.Time{Time: time.Now()}
    	pod.ResourceVersion = "1"
    	manager.expectations.ExpectDeletions(logger, rsKey, []string{controller.PodKey(&pod)})
    
    	// A pod added with a deletion timestamp should decrement deletions, not creations.
    	manager.addPod(logger, &pod)
    
    	queueRS, _ := manager.queue.Get()
    	if queueRS != rsKey {
    		t.Fatalf("Expected to find key %v in queue, found %v", rsKey, queueRS)
    	}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 69.2K bytes
    - Viewed (0)
  2. tensorflow/compiler/jit/mark_for_compilation_pass.cc

        // stable from run to rum.
        bool deterministic_cluster_names;
    
        int max_cluster_size;
        int min_cluster_size;
    
        // Compiler fuel for the auto-clustering algorithm.
        //
        // We decrement this value by one on every time we choose a compilation
        // candidate and we stop clustering when it hits zero.  This means the
        // initial value for this variable (via --tf_xla_clustering_fuel=N)
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Feb 21 12:19:41 UTC 2024
    - 85.3K bytes
    - Viewed (0)
  3. src/go/parser/parser.go

    	case token.ARROW:
    		// send statement
    		arrow := p.pos
    		p.next()
    		y := p.parseRhs()
    		return &ast.SendStmt{Chan: x[0], Arrow: arrow, Value: y}, false
    
    	case token.INC, token.DEC:
    		// increment or decrement
    		s := &ast.IncDecStmt{X: x[0], TokPos: p.pos, Tok: p.tok}
    		p.next()
    		return s, false
    	}
    
    	// expression
    	return &ast.ExprStmt{X: x[0]}, false
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Dec 08 20:07:50 UTC 2023
    - 72.2K bytes
    - Viewed (0)
  4. src/runtime/proc.go

    				continue
    			}
    			// Drop allpLock so we can take sched.lock.
    			unlock(&allpLock)
    			// Need to decrement number of idle locked M's
    			// (pretending that one more is running) before the CAS.
    			// Otherwise the M from which we retake can exit the syscall,
    			// increment nmidle and report deadlock.
    			incidlelocked(-1)
    			trace := traceAcquire()
    			if atomic.Cas(&pp.status, s, _Pidle) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 207.5K bytes
    - Viewed (0)
  5. src/sync/waitgroup.go

    	if race.Enabled {
    		if delta < 0 {
    			// Synchronize decrements with Wait.
    			race.ReleaseMerge(unsafe.Pointer(wg))
    		}
    		race.Disable()
    		defer race.Enable()
    	}
    	state := wg.state.Add(uint64(delta) << 32)
    	v := int32(state >> 32)
    	w := uint32(state)
    	if race.Enabled && delta > 0 && v == int32(delta) {
    		// The first increment must be synchronized with Wait.
    		// Need to model this as a read, because there can be
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 21:14:51 UTC 2024
    - 4K bytes
    - Viewed (0)
  6. src/net/http/transport.go

    		} else {
    			// q is a value (like a slice), so we have to store
    			// the updated q back into the map.
    			t.connsPerHostWait[key] = q
    		}
    		if done {
    			return
    		}
    	}
    
    	// Otherwise, decrement the recorded count.
    	if n--; n == 0 {
    		delete(t.connsPerHost, key)
    	} else {
    		t.connsPerHost[key] = n
    	}
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jun 06 21:59:21 UTC 2024
    - 91K bytes
    - Viewed (0)
  7. cmd/bucket-replication.go

    	if dobj.VersionID != "" {
    		prevStatus = replication.StatusType(dobj.VersionPurgeStatus())
    		replicationStatus = replication.StatusType(rinfos.VersionPurgeStatus())
    	}
    
    	// to decrement pending count later.
    	for _, rinfo := range rinfos.Targets {
    		if rinfo.ReplicationStatus != rinfo.PrevReplicationStatus {
    			globalReplicationStats.Update(dobj.Bucket, rinfo, replicationStatus,
    				prevStatus)
    		}
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu Jun 13 06:56:12 UTC 2024
    - 114.4K bytes
    - Viewed (0)
  8. src/database/sql/sql.go

    		fn()
    	}
    	dc.onPut = nil
    
    	if errors.Is(err, driver.ErrBadConn) {
    		// Don't reuse bad connections.
    		// Since the conn is considered bad and is being discarded, treat it
    		// as closed. Don't decrement the open count here, finalClose will
    		// take care of that.
    		db.maybeOpenNewConnections()
    		db.mu.Unlock()
    		dc.Close()
    		return
    	}
    	if putConnHook != nil {
    		putConnHook(db, dc)
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:16:53 UTC 2024
    - 103.6K bytes
    - Viewed (0)
  9. test/loopbce.go

    		x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
    	}
    	return x
    }
    
    func f4(a [10]int) int {
    	x := 0
    	for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,8\], increment 2$"
    		x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
    	}
    	return x
    }
    
    func f5(a [10]int) int {
    	x := 0
    	for i := -10; i < len(a); i += 2 { // ERROR "Induction variable: limits \[-10,8\], increment 2$"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:25 UTC 2023
    - 13.8K bytes
    - Viewed (0)
  10. src/crypto/aes/gcm_amd64.s

    		PCLMULQDQ $0x11, T0, ACC1
    
    		combinedRound(1)
    		increment(0)
    		combinedRound(2)
    		increment(1)
    		combinedRound(3)
    		increment(2)
    		combinedRound(4)
    		increment(3)
    		combinedRound(5)
    		increment(4)
    		combinedRound(6)
    		increment(5)
    		combinedRound(7)
    		increment(6)
    
    		aesRound(8)
    		increment(7)
    
    		PXOR ACC0, ACCM
    		PXOR ACC1, ACCM
    		MOVOU ACCM, T0
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:29:44 UTC 2024
    - 23.4K bytes
    - Viewed (0)
Back to top