OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	12/01/2022 06:13:56 PM	rwxr-xr-x
📄 example_test.go	4.83 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 exp.go	10.92 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 export_test.go	482 bytes	12/01/2022 06:12:59 PM	rw-r--r--
📄 gen_cooked.go	1.51 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 normal.go	6.3 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 race_test.go	1.09 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 rand.go	13.49 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 rand_test.go	16.66 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 regress_test.go	17.78 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 rng.go	14.76 KB	12/01/2022 06:12:59 PM	rw-r--r--
📄 zipf.go	1.8 KB	12/01/2022 06:12:59 PM	rw-r--r--

Editing: race_test.go

// Copyright 2016 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package rand_test

import (
	. "math/rand"
	"sync"
	"testing"
)

// TestConcurrent exercises the rand API concurrently, triggering situations
// where the race detector is likely to detect issues.
func TestConcurrent(t *testing.T) {
	const (
		numRoutines = 10
		numCycles   = 10
	)
	var wg sync.WaitGroup
	defer wg.Wait()
	wg.Add(numRoutines)
	for i := 0; i < numRoutines; i++ {
		go func(i int) {
			defer wg.Done()
			buf := make([]byte, 997)
			for j := 0; j < numCycles; j++ {
				var seed int64
				seed += int64(ExpFloat64())
				seed += int64(Float32())
				seed += int64(Float64())
				seed += int64(Intn(Int()))
				seed += int64(Int31n(Int31()))
				seed += int64(Int63n(Int63()))
				seed += int64(NormFloat64())
				seed += int64(Uint32())
				seed += int64(Uint64())
				for _, p := range Perm(10) {
					seed += int64(p)
				}
				Read(buf)
				for _, b := range buf {
					seed += int64(b)
				}
				Seed(int64(i*j) * seed)
			}
		}(i)
	}
}