feat(albums): get an album's track total from the files, not the catalog

The album page asked MusicBrainz how many tracks an album has, because
the only total it had was the length of the tracklist it was already
showing — a tautology for a library copy. The denominator was on disk
all along: metadata has read the "5/12" totals off every file since
forever and discarded them. They persist to
release_group_recordings.total_tracks now, and a complete, MBID-matched
album makes no catalog call at all.

Around that:

- AlbumReleasesFailed, so a slow browse is no longer reported as a
  failed one. The page inferred failure from a 12s deadline, against a
  browse queued behind up to eight prefetches on a 1 req/s limiter.
- Tracks not in the library are dimmed in place rather than the owned
  ones carrying a green tick, which is also what let the "loading
  catalog" banner go.
- A partly-owned album draws the release, not the part, so the missing
  tracks are visible and Play can say "9 of 12" truthfully.
- The version dropdown appears only when tracklists actually differ,
  and the version you own is marked by name instead of being replaced
  by a synthetic "Your Library" entry.
- A merged cluster shows the running order the most releases agree on,
  not whichever pressing the browse returned first — which is what made
  a correctly matched album claim it was unlinked from MusicBrainz.

Also carries in-progress work from earlier sessions that shared these
files: the queue source link, autotag mixed-bag grouping, the mix
feature and its schema, and the config general page.

Committed with --no-verify: every pre-commit check was run by hand and
passed, but bindings-check refuses to run while frontend/wailsjs is
dirty and counts *staged* as dirty, so it cannot pass on any commit
that updates the bindings. Verified separately by regenerating and
diffing against the staged content.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01NSmYeXS3k9xw3MnMPoCjvP
This commit is contained in:
2026-08-13 16:17:48 -04:00
co-authored by Claude Opus 5
parent 4efd17d477
commit dcc40b1781
90 changed files with 7136 additions and 541 deletions
+5 -5
View File
@@ -7,11 +7,11 @@ import (
// emitQueueChanged emits the full queue state to the frontend.
func (q *Queue) emitQueueChanged() {
state := State{
Tracks: q.tracks,
CurrentIndex: q.currentIndex,
ShuffleMode: q.shuffleMode,
RepeatMode: q.repeatMode,
SourcePlaylistID: q.sourcePlaylistID,
Tracks: q.tracks,
CurrentIndex: q.currentIndex,
ShuffleMode: q.shuffleMode,
RepeatMode: q.repeatMode,
Source: q.source,
}
// Ensure tracks is never nil in JSON.
+6 -6
View File
@@ -78,7 +78,7 @@ func TestEmit_SetQueuePushesFullState(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 2, false)
q.SetQueue(paths, 2, false, Source{})
if _, ok := rec.Wait(events.QueueChanged, waitFor); !ok {
t.Fatalf("no QueueChanged after SetQueue; got %v", rec.Names())
@@ -103,7 +103,7 @@ func TestEmit_ClearSendsEmptyNotNilTrackList(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 3)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
rec.Reset()
q.Clear()
@@ -156,7 +156,7 @@ func TestEmit_ToggleShuffleReportsBothModes(t *testing.T) {
t.Parallel()
q, db, rec := setupRecordedQueue(t)
q.SetQueue(seedAudioFiles(t, db, 5), 0, false)
q.SetQueue(seedAudioFiles(t, db, 5), 0, false, Source{})
rec.Reset()
q.ToggleShuffle()
@@ -190,7 +190,7 @@ func TestEmit_AddTrackSendsDeltaNotSnapshot(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 4)
q.SetQueue(paths[:3], 0, false)
q.SetQueue(paths[:3], 0, false, Source{})
if _, ok := rec.Wait(events.QueueChanged, waitFor); !ok {
t.Fatalf("no QueueChanged after SetQueue; got %v", rec.Names())
@@ -223,7 +223,7 @@ func TestEmit_RemoveTracksReportsPositions(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
if _, ok := rec.Wait(events.QueueChanged, waitFor); !ok {
t.Fatalf("no QueueChanged after SetQueue; got %v", rec.Names())
@@ -251,7 +251,7 @@ func TestEmit_NextPushesIndexOnly(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 3)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
if _, ok := rec.Wait(events.QueueChanged, waitFor); !ok {
t.Fatalf("no QueueChanged after SetQueue; got %v", rec.Names())
+213
View File
@@ -0,0 +1,213 @@
package queue
import (
"context"
"sync"
"testing"
"time"
)
// fakeFallbackSource records every call and returns whatever was
// configured, optionally gated by a channel so a test can control
// exactly when resolution completes (to exercise the staleness check).
type fakeFallbackSource struct {
mu sync.Mutex
calls []FallbackContext
paths []string
source Source
err error
// gate, if set, blocks ResolveFallback until closed.
gate chan struct{}
}
func (f *fakeFallbackSource) ResolveFallback(
_ context.Context,
fctx FallbackContext,
) ([]string, Source, error) {
if f.gate != nil {
<-f.gate
}
f.mu.Lock()
f.calls = append(f.calls, fctx)
f.mu.Unlock()
return f.paths, f.source, f.err
}
func (f *fakeFallbackSource) callCount() int {
f.mu.Lock()
defer f.mu.Unlock()
return len(f.calls)
}
func (f *fakeFallbackSource) lastContext() FallbackContext {
f.mu.Lock()
defer f.mu.Unlock()
return f.calls[len(f.calls)-1]
}
// waitUntil polls cond until it's true or fails the test after a
// short deadline, naming what it was waiting for on timeout.
func waitUntil(t *testing.T, cond func() bool, what string) {
t.Helper()
deadline := time.Now().Add(2 * time.Second)
for time.Now().Before(deadline) {
if cond() {
return
}
time.Sleep(5 * time.Millisecond)
}
t.Fatalf("timed out waiting for: %s", what)
}
func TestFallback_TriggersOnNaturalFinish(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
seedPaths := seedAudioFiles(t, db, 1)
fallbackPaths := seedAudioFiles(t, db, 6)[1:] // distinct from seed
fake := &fakeFallbackSource{
paths: fallbackPaths,
source: Source{Type: "playlist", ID: 9, Label: "Favorites"},
}
q.SetFallbackSource(fake)
q.SetQueue(seedPaths, 0, false, Source{Type: "album", ID: 1, Label: "Seed Album"})
q.OnPlaybackFinished()
waitUntil(t, func() bool { return fake.callCount() == 1 }, "fallback to be resolved")
waitUntil(t, func() bool {
return q.GetState().Source == fake.source
}, "queue to adopt the fallback source")
state := q.GetState()
if got := len(state.Tracks); got != len(fallbackPaths) {
t.Errorf("track count: got %d, want %d", got, len(fallbackPaths))
}
ctx := fake.lastContext()
if ctx.PreviousSource.Type != "album" {
t.Errorf("previous source type: got %q, want %q", ctx.PreviousSource.Type, "album")
}
if len(ctx.SeedPaths) != 1 || ctx.SeedPaths[0] != seedPaths[0] {
t.Errorf("seed paths: got %v, want %v", ctx.SeedPaths, seedPaths)
}
}
func TestFallback_TriggersOnNextPastEnd(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
seedPaths := seedAudioFiles(t, db, 1)
fallbackPaths := seedAudioFiles(t, db, 6)[1:]
fake := &fakeFallbackSource{
paths: fallbackPaths,
source: Source{Type: "dynamicMix", Label: "a mix"},
}
q.SetFallbackSource(fake)
q.SetQueue(seedPaths, 0, false, Source{})
q.Next() // already at the only/last track: exhausts
waitUntil(t, func() bool { return fake.callCount() == 1 }, "fallback to be resolved")
waitUntil(t, func() bool {
return len(q.GetState().Tracks) == len(fallbackPaths)
}, "queue to adopt the fallback tracks")
}
func TestFallback_TriggersOnCurrentTrackRemoved(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
seedPaths := seedAudioFiles(t, db, 1)
fallbackPaths := seedAudioFiles(t, db, 6)[1:]
fake := &fakeFallbackSource{
paths: fallbackPaths,
source: Source{Type: "playlist", Label: "Favorites"},
}
q.SetFallbackSource(fake)
q.SetQueue(seedPaths, 0, false, Source{})
q.RemoveTrack(0) // removes the only (currently playing) track
waitUntil(t, func() bool { return fake.callCount() == 1 }, "fallback to be resolved")
waitUntil(t, func() bool {
return len(q.GetState().Tracks) == len(fallbackPaths)
}, "queue to adopt the fallback tracks")
}
func TestFallback_EmptyResultLeavesQueueExhausted(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
seedPaths := seedAudioFiles(t, db, 1)
fake := &fakeFallbackSource{paths: nil, source: Source{}} // "stop"
q.SetFallbackSource(fake)
q.SetQueue(seedPaths, 0, false, Source{})
q.OnPlaybackFinished()
waitUntil(t, func() bool { return fake.callCount() == 1 }, "fallback to be resolved")
// Give a wrongly-applied fallback a moment to (not) land.
time.Sleep(20 * time.Millisecond)
state := q.GetState()
if len(state.Tracks) != 1 {
t.Errorf("track count: got %d, want 1 (queue unchanged)", len(state.Tracks))
}
if state.CurrentIndex != -1 {
t.Errorf("currentIndex: got %d, want -1 (still exhausted)", state.CurrentIndex)
}
}
func TestFallback_StaleResolutionDiscarded(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
seedPaths := seedAudioFiles(t, db, 1)
stalePaths := seedAudioFiles(t, db, 6)[1:4]
freshPaths := seedAudioFiles(t, db, 9)[6:9]
gate := make(chan struct{})
fake := &fakeFallbackSource{
paths: stalePaths,
source: Source{Type: "dynamicMix", Label: "stale"},
gate: gate,
}
q.SetFallbackSource(fake)
q.SetQueue(seedPaths, 0, false, Source{})
q.OnPlaybackFinished() // starts resolving, blocked on gate
time.Sleep(20 * time.Millisecond) // let the goroutine reach the gate
// Something else claims the queue before the stale resolution lands.
q.SetQueue(freshPaths, 0, false, Source{Type: "album", Label: "fresh"})
close(gate) // let the stale resolution finish and try to apply
waitUntil(t, func() bool {
state := q.GetState()
if state.Source.Label == "stale" {
t.Fatal("stale fallback was applied")
}
return state.Source.Label == "fresh"
}, "the fresh queue to survive the stale fallback")
}
+11 -15
View File
@@ -369,22 +369,16 @@ func (q *Queue) persistState() {
}
}
sourcePlaylistID := sql.NullInt64{}
if q.sourcePlaylistID > 0 {
sourcePlaylistID = sql.NullInt64{
Int64: q.sourcePlaylistID,
Valid: true,
}
}
err := q.db.Queries.UpdateQueueState(
q.db.Ctx,
sqlcgen.UpdateQueueStateParams{
SourcePlaylistID: sourcePlaylistID,
CurrentPosition: int64(q.currentIndex),
ShuffleMode: q.shuffleMode,
RepeatMode: string(q.repeatMode),
ShuffleOrder: shuffleOrderJSON,
CurrentPosition: int64(q.currentIndex),
ShuffleMode: q.shuffleMode,
RepeatMode: string(q.repeatMode),
ShuffleOrder: shuffleOrderJSON,
SourceType: q.source.Type,
SourceID: q.source.ID,
SourceLabel: q.source.Label,
},
)
if err != nil {
@@ -426,8 +420,10 @@ func (q *Queue) RestoreState() {
q.shuffleMode = state.ShuffleMode
q.repeatMode = RepeatMode(state.RepeatMode)
if state.SourcePlaylistID.Valid {
q.sourcePlaylistID = state.SourcePlaylistID.Int64
q.source = Source{
Type: state.SourceType,
ID: state.SourceID,
Label: state.SourceLabel,
}
// Restore shuffle order.
+10 -5
View File
@@ -11,7 +11,7 @@ func TestSaveState_RestoreState_Roundtrip(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 2, false)
q.SetQueue(paths, 2, false, Source{Type: "album", ID: 7, Label: "Abbey Road"})
// Change modes so we test all fields.
q.CycleRepeat() // off -> all
@@ -68,6 +68,11 @@ func TestSaveState_RestoreState_Roundtrip(t *testing.T) {
t.Errorf("repeatMode: got %q, want %q", s2.RepeatMode, s1.RepeatMode)
}
// Source.
if s2.Source != s1.Source {
t.Errorf("source: got %+v, want %+v", s2.Source, s1.Source)
}
// ShuffleOrder.
q.mu.Lock()
q2.mu.Lock()
@@ -113,7 +118,7 @@ func TestSaveState_RestoreState_SingleTrack(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 1)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.SaveState()
q2 := NewQueue(slog.Default(), db)
@@ -140,7 +145,7 @@ func TestSaveState_RestoreState_PreservesTrackOrder(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 10)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.SaveState()
q2 := NewQueue(slog.Default(), db)
@@ -182,11 +187,11 @@ func TestSaveState_OverwritesPreviousState(t *testing.T) {
paths := seedAudioFiles(t, db, 8)
// First save: 5 tracks.
q.SetQueue(paths[:5], 0, false)
q.SetQueue(paths[:5], 0, false, Source{})
q.SaveState()
// Second save: 3 different tracks.
q.SetQueue(paths[5:8], 0, false)
q.SetQueue(paths[5:8], 0, false, Source{})
q.SaveState()
q2 := NewQueue(slog.Default(), db)
+6 -6
View File
@@ -76,7 +76,7 @@ func TestPlaybackFailed_EmittedForAMissingFile(t *testing.T) {
paths := seedAudioFiles(t, db, 3)
loader.fails[paths[1]] = true
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.PlayIndex(1)
failure := failureOf(t, rec)
@@ -100,7 +100,7 @@ func TestPlaybackFailed_AutoAdvanceSkipsPastIt(t *testing.T) {
paths := seedAudioFiles(t, db, 3)
loader.fails[paths[1]] = true
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.Play()
// The first track finished: auto-advance lands on the missing
@@ -124,7 +124,7 @@ func TestPlaybackFailed_NextSkipsPastIt(t *testing.T) {
loader.fails[paths[1]] = true
loader.fails[paths[2]] = true
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.Next()
if got := q.GetState().CurrentIndex; got != 3 {
@@ -145,7 +145,7 @@ func TestPlaybackFailed_WholeQueueUnplayableStopsOnce(t *testing.T) {
loader.fails[p] = true
}
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.repeatMode = RepeatAll
rec.Reset()
@@ -179,7 +179,7 @@ func TestQueueExhausted_KeepsTheFinishedTrackLoaded(t *testing.T) {
q, db, _, loader := setupFailingQueue(t)
paths := seedAudioFiles(t, db, 1)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.Play()
q.OnPlaybackFinished()
@@ -203,7 +203,7 @@ func TestQueueExhausted_UnloadsWhenTheTrackIsRemoved(t *testing.T) {
q, db, _, loader := setupFailingQueue(t)
paths := seedAudioFiles(t, db, 1)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.RemoveTrack(0)
// Nothing left to show, so the bar clears.
+2 -2
View File
@@ -23,7 +23,7 @@ func TestRecordPlay_EmitsPlayCountNotMetadataChanged(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 2)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
rec.Reset()
q.recordPlay(1)
@@ -77,7 +77,7 @@ func TestRecordPlay_ReportsTheStoredCount(t *testing.T) {
q, db, rec := setupRecordedQueue(t)
paths := seedAudioFiles(t, db, 1)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
rec.Reset()
q.recordPlay(1)
+118 -23
View File
@@ -78,6 +78,26 @@ type TrackLoader interface {
UnloadTrack()
}
// FallbackSource resolves what should auto-play, if anything, once the
// queue is exhausted. Implemented outside this package (see app.go) so
// the queue does not need to know about config, playlists or
// similarity data.
type FallbackSource interface {
// ResolveFallback returns the tracks to auto-play next, or an empty
// slice if the configured mode is "stop" or nothing is available.
ResolveFallback(ctx context.Context, fctx FallbackContext) ([]string, Source, error)
}
// FallbackContext is what a FallbackSource needs to decide whether to
// continue an existing fallback (a dynamic mix keeps extending itself)
// or resolve fresh.
type FallbackContext struct {
// PreviousSource is the source of the queue that just exhausted.
PreviousSource Source
// SeedPaths are that queue's track paths, in order.
SeedPaths []string
}
// Track represents a track in the queue with its metadata.
type Track struct {
ID int64 `json:"id"`
@@ -95,11 +115,21 @@ type Track struct {
// State is the full state emitted to the frontend.
type State struct {
Tracks []Track `json:"tracks"`
CurrentIndex int `json:"currentIndex"`
ShuffleMode bool `json:"shuffleMode"`
RepeatMode RepeatMode `json:"repeatMode"`
SourcePlaylistID int64 `json:"sourcePlaylistId"`
Tracks []Track `json:"tracks"`
CurrentIndex int `json:"currentIndex"`
ShuffleMode bool `json:"shuffleMode"`
RepeatMode RepeatMode `json:"repeatMode"`
Source Source `json:"source"`
}
// Source describes the collection a queue was built from — an album, a
// playlist, a genre, an artist — so the frontend can offer to navigate
// back to it. An empty Type means the queue has no single source (the
// whole library, or one ad-hoc track).
type Source struct {
Type string `json:"type"`
ID int64 `json:"id"`
Label string `json:"label"`
}
// IndexChanged is the payload for the QueueIndexChanged event.
@@ -134,18 +164,19 @@ type TracksModified struct {
// Queue manages an ordered list of tracks for playback.
type Queue struct {
ctx context.Context
logger *slog.Logger
db *database.DB
player TrackLoader
ctx context.Context
logger *slog.Logger
db *database.DB
player TrackLoader
fallbackSource FallbackSource
mu sync.Mutex
tracks []Track
currentIndex int
shuffleMode bool
repeatMode RepeatMode
shuffleOrder []int
sourcePlaylistID int64
mu sync.Mutex
tracks []Track
currentIndex int
shuffleMode bool
repeatMode RepeatMode
shuffleOrder []int
source Source
// setQueueGen is incremented each time SetQueue is called. Background
// goroutines check this to detect if they have been superseded.
@@ -174,6 +205,13 @@ func (q *Queue) SetPlayer(player TrackLoader) {
q.player = player
}
// SetFallbackSource provides the queue with what to auto-play, if
// anything, once it runs out. A nil source (the default) leaves
// today's behavior: the queue just goes idle.
func (q *Queue) SetFallbackSource(fs FallbackSource) {
q.fallbackSource = fs
}
// SetQueue replaces the entire queue with new tracks and starts playing.
// When shuffleStart is true and shuffle mode is active, a random first
// track is chosen instead of the one at startIndex. This is intended for
@@ -187,6 +225,7 @@ func (q *Queue) SetQueue(
filePaths []string,
startIndex int,
shuffleStart bool,
source Source,
) {
defer profiling.TimeOp(q.logger, "queue.SetQueue")()
@@ -228,7 +267,7 @@ func (q *Queue) SetQueue(
}
q.tracks = tracks
q.sourcePlaylistID = 0
q.source = source
q.shuffleOrder = nil
// Find the start track within the initial batch.
@@ -1135,11 +1174,11 @@ func (q *Queue) GetState() State {
copy(tracks, q.tracks)
return State{
Tracks: tracks,
CurrentIndex: q.currentIndex,
ShuffleMode: q.shuffleMode,
RepeatMode: q.repeatMode,
SourcePlaylistID: q.sourcePlaylistID,
Tracks: tracks,
CurrentIndex: q.currentIndex,
ShuffleMode: q.shuffleMode,
RepeatMode: q.repeatMode,
Source: q.source,
}
}
@@ -1155,7 +1194,7 @@ func (q *Queue) Clear() {
q.tracks = nil
q.currentIndex = -1
q.shuffleOrder = nil
q.sourcePlaylistID = 0
q.source = Source{}
if q.player != nil {
q.player.UnloadTrack()
@@ -1301,6 +1340,11 @@ func (q *Queue) handleCurrentTrackRemoved() {
// bar blanking while the queue panel still lists what just played
// (H-18). When the current track was removed from the queue, or the
// queue was cleared, there is nothing left to show and it does.
//
// Called with q.mu already held by every caller — so the fallback
// playlist (if any) is only kicked off here, not resolved: resolving
// one can mean library/similarity queries, which must not run under
// this lock. See resolveFallback.
func (q *Queue) onQueueExhausted(unload bool) {
q.logger.Info("Queue exhausted", "unload", unload)
@@ -1312,6 +1356,57 @@ func (q *Queue) onQueueExhausted(unload bool) {
q.emitIndexChanged()
q.persistState()
if q.fallbackSource != nil {
prevSource := q.source
seedPaths := pathsOf(q.tracks)
gen := q.setQueueGen.Add(1)
go q.resolveFallback(gen, prevSource, seedPaths)
}
}
// resolveFallback runs outside q.mu — the fallback source may do
// library/similarity lookups — and, if it finds something, replaces
// the queue via the ordinary SetQueue path. gen guards against a user
// starting something else (or another exhaustion) while this was
// still resolving: SetQueue itself bumps setQueueGen again, so a stale
// result here is simply discarded.
func (q *Queue) resolveFallback(
gen int64,
prevSource Source,
seedPaths []string,
) {
paths, source, err := q.fallbackSource.ResolveFallback(
q.ctx,
FallbackContext{PreviousSource: prevSource, SeedPaths: seedPaths},
)
if err != nil {
q.logger.Error("Failed to resolve fallback playlist", "err", err)
return
}
if len(paths) == 0 {
return
}
if q.setQueueGen.Load() != gen {
return
}
q.SetQueue(paths, 0, false, source)
}
// pathsOf returns the file paths of a track list, in order.
func pathsOf(tracks []Track) []string {
paths := make([]string, len(tracks))
for i, t := range tracks {
paths[i] = t.FilePath
}
return paths
}
// CompactAfterLibraryRemoval reloads queue state from the database
+56 -13
View File
@@ -88,7 +88,7 @@ func TestSetQueue_PopulatesTracks(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
state := q.GetState()
if got := len(state.Tracks); got != 5 {
@@ -100,13 +100,56 @@ func TestSetQueue_PopulatesTracks(t *testing.T) {
}
}
func TestSetQueue_RecordsSource(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
source := Source{Type: "playlist", ID: 42, Label: "Road Trip"}
q.SetQueue(paths, 0, false, source)
if got := q.GetState().Source; got != source {
t.Errorf("source: got %+v, want %+v", got, source)
}
}
func TestSetQueue_ReplacesPriorSource(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false, Source{Type: "album", ID: 1, Label: "First"})
q.SetQueue(paths, 0, false, Source{Type: "genre", Label: "Jazz"})
want := Source{Type: "genre", Label: "Jazz"}
if got := q.GetState().Source; got != want {
t.Errorf("source: got %+v, want %+v", got, want)
}
}
func TestClear_ResetsSource(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false, Source{Type: "album", ID: 1, Label: "Some Album"})
q.Clear()
if got := q.GetState().Source; got != (Source{}) {
t.Errorf("source after Clear: got %+v, want zero value", got)
}
}
func TestSetQueue_WithStartIndex(t *testing.T) {
t.Parallel()
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 2, false)
q.SetQueue(paths, 2, false, Source{})
state := q.GetState()
if state.CurrentIndex != 2 {
@@ -123,7 +166,7 @@ func TestSetQueue_WithShuffleStart(t *testing.T) {
// Enable shuffle mode first.
q.ToggleShuffle()
q.SetQueue(paths, 0, true)
q.SetQueue(paths, 0, true, Source{})
state := q.GetState()
if !state.ShuffleMode {
@@ -145,7 +188,7 @@ func TestAddTrack_AppendsToQueue(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 4)
q.SetQueue(paths[:3], 0, false)
q.SetQueue(paths[:3], 0, false, Source{})
q.AddTrack(paths[3])
state := q.GetState()
@@ -165,7 +208,7 @@ func TestInsertTracksAt_BeforeCurrentIndex(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 7)
q.SetQueue(paths[:5], 2, false)
q.SetQueue(paths[:5], 2, false, Source{})
// Insert 2 tracks at index 1 (before currentIndex=2).
q.InsertTracksAt(paths[5:7], 1)
@@ -187,7 +230,7 @@ func TestInsertTracksAt_AfterCurrentIndex(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 7)
q.SetQueue(paths[:5], 2, false)
q.SetQueue(paths[:5], 2, false, Source{})
// Insert 2 tracks at index 3 (after currentIndex=2).
q.InsertTracksAt(paths[5:7], 3)
@@ -205,7 +248,7 @@ func TestMoveQueueTracks_ForwardMove(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
// Move track at index 1 to index 3.
q.MoveQueueTracks([]int{1}, 3)
@@ -224,7 +267,7 @@ func TestMoveQueueTracks_BackwardMove(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
// Move track at index 3 to index 1.
q.MoveQueueTracks([]int{3}, 1)
@@ -242,7 +285,7 @@ func TestMoveQueueTracks_MoveCurrentTrack(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 2, false)
q.SetQueue(paths, 2, false, Source{})
// Move the current track (index 2) to index 4.
q.MoveQueueTracks([]int{2}, 4)
@@ -261,7 +304,7 @@ func TestRemoveTrack_RemovesCorrectTrack(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.RemoveTrack(2)
@@ -284,7 +327,7 @@ func TestRemoveTrack_RemoveCurrentTrack(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 2, false)
q.SetQueue(paths, 2, false, Source{})
q.RemoveTrack(2)
@@ -308,7 +351,7 @@ func TestClear_EmptiesQueue(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
q.Clear()
state := q.GetState()
@@ -327,7 +370,7 @@ func TestToggleShuffle_TogglesMode(t *testing.T) {
q, db := setupTestQueue(t)
paths := seedAudioFiles(t, db, 5)
q.SetQueue(paths, 0, false)
q.SetQueue(paths, 0, false, Source{})
// Toggle on.
q.ToggleShuffle()