Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 196 for ran0 (0.05 seconds)

  1. tensorflow/c/eager/c_api_unified_experimental.h

    void TF_DeleteExecutionContext(TF_ExecutionContext*);
    
    // Represents a (partially-defined) shape.
    typedef struct TF_Shape {
      int num_dims;  // Must be >= -1; -1 represents unknown rank.
      int64_t* dim_sizes;
    } TF_Shape;
    
    // Add a new parameter to a TensorFlow Function.
    TF_AbstractTensor* TF_AddFunctionParameter(TF_ExecutionContext* func,
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sun Oct 24 11:27:00 GMT 2021
    - 7K bytes
    - Click Count (0)
  2. .github/PULL_REQUEST_TEMPLATE.md

    https://git.k8s.io/community/contributors/devel/sig-release/release.md#issuepr-kind-label
    3. Ensure you have added or ran the appropriate tests for your PR: https://git.k8s.io/community/contributors/devel/sig-testing/testing.md
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Tue Jan 20 23:14:09 GMT 2026
    - 3.1K bytes
    - Click Count (0)
  3. src/main/resources/fess_config.properties

    labels.facet_filetype_txt=filetype:txt\t\
    labels.facet_filetype_others=filetype:others\n\
    
    # ranking
    
    # Window size for rank fusion.
    rank.fusion.window_size=200
    # Rank constant for rank fusion.
    rank.fusion.rank_constant=20
    # Number of threads for rank fusion.
    rank.fusion.threads=-1
    # Score field for rank fusion.
    rank.fusion.score_field=rf_score
    
    # acl
    
    # Whether to get SMB roles from a file.
    smb.role.from.file=true
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 59.3K bytes
    - Click Count (0)
  4. src/bytes/bytes_test.go

    				rs = append(rs, r)
    			}
    		}
    	}
    	// Shuffle the runes so that they are not in descending order.
    	// The sort is deterministic since this is used for benchmarks,
    	// which need to be repeatable.
    	rr := rand.New(rand.NewSource(1))
    	rr.Shuffle(len(rs), func(i, j int) {
    		rs[i], rs[j] = rs[j], rs[i]
    	})
    	uchars := string(rs)
    
    	return func(b *testing.B, n int) {
    		buf := bmbuf[0:n]
    		o := copy(buf, uchars)
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Mar 11 03:07:05 GMT 2026
    - 62.9K bytes
    - Click Count (0)
  5. tensorflow/c/c_api_internal.h

    // Set the shapes and types of the output's handle.
    //
    // The lengths of the arrays pointed to by `shapes`, `ranks`, and `types` must
    // all be equal to `num_shapes_and_types`. If `ranks[i] != -1`, (i.e., if the
    // rank is known), then it must be equal to the length of `shapes[i]`; if
    // `ranks[i] == 1`, then `shapes[i]` may be nullptr.
    //
    // TODO(akshayka): Implement a corresponding getter method.
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 7.5K bytes
    - Click Count (0)
  6. cmd/xl-storage-format-v2_test.go

    		t.Run(test.name, func(t *testing.T) {
    			// Run multiple times, shuffling the input order.
    			for i := range int64(50) {
    				t.Run(fmt.Sprint(i), func(t *testing.T) {
    					rng := rand.New(rand.NewSource(i))
    					rng.Shuffle(len(test.input), func(i, j int) {
    						test.input[i], test.input[j] = test.input[j], test.input[i]
    					})
    					got := mergeXLV2Versions(test.quorum, true, 0, test.input...)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 37.8K bytes
    - Click Count (0)
  7. cmd/erasure-server-pool-rebalance.go

    	// Save rebalance.bin periodically.
    	go func() {
    		// Update rebalance.bin periodically once every 5-10s, chosen randomly
    		// to avoid multiple pool leaders herding to update around the same
    		// time.
    		r := rand.New(rand.NewSource(time.Now().UnixNano()))
    		randSleepFor := func() time.Duration {
    			return 5*time.Second + time.Duration(float64(5*time.Second)*r.Float64())
    		}
    
    		timer := time.NewTimer(randSleepFor())
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 28.7K bytes
    - Click Count (0)
  8. build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/docker/DockerBuildTask.java

                        LOGGER.warn("Attempt {}/{} to pull Docker base image {} failed", attempt, maxAttempts, baseImage);
                    }
                }
    
                // If we successfully ran `docker pull` above, we would have returned before this point.
                throw new GradleException("Failed to pull Docker base image [" + baseImage + "], all attempts failed");
            }
    
            @Override
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Tue Jun 01 09:19:30 GMT 2021
    - 6.5K bytes
    - Click Count (0)
  9. src/bytes/buffer_test.go

    	var buf Buffer
    	s := ""
    	for i := 0; i < 50; i++ {
    		wlen := rand.Intn(len(testString))
    		if i%2 == 0 {
    			s = fillString(t, "TestMixedReadsAndWrites (1)", &buf, s, 1, testString[0:wlen])
    		} else {
    			s = fillBytes(t, "TestMixedReadsAndWrites (1)", &buf, s, 1, testBytes[0:wlen])
    		}
    
    		rlen := rand.Intn(len(testString))
    		fub := make([]byte, rlen)
    		n, _ := buf.Read(fub)
    		s = s[n:]
    	}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 19.4K bytes
    - Click Count (0)
  10. guava-tests/test/com/google/common/math/IntMathTest.java

        for (int i = 0; i < 100000; i++) {
          assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
        }
    
        // Then check 1000 deterministic pseudo-random int values.
        Random rand = new Random(1);
        for (int i = 0; i < 1000; i++) {
          int n = rand.nextInt(Integer.MAX_VALUE);
          assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
        }
      }
    
      public void testSaturatedAbs() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 24.1K bytes
    - Click Count (0)
Back to Top