playlist: simplified playlist.queued updates
Before every operation which modifies the playlist, remember a pointer
to the song struct. After the modification, determine the "next song"
again, and if it differs, dequeue and queue the new song.
This removes a lot of complexity from the playlist update code, and
makes it more robust.
Showing
This diff is collapsed.
Click to expand it.
Please
register
or
sign in
to comment