Read what a machine has from its haves: reported-and-current, the bus list, a given value's first good start; drop the digest of a send (migration 0110) (release 6, issue 1945 B8)

internal/inventory/chain_assignments.go

@@ -9,8 +9,6 @@ import (
 	"strings"
 	"time"
 
-	"github.com/jackc/pgx/v5"
-
 	"github.com/novox/mesh-controller/internal/chain"
 )
 
@@ -190,36 +188,6 @@ func (i *Inventory) chainUnassign(ctx context.Context, c *chain.Chain, node Node
 	return fmt.Errorf("the assignment of %s to %s kept moving under the write", module, node.Name)
 }
 
-// chainAwaitingSince is AwaitingSince over the bucket: the oldest assignment on the machine made after it was last sent.
-func (i *Inventory) chainAwaitingSince(ctx context.Context, name string) (time.Time, error) {
-	var sentAt *time.Time
-	var created time.Time
-	err := i.store.Pool().QueryRow(ctx, `select sent_at, created from node where name = $1`, name).Scan(&sentAt, &created)
-	if errors.Is(err, pgx.ErrNoRows) {
-		return time.Time{}, fmt.Errorf("%w: %s", ErrNoSuchNode, name)
-	}
-	if err != nil {
-		return time.Time{}, err
-	}
-	rows, err := i.assignments(ctx)
-	if err != nil {
-		return time.Time{}, err
-	}
-	var oldest time.Time
-	for _, a := range rows {
-		if a.Node == name && (sentAt == nil || a.Assigned.After(*sentAt)) && (oldest.IsZero() || a.Assigned.Before(oldest)) {
-			oldest = a.Assigned
-		}
-	}
-	switch {
-	case !oldest.IsZero():
-		return oldest, nil
-	case sentAt != nil:
-		return *sentAt, nil
-	}
-	return created, nil
-}
-
 // KeepAssignmentPlans writes the provisioner's plan of each assignment into its value on the bus, and a value of its own for
 // each module only pulled in by another on a machine (issue 765), and ends the value of one that is no longer pulled in. The
 // plans are derived from what each machine was last sent, not part of the record of what is assigned, so they are read