Added unit tests, documentation and function descriptions across the board. Increased cyclop complexity threshold to 15 which is a bit more sane than 10 and excluded _test.go files from linters.

internal/mock/findATender/generator.go

@@ -23,6 +23,8 @@ type Generator struct {
 	rnd   *rand.Rand
 }
 
+// NewGenerator returns a generator drawing from cat and storing releases in
+// store. The same seed and store contents give the same releases.
 func NewGenerator(cat *Catalog, store *Store, seed int64) *Generator {
 	return &Generator{
 		cat:   cat,
@@ -31,6 +33,9 @@ func NewGenerator(cat *Catalog, store *Store, seed int64) *Generator {
 	}
 }
 
+// Make returns a new release dated at (to the second). About a third of the
+// time it moves on a procedure still open from the last 60 days; otherwise it
+// starts a new one.
 func (g *Generator) Make(at time.Time) ocds.Release {
 	at = at.UTC().Truncate(time.Second)
 	if g.rnd.Float64() < 0.35 {
@@ -105,6 +110,9 @@ func (g *Generator) newProcedure(at time.Time) ocds.Release {
 	}
 }
 
+// advance returns the next release in prev's procedure: planning moves to
+// tender, and a tender either has its deadline extended (tenderUpdate) or is
+// awarded to a supplier from the catalog.
 func (g *Generator) advance(prev ocds.Release, at time.Time) ocds.Release {
 	r := clone(prev)
 	r.ID = g.store.NextNoticeID(at.Year())
@@ -190,6 +198,8 @@ func (g *Generator) newOCID() string {
 	}
 }
 
+// gap returns a random duration from min to max inclusive, or min if max is
+// not larger.
 func (g *Generator) gap(min, max time.Duration) time.Duration {
 	if max <= min {
 		return min