Search Options

Results per page
Sort
Preferred Languages
Advance

Results 211 - 220 of 580 for adding (0.04 sec)

  1. docs/en/docs/help-fastapi.md

    You can "star" FastAPI in GitHub (clicking the star button at the top right): <a href="https://github.com/fastapi/fastapi" class="external-link" target="_blank">https://github.com/fastapi/fastapi</a>. ⭐️
    
    By adding a star, other users will be able to find it more easily and see that it has been already useful for others.
    
    ## Watch the GitHub repository for releases { #watch-the-github-repository-for-releases }
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 14K bytes
    - Viewed (0)
  2. guava/src/com/google/common/math/LongMath.java

       * {@code Math.addExact(a, b)} will call the {@link Math#addExact(int, int)} overload, not {@link
       * Math#addExact(long, long)}. Also note that adding two {@code int} values can <b>never</b>
       * overflow a {@code long}, so you can just write {@code (long) a + b}.
       *
       * @throws ArithmeticException if {@code a + b} overflows in signed {@code long} arithmetic
       */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Nov 03 21:01:09 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  3. RELEASE.md

            behavior.
        *   Adding `clear_losses` API to be able to clear losses at the end of
            forward pass in a custom training loop in eager.
        *   Add support for passing list of lists to the `metrics` param in Keras
            `compile`.
        *   Added top-k to precision and recall to keras metrics.
        *   Adding public APIs for `cumsum` and `cumprod` keras backend functions.
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Tue Oct 28 22:27:41 UTC 2025
    - 740.4K bytes
    - Viewed (3)
  4. guava/src/com/google/common/collect/CompactHashSet.java

    /**
     * CompactHashSet is an implementation of a Set. All optional operations (adding and removing) are
     * supported. The elements can be any objects.
     *
     * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
     * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
     * good job of distributing the elements to the buckets to a distribution not far from uniform), and
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 24.7K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/util/concurrent/ServiceManager.java

        for (Service service : copy) {
          service.addListener(new ServiceListener(service, stateReference), directExecutor());
          // We check the state after adding the listener as a way to ensure that our listener was added
          // to a NEW service.
          checkArgument(service.state() == NEW, "Can only manage NEW services, %s", service);
        }
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 22 17:49:12 UTC 2025
    - 33.2K bytes
    - Viewed (1)
  6. guava/src/com/google/common/util/concurrent/ServiceManager.java

        for (Service service : copy) {
          service.addListener(new ServiceListener(service, stateReference), directExecutor());
          // We check the state after adding the listener as a way to ensure that our listener was added
          // to a NEW service.
          checkArgument(service.state() == NEW, "Can only manage NEW services, %s", service);
        }
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 22 17:49:12 UTC 2025
    - 32.9K bytes
    - Viewed (0)
  7. src/archive/tar/reader.go

    // assuming that skipped regions are filled with NULs.
    // This always writes the last byte to ensure w is the right size.
    //
    // TODO(dsnet): Re-export this when adding sparse file support.
    // See https://golang.org/issue/22735
    func (tr *Reader) writeTo(w io.Writer) (int64, error) {
    	if tr.err != nil {
    		return 0, tr.err
    	}
    	n, err := tr.curr.WriteTo(w)
    	if err != nil {
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Oct 07 19:46:36 UTC 2025
    - 26.9K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/graph/Network.java

     * }
     *
     * <p>{@link NetworkBuilder#build()} returns an instance of {@link MutableNetwork}, which is a
     * subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you
     * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on
     * the network), you should use the non-mutating {@link Network} interface, or an {@link
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 07 15:57:03 UTC 2025
    - 17.7K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/util/concurrent/FluentFuture.java

     * }
     *
     * <h3>Alternatives</h3>
     *
     * <h4>Frameworks</h4>
     *
     * <p>When chaining together a graph of asynchronous operations, you will often find it easier to
     * use a framework. Frameworks automate the process, often adding features like monitoring,
     * debugging, and cancellation. Examples of frameworks include:
     *
     * <ul>
     *   <li><a href="https://dagger.dev/producers.html">Dagger Producers</a>
     * </ul>
     *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 19.7K bytes
    - Viewed (0)
  10. cmd/erasure-metadata.go

    	if fi.Metadata == nil {
    		fi.Metadata = make(map[string]string)
    	}
    	fi.Metadata[ReservedMetadataPrefixLower+tierFVMarker] = ""
    }
    
    // SetSkipTierFreeVersion indicates to skip adding a tier free version id.
    // Note: Used only when expiring tiered objects and the remote content has
    // already been scheduled for deletion
    func (fi *FileInfo) SetSkipTierFreeVersion() {
    	if fi.Metadata == nil {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 21.3K bytes
    - Viewed (0)
Back to top