Files
yellowjacket/backend/playlist/phantom_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

188 lines
5.1 KiB
Go

package playlist
import (
"path/filepath"
"testing"
)
// setupPhantomPlaylist builds a playlist whose M3U8 holds two entries —
// one file the library has and one it does not — with the matching
// playlist_tracks rows: a linked row at position 0 and a phantom at
// position 1. It returns the playlist id, the phantom's absolute path
// and the library path the user would resolve it to.
func setupPhantomPlaylist(
t *testing.T,
) (svc *Service, playlistID int64, phantomAbs, targetAbs string) {
t.Helper()
svc, db, _ := setupRecordedService(t)
paths := seedPlaylistTracks(t, db, 2)
libDir := svc.libraryDir.(stubLibraryDir).dir
// seedPlaylistTracks writes absolute paths outside the library root,
// which is fine: an M3U8 entry may be absolute, and resolveM3UPath
// returns an absolute entry unchanged.
targetAbs = paths[1]
phantomAbs = filepath.Join(libDir, "gone", "missing.mp3")
created, err := svc.CreatePlaylist("Imported")
if err != nil {
t.Fatalf("CreatePlaylist: %v", err)
}
playlistID = created.ID
dir, err := svc.playlistsDir()
if err != nil {
t.Fatalf("playlistsDir: %v", err)
}
if err := writeM3U8(dir, playlistID, "Imported", []m3uEntry{
{RelativePath: paths[0], DisplayTitle: "Track 1", DurationSec: 180},
{
RelativePath: phantomAbs,
DisplayTitle: "Some Artist - Missing",
DurationSec: 200,
},
}); err != nil {
t.Fatalf("writeM3U8: %v", err)
}
if _, err := db.ExecContext(
`INSERT INTO playlist_tracks (playlist_id, audio_file_id, position)
VALUES (?, 1, 0)`,
playlistID,
); err != nil {
t.Fatalf("insert linked track: %v", err)
}
if _, err := db.ExecContext(
`INSERT INTO playlist_tracks
(playlist_id, position, phantom_title, phantom_file_path)
VALUES (?, 1, 'Some Artist - Missing', ?)`,
playlistID, phantomAbs,
); err != nil {
t.Fatalf("insert phantom track: %v", err)
}
return svc, playlistID, phantomAbs, targetAbs
}
// countPlaylistRows reports how many playlist_tracks rows the playlist
// has, and how many of them are still phantoms.
func countPlaylistRows(
t *testing.T, svc *Service, playlistID int64,
) (total, phantoms int) {
t.Helper()
rows, err := svc.db.QueryContext(
`SELECT COUNT(*),
COALESCE(SUM(audio_file_id IS NULL), 0)
FROM playlist_tracks WHERE playlist_id = ?`,
playlistID,
)
if err != nil {
t.Fatalf("count playlist_tracks: %v", err)
}
defer func() { _ = rows.Close() }()
if !rows.Next() {
t.Fatal("count playlist_tracks: no row")
}
if err := rows.Scan(&total, &phantoms); err != nil {
t.Fatalf("scan count: %v", err)
}
return total, phantoms
}
// TestResolvePhantomTracksFillsTheRowItAlreadyHas is the regression for
// a manually resolved phantom appearing twice: the resolution used to
// append a *new* playlist_tracks row and leave the phantom row behind,
// so the playlist held two rows for one M3U8 line — and the resolved
// one sat at the end of the playlist rather than where the track was.
func TestResolvePhantomTracksFillsTheRowItAlreadyHas(t *testing.T) {
t.Parallel()
svc, playlistID, phantomAbs, targetAbs := setupPhantomPlaylist(t)
if err := svc.ResolvePhantomTracks(
playlistID, map[string]string{phantomAbs: targetAbs},
); err != nil {
t.Fatalf("ResolvePhantomTracks: %v", err)
}
total, phantoms := countPlaylistRows(t, svc, playlistID)
if total != 2 {
t.Errorf("playlist_tracks rows = %d, want 2", total)
}
if phantoms != 0 {
t.Errorf("phantom rows left = %d, want 0", phantoms)
}
// The track stays where it was in the playlist.
tracks, err := svc.GetPlaylistTracks(playlistID)
if err != nil {
t.Fatalf("GetPlaylistTracks: %v", err)
}
if len(tracks) != 2 {
t.Fatalf("tracks = %d, want 2", len(tracks))
}
if tracks[1].FilePath != targetAbs {
t.Errorf(
"resolved track at position 1 = %q, want %q",
tracks[1].FilePath, targetAbs,
)
}
if tracks[1].Phantom {
t.Error("resolved track is still marked phantom")
}
}
// TestResolvePhantomTracksRefusesTwoPhantomsForOneFile pins the rule
// FindPhantomMatches already applies on the auto-match path: one library
// file cannot stand in for two phantom tracks, or resolving adds it to
// the playlist twice.
func TestResolvePhantomTracksRefusesTwoPhantomsForOneFile(t *testing.T) {
t.Parallel()
svc, playlistID, phantomAbs, targetAbs := setupPhantomPlaylist(t)
secondPhantom := filepath.Join(
svc.libraryDir.(stubLibraryDir).dir, "gone", "missing-2.mp3",
)
if _, err := svc.db.ExecContext(
`INSERT INTO playlist_tracks
(playlist_id, position, phantom_title, phantom_file_path)
VALUES (?, 2, 'Some Artist - Missing 2', ?)`,
playlistID, secondPhantom,
); err != nil {
t.Fatalf("insert second phantom: %v", err)
}
if err := svc.ResolvePhantomTracks(playlistID, map[string]string{
phantomAbs: targetAbs,
secondPhantom: targetAbs,
}); err != nil {
t.Fatalf("ResolvePhantomTracks: %v", err)
}
total, phantoms := countPlaylistRows(t, svc, playlistID)
if total != 3 {
t.Errorf("playlist_tracks rows = %d, want 3", total)
}
// One of the two phantoms is resolved; the other is left for the
// user to point somewhere else.
if phantoms != 1 {
t.Errorf("phantom rows left = %d, want 1", phantoms)
}
}