panic("par.Work.Do: n < 1")
	}
	if w.running >= 1 {
		panic("par.Work.Do: already called Do")
	}

	w.running = n
	w.f = f
	w.wait.L = &w.mu

	for i := 0; i < n-1; i++ {
		go w.runner()
	}
	w.runner()
}

// runner executes work in w until both nothing is left to do
// and all the runners are waiting for work.
// (Then all the runners return.)
func (w *Work[T]) runner() {
	for {

carlory <******@****.***> 1715775009 +0800

Patrick Ohly <******@****.***> 1654683162 +0200

Stephen Kitt <******@****.***> 1716824549 +0200

Harshavardhana <******@****.***> 1713699798 -0700

Harshavardhana <******@****.***> 1713699798 -0700

Harshavardhana <******@****.***> 1713699798 -0700

Justin Griffin <******@****.***> 1709657048 -0500

Harshavardhana <******@****.***> 1713699798 -0700

}

// divWVW overwrites z with ⌊x/y⌋, returning the remainder r.
// The caller must ensure that len(z) = len(x).
func divWVW(z []Word, xn Word, x []Word, y Word) (r Word) {
	r = xn
	if len(x) == 1 {
		qq, rr := bits.Div(uint(r), uint(x[0]), uint(y))
		z[0] = Word(qq)
		return Word(rr)
	}
	rec := reciprocalWord(y)
	for i := len(z) - 1; i >= 0; i-- {
		z[i], r = divWW(r, x[i], y, rec)
	}
	return r
}