Search Options

Results per page
Sort
Preferred Languages
Advance

Results 461 - 470 of 643 for setEnd (0.17 sec)

  1. android/guava/src/com/google/common/collect/HashBiMap.java

            return key;
          }
          biMap.replaceKeyInEntry(index, key, false);
          return oldKey;
        }
      }
    
      /**
       * @serialData the number of entries, first key, first value, second key, second value, and so on.
       */
      @GwtIncompatible // java.io.ObjectOutputStream
      @J2ktIncompatible
      private void writeObject(ObjectOutputStream stream) throws IOException {
        stream.defaultWriteObject();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Mar 06 16:06:58 UTC 2023
    - 36.4K bytes
    - Viewed (0)
  2. guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

       *
       * <pre>{@code
       * enum MyLockOrder {
       *   FIRST, SECOND, THIRD;
       * }
       *
       * CycleDetectingLockFactory.WithExplicitOrdering<MyLockOrder> factory =
       *   CycleDetectingLockFactory.newInstanceWithExplicitOrdering(Policies.THROW);
       *
       * Lock lock1 = factory.newReentrantLock(MyLockOrder.FIRST);
       * Lock lock2 = factory.newReentrantLock(MyLockOrder.SECOND);
       * Lock lock3 = factory.newReentrantLock(MyLockOrder.THIRD);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Dec 15 19:31:54 UTC 2023
    - 35.9K bytes
    - Viewed (0)
  3. cmd/format-erasure.go

    		This    string `json:"this"`    // This field carries assigned disk uuid.
    		// Sets field carries the input disk order generated the first
    		// time when fresh disks were supplied, it is a two dimensional
    		// array second dimension represents list of disks used per set.
    		Sets [][]string `json:"sets"`
    		// Distribution algorithm represents the hashing algorithm
    		// to pick the right set index for an object.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 23.2K bytes
    - Viewed (0)
  4. okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt

              }
            }
          if (!acquired) continue
    
          // Confirm the connection is healthy and return it.
          if (connection.isHealthy(doExtensiveHealthChecks)) return connection
    
          // In the second synchronized block, release the unhealthy acquired connection. We're also on
          // the hook to close this connection if it's no longer in use.
          val noNewExchangesEvent: Boolean
          val toClose: Socket? =
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Apr 20 17:03:43 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  5. src/main/java/jcifs/netbios/NbtAddress.java

         * be retrieved with the Node Status request.
         * 
         * The degree of state that an NbtAddress has is dependant on how it was
         * created and what is required of it. The second degree of state is the
         * most common. This is the state information that would be retrieved from
         * WINS for example. Natrually it is not practical for every NbtAddress
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 15.2K bytes
    - Viewed (0)
  6. cmd/admin-handlers_test.go

    	globalBootTime = UTCNow()
    
    	globalEndpoints = mustGetPoolEndpoints(0, erasureDirs...)
    
    	initAllSubsystems(ctx)
    
    	initConfigSubsystem(ctx, objLayer)
    
    	globalIAMSys.Init(ctx, objLayer, globalEtcdClient, 2*time.Second)
    
    	// Setup admin mgmt REST API handlers.
    	adminRouter := mux.NewRouter()
    	registerAdminRouter(adminRouter, true)
    
    	return &adminErasureTestBed{
    		erasureDirs: erasureDirs,
    		objLayer:    objLayer,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jul 24 10:24:01 UTC 2024
    - 13.9K bytes
    - Viewed (0)
  7. internal/logger/config.go

    		httpTimeoutCfgVal := getCfgVal(EnvAuditWebhookHTTPTimeout, k, kv.Get(httpTimeout))
    		httpTimeout, err := time.ParseDuration(httpTimeoutCfgVal)
    		if err != nil {
    			return cfg, err
    		}
    		if httpTimeout < time.Second {
    			return cfg, fmt.Errorf("minimum value allowed for http_timeout is '1s': %s", httpTimeout)
    		}
    
    		cfg.AuditWebhook[k] = http.Config{
    			HTTPTimeout: httpTimeout,
    			Enabled:     true,
    			Endpoint:    url,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 20 16:02:50 UTC 2024
    - 18.3K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/Multisets.java

      }
    
      /**
       * Returns an unmodifiable view of the difference of two multisets. In the returned multiset, the
       * count of each element is the result of the <i>zero-truncated subtraction</i> of its count in
       * the second multiset from its count in the first multiset, with elements that would have a count
       * of 0 not included. The iteration order of the returned multiset matches that of the element set
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 41.7K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/primitives/Ints.java

       * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use the
       * equivalent {@link Integer#compare} method instead.
       *
       * @param a the first {@code int} to compare
       * @param b the second {@code int} to compare
       * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is
       *     greater than {@code b}; or zero if they are equal
       */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 31K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/Multisets.java

      }
    
      /**
       * Returns an unmodifiable view of the difference of two multisets. In the returned multiset, the
       * count of each element is the result of the <i>zero-truncated subtraction</i> of its count in
       * the second multiset from its count in the first multiset, with elements that would have a count
       * of 0 not included. The iteration order of the returned multiset matches that of the element set
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 41.5K bytes
    - Viewed (0)
Back to top