Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 241 - 250 of 802 for Adding (0.05 seconds)

  1. guava/src/com/google/common/collect/ImmutableRangeSet.java

       */
      public static class Builder<C extends Comparable<?>> {
        private final List<Range<C>> ranges;
    
        public Builder() {
          this.ranges = new ArrayList<>();
        }
    
        // TODO(lowasser): consider adding union, in addition to add, that does allow overlap
    
        /**
         * Add the specified range to this builder. Adjacent ranges are permitted and will be merged,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:45:58 GMT 2026
    - 27.4K bytes
    - Click Count (0)
  2. tensorflow/c/c_api_experimental.cc

        // Make a copy so that we can mutate it.
        FunctionDef fdef_to_load = fdef;
        if (mutate_proto_func) {
          (*mutate_proto_func)(&fdef_to_load);
        }
        VLOG(1) << "Adding func to graph: " << fdef_to_load.DebugString();
        std::vector<char> binary_proto_buf(fdef_to_load.ByteSizeLong());
        fdef_to_load.SerializeToArray(binary_proto_buf.data(),
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 04 05:55:32 GMT 2025
    - 29.4K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/math/StatsAccumulatorTest.java

        assertThat(manyValuesAccumulatorByAddAllStats.min()).isEqualTo(MANY_VALUES_MIN);
        assertThat(manyValuesAccumulatorByAddAllStatsAccumulator.min()).isEqualTo(MANY_VALUES_MIN);
        // For datasets of many double values created by adding elements individually, we test many
        // combinations of finite and non-finite values:
        for (ManyValues values : ALL_MANY_VALUES) {
          StatsAccumulator accumulator = new StatsAccumulator();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 37.1K bytes
    - Click Count (0)
  4. docs/en/docs/help-fastapi.md

    ## Star **FastAPI** in GitHub { #star-fastapi-in-github }
    
    You can "star" FastAPI in GitHub (clicking the star button at the top right): [https://github.com/fastapi/fastapi](https://github.com/fastapi/fastapi). ⭐️
    
    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 }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/collect/AbstractMapBasedMultimap.java

     * replace an existing pair with the same key and value, if such a pair is present. With collections
     * like {@link List} that allow duplicates, the collection will keep the existing key-value pairs
     * while adding a new pair.
     *
     * <p>This class is not threadsafe when any concurrent operations update the multimap, even if the
     * underlying map and {@link #createCollection()} method return threadsafe classes. Concurrent read
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Aug 12 15:51:57 GMT 2025
    - 46.9K bytes
    - Click Count (0)
  6. CHANGELOG/CHANGELOG-1.22.md

    ### Container Images
    
    All container images are available as manifest lists and support the described
    architectures. It is also possible to pull a specific architecture directly by
    adding the "-$ARCH" suffix  to the container image name.
    
    name | architectures
    ---- | -------------
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Tue Dec 13 12:43:45 GMT 2022
    - 454.1K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/ConcurrentHashMultiset.java

                  return oldValue;
                }
              } catch (ArithmeticException overflow) {
                throw new IllegalArgumentException(
                    "Overflow adding " + occurrences + " occurrences to a count of " + oldValue);
              }
            } else {
              // In the case of a concurrent remove, we might observe a zero value, which means another
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 22.3K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/graph/Graphs.java

            return traverser.breadthFirst(graph.successors(node));
        }
        throw new IllegalArgumentException("Unrecognized strategy: " + strategy);
      }
    
      /**
       * A strategy for adding self-loops to {@linkplain #transitiveClosure(Graph,
       * TransitiveClosureSelfLoopStrategy) the transitive closure graph}. All strategies preserve
       * self-loops that are present in the original graph.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 24.4K bytes
    - Click Count (0)
  9. CHANGELOG/CHANGELOG-1.9.md

    * Fix a scalability issue where high rates of event writes degraded etcd performance. ([#64539](https://github.com/kubernetes/kubernetes/pull/64539), [@ccding](https://github.com/ccding))
    * Properly manage security groups for loadbalancer services on OpenStack. ([#65373](https://github.com/kubernetes/kubernetes/pull/65373), [@multi-io](https://github.com/multi-io))
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Tue Nov 16 10:46:27 GMT 2021
    - 313.7K bytes
    - Click Count (0)
  10. docs/smb3-features/04-directory-leasing-design.md

    ```java
    @Test
    public void testDirectoryCacheEntry() {
        DirectoryCacheEntry entry = new DirectoryCacheEntry(
            "/test/dir", new Smb2LeaseKey(), DirectoryCacheScope.IMMEDIATE_CHILDREN);
        
        // Test adding children
        SmbFileAttributes attrs = createMockAttributes("file1.txt", 1000, false);
        entry.updateChild("file1.txt", attrs);
        
        assertTrue(entry.hasChild("file1.txt"));
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 02:53:50 GMT 2025
    - 36.2K bytes
    - Click Count (0)
Back to Top