Apply linter autofixes: internal/vaultik (refs #61)

internal/vaultik/restore_plan.go

@@ -53,26 +53,33 @@ func newRestorePlan(
 			// No chunks to fetch — restore can run immediately.
 			p.fileBlobs[f.ID] = nil
 			p.ready = append(p.ready, f.ID)
+
 			continue
 		}
+
 		fileChunks, err := repos.FileChunks.GetByFileID(ctx, f.ID)
 		if err != nil {
 			return nil, fmt.Errorf("planning %s: %w", f.Path, err)
 		}
+
 		blobs := make(map[string]struct{})
+
 		for _, fc := range fileChunks {
 			bc, ok := chunkToBlobMap[fc.ChunkHash.String()]
 			if !ok {
 				return nil, fmt.Errorf("planning %s: chunk %s missing from blob map",
 					f.Path, fc.ChunkHash.String()[:16])
 			}
+
 			hash, ok := blobIDToHash[bc.BlobID.String()]
 			if !ok {
 				return nil, fmt.Errorf("planning %s: blob id %s missing from id-to-hash map",
 					f.Path, bc.BlobID)
 			}
+
 			blobs[hash] = struct{}{}
 		}
+
 		p.fileBlobs[f.ID] = blobs
 		for hash := range blobs {
 			set, ok := p.blobFiles[hash]
@@ -80,12 +87,15 @@ func newRestorePlan(
 				set = make(map[types.FileID]struct{})
 				p.blobFiles[hash] = set
 			}
+
 			set[f.ID] = struct{}{}
 		}
+
 		if len(blobs) == 0 {
 			p.ready = append(p.ready, f.ID)
 		}
 	}
+
 	return p, nil
 }
 
@@ -96,10 +106,12 @@ func (p *restorePlan) markBlobCached(blobHash string) {
 	if _, already := p.cached[blobHash]; already {
 		return
 	}
+
 	p.cached[blobHash] = struct{}{}
 	for fileID := range p.blobFiles[blobHash] {
 		blobs := p.fileBlobs[fileID]
 		delete(blobs, blobHash)
+
 		if len(blobs) == 0 {
 			p.ready = append(p.ready, fileID)
 		}
@@ -112,8 +124,10 @@ func (p *restorePlan) popReady() (types.FileID, bool) {
 	if len(p.ready) == 0 {
 		return types.FileID{}, false
 	}
+
 	id := p.ready[0]
 	p.ready = p.ready[1:]
+
 	return id, true
 }
 
@@ -123,17 +137,20 @@ func (p *restorePlan) finishFile(fileID types.FileID) {
 	for hash := range p.fileBlobs[fileID] {
 		if set, ok := p.blobFiles[hash]; ok {
 			delete(set, fileID)
+
 			if len(set) == 0 {
 				delete(p.blobFiles, hash)
 			}
 		}
 	}
+
 	delete(p.fileBlobs, fileID)
 	// Also scrub the file from any blobFiles entries where it might
 	// still appear even after its uncached-blob set was emptied.
 	for hash, set := range p.blobFiles {
 		if _, ok := set[fileID]; ok {
 			delete(set, fileID)
+
 			if len(set) == 0 {
 				delete(p.blobFiles, hash)
 			}
@@ -150,8 +167,11 @@ func (p *restorePlan) finishFile(fileID types.FileID) {
 // The zero FileID return means nothing is pending.
 func (p *restorePlan) pickNextDownload() types.FileID {
 	var best types.FileID
+
 	bestCount := math.MaxInt
+
 	var bestID string
+
 	for id, blobs := range p.fileBlobs {
 		n := len(blobs)
 		if n == 0 {
@@ -159,6 +179,7 @@ func (p *restorePlan) pickNextDownload() types.FileID {
 			// popReady; ignore here just in case.
 			continue
 		}
+
 		idStr := id.String()
 		if n < bestCount || (n == bestCount && (best.IsZero() || idStr < bestID)) {
 			best = id
@@ -166,16 +187,19 @@ func (p *restorePlan) pickNextDownload() types.FileID {
 			bestID = idStr
 		}
 	}
+
 	return best
 }
 
 // blobsNeeded returns the uncached blob hashes for fileID in any order.
 func (p *restorePlan) blobsNeeded(fileID types.FileID) []string {
 	blobs := p.fileBlobs[fileID]
+
 	out := make([]string, 0, len(blobs))
 	for h := range blobs {
 		out = append(out, h)
 	}
+
 	return out
 }