Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 121 - 130 of 212 for gosave (0.06 seconds)

  1. okhttp/src/jvmTest/kotlin/okhttp3/SocksProxy.kt

        )
    
      fun connectionCount(): Int = connectionCount.get()
    
      fun shutdown() {
        serverSocket!!.close()
        executor.shutdown()
        if (!executor.awaitTermination(5, TimeUnit.SECONDS)) {
          throw IOException("Gave up waiting for executor to shut down")
        }
      }
    
      private fun service(from: Socket) {
        val name = "SocksProxy ${from.remoteSocketAddress}"
        threadName(name) {
          try {
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Mon May 05 16:01:00 GMT 2025
    - 7.6K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/collect/MultimapBuilder.java

       *
       * <p>The collections returned by {@link Multimap#keySet()}, {@link Multimap#keys()}, and {@link
       * Multimap#asMap()} will iterate through the keys in the order that they were first added to the
       * multimap, save that if all values associated with a key are removed and then the key is added
       * back into the multimap, that key will come last in the key iteration order.
       */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 18K bytes
    - Click Count (0)
  3. cmd/bucket-replication.go

    	// For each bucket name, store the last timestamp of the
    	// successful save of replication status in the backend disks.
    	lastResyncStatusSave := make(map[string]time.Time)
    
    	for {
    		select {
    		case <-resyncTimer.C:
    			s.RLock()
    			for bucket, brs := range s.statusMap {
    				var updt bool
    				// Save the replication status if one resync to any bucket target is still not finished
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 118.2K bytes
    - Click Count (0)
  4. cmd/site-replication.go

    	}
    
    	// we can now save the cluster replication configuration state.
    	if err = c.saveToDisk(ctx, state); err != nil {
    		return madmin.ReplicateEditStatus{
    			Status:    madmin.ReplicateAddStatusPartial,
    			ErrDetail: fmt.Sprintf("unable to save cluster-replication state on local: %v", err),
    		}, nil
    	}
    
    	if peer.DeploymentID != "" {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 184.8K bytes
    - Click Count (1)
  5. android/guava/src/com/google/common/util/concurrent/InterruptibleTask.java

            blocker = (Blocker) state;
          }
          spinCount++;
          if (spinCount > MAX_BUSY_WAIT_SPINS) {
            /*
             * If we have spun a lot, just park ourselves. This will save CPU while we wait for a slow
             * interrupting thread. In theory, interruptTask() should be very fast, but due to
             * InterruptibleChannel and JavaLangAccess.blockedOn(Thread, Interruptible), it isn't
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 10K bytes
    - Click Count (0)
  6. doc/asm.html

    </p>
    
    <pre>
    get_tls(CX)
    MOVQ	g(CX), AX     // Move g into AX.
    MOVQ	g_m(AX), BX   // Move g.m into BX.
    </pre>
    
    <p>
    Register <code>BP</code> is callee-save.
    The assembler automatically inserts <code>BP</code> save/restore when frame size is larger than zero.
    Using <code>BP</code> as a general purpose register is allowed,
    however it can interfere with sampling-based profiling.
    </p>
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Nov 14 19:09:46 GMT 2025
    - 36.5K bytes
    - Click Count (0)
  7. cmd/mrf.go

    	m.wg.Add(1)
    	defer m.wg.Done()
    
    	if atomic.LoadInt32(&m.closing) == 1 {
    		return
    	}
    
    	select {
    	case m.opCh <- op:
    	default:
    	}
    }
    
    // Do not accept new MRF operations anymore and start to save
    // the current heal status in one available disk
    func (m *mrfState) shutdown() {
    	atomic.StoreInt32(&m.closing, 1)
    	m.wg.Wait()
    	close(m.opCh)
    	atomic.StoreInt32(&m.closed, 1)
    
    	if len(m.opCh) > 0 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue May 27 15:19:03 GMT 2025
    - 6.5K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java

         * the lock to check again. Since an IDLE state was observed inside the preceding synchronized
         * block, and reference field assignment is atomic, this may save reacquiring the lock when
         * another thread or the worker task has cleared the count and set the state.
         *
         * <p>When {@link #executor} is a directExecutor(), the value written to
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 10.6K bytes
    - Click Count (0)
  9. guava/src/com/google/common/util/concurrent/SequentialExecutor.java

         * the lock to check again. Since an IDLE state was observed inside the preceding synchronized
         * block, and reference field assignment is atomic, this may save reacquiring the lock when
         * another thread or the worker task has cleared the count and set the state.
         *
         * <p>When {@link #executor} is a directExecutor(), the value written to
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 10.6K bytes
    - Click Count (0)
  10. CONTRIBUTING.md

    This can save everyone a lot of time and frustration.
    
    For any non-trivial change, we need to be able to answer these questions:
    
    * Why is this change done? What's the use case?
    * For user-facing features, what will the API look like?
    * What test cases should it have? What could go wrong?
    * How will it roughly be implemented? We'll happily provide code pointers to save you time.
    
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Tue Nov 25 06:57:22 GMT 2025
    - 19K bytes
    - Click Count (0)
Back to Top