Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 2 of 2 for Knuth (0.02 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. guava/src/com/google/common/math/PairedStatsAccumulator.java

      /** Adds the given pair of values to the dataset. */
      public void add(double x, double y) {
        // We extend the recursive expression for the one-variable case at Art of Computer Programming
        // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i.
        // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 08 18:35:13 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  2. cmd/test-utils_test.go

    		return rand.New(rand.NewSource(time.Now().UnixNano())).Intn(maxN-minN) + minN
    	}
    	return rand.New(rand.NewSource(seed)).Intn(maxN-minN) + minN
    }
    
    // Randomizes the order of bytes in the byte array
    // using Knuth Fisher-Yates shuffle algorithm.
    func randomizeBytes(s []byte, seed int64) []byte {
    	// special value -1 means no explicit seeding.
    	if seed != -1 {
    		rand.Seed(seed)
    	}
    	n := len(s)
    	var j int
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 77K bytes
    - Click Count (0)
Back to Top