Function proposeAndWaitEmulator

worker/proposal_test.go:24–53

proposeAndWaitEmulator emulates proposeAndWait. It has one function(propose) inside it, which returns errInternalRetry 50% of the time. Rest of the time it just sleeps for 1 second to emulate successful response, if sleep is true. It also expects maxRetry as argument, which is max number of times pr

(l *rateLimiter, r *rand.Rand, maxRetry int, sleep bool)

// to emulate successful response, if sleep is true. It also expects maxRetry as argument, which
// is max number of times propose should be called for each errInternalRetry.
func proposeAndWaitEmulator(l *rateLimiter, r *rand.Rand, maxRetry int, sleep bool) error {
	// succeed/fail with equal probability.
	propose := func(timeout time.Duration) error {
		num := int(r.Int31n(10))
		if num%2 == 0 {
			return errInternalRetry
		}

		// Sleep for 1 second, to emulate successful behaviour.
		if sleep {
			time.Sleep(1 * time.Second)
		}
		return nil
	}

	runPropose := func(i int) error {
		if err := l.incr(context.Background(), i); err != nil {
			return err
		}
		defer l.decr(i)
		return propose(newTimeout(i))
	}

	for i := range maxRetry {
		if err := runPropose(i); err != errInternalRetry {
			return err
		}
	}
	return errUnableToServe
}

// This test tests for deadlock in rate limiter. It tried some fixed number of proposals in
// multiple goroutines. At the end it matches if sum of completed and aborted proposals is