Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 41 for rand1 (0.05 sec)

  1. pkg/controller/statefulset/stateful_set_utils_test.go

    							claimRefs,
    							metav1.OwnerReference{
    								Name:       "rand1",
    								APIVersion: "v1",
    								Kind:       "Pod",
    								UID:        "rand1-uid",
    							},
    							metav1.OwnerReference{
    								Name:       "rand2",
    								APIVersion: "v1",
    								Kind:       "Pod",
    								UID:        "rand2-uid",
    							})
    					}
    					claim.SetOwnerReferences(claimRefs)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 05 19:06:41 UTC 2024
    - 50.9K bytes
    - Viewed (0)
  2. pkg/kubelet/stats/cri_stats_provider_test.go

    		UsedBytes:  &runtimeapi.UInt64Value{Value: rand.Uint64()},
    		InodesUsed: &runtimeapi.UInt64Value{Value: rand.Uint64()},
    	}
    }
    
    func makeFakeVolumeStats(volumeNames []string) []statsapi.VolumeStats {
    	volumes := make([]statsapi.VolumeStats, len(volumeNames))
    	availableBytes := rand.Uint64()
    	capacityBytes := rand.Uint64()
    	usedBytes := rand.Uint64() / 100
    	inodes := rand.Uint64()
    	inodesFree := rand.Uint64()
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Apr 25 14:24:16 UTC 2024
    - 54.5K bytes
    - Viewed (0)
  3. cmd/test-utils_test.go

    	// special value -1 means no explicit seeding.
    	if seed != -1 {
    		rand.Seed(seed)
    	}
    	return rand.Intn(max-min) + min
    }
    
    // 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
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Jun 10 15:50:49 UTC 2024
    - 76.9K bytes
    - Viewed (0)
  4. pkg/volume/csi/csi_mounter_test.go

    See the License for the specific language governing permissions and
    limitations under the License.
    */
    
    package csi
    
    import (
    	"context"
    	"fmt"
    	"math/rand"
    	"os"
    	"path/filepath"
    	"reflect"
    	goruntime "runtime"
    	"testing"
    	"time"
    
    	"github.com/google/go-cmp/cmp"
    	"github.com/stretchr/testify/assert"
    	authenticationv1 "k8s.io/api/authentication/v1"
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Apr 24 18:25:29 UTC 2024
    - 50.1K bytes
    - Viewed (0)
  5. src/crypto/tls/common.go

    // modified. A Config may be reused; the tls package will also not
    // modify it.
    type Config struct {
    	// Rand provides the source of entropy for nonces and RSA blinding.
    	// If Rand is nil, TLS uses the cryptographic random reader in package
    	// crypto/rand.
    	// The Reader must be safe for use by multiple goroutines.
    	Rand io.Reader
    
    	// Time returns the current time as the number of seconds since the epoch.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:10:12 UTC 2024
    - 59.1K bytes
    - Viewed (0)
  6. src/crypto/tls/tls_test.go

    	default:
    		return false
    	}
    }
    
    type brokenSigner struct{ crypto.Signer }
    
    func (s brokenSigner) Sign(rand io.Reader, digest []byte, opts crypto.SignerOpts) (signature []byte, err error) {
    	// Replace opts with opts.HashFunc(), so rsa.PSSOptions are discarded.
    	return s.Signer.Sign(rand, digest, opts.HashFunc())
    }
    
    // TestPKCS1OnlyCert uses a client certificate with a broken crypto.Signer that
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:10:12 UTC 2024
    - 60.5K bytes
    - Viewed (0)
  7. src/math/big/int_test.go

    }
    
    func TestModSqrt(t *testing.T) {
    	var elt, mod, modx4, sq, sqrt Int
    	r := rand.New(rand.NewSource(9))
    	for i, s := range primes[1:] { // skip 2, use only odd primes
    		mod.SetString(s, 10)
    		modx4.Lsh(&mod, 2)
    
    		// test a few random elements per prime
    		for x := 1; x < 5; x++ {
    			elt.Rand(r, &modx4)
    			elt.Sub(&elt, &mod) // test range [-mod, 3*mod)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 18:42:28 UTC 2024
    - 58.5K bytes
    - Viewed (0)
  8. src/strings/strings_test.go

    		for strLen := 5 + rand.Intn(5); strLen < 140; strLen += 10 { // Arbitrary
    			s1 := make([]byte, strLen)
    			for i := range s1 {
    				s1[i] = chars[rand.Intn(len(chars))]
    			}
    			s := string(s1)
    			for i := 0; i < 50; i++ {
    				begin := rand.Intn(len(s) + 1)
    				end := begin + rand.Intn(len(s)+1-begin)
    				sep := s[begin:end]
    				if i%4 == 0 {
    					pos := rand.Intn(len(sep) + 1)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 12:58:37 UTC 2024
    - 53K bytes
    - Viewed (0)
  9. src/crypto/x509/x509.go

    				Parameters: details.params,
    			}, nil
    		}
    	}
    
    	return 0, ai, errors.New("x509: unknown SignatureAlgorithm")
    }
    
    func signTBS(tbs []byte, key crypto.Signer, sigAlg SignatureAlgorithm, rand io.Reader) ([]byte, error) {
    	signed := tbs
    	hashFunc := sigAlg.hashFunc()
    	if hashFunc != 0 {
    		h := hashFunc.New()
    		h.Write(signed)
    		signed = h.Sum(nil)
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 09:20:15 UTC 2024
    - 82K bytes
    - Viewed (0)
  10. src/runtime/map.go

    	// When we reach 1<<15 - 1, we will have approximately
    	// as many overflow buckets as buckets.
    	mask := uint32(1)<<(h.B-15) - 1
    	// Example: if h.B == 18, then mask == 7,
    	// and rand() & 7 == 0 with probability 1/8.
    	if uint32(rand())&mask == 0 {
    		h.noverflow++
    	}
    }
    
    func (h *hmap) newoverflow(t *maptype, b *bmap) *bmap {
    	var ovf *bmap
    	if h.extra != nil && h.extra.nextOverflow != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 57.6K bytes
    - Viewed (0)
Back to top