Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 90 for randPod (0.08 sec)

  1. src/math/rand/v2/rand.go

    type Source interface {
    	Uint64() uint64
    }
    
    // A Rand is a source of random numbers.
    type Rand struct {
    	src Source
    }
    
    // New returns a new Rand that uses random values from src
    // to generate other random values.
    func New(src Source) *Rand {
    	return &Rand{src: src}
    }
    
    // Int64 returns a non-negative pseudo-random 63-bit integer as an int64.
    func (r *Rand) Int64() int64 { return int64(r.src.Uint64() &^ (1 << 63)) }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 02:25:49 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  2. src/math/rand/rand.go

    	}
    
    	r.src.Seed(seed)
    	r.readPos = 0
    }
    
    // Int63 returns a non-negative pseudo-random 63-bit integer as an int64.
    func (r *Rand) Int63() int64 { return r.src.Int63() }
    
    // Uint32 returns a pseudo-random 32-bit value as a uint32.
    func (r *Rand) Uint32() uint32 { return uint32(r.Int63() >> 31) }
    
    // Uint64 returns a pseudo-random 64-bit value as a uint64.
    func (r *Rand) Uint64() uint64 {
    	if r.s64 != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 22:09:08 UTC 2024
    - 16.9K bytes
    - Viewed (0)
  3. src/crypto/rsa/pkcs1v15.go

    	return valid, em, index, nil
    }
    
    // nonZeroRandomBytes fills the given slice with non-zero random octets.
    func nonZeroRandomBytes(s []byte, random io.Reader) (err error) {
    	_, err = io.ReadFull(random, s)
    	if err != nil {
    		return
    	}
    
    	for i := 0; i < len(s); i++ {
    		for s[i] == 0 {
    			_, err = io.ReadFull(random, s[i:i+1])
    			if err != nil {
    				return
    			}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 00:11:21 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/BloomFilterTest.java

      private static final int NUM_PUTS = 100_000;
      private static final ThreadLocal<Random> random =
          new ThreadLocal<Random>() {
            @Override
            protected Random initialValue() {
              return new Random();
            }
          };
    
      private static final int GOLDEN_PRESENT_KEY = random.get().nextInt();
    
      @AndroidIncompatible // OutOfMemoryError
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri May 17 15:27:58 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  5. src/crypto/rsa/rsa.go

    }
    
    // GenerateKey generates a random RSA private key of the given bit size.
    //
    // Most applications should use [crypto/rand.Reader] as rand. Note that the
    // returned key does not depend deterministically on the bytes read from rand,
    // and may change between calls and/or between versions.
    func GenerateKey(random io.Reader, bits int) (*PrivateKey, error) {
    	return GenerateMultiPrimeKey(random, 2, bits)
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 00:11:18 UTC 2024
    - 23.4K bytes
    - Viewed (0)
  6. internal/auth/credentials.go

    // the given io.Reader. If random is nil, crypto/rand.Reader is used.
    // If length <= 0, the access key length is chosen automatically.
    //
    // GenerateAccessKey returns an error if length is too small for a valid
    // access key.
    func GenerateAccessKey(length int, random io.Reader) (string, error) {
    	if random == nil {
    		random = rand.Reader
    	}
    	if length <= 0 {
    		length = accessKeyMaxLen
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Tue May 28 17:14:16 UTC 2024
    - 12K bytes
    - Viewed (0)
  7. tensorflow/compiler/mlir/quantization/stablehlo/python/integration_test/quantize_model_test_base.py

            """Initializes a MatmulModel.
    
            Args:
              weight_shape: Shape of the weight tensor.
            """
            self.filters = np.random.uniform(low=-1.0, high=1.0, size=weight_shape)
    
            if bias_fn is not None:
              self.bias = np.random.uniform(
                  low=-1.0, high=1.0, size=weight_shape[-1]
              )
    
          def has_reshape(self) -> bool:
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue May 14 06:31:57 UTC 2024
    - 18.2K bytes
    - Viewed (0)
  8. src/crypto/tls/handshake_messages_test.go

    }
    
    func TestRejectEmptySCTList(t *testing.T) {
    	// RFC 6962, Section 3.3.1 specifies that empty SCT lists are invalid.
    
    	var random [32]byte
    	sct := []byte{0x42, 0x42, 0x42, 0x42}
    	serverHello := &serverHelloMsg{
    		vers:   VersionTLS12,
    		random: random[:],
    		scts:   [][]byte{sct},
    	}
    	serverHelloBytes := mustMarshal(t, serverHello)
    
    	var serverHelloCopy serverHelloMsg
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:10:12 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  9. guava/src/com/google/common/cache/Striped64.java

       * class-unloading when ThreadLocals are not removed.
       */
      static final ThreadLocal<int @Nullable []> threadHashCode = new ThreadLocal<>();
    
      /** Generator of new random hash codes */
      static final Random rng = new Random();
    
      /** Number of CPUS, to place bound on table size */
      static final int NCPU = Runtime.getRuntime().availableProcessors();
    
      /** Table of cells. When non-null, size is a power of 2. */
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/cache/Striped64.java

       * class-unloading when ThreadLocals are not removed.
       */
      static final ThreadLocal<int @Nullable []> threadHashCode = new ThreadLocal<>();
    
      /** Generator of new random hash codes */
      static final Random rng = new Random();
    
      /** Number of CPUS, to place bound on table size */
      static final int NCPU = Runtime.getRuntime().availableProcessors();
    
      /** Table of cells. When non-null, size is a power of 2. */
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri Jun 07 22:25:23 UTC 2024
    - 11.5K bytes
    - Viewed (2)
Back to top