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
235 lines
6.1 KiB
Go
235 lines
6.1 KiB
Go
package library
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
"yellowjacket/backend/database"
|
|
)
|
|
|
|
// track is one file as the scan would write it: a position on a disc,
|
|
// and whatever total the file's tag declared (0 meaning the tag did not
|
|
// say).
|
|
type track struct {
|
|
recordingID int
|
|
disc int
|
|
number int
|
|
total int
|
|
}
|
|
|
|
// stageAlbum writes an album's files straight in. The completeness
|
|
// query reads only audio_files now - the totals used to live on a join
|
|
// table - so this exercises the arithmetic without standing up a scan.
|
|
func stageAlbum(t *testing.T, lib *Library, albumID int, tracks []track) {
|
|
t.Helper()
|
|
|
|
for _, tr := range tracks {
|
|
database.InsertTestTrack(t, lib.db, database.TestTrack{
|
|
FilePath: fmt.Sprintf("/music/album%d/%d.mp3", albumID, tr.recordingID),
|
|
Title: "Test Track",
|
|
Artist: "Test Artist",
|
|
Album: fmt.Sprintf("Test Album %d", albumID),
|
|
TrackNumber: int64(tr.number),
|
|
DiscNumber: int64(tr.disc),
|
|
TotalTracks: int64(tr.total),
|
|
})
|
|
}
|
|
}
|
|
|
|
// albumIDFor reads back the id stageAlbum's files were filed under.
|
|
func albumIDFor(t *testing.T, lib *Library, albumID int) int64 {
|
|
t.Helper()
|
|
|
|
var id int64
|
|
if err := lib.db.QueryRowWriter(
|
|
"SELECT id FROM albums WHERE name = ?", fmt.Sprintf("Test Album %d", albumID),
|
|
).Scan(&id); err != nil {
|
|
t.Fatalf("read album id: %v", err)
|
|
}
|
|
|
|
return id
|
|
}
|
|
|
|
// disc builds a run of tracks on one disc, each declaring the same
|
|
// total — which is what a correctly tagged rip looks like.
|
|
func disc(discNum, firstRecordingID, held, declared int) []track {
|
|
out := make([]track, 0, held)
|
|
|
|
for i := range held {
|
|
out = append(out, track{
|
|
recordingID: firstRecordingID + i,
|
|
disc: discNum,
|
|
number: i + 1,
|
|
total: declared,
|
|
})
|
|
}
|
|
|
|
return out
|
|
}
|
|
|
|
func TestGetAlbumCompleteness(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
cases := []struct {
|
|
name string
|
|
tracks []track
|
|
wantOwned int
|
|
wantExpected int
|
|
wantKnown bool
|
|
wantComplete bool
|
|
}{
|
|
{
|
|
name: "every track present",
|
|
tracks: disc(1, 100, 12, 12),
|
|
wantOwned: 12,
|
|
wantExpected: 12,
|
|
wantKnown: true,
|
|
wantComplete: true,
|
|
},
|
|
{
|
|
name: "three tracks short",
|
|
tracks: disc(1, 200, 9, 12),
|
|
wantOwned: 9,
|
|
wantExpected: 12,
|
|
wantKnown: true,
|
|
wantComplete: false,
|
|
},
|
|
{
|
|
// A bonus track puts the folder over its declared total.
|
|
// That is a complete album, not a broken one — which is
|
|
// why Complete is >= and not ==.
|
|
name: "bonus track over the declared total",
|
|
tracks: disc(1, 300, 13, 12),
|
|
wantOwned: 13,
|
|
wantExpected: 12,
|
|
wantKnown: true,
|
|
wantComplete: true,
|
|
},
|
|
{
|
|
// The whole reason Known exists: an untagged rip declares
|
|
// no total, and a ring drawn from that would mark most of
|
|
// an untagged library incomplete on no evidence.
|
|
name: "no totals declared at all",
|
|
tracks: []track{
|
|
{recordingID: 400, disc: 1, number: 1},
|
|
{recordingID: 401, disc: 1, number: 2},
|
|
},
|
|
wantOwned: 2,
|
|
wantExpected: 0,
|
|
wantKnown: false,
|
|
wantComplete: false,
|
|
},
|
|
{
|
|
// Totals are per disc, so the expectation is a sum and not
|
|
// a single number — the bug this shape exists to catch is
|
|
// reading one disc's "10" as the whole album's.
|
|
name: "two discs, one short",
|
|
tracks: append(disc(1, 500, 10, 10), disc(2, 600, 2, 5)...),
|
|
wantOwned: 12,
|
|
wantExpected: 15,
|
|
wantKnown: true,
|
|
wantComplete: false,
|
|
},
|
|
{
|
|
name: "two discs, both complete",
|
|
tracks: append(disc(1, 700, 10, 10), disc(2, 800, 5, 5)...),
|
|
wantOwned: 15,
|
|
wantExpected: 15,
|
|
wantKnown: true,
|
|
wantComplete: true,
|
|
},
|
|
{
|
|
// One disc ripped by a tagger that wrote totals, one by a
|
|
// tagger that did not. The album's total is unknowable —
|
|
// the disc that did declare cannot stand in for the one
|
|
// that did not.
|
|
name: "one disc untotalled",
|
|
tracks: append(
|
|
disc(1, 900, 10, 10),
|
|
track{recordingID: 950, disc: 2, number: 1},
|
|
),
|
|
wantOwned: 11,
|
|
wantExpected: 10,
|
|
wantKnown: false,
|
|
wantComplete: false,
|
|
},
|
|
{
|
|
// This app detects duplicates, so it must not be fooled by
|
|
// them: two files of track 3 are one track held, and
|
|
// counting both would report a short album as complete.
|
|
name: "a duplicated track counts once",
|
|
tracks: append(
|
|
disc(1, 1000, 5, 6),
|
|
track{recordingID: 1099, disc: 1, number: 3, total: 6},
|
|
),
|
|
wantOwned: 5,
|
|
wantExpected: 6,
|
|
wantKnown: true,
|
|
wantComplete: false,
|
|
},
|
|
{
|
|
// Untotalled *and* unnumbered: the fallback keys off the
|
|
// recording id, so these must not collapse into one.
|
|
name: "unnumbered tracks stay distinct",
|
|
tracks: []track{
|
|
{recordingID: 1100, disc: 1},
|
|
{recordingID: 1101, disc: 1},
|
|
{recordingID: 1102, disc: 1},
|
|
},
|
|
wantOwned: 3,
|
|
wantExpected: 0,
|
|
wantKnown: false,
|
|
wantComplete: false,
|
|
},
|
|
}
|
|
|
|
for i, tc := range cases {
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
lib, _ := setupTestLibrary(t)
|
|
albumID := i + 1
|
|
|
|
stageAlbum(t, lib, albumID, tc.tracks)
|
|
|
|
got, err := lib.GetAlbumCompleteness(albumIDFor(t, lib, albumID))
|
|
if err != nil {
|
|
t.Fatalf("GetAlbumCompleteness: %v", err)
|
|
}
|
|
|
|
if got.Owned != tc.wantOwned {
|
|
t.Errorf("owned = %d, want %d", got.Owned, tc.wantOwned)
|
|
}
|
|
|
|
if got.Expected != tc.wantExpected {
|
|
t.Errorf("expected = %d, want %d", got.Expected, tc.wantExpected)
|
|
}
|
|
|
|
if got.Known != tc.wantKnown {
|
|
t.Errorf("known = %v, want %v", got.Known, tc.wantKnown)
|
|
}
|
|
|
|
if got.Complete != tc.wantComplete {
|
|
t.Errorf("complete = %v, want %v", got.Complete, tc.wantComplete)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
// An album with no rows at all must not read as "complete" by virtue of
|
|
// holding everything it knows about, which is nothing.
|
|
func TestGetAlbumCompleteness_EmptyAlbum(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
lib, _ := setupTestLibrary(t)
|
|
|
|
got, err := lib.GetAlbumCompleteness(999)
|
|
if err != nil {
|
|
t.Fatalf("GetAlbumCompleteness: %v", err)
|
|
}
|
|
|
|
if got.Known || got.Complete || got.Owned != 0 {
|
|
t.Errorf("empty album reported %+v, want zero and unknown", got)
|
|
}
|
|
}
|