Files
yellowjacket/backend/library/remove_tracks_test.go
T
yonluandClaude Opus 5 e7748f1fd5
CI / check (push) Successful in 3m7s
CI / e2e (push) Canceled after 1m45s
feat(database): shape the library like files, and shrink the catalog
Plans 013 and 014, the album page that prompted them, and the smaller
fixes they turned up. Changelog, largest first.

## The local library is shaped like files, not like MusicBrainz

`audio_files` carries its own tags and points at `albums` and
`artists`; `file_genres` is the one real many-to-many. `recordings`,
`release_group_recordings`, `artist_credit`, `artist_credit_artist`,
`recording_genres`, `release_groups` and `release_to_rg` are gone from
the local side, and with them a six-way join in every read, a
`MIN(release_group_id)` subquery in eleven queries and a
first-credited-artist subquery in nine. Measured on a real 25,966-file
library, every many-to-many that model expressed was 1:1 in the data.

- Ownership is a file. `GetFilePathsByRecordingMBIDs`,
  `LibraryMBIDIndex.CheckMBIDs`, `collectLibraryEntities` and
  `pruneStaleLocalCrossReferences` all join `audio_files`, so the 812
  orphaned recordings, 216 release groups and 260 artists that library
  carried are now structurally impossible.
- One projection: every track query selects from the `track_metadata`
  view, one row type, one mapper. Nine hand-rolled copies had drifted
  far enough to report different years on different screens.
- `library_id = 0` means every library, so each list query exists once
  instead of scoped and unscoped with a branch at every call site.
- No migration chain. `sql/schemas/` is the one description of the
  shape; `sql/migrations/`, `applyMigrations` and `schema_migrations`
  are squashed away, along with the drift between them that had sqlc
  generating against a stale schema.
- `database.InsertTestTrack` is the one test seeder; twenty test files
  had been assembling the old FK chain each in its own order.

## The catalog stores its ids as bytes

`explore_index`'s three 36-char MBID columns and its entity-type text
are 16 raw bytes and a small integer. The table and its six indexes go
780 MB to 405 MB on a real 2,052,200-row catalog, which is why a fresh
install is ~0.6 GB rather than ~1.0 GB.

- `backend/explore/mbid.go` is the only place the encoding is known;
  everything above it speaks dashed strings.
- `CHECK(length(mbid) = 16)` makes a stringly write fail at the insert
  rather than silently returning no rows, since SQLite does not coerce
  between TEXT and BLOB.
- The importer asks the artifact what encoding it carries and converts
  on the way in, so the artifact already published keeps working and no
  format bump is needed.
- `indexRowColumns`/`scanIndexRow` replace four copies of a 22-column
  list, and `TestStoredEncodingRoundTrips` sweeps every read path.

## An album page that says how much of the album is yours

- One question, asked once: is there a file. `filePaths` is filled by a
  single batched lookup when the tracklist settles, and the badge, the
  Play count, the dimmed rows and every menu item read it — replacing
  four claims of decreasing confidence that could show a green tick on
  an album whose every action did nothing.
- Play, Play 7 of 12, or no play button at all.
- `total_tracks` on `explore_index` (~2 bytes over 400,677 release
  groups) and on `audio_files` from tags that have always carried it:
  a complete MBID-matched album now makes no catalog call at all, where
  it used to spend the most expensive request the app makes.
- A merged cluster shows the running order the most releases agree on,
  and the version list marks the release you own rather than standing a
  synthetic entry in for it.
- `AlbumReleasesFailed`: a slow fetch is no longer reported as a failed
  one by a 12-second timer.
- Rows not in the library are dimmed in place (with `aria-disabled`)
  instead of the owned ones wearing a green tick and a legend.

## Caches and cover art get ceilings

- Only the three tiers of a cover are stored; the full-resolution copy
  nothing rendered was 1,134 MB of a 1.4 GB covers directory.
- One artist portrait is downloaded and the rest are remembered as
  URLs — 4.1 GB of a 5.3 GB cache was candidates no code path reads.
- `browsedArtBudget` and `httpCacheBudget` bound what an age cannot:
  the same install held art for 5,770 artists in a 1,301-artist
  library.
- `OrphanedArtistImagesJob` joined a bare MBID onto a sharded
  directory, so it deleted the rows that were the only record of the
  files it left behind. `explore.ArtistImageDir` is that layout's one
  definition now.

## The autotag queue asks whether there is work

`tagging_items` was a row per album folder, not a queue, and no query
read the `tag_status` column that held the answer. The four queue
queries ask the files, which matters most where it is least visible:
`startPrefetch` was scoring every album in a tagged library against
MusicBrainz.

## Phantom playlist tracks resolve in place

An M3U8 imported before its files leaves phantom rows; they now match
by path and fall back to position, keep their place in the playlist
when resolved, and pair best-first so two phantoms cannot claim the
same file.

## Playing a track plays the list it is in

Double-click, and Play on a single row's menu, queue the list as
displayed with `startIndex` on that row — the album page and the track
list used to queue one track and discard the album around it. A
multi-row selection still plays exactly itself.

Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01AfVYUVExXsx1nSWrXN8mAh
2026-08-16 13:58:15 -04:00

297 lines
7.9 KiB
Go

package library
import (
"log/slog"
"os"
"path/filepath"
"slices"
"testing"
"yellowjacket/backend/database"
"yellowjacket/backend/database/sql/sqlcgen"
"yellowjacket/backend/events"
"yellowjacket/internal/testfixtures"
)
// setupScanLibrary builds a Library over a temp directory holding
// copies of `count` real fixture tracks, plus the libraries row the
// scan needs. Real files, because the scan extracts tags from them.
func setupScanLibrary(
t *testing.T,
count int,
) (lib *Library, dir string, paths []string, rec *events.Recorder, libID int64) {
t.Helper()
m := testfixtures.Load(t)
sources := m.Case(t, testfixtures.CaseFLACAlbum)
if len(sources) < count {
t.Fatalf("fixture case has %d tracks, need %d", len(sources), count)
}
dir = t.TempDir()
paths = make([]string, 0, count)
for _, src := range sources[:count] {
data, err := os.ReadFile(src)
if err != nil {
t.Fatalf("read fixture %s: %v", src, err)
}
dst := filepath.Join(dir, filepath.Base(src))
if err := os.WriteFile(dst, data, 0o600); err != nil {
t.Fatalf("write fixture copy: %v", err)
}
paths = append(paths, dst)
}
db := database.NewTestDB(t)
rec = events.NewRecorder()
lib = &Library{
ctx: events.WithSink(t.Context(), rec),
logger: slog.Default(),
conf: &Config{},
db: db,
}
row, err := db.Queries.CreateLibrary(t.Context(), sqlcgen.CreateLibraryParams{
Name: "Test",
Path: dir,
})
if err != nil {
t.Fatalf("create library row: %v", err)
}
slices.Sort(paths)
return lib, dir, paths, rec, row.ID
}
// scannedPaths returns the file paths currently in the database, sorted.
func scannedPaths(t *testing.T, lib *Library) []string {
t.Helper()
rows, err := lib.db.Queries.GetAllAudioFilePaths(t.Context())
if err != nil {
t.Fatalf("read audio file paths: %v", err)
}
out := make([]string, 0, len(rows))
for _, row := range rows {
out = append(out, row.FilePath)
}
slices.Sort(out)
return out
}
// TestRemoveFromLibrary_SurvivesRescan is the assertion the whole phase
// rests on: a removed path stays removed across a real scan of the real
// directory, and the file it named is still on disk.
//
// Its positive half is not optional. A guard that excluded everything
// would satisfy "the removed path did not come back" for free, so the
// same scan must also put back a row deleted *without* an exclusion.
func TestRemoveFromLibrary_SurvivesRescan(t *testing.T) {
t.Parallel()
lib, dir, paths, _, libID := setupScanLibrary(t, 3)
lib.scanInternal(libID, "Test", dir)
if got := scannedPaths(t, lib); len(got) != 3 {
t.Fatalf("first scan imported %d tracks, want 3: %v", len(got), got)
}
removed := paths[0]
// The control: its row is deleted directly, with no exclusion, so
// the same scan has to bring it back.
control := paths[1]
result, err := lib.RemoveFromLibrary([]string{removed})
if err != nil {
t.Fatalf("RemoveFromLibrary: %v", err)
}
if result.TracksRemoved != 1 || result.PathsExcluded != 1 {
t.Fatalf(
"RemoveFromLibrary = %+v, want 1 removed and 1 excluded",
result,
)
}
controlRow, err := lib.db.Queries.GetAudioFileByPath(t.Context(), control)
if err != nil {
t.Fatalf("look up control track: %v", err)
}
if err := lib.db.Queries.DeleteAudioFile(t.Context(), controlRow.ID); err != nil {
t.Fatalf("delete control row: %v", err)
}
lib.scanInternal(libID, "Test", dir)
after := scannedPaths(t, lib)
if slices.Contains(after, removed) {
t.Errorf("excluded path came back after a rescan: %s\nrows: %v", removed, after)
}
if !slices.Contains(after, control) {
t.Errorf(
"the rescan did not re-import a path that was NOT excluded (%s)"+
" — the exclusion is skipping more than it was asked to\nrows: %v",
control, after,
)
}
// The promise the confirmation dialog makes.
if _, err := os.Stat(removed); err != nil {
t.Errorf("removed file is no longer on disk: %v", err)
}
}
// TestRemoveFromLibrary_SoftScanSeesNoChange pins the trap that would
// otherwise queue a full scan on every launch: the soft scan compares
// the number of audio files on disk against the number of rows, and an
// excluded path is on disk and deliberately not a row.
func TestRemoveFromLibrary_SoftScanSeesNoChange(t *testing.T) {
t.Parallel()
lib, dir, paths, _, libID := setupScanLibrary(t, 3)
lib.scanInternal(libID, "Test", dir)
if _, err := lib.RemoveFromLibrary([]string{paths[0]}); err != nil {
t.Fatalf("RemoveFromLibrary: %v", err)
}
dbCount, err := lib.db.Queries.CountAudioFiles(t.Context(), libID)
if err != nil {
t.Fatalf("count rows: %v", err)
}
diskCount, _ := surveyAudioFiles(dir, lib.excludedPathSet(libID))
if diskCount != dbCount {
t.Errorf(
"soft scan would see disk %d vs db %d — every launch queues a full scan",
diskCount, dbCount,
)
}
// And the positive half: without the exclusion set the survey still
// counts the file, which is what makes the argument above real
// rather than a tautology about a function that counts nothing.
if raw, _ := surveyAudioFiles(dir, nil); raw != dbCount+1 {
t.Errorf("unfiltered survey = %d, want %d", raw, dbCount+1)
}
}
// TestRemoveFromLibrary_FullRescanClearsExclusions pins the only route
// back for a path removed by mistake.
func TestRemoveFromLibrary_FullRescanClearsExclusions(t *testing.T) {
t.Parallel()
lib, dir, paths, _, libID := setupScanLibrary(t, 2)
lib.scanInternal(libID, "Test", dir)
if _, err := lib.RemoveFromLibrary([]string{paths[0]}); err != nil {
t.Fatalf("RemoveFromLibrary: %v", err)
}
if err := lib.clearLibraryTables(); err != nil {
t.Fatalf("clearLibraryTables: %v", err)
}
count, err := lib.db.Queries.CountExcludedPathsByLibrary(t.Context(), libID)
if err != nil {
t.Fatalf("count exclusions: %v", err)
}
if count != 0 {
t.Fatalf("full rescan left %d exclusions behind", count)
}
lib.scanInternal(libID, "Test", dir)
if !slices.Contains(scannedPaths(t, lib), paths[0]) {
t.Error("a full rescan did not bring back a previously excluded path")
}
}
// TestRemoveFromLibrary_EmitsPatchablePayload checks the event carries
// what a store needs to patch rather than invalidate.
func TestRemoveFromLibrary_EmitsPatchablePayload(t *testing.T) {
t.Parallel()
lib, dir, paths, rec, libID := setupScanLibrary(t, 2)
lib.scanInternal(libID, "Test", dir)
if _, err := lib.RemoveFromLibrary([]string{paths[0]}); err != nil {
t.Fatalf("RemoveFromLibrary: %v", err)
}
ev, ok := rec.Last(events.TracksRemovedFromLibrary)
if !ok {
t.Fatalf("no TracksRemovedFromLibrary emitted; got %v", rec.Names())
}
payload, ok := ev.Payload().(map[string]any)
if !ok {
t.Fatalf("payload is %T, want a map", ev.Payload())
}
got, ok := payload["filePaths"].([]string)
if !ok || len(got) != 1 || got[0] != paths[0] {
t.Errorf("payload filePaths = %v, want [%s]", payload["filePaths"], paths[0])
}
if count, ok := payload["count"].(int64); !ok || count != 1 {
t.Errorf("payload count = %v, want 1", payload["count"])
}
}
// TestRemoveFromLibrary_CompactsTheQueue pins the half that is invisible
// from the track list: deleting an audio_files row cascades to
// queue_tracks, so the queue's in-memory copy — and the player, if it
// was the track playing — has to be told.
func TestRemoveFromLibrary_CompactsTheQueue(t *testing.T) {
t.Parallel()
lib, dir, paths, _, libID := setupScanLibrary(t, 2)
lib.scanInternal(libID, "Test", dir)
compacted := 0
lib.SetRemovalHooks(RemovalHooks{
CompactQueue: func() { compacted++ },
})
if _, err := lib.RemoveFromLibrary([]string{paths[0]}); err != nil {
t.Fatalf("RemoveFromLibrary: %v", err)
}
if compacted != 1 {
t.Errorf("CompactQueue called %d times, want 1", compacted)
}
}
// TestRemoveFromLibrary_RejectsAnEmptyRequest keeps a stray Delete on
// an empty selection from reaching the database at all.
func TestRemoveFromLibrary_RejectsAnEmptyRequest(t *testing.T) {
t.Parallel()
lib, _, _, _, _ := setupScanLibrary(t, 1)
if _, err := lib.RemoveFromLibrary(nil); err == nil {
t.Error("RemoveFromLibrary(nil) succeeded, want an error")
}
}