Search Options

Results per page
Sort
Preferred Languages
Advance

Results 171 - 180 of 566 for lookUp (0.11 sec)

  1. docs/en/docs/tutorial/first-steps.md

    #### Check the `openapi.json` { #check-the-openapi-json }
    
    If you are curious about how the raw OpenAPI schema looks like, FastAPI automatically generates a JSON (schema) with the descriptions of all your API.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 11K bytes
    - Viewed (0)
  2. src/test/java/jcifs/smb1/util/MimeMapTest.java

        @Nested
        @DisplayName("Performance and concurrency")
        class PerformanceTests {
    
            @Test
            @DisplayName("Should handle multiple lookups efficiently")
            void testMultipleLookups() throws IOException {
                // Test that multiple lookups work correctly
                for (int i = 0; i < 100; i++) {
                    assertEquals("application/pdf", mimeMap.getMimeType("pdf"));
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 9.1K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

            }
          }
          return true;
        }
      },
      /**
       * This strategy uses all 128 bits of {@link Hashing#murmur3_128} when hashing. It looks different
       * from the implementation in MURMUR128_MITZ_32 because we're avoiding the multiplication in the
       * loop and doing a (much simpler) += hash2. We're also changing the index to a positive number by
       * AND'ing with Long.MAX_VALUE instead of flipping the bits.
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 10.6K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/util/concurrent/AggregateFuture.java

          // Note that if all the futures on the list are done prior to completing this loop, the last
          // call to addListener() will callback to setOneValue(), transitively call our cleanup
          // listener, and set this.futures to null.
          // This is not actually a problem, since the foreach only needs this.futures to be non-null
          // at the beginning of the loop.
          int i = 0;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 16K bytes
    - Viewed (0)
  5. .github/bot_config.yml

    # words checklist
    segfault_memory:
       - segfault
       - memory leaks
    # assignees
    filesystem_security_assignee:
       - mihaimaruseac
       
    # Cuda Comment
    cuda_comment: >
       From the template it looks like you are installing **TensorFlow** (TF) prebuilt binaries:
          * For TF-GPU - See point 1
          * For TF-CPU - See point 2
       -----------------------------------------------------------------------------------------------
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Jun 30 16:38:59 UTC 2025
    - 4K bytes
    - Viewed (0)
  6. docs/en/docs/advanced/openapi-callbacks.md

    This code won't be executed in your app, we only need it to *document* how that *external API* should look like.
    
    But, you already know how to easily create automatic documentation for an API with **FastAPI**.
    
    So we are going to use that same knowledge to document how the *external API* should look like... by creating the *path operation(s)* that the external API should implement (the ones your API will call).
    
    /// tip
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  7. ci/official/utilities/code_check_full.bats

    setup_file() {
        bazel version  # Start the bazel server
    }
    
    # Do a bazel query specifically for the licenses checker. It searches for
    # targets matching the provided query, which start with // or @ but not
    # //tensorflow (so it looks for //third_party, //external, etc.), and then
    # gathers the list of all packages (i.e. directories) which contain those
    # targets.
    license_query() {
     bazel cquery --experimental_cc_shared_library "$1" --keep_going \
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Wed Aug 06 20:43:08 UTC 2025
    - 13.4K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/HashBasedTable.java

     * iterators that don't support {@code remove()}. Otherwise, all optional operations are supported.
     * Null row keys, columns keys, and values are not supported.
     *
     * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in
     * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/HashBasedTable.java

     * iterators that don't support {@code remove()}. Otherwise, all optional operations are supported.
     * Null row keys, columns keys, and values are not supported.
     *
     * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in
     * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/CompactHashMap.java

      }
    
      /**
       * Updates the index an iterator is pointing to after a call to remove: returns the index of the
       * entry that should be looked at after a removal on indexRemoved, with indexBeforeRemove as the
       * index that *was* the next entry that would be looked at.
       */
      int adjustAfterRemove(int indexBeforeRemove, @SuppressWarnings("unused") int indexRemoved) {
        return indexBeforeRemove - 1;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 35.7K bytes
    - Viewed (0)
Back to top