Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 111 - 120 of 3,236 for Hall (0.02 seconds)

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

     * value and the old value.
     *
     * <p>Keys and values may be null. All optional multimap methods are supported, and all returned
     * views are modifiable.
     *
     * <p>The lists returned by {@link #get}, {@link #removeAll}, and {@link #replaceValues} all
     * implement {@link java.util.RandomAccess}.
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 05 23:15:58 GMT 2025
    - 6.8K bytes
    - Click Count (0)
  2. tensorflow/c/c_api_internal.h

      tensorflow::mutex mu TF_ACQUIRED_AFTER(TF_Graph::mu);
      int last_num_graph_nodes;
    
      // If true, TF_SessionRun and similar methods will call
      // ExtendSessionGraphHelper before running the graph (this is the default
      // public behavior). Can be set to false if the caller needs to call
      // ExtendSessionGraphHelper manually.
      std::atomic<bool> extend_before_run;
    };
    
    struct TF_ImportGraphDefOptions {
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 7.5K bytes
    - Click Count (0)
  3. internal/logger/audit.go

    		reqInfo := GetReqInfo(ctx)
    		if reqInfo == nil {
    			return
    		}
    		reqInfo.RLock()
    		defer reqInfo.RUnlock()
    
    		entry = internalAudit.ToEntry(w, r, reqClaims, xhttp.GlobalDeploymentID)
    		// indicates all requests for this API call are inbound
    		entry.Trigger = "incoming"
    
    		for _, filterKey := range filterKeys {
    			delete(entry.ReqClaims, filterKey)
    			delete(entry.ReqQuery, filterKey)
    			delete(entry.ReqHeader, filterKey)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 4.6K bytes
    - Click Count (0)
  4. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RoutePlanner.kt

     * will prefer pooled connections. Only pooled HTTP/2 connections are used for such de-duplication.
     *
     * It is possible to cancel the finding process by canceling its call.
     *
     * Implementations of this interface are not thread-safe. Each instance is thread-confined to the
     * thread executing the call.
     */
    interface RoutePlanner {
      val address: Address
    
      /** Follow-ups for failed plans and plans that lost a race. */
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue May 27 14:58:02 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  5. docs/en/docs/tutorial/dependencies/index.md

    Actually, all (or most) of the web frameworks work in this same way.
    
    You never call those functions directly. They are called by your framework (in this case, **FastAPI**).
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 9.5K bytes
    - Click Count (0)
  6. okhttp/src/jvmTest/kotlin/okhttp3/CallTest.kt

        val request = Request(server.url("/a"))
        val call = client.newCall(request)
        call.enqueue(
          object : Callback {
            override fun onFailure(
              call: Call,
              e: IOException,
            ) {
              failureRef.set(true)
              latch.countDown()
            }
    
            override fun onResponse(
              call: Call,
              response: Response,
            ) {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:02:18 GMT 2026
    - 146.5K bytes
    - Click Count (0)
  7. guava/src/com/google/common/cache/LoadingCache.java

       *
       * <p>If another call to {@link #get} or {@link #getUnchecked} is currently loading the value for
       * {@code key}, simply waits for that thread to finish and returns its loaded value. Note that
       * multiple threads can concurrently load values for distinct keys.
       *
       * <p>Caches loaded by a {@link CacheLoader} will call {@link CacheLoader#load} to load new values
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 12:40:22 GMT 2026
    - 8.5K bytes
    - Click Count (0)
  8. src/main/java/org/codelibs/fess/opensearch/user/bsbhv/BsUserBhv.java

        public int[] batchInsert(List<User> list, RequestOptionCall<BulkRequestBuilder> call) {
            return batchInsert(list, call, null);
        }
    
        public int[] batchInsert(List<User> list, RequestOptionCall<BulkRequestBuilder> call,
                RequestOptionCall<IndexRequestBuilder> entityCall) {
            return doBatchInsert(new BulkList<>(list, call, entityCall), null);
        }
    
        public int[] batchUpdate(List<User> list) {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 15 06:53:53 GMT 2025
    - 12K bytes
    - Click Count (0)
  9. samples/guide/src/main/java/okhttp3/recipes/kt/WiresharkExample.kt

          } else {
            null
          }
        }
    
        override fun secureConnectStart(call: Call) {
          // Register to capture "Produced ClientHello handshake message".
          currentThread = Thread.currentThread()
          logger.addHandler(loggerHandler)
        }
    
        override fun secureConnectEnd(
          call: Call,
          handshake: Handshake?,
        ) {
          logger.removeHandler(loggerHandler)
        }
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 10.9K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/Sets.java

        }
      }
    
      /**
       * Returns an unmodifiable <b>view</b> of the union of two sets. The returned set contains all
       * elements that are contained in either backing set. Iterating over the returned set iterates
       * first over all the elements of {@code set1}, then over each element of {@code set2}, in order,
       * that is not contained in {@code set1}.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 81.4K bytes
    - Click Count (0)
Back to Top