Search Options

Results per page
Sort
Preferred Languages
Advance

Results 121 - 130 of 166 for avevate (0.23 sec)

  1. src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tlog.go

    // StoredHashes returns the hashes that must be stored when writing
    // record n with the given data. The hashes should be stored starting
    // at StoredHashIndex(0, n). The result will have at most 1 + logâ‚‚ n hashes,
    // but it will average just under two per call for a sequence of calls for n=1..k.
    //
    // StoredHashes may read up to log n earlier hashes from r
    // in order to compute hashes for completed subtrees.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jul 12 20:38:21 UTC 2023
    - 17.9K bytes
    - Viewed (0)
  2. guava/src/com/google/common/math/Stats.java

    import java.util.stream.DoubleStream;
    import java.util.stream.IntStream;
    import java.util.stream.LongStream;
    import javax.annotation.CheckForNull;
    
    /**
     * A bundle of statistical summary values -- sum, count, mean/average, min and max, and several
     * forms of variance -- that were computed from a single set of zero or more floating-point values.
     *
     * <p>There are two ways to obtain a {@code Stats} instance:
     *
     * <ul>
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 24.7K bytes
    - Viewed (0)
  3. src/net/textproto/reader.go

    	m := make(MIMEHeader, hint)
    
    	// Account for 400 bytes of overhead for the MIMEHeader, plus 200 bytes per entry.
    	// Benchmarking map creation as of go1.20, a one-entry MIMEHeader is 416 bytes and large
    	// MIMEHeaders average about 200 bytes per entry.
    	maxMemory -= 400
    	const mapEntryOverhead = 200
    
    	// The first line cannot start with a leading space.
    	if buf, err := r.R.Peek(1); err == nil && (buf[0] == ' ' || buf[0] == '\t') {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 19:57:43 UTC 2024
    - 22.1K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/primitives/Ints.java

        // twice as many reads and writes. But benchmarking shows that they usually perform better than
        // Dolphin. Reversal is about as good as Successive on average, and it is much simpler,
        // especially since we already have a `reverse` method.
        checkNotNull(array);
        checkPositionIndexes(fromIndex, toIndex, array.length);
        if (array.length <= 1) {
          return;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 29.7K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/ImmutableSet.java

        static final int MAX_RUN_MULTIPLIER = 13;
    
        /**
         * Checks the whole hash table for poor hash distribution. Takes O(n) in the worst case, O(n /
         * log n) on average.
         *
         * <p>The online hash flooding detecting in RegularSetBuilderImpl.add can detect e.g. many
         * exactly matching hash codes, which would cause construction to take O(n^2), but can't detect
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed May 08 03:01:02 UTC 2024
    - 35.3K bytes
    - Viewed (0)
  6. guava/src/com/google/common/primitives/Ints.java

        // twice as many reads and writes. But benchmarking shows that they usually perform better than
        // Dolphin. Reversal is about as good as Successive on average, and it is much simpler,
        // especially since we already have a `reverse` method.
        checkNotNull(array);
        checkPositionIndexes(fromIndex, toIndex, array.length);
        if (array.length <= 1) {
          return;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 29.9K bytes
    - Viewed (0)
  7. src/internal/trace/gc.go

    				if !(flags&UtilPerProc != 0 && l.Label == "GC (dedicated)") {
    					bgMark[ev.Goroutine()] = true
    					ps[ev.Proc()].gc++
    				}
    			}
    		}
    
    		if flags&UtilPerProc == 0 {
    			// Compute the current average utilization.
    			if len(ps) == 0 {
    				continue
    			}
    			gcPs := 0
    			if stw > 0 {
    				gcPs = len(ps)
    			} else {
    				for i := range ps {
    					if ps[i].gc > 0 {
    						gcPs++
    					}
    				}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 26K bytes
    - Viewed (0)
  8. src/main/resources/fess_config.properties

    page.favorite.log.max.fetch.size=100
    page.file.auth.max.fetch.size=100
    page.web.auth.max.fetch.size=100
    page.path.mapping.max.fetch.size=1000
    page.request.header.max.fetch.size=1000
    page.scheduled.job.max.fetch.size=100
    page.elevate.word.max.fetch.size=1000
    page.bad.word.max.fetch.size=1000
    page.dictionary.max.fetch.size=1000
    page.relatedcontent.max.fetch.size=5000
    page.relatedquery.max.fetch.size=5000
    page.thumbnail.queue.max.fetch.size=100
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Apr 11 02:34:53 UTC 2024
    - 30.6K bytes
    - Viewed (0)
  9. src/cmd/vendor/github.com/google/pprof/profile/legacy_profile.go

    // each collected sample by its probability of appearing in the
    // profile. heapz v2 profiles rely on a poisson process to determine
    // which samples to collect, based on the desired average collection
    // rate R. The probability of a sample of size S to appear in that
    // profile is 1-exp(-S/R).
    func scaleHeapSample(count, size, rate int64) (int64, int64) {
    	if count == 0 || size == 0 {
    		return 0, 0
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 22 18:58:12 UTC 2022
    - 32.8K bytes
    - Viewed (0)
  10. src/runtime/syscall_windows_test.go

    		if err != nil {
    			b.Fatalf("running main.exe failed: %v\n%s", err, out)
    		}
    	}
    }
    
    const benchmarkRunningGoProgram = `
    package main
    
    import _ "os" // average Go program will use "os" package, do the same here
    
    func main() {
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Aug 31 16:31:35 UTC 2023
    - 32.5K bytes
    - Viewed (0)
Back to top