Name the table lookup the Generator doc's fixed tree excepts, and drop the renders restatement
This commit is contained in:
+3
-2
@@ -28,8 +28,9 @@ var ErrNoData = errors.New("no data: WithoutShippedData needs at least one WithD
|
|||||||
|
|
||||||
// Generator generates fake data from a loaded namespace tree. Create one with [New].
|
// Generator generates fake data from a loaded namespace tree. Create one with [New].
|
||||||
// It is safe for concurrent use; a seeded sequence is reproducible only when drawn
|
// It is safe for concurrent use; a seeded sequence is reproducible only when drawn
|
||||||
// from one goroutine. The compiled tree is immutable after [New], so List, NewTemplate
|
// from one goroutine. The compiled tree is fixed after [New] bar each table's row lookup,
|
||||||
// and NewRecordTemplate read it without a lock; mu guards the rest, which every render takes.
|
// which its sync.Once builds on first use, so List, NewTemplate and NewRecordTemplate
|
||||||
|
// read it without a lock; mu guards the rest, which every render takes.
|
||||||
type Generator struct {
|
type Generator struct {
|
||||||
mu sync.Mutex
|
mu sync.Mutex
|
||||||
rand *session
|
rand *session
|
||||||
|
|||||||
+1
-2
@@ -152,8 +152,7 @@ func isFixed(n node) bool {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// renders reports whether rendering n can reach anything in want, following the
|
// renders reports whether rendering n can reach anything in want, following the
|
||||||
// same edges expand does. seen keeps a node from being walked twice, so the walk
|
// same edges expand does.
|
||||||
// ends across a cycle too.
|
|
||||||
func renders(n node, want, seen map[node]bool) bool {
|
func renders(n node, want, seen map[node]bool) bool {
|
||||||
if want[n] {
|
if want[n] {
|
||||||
return true
|
return true
|
||||||
|
|||||||
Reference in New Issue
Block a user