Search Options

Results per page
Sort
Preferred Languages
Advance

Results 251 - 260 of 396 for Forking (0.05 sec)

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

     * k). In benchmarks, this implementation performs at least as well as either implementation, and
     * degrades more gracefully for worst-case input.
     *
     * <p>The implementation does not necessarily use a <i>stable</i> sorting algorithm; when multiple
     * equivalent elements are added to it, it is undefined which will come first in the output.
     *
     * @author Louis Wasserman
     */
    @GwtCompatible
    @ElementTypesAreNonnullByDefault
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  2. cmd/data-usage-cache.go

    }
    
    // load the cache content with name from minioMetaBackgroundOpsBucket.
    // Only backend errors are returned as errors.
    // The loader is optimistic and has no locking, but tries 5 times before giving up.
    // If the object is not found, a nil error with empty data usage cache is returned.
    func (d *dataUsageCache) load(ctx context.Context, store objectIO, name string) error {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 34.7K bytes
    - Viewed (0)
  3. doc/godebug.md

    (discussed below).
    
    When preparing any change that is permitted by Go 1 compatibility
    but may nonetheless break some existing programs,
    we first engineer the change to keep as many existing programs working as possible.
    For the remaining programs,
    we define a new GODEBUG setting that
    allows individual programs to opt back in to the old behavior.
    A GODEBUG setting may not be added if doing so is infeasible,
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Oct 28 14:46:33 UTC 2024
    - 17.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/CompactHashSet.java

     * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
     * every element added, the garbage collector will have to traverse {@code 1.5} references on
     * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.
     *
     * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion
     * order. Any removal invalidates any ordering guarantees.
     *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24K bytes
    - Viewed (0)
  5. compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/VersionRange.java

                    }
                }
                return buf.toString();
            }
        }
    
        public ArtifactVersion matchVersion(List<ArtifactVersion> versions) {
            // TODO could be more efficient by sorting the list and then moving along the restrictions in order?
    
            ArtifactVersion matched = null;
            for (ArtifactVersion version : versions) {
                if (containsVersion(version)) {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 19K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/ImmutableMap.java

        return RegularImmutableMap.create(
            10,
            new Object[] {
              k1, v1, k2, v2, k3, v3, k4, v4, k5, v5, k6, v6, k7, v7, k8, v8, k9, v9, k10, v10
            });
      }
    
      // looking for of() with > 10 entries? Use the builder or ofEntries instead.
    
      /**
       * Returns an immutable map containing the given entries, in order.
       *
       * @throws IllegalArgumentException if duplicate keys are provided
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 41.5K bytes
    - Viewed (0)
  7. src/bufio/scan.go

    	start := 0
    	for width := 0; start < len(data); start += width {
    		var r rune
    		r, width = utf8.DecodeRune(data[start:])
    		if !isSpace(r) {
    			break
    		}
    	}
    	// Scan until space, marking end of word.
    	for width, i := 0, start; i < len(data); i += width {
    		var r rune
    		r, width = utf8.DecodeRune(data[i:])
    		if isSpace(r) {
    			return i + width, data[start:i], nil
    		}
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Oct 23 09:06:30 UTC 2023
    - 14.2K bytes
    - Viewed (0)
  8. impl/maven-core/src/main/java/org/apache/maven/DefaultMaven.java

        //
        // 3) Create RepositorySystemSession.
        //
        // 4) Create MavenSession.
        //
        // 5) Execute AbstractLifecycleParticipant.afterSessionStart(session)
        //
        // 6) Get reactor projects looking for general POM errors
        //
        // 7) Create ProjectDependencyGraph using trimming which takes into account --projects and reactor mode.
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 27.5K bytes
    - Viewed (1)
  9. guava/src/com/google/common/collect/ImmutableList.java

          default:
            return construct(elements.clone());
        }
      }
    
      /**
       * Returns an immutable list containing the given elements, sorted according to their natural
       * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the
       * order in which they appear in the input.
       *
       * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Aug 16 19:14:45 UTC 2024
    - 30.5K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/math/Quantiles.java

       */
      private static void selectInPlace(int required, double[] array, int from, int to) {
        // If we are looking for the least element in the range, we can just do a linear search for it.
        // (We will hit this whenever we are doing quantile interpolation: our first selection finds
        // the lower value, our second one finds the upper value by looking for the next least element.)
        if (required == from) {
          int min = from;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 29.9K bytes
    - Viewed (0)
Back to top