Compare commits
63
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
c4e055ce51 | ||
|
|
10eca353ab | ||
|
|
88fc50afb8 | ||
|
|
19c68d73a7 | ||
|
|
41c41a860e | ||
|
|
4bf59b45b7 | ||
|
|
fc99d9e0d7 | ||
|
|
90f1239fba | ||
|
|
b2fe1cb1e0 | ||
|
|
065a879190 | ||
|
|
89882b4863 | ||
|
|
18a08daa91 | ||
|
|
aa59773d22 | ||
|
|
a4777f26b6 | ||
|
|
92faa9741b | ||
|
|
bf0a53e64c | ||
|
|
7be4a02e31 | ||
|
|
ad9c25a5a2 | ||
|
|
a83a127e31 | ||
|
|
4b9114fd8d | ||
|
|
e049a71458 | ||
|
|
0c944f2382 | ||
|
|
75525b67e4 | ||
|
|
85768dc489 | ||
|
|
1a221a40d3 | ||
|
|
0821deb877 | ||
|
|
31ada14111 | ||
|
|
20139394f3 | ||
|
|
eb139cf872 | ||
|
|
ae82fd2233 | ||
|
|
3c3197df4b | ||
|
|
e16bd245bd | ||
|
|
887a9324b4 | ||
|
|
fcb484ead5 | ||
|
|
48de41cd69 | ||
|
|
66a6ee63ab | ||
|
|
10660c8168 | ||
|
|
441b67daaa | ||
|
|
026f26bdf6 | ||
|
|
73dc80bdc9 | ||
|
|
760021ea5a | ||
|
|
63ec068add | ||
|
|
a2ff0aed4c | ||
|
|
12e75ee24c | ||
|
|
792e87298b | ||
|
|
266e7032dd | ||
|
|
d6b48fb3ac | ||
|
|
3bf27e3fd5 | ||
|
|
185eb1b125 | ||
|
|
b3556d825c | ||
|
|
bf4f352117 | ||
|
|
1062b7c0bc | ||
|
|
48abecb830 | ||
|
|
e1c07438e9 | ||
|
|
6e563f3846 | ||
|
|
590a0d86dd | ||
|
|
36af7090d9 | ||
|
|
3e142f8c35 | ||
|
|
3d375adab1 | ||
|
|
e3d492e130 | ||
|
|
e6f30b6e43 | ||
|
|
351798fd66 | ||
|
|
40984f6086 |
@@ -139,6 +139,23 @@ jobs:
|
|||||||
echo "skip=true" >> "$GITHUB_OUTPUT"
|
echo "skip=true" >> "$GITHUB_OUTPUT"
|
||||||
exit 0
|
exit 0
|
||||||
fi
|
fi
|
||||||
|
|
||||||
|
# Nor is a prerelease, and this trigger is `v*`, which matches
|
||||||
|
# `v0.4.0-beta.1`. Two reasons it is worst here. The APK goes
|
||||||
|
# to the *generic* registry, which is readable without
|
||||||
|
# credentials so Obtainium can poll a plain URL — a beta would
|
||||||
|
# be offered to every device on it. And the versionCode maths
|
||||||
|
# below splits on dots and would read "1" out of "0-beta",
|
||||||
|
# producing a code that is wrong rather than a build that
|
||||||
|
# fails: Android orders releases by that integer and refuses
|
||||||
|
# anything not greater than what is installed.
|
||||||
|
case "$v" in
|
||||||
|
*-*)
|
||||||
|
echo "v$v is a prerelease; not publishing an APK for it"
|
||||||
|
echo "skip=true" >> "$GITHUB_OUTPUT"
|
||||||
|
exit 0
|
||||||
|
;;
|
||||||
|
esac
|
||||||
echo "skip=false" >> "$GITHUB_OUTPUT"
|
echo "skip=false" >> "$GITHUB_OUTPUT"
|
||||||
|
|
||||||
# Android orders releases by an integer and refuses anything
|
# Android orders releases by an integer and refuses anything
|
||||||
|
|||||||
@@ -72,6 +72,22 @@ jobs:
|
|||||||
exit 0
|
exit 0
|
||||||
fi
|
fi
|
||||||
|
|
||||||
|
# A prerelease is not a shipment either, and this trigger is
|
||||||
|
# `v*` — which matches `v0.4.0-beta.1`. Nothing produces one
|
||||||
|
# today; the guard is here because the thing that would is
|
||||||
|
# semantic-release's `prerelease: true` channel, a one-line
|
||||||
|
# change in .releaserc.yml whose blast radius is four public
|
||||||
|
# package channels. Same argument as release.yml's
|
||||||
|
# `chore(release):` guard: cheap, against something a future
|
||||||
|
# edit turns on somewhere else entirely.
|
||||||
|
case "$v" in
|
||||||
|
*-*)
|
||||||
|
echo "$v is a prerelease; not packaging it for pacman"
|
||||||
|
echo "skip=true" >> "$GITHUB_OUTPUT"
|
||||||
|
exit 0
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
echo "skip=false" >> "$GITHUB_OUTPUT"
|
echo "skip=false" >> "$GITHUB_OUTPUT"
|
||||||
echo "tag=$v" >> "$GITHUB_OUTPUT"
|
echo "tag=$v" >> "$GITHUB_OUTPUT"
|
||||||
echo "building $v"
|
echo "building $v"
|
||||||
|
|||||||
@@ -95,6 +95,19 @@ jobs:
|
|||||||
exit 0
|
exit 0
|
||||||
fi
|
fi
|
||||||
|
|
||||||
|
# Nor is a prerelease, and this trigger is `v*`, which matches
|
||||||
|
# `v0.4.0-beta.1`. The mildest of the four — assets attach to
|
||||||
|
# the prerelease's own Gitea release and no package manager
|
||||||
|
# reads them — but four workflows sharing one trigger should
|
||||||
|
# share one answer about what a shipment is.
|
||||||
|
case "$v" in
|
||||||
|
*-*)
|
||||||
|
echo "$v is a prerelease; not attaching desktop assets"
|
||||||
|
echo "skip=true" >> "$GITHUB_OUTPUT"
|
||||||
|
exit 0
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
echo "skip=false" >> "$GITHUB_OUTPUT"
|
echo "skip=false" >> "$GITHUB_OUTPUT"
|
||||||
echo "tag=$v" >> "$GITHUB_OUTPUT"
|
echo "tag=$v" >> "$GITHUB_OUTPUT"
|
||||||
echo "version=${v#v}" >> "$GITHUB_OUTPUT"
|
echo "version=${v#v}" >> "$GITHUB_OUTPUT"
|
||||||
|
|||||||
@@ -56,6 +56,18 @@ jobs:
|
|||||||
echo "skip=true" >> "$GITHUB_OUTPUT"
|
echo "skip=true" >> "$GITHUB_OUTPUT"
|
||||||
exit 0
|
exit 0
|
||||||
fi
|
fi
|
||||||
|
|
||||||
|
# Nor is a prerelease, and this trigger is `v*`, which matches
|
||||||
|
# `v0.4.0-beta.1`. It matters most here of the four: the tap
|
||||||
|
# is public, and `brew upgrade` would offer a beta to everyone
|
||||||
|
# on it.
|
||||||
|
case "$VERSION" in
|
||||||
|
*-*)
|
||||||
|
echo "$TAG is a prerelease; not syncing it to a public tap"
|
||||||
|
echo "skip=true" >> "$GITHUB_OUTPUT"
|
||||||
|
exit 0
|
||||||
|
;;
|
||||||
|
esac
|
||||||
echo "skip=false" >> "$GITHUB_OUTPUT"
|
echo "skip=false" >> "$GITHUB_OUTPUT"
|
||||||
|
|
||||||
TARBALL="${SOURCE_TARBALL_BASE}/${TAG}.tar.gz"
|
TARBALL="${SOURCE_TARBALL_BASE}/${TAG}.tar.gz"
|
||||||
|
|||||||
@@ -1,11 +1,36 @@
|
|||||||
name: Release
|
name: Release
|
||||||
|
|
||||||
# The sixth workflow, and the one that decides whether the other three
|
# The sixth workflow, and the one that decides whether the other three
|
||||||
# run at all. On every push to main it reads the Conventional Commits
|
# run at all. It reads the Conventional Commits since the last tag, and
|
||||||
# since the last tag, and if any of them is releasable it writes the
|
# if any of them is releasable it writes the changelog, pushes the tag,
|
||||||
# changelog, pushes the tag, and creates the Gitea release whose body is
|
# and creates the Gitea release whose body is that changelog section.
|
||||||
# that changelog section. The publishing workflows are keyed on `v*`, so
|
# The publishing workflows are keyed on `v*`, so the tag push is what
|
||||||
# the tag push is what starts them.
|
# starts them.
|
||||||
|
#
|
||||||
|
# **It is triggered by hand, and there is deliberately no `push`
|
||||||
|
# trigger.** There was one, on `main`, which made the trigger "a PR was
|
||||||
|
# merged" and nothing else: eight releases in twenty-two hours
|
||||||
|
# (v0.0.1 -> v0.3.1) for one session's work, each fanning out to four
|
||||||
|
# publishers on a runner with capacity 1, so ~40 packaging jobs shipped
|
||||||
|
# three issues and ordinary PR CI queued behind them. A version per
|
||||||
|
# merged PR is a version per unit of *work*, not per *shipment*, and
|
||||||
|
# pacman, Homebrew and Obtainium see every one.
|
||||||
|
#
|
||||||
|
# Nothing else had to change to batch them: semantic-release already
|
||||||
|
# reads every commit since the last tag, so five fixes and two feats
|
||||||
|
# become one minor release with all seven in the notes. Release
|
||||||
|
# frequency was only ever how often this file fired.
|
||||||
|
#
|
||||||
|
# This is the rule `index-artifact.yml` states and is the other instance
|
||||||
|
# of: **a job that mutates state which cannot be rebuilt in ten minutes
|
||||||
|
# is triggered deliberately, not by a push.** A release here is a tag,
|
||||||
|
# a Gitea release, an Arch package, a Homebrew formula, a signed APK and
|
||||||
|
# desktop assets — and an Android version going backwards costs the user
|
||||||
|
# their library (docs/android-release.md).
|
||||||
|
#
|
||||||
|
# A schedule was considered and rejected: a cron batches without anyone
|
||||||
|
# having to remember, but it puts the decision back on a timer, which is
|
||||||
|
# the thing being removed.
|
||||||
#
|
#
|
||||||
# **Why the tag is pushed with PACKAGE_TOKEN and not the Actions token.**
|
# **Why the tag is pushed with PACKAGE_TOKEN and not the Actions token.**
|
||||||
# Gitea, like GitHub, does not start a workflow from a ref pushed by a
|
# Gitea, like GitHub, does not start a workflow from a ref pushed by a
|
||||||
@@ -19,9 +44,12 @@ name: Release
|
|||||||
# instead.
|
# instead.
|
||||||
|
|
||||||
on:
|
on:
|
||||||
push:
|
|
||||||
branches: [main]
|
|
||||||
workflow_dispatch:
|
workflow_dispatch:
|
||||||
|
inputs:
|
||||||
|
dry_run:
|
||||||
|
description: "Report what would be released and stop"
|
||||||
|
required: false
|
||||||
|
default: "false"
|
||||||
|
|
||||||
# Cutting a tag is not a thing to cancel halfway: a superseded run must
|
# Cutting a tag is not a thing to cancel halfway: a superseded run must
|
||||||
# finish, not be killed between `git push --tags` and the release POST.
|
# finish, not be killed between `git push --tags` and the release POST.
|
||||||
@@ -163,14 +191,32 @@ jobs:
|
|||||||
# been right, the tag would have been right, every job would have
|
# been right, the tag would have been right, every job would have
|
||||||
# been green, and the release body would have been empty. Check the
|
# been green, and the release body would have been empty. Check the
|
||||||
# notes, not the exit code, before moving any of these.
|
# notes, not the exit code, before moving any of these.
|
||||||
|
# The point of a manual trigger is deliberateness, and deliberate
|
||||||
|
# means being able to look before pulling the lever. `--dry-run`
|
||||||
|
# reports the version and the notes and writes nothing: no tag, no
|
||||||
|
# release, no publishers. `make release-dry` is the same answer
|
||||||
|
# locally; this is it from the runner, against the same commit and
|
||||||
|
# the same tag history, which is what actually decides.
|
||||||
- name: Run semantic-release
|
- name: Run semantic-release
|
||||||
if: steps.guard.outputs.skip == 'false'
|
if: steps.guard.outputs.skip == 'false'
|
||||||
working-directory: /src
|
working-directory: /src
|
||||||
|
env:
|
||||||
|
DRY_RUN: ${{ inputs.dry_run }}
|
||||||
run: |
|
run: |
|
||||||
set -eu
|
set -eu
|
||||||
git config user.name "yellowjacket-ci"
|
git config user.name "yellowjacket-ci"
|
||||||
git config user.email "yj@yellowjacket.app"
|
git config user.email "yj@yellowjacket.app"
|
||||||
|
|
||||||
|
# Anything but a literal "true" releases for real. A typo in a
|
||||||
|
# dispatch box must not silently turn a shipment into a no-op
|
||||||
|
# that reports success — the failure worth avoiding is the one
|
||||||
|
# where nothing happens and the run is green.
|
||||||
|
dry=""
|
||||||
|
if [ "${DRY_RUN:-false}" = "true" ]; then
|
||||||
|
echo "DRY RUN — no tag will be pushed and no release created"
|
||||||
|
dry="--dry-run"
|
||||||
|
fi
|
||||||
|
|
||||||
npx --yes \
|
npx --yes \
|
||||||
-p semantic-release@25 \
|
-p semantic-release@25 \
|
||||||
-p @semantic-release/commit-analyzer@13 \
|
-p @semantic-release/commit-analyzer@13 \
|
||||||
@@ -178,5 +224,5 @@ jobs:
|
|||||||
-p @semantic-release/changelog@7 \
|
-p @semantic-release/changelog@7 \
|
||||||
-p @semantic-release/exec@7 \
|
-p @semantic-release/exec@7 \
|
||||||
-p conventional-changelog-conventionalcommits@9 \
|
-p conventional-changelog-conventionalcommits@9 \
|
||||||
semantic-release \
|
semantic-release $dry \
|
||||||
--repository-url "https://x-access-token:${PACKAGE_TOKEN}@${SERVER_URL#https://}/${REPO}.git"
|
--repository-url "https://x-access-token:${PACKAGE_TOKEN}@${SERVER_URL#https://}/${REPO}.git"
|
||||||
|
|||||||
@@ -0,0 +1,107 @@
|
|||||||
|
name: Unclaim
|
||||||
|
|
||||||
|
# A `Closes #N` footer in a commit body closes the issue on merge — and
|
||||||
|
# leaves `Status/In Progress` on it, because Gitea's auto-close touches
|
||||||
|
# state and nothing else. So #100 was closed and simultaneously marked
|
||||||
|
# as being actively worked on, and `scripts/issue.sh close` (which does
|
||||||
|
# drop the label) is exactly the thing the footer exists to avoid
|
||||||
|
# calling.
|
||||||
|
#
|
||||||
|
# **This hooks the close, not the merge.** Stripping the label in the
|
||||||
|
# PR would work and would be a per-PR habit; habits are what the footer
|
||||||
|
# removed. `issues: [closed]` covers every path an issue can close by —
|
||||||
|
# the footer on merge, `issue.sh close`, someone clicking Close in the
|
||||||
|
# web UI — and asks nothing of anyone at any of them.
|
||||||
|
#
|
||||||
|
# **Reopening deliberately does not restore it.** Reopening says the
|
||||||
|
# work was not finished, not that somebody is at a keyboard doing it
|
||||||
|
# now; the claim gets re-made by whoever picks it up.
|
||||||
|
#
|
||||||
|
# **This is not instant, and should not be described as it.** The
|
||||||
|
# runner has capacity 1 and is shared with an index build that can hold
|
||||||
|
# it for three hours, so a label tweak can queue behind one. Stale for
|
||||||
|
# an afternoon beats stale forever, which is what it was.
|
||||||
|
#
|
||||||
|
# The audit that answers "is this still firing" stays in CLAUDE.md and
|
||||||
|
# is one command:
|
||||||
|
#
|
||||||
|
# ./scripts/issue.sh list --state closed --label "Status/In Progress"
|
||||||
|
#
|
||||||
|
# A workflow that silently stops working is the failure mode this whole
|
||||||
|
# area has already produced once.
|
||||||
|
|
||||||
|
on:
|
||||||
|
issues:
|
||||||
|
types: [closed]
|
||||||
|
|
||||||
|
jobs:
|
||||||
|
unclaim:
|
||||||
|
runs-on: ubuntu-latest
|
||||||
|
container:
|
||||||
|
image: ubuntu:24.04
|
||||||
|
|
||||||
|
steps:
|
||||||
|
- name: Drop the claim label
|
||||||
|
# **Inside a container the act runner selects `sh`, not bash**, so
|
||||||
|
# `set -o pipefail` fails the job on its second line with "Illegal
|
||||||
|
# option" and the step never reaches the API. `homebrew-formula.yml`
|
||||||
|
# carries the same `set -euo pipefail` without trouble because it
|
||||||
|
# runs with **no container**, on the host image where bash is the
|
||||||
|
# default — so "another workflow does it" is not evidence here.
|
||||||
|
shell: bash
|
||||||
|
env:
|
||||||
|
# The automatic Actions token, as release.yml uses for the
|
||||||
|
# floor tag. It needs no more than write access to this repo.
|
||||||
|
TOKEN: ${{ secrets.GITEA_TOKEN }}
|
||||||
|
API: ${{ github.server_url }}/api/v1/repos/${{ github.repository }}
|
||||||
|
ISSUE: ${{ github.event.issue.number }}
|
||||||
|
run: |
|
||||||
|
set -euo pipefail
|
||||||
|
|
||||||
|
# `ca-certificates` is named because `--no-install-recommends`
|
||||||
|
# skips it, and `ubuntu:24.04` ships no CA bundle of its own —
|
||||||
|
# so curl comes up unable to verify TLS against our own Gitea
|
||||||
|
# and fails with "error setting certificate file" (exit 77).
|
||||||
|
# Every other containerised workflow here spells it out for the
|
||||||
|
# same reason; this one did not, and cost a release cycle.
|
||||||
|
apt-get update -qq
|
||||||
|
apt-get install -y -qq --no-install-recommends \
|
||||||
|
ca-certificates curl jq >/dev/null
|
||||||
|
|
||||||
|
label_id=$(
|
||||||
|
curl -sSf -H "Authorization: token $TOKEN" "$API/labels?limit=100" |
|
||||||
|
jq -r '.[] | select(.name == "Status/In Progress") | .id'
|
||||||
|
)
|
||||||
|
|
||||||
|
# The label not existing is a repo somebody reorganised, not a
|
||||||
|
# failure of this run — say so and stop, rather than failing a
|
||||||
|
# job on every close from then on.
|
||||||
|
if [ -z "$label_id" ]; then
|
||||||
|
echo "unclaim: no 'Status/In Progress' label in this repo; nothing to do"
|
||||||
|
exit 0
|
||||||
|
fi
|
||||||
|
|
||||||
|
# DELETE is idempotent here: an issue that never carried the
|
||||||
|
# label answers the same as one that did, which is what makes
|
||||||
|
# this safe to run on *every* close rather than only the ones
|
||||||
|
# that were claimed.
|
||||||
|
# The body is captured, not discarded, so a refusal is
|
||||||
|
# diagnosable from this log alone. Whether the automatic
|
||||||
|
# token carries issue-write scope is still unproven, and
|
||||||
|
# "DELETE returned 403" without Gitea's own sentence costs
|
||||||
|
# another merge to find out which of the two it is.
|
||||||
|
body=$(mktemp)
|
||||||
|
code=$(
|
||||||
|
curl -sS -o "$body" -w '%{http_code}' -X DELETE \
|
||||||
|
-H "Authorization: token $TOKEN" \
|
||||||
|
"$API/issues/$ISSUE/labels/$label_id"
|
||||||
|
)
|
||||||
|
|
||||||
|
case "$code" in
|
||||||
|
204) echo "unclaim: #$ISSUE is closed and unclaimed" ;;
|
||||||
|
*)
|
||||||
|
echo "unclaim: DELETE returned $code for #$ISSUE" >&2
|
||||||
|
cat "$body" >&2
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
esac
|
||||||
-118
@@ -1,118 +0,0 @@
|
|||||||
# Work log
|
|
||||||
|
|
||||||
Temporal memory: what happened and what's next. Structure lives in
|
|
||||||
`CLAUDE.md`, operational instructions in `.pi/skills/yellowjacket-dev/`,
|
|
||||||
measured discoveries in `.planning/NOTES.md`. Don't duplicate those here.
|
|
||||||
|
|
||||||
## Current state
|
|
||||||
|
|
||||||
Plan 005 (agent development harness) is **complete — all seven
|
|
||||||
phases**. Everything from phase 1 onward is still **uncommitted**: one
|
|
||||||
large but coherent working-tree diff, nothing pushed.
|
|
||||||
|
|
||||||
All four tiers verified green from a cold, cleaned state:
|
|
||||||
`make ui-test` 313 passed, `make lint` 0 issues × 3 configurations,
|
|
||||||
`make test` green × 3 passes, `make e2e` 19 passed. Both CI jobs
|
|
||||||
verified green in a bare `ubuntu:24.04` container, including 19/19 on
|
|
||||||
WebKit.
|
|
||||||
|
|
||||||
**Committed and pushed** as `5ca6cad` (the harness) + `ccacd67` (a CI
|
|
||||||
fix), and **green on the real runner**: job `check` ~4 min, job `e2e`
|
|
||||||
~3 min with 19/19 chromium *and* 19/19 webkit. One commit rather than
|
|
||||||
seven because the working tree was the end state, not per-phase
|
|
||||||
snapshots — `Makefile`, `CLAUDE.md` and `lefthook.yml` are touched by
|
|
||||||
nearly every phase, so a split would have been fabricated history.
|
|
||||||
|
|
||||||
Still unverified, because no run has failed yet: the
|
|
||||||
`actions/upload-artifact` step (`continue-on-error`, so it cannot mask
|
|
||||||
a real failure) and whether pnpm honours `npm_config_store_dir` for
|
|
||||||
store caching. Worth checking the next time a spec legitimately fails.
|
|
||||||
|
|
||||||
- [ ] `gitea_ci`'s `job_logs` returns 404 on Gitea 1.27.1 — the endpoint
|
|
||||||
is not exposed. Logs come from the VPS instead: `zstdcat` the file
|
|
||||||
under `gitea/actions_log/<owner>/<repo>/<xx>/<task_id>.log.zst`,
|
|
||||||
and note `zstdcat` is not in the gitea container, so
|
|
||||||
`docker cp` it out first. Job status is `action_run_job.status`
|
|
||||||
(1 success, 2 failure, 4 skipped, 5 waiting, 6 running).
|
|
||||||
Probably belongs in the `gitea` skill, not here.
|
|
||||||
|
|
||||||
Open items deliberately not fixed: WAV tags are write-only
|
|
||||||
(`TestWAVTagsAreNotReadableYet`), `themeStore.loadFromBackend`'s failure
|
|
||||||
handler cannot recover, `backend/playlist` has no CRUD suite.
|
|
||||||
|
|
||||||
## Log
|
|
||||||
|
|
||||||
### 2026-08-11 — cold skill run, then phase 7 (CI)
|
|
||||||
|
|
||||||
- **Followed the skill cold first**, as the last session asked. It
|
|
||||||
works: app up from a wiped `.dev/`, an undocumented flow driven
|
|
||||||
(queue panel + shuffle, asserted on `QueueModeChanged`), stopped —
|
|
||||||
~1 minute, no dead ends. One real config bug: `outputDir` in
|
|
||||||
`.playwright/cli.config.json` resolves against **cwd**, not the
|
|
||||||
config file's directory (only `initScript` does that), so snapshots
|
|
||||||
were landing above the repo and a *stale* one from the previous
|
|
||||||
session answered `ls -t` instead. That cost a DOM walk to disprove a
|
|
||||||
regression that did not exist. Four smaller doc gaps fixed
|
|
||||||
(`sandbox-seed` already runs `testdata`; `ui-setup`/`e2e-setup` were
|
|
||||||
undocumented prerequisites; `snapshot` prints a path; `dev-stop`
|
|
||||||
leaves the browser open), plus `dev-headless.sh`'s own banner, which
|
|
||||||
was suggesting the bare `window.go` call its next paragraph warns
|
|
||||||
against.
|
|
||||||
- **Built both CI jobs as container scripts before writing any YAML**,
|
|
||||||
then transcribed the YAML back out and re-ran it to prove the
|
|
||||||
transcription. Push-and-see is a bad loop on a self-hosted runner.
|
|
||||||
- **It found a real bug immediately**: `make lint` omitted
|
|
||||||
`webkit2_41` on all three passes, so it was linting configurations
|
|
||||||
nothing builds. Invisible on Arch (which still ships
|
|
||||||
`webkit2gtk-4.0.pc`), fatal on Ubuntu 24.04. Tag sets now match
|
|
||||||
`make test`.
|
|
||||||
- **Both open decisions settled by measurement**: ALSA `null` PCM for
|
|
||||||
audio (no daemon; the elapsed clock really advances), dead-address
|
|
||||||
stub for the explore artifact (and setting it for the *app* run, not
|
|
||||||
just seeding, is worth 8x on suite wall clock). **WebKit is a
|
|
||||||
required step** — it had never been run anywhere, so one throwaway
|
|
||||||
container run replaced a coin flip with 19/19 at +11 s.
|
|
||||||
|
|
||||||
### 2026-08-10 — phase 6, pi affordances
|
|
||||||
|
|
||||||
- Added `.pi/skills/yellowjacket-dev/` as a directory rather than a flat
|
|
||||||
file: only the description is always in context, so `SKILL.md` stays
|
|
||||||
short enough that reading it whole is never a decision, and the deeper
|
|
||||||
material sits in `references/{harness,fixtures,ui-tier,schema-change}.md`.
|
|
||||||
- Settled the CLAUDE.md-vs-skill split **grammatically, not topically**,
|
|
||||||
because a topical split is what rots — every new fact gets two
|
|
||||||
plausible homes. Three docs, three tenses: NOTES.md is past
|
|
||||||
(measured, dated, append-only), CLAUDE.md is present (what the system
|
|
||||||
is), the skill is imperative (what to run). A new paragraph's tense
|
|
||||||
decides where it goes.
|
|
||||||
- The five gotchas (binding timeouts, first-run wizard, `pkill -f`,
|
|
||||||
seeds-by-running, WebKit-is-CI-only) went **inline in SKILL.md**, not
|
|
||||||
into a reference: you need them before the failure, not after.
|
|
||||||
- Trimmed CLAUDE.md's "Fixtures and the headless harness" section by
|
|
||||||
about half — the command sequences and gotchas it was carrying are now
|
|
||||||
the skill's, and leaving both would have created exactly the duplicate
|
|
||||||
description this repo has a standing rule against.
|
|
||||||
- Added `make skill-check` / `scripts/skill-check.sh` + a pre-commit
|
|
||||||
hook: every command in `.pi/**/*.md` must be a real `make` target, so
|
|
||||||
the Makefile stays the source of truth for invocation and a renamed
|
|
||||||
target fails a commit instead of misleading an agent later. Verified
|
|
||||||
it fails (it caught its own not-yet-created target) and passes.
|
|
||||||
- Added the `/e2e` prompt template: promoting a hand-driven
|
|
||||||
`playwright-cli` session into a spec is a transcription with four
|
|
||||||
fixed substitutions (refs → testids, sleeps → `waitForEvent`, raw
|
|
||||||
`window.go` → `callBinding`, short fixture → `LONG_TRACK`), plus three
|
|
||||||
runs — pass, pass again, pass after a DB restore — because the usual
|
|
||||||
failure is a spec depending on state the hand-driving left behind.
|
|
||||||
- One shell trap: under `set -euo pipefail`, `x="$(make -pqRr | …)"`
|
|
||||||
fails the whole assignment, because `make -q` exits non-zero when a
|
|
||||||
target is out of date and `pipefail` propagates it.
|
|
||||||
|
|
||||||
### Earlier
|
|
||||||
|
|
||||||
Phases 1–5 of plan 005: fixture generator and manifest, headless launch
|
|
||||||
and seeds, the event bridge + `data-testid` pass + `backend/testctl` +
|
|
||||||
`e2e/`, the Vitest component tier + `make bindings-check`, and the
|
|
||||||
`events.Emit` wrapper with its in-process service-event tests. Recaps
|
|
||||||
and the five "verified end to end" blocks are in
|
|
||||||
`.planning/plans/active/005-agent-development-harness.md`; the lessons
|
|
||||||
are in `.planning/NOTES.md`.
|
|
||||||
@@ -3445,3 +3445,138 @@ their own output, and leave the previous snapshots in place.
|
|||||||
makes it worth having: a restored snapshot resolves to `refresh` and
|
makes it worth having: a restored snapshot resolves to `refresh` and
|
||||||
folds in the incremental listens since — minutes, against the 3–23 h a
|
folds in the incremental listens since — minutes, against the 3–23 h a
|
||||||
rebuild was estimating.
|
rebuild was estimating.
|
||||||
|
|
||||||
|
## A green release pipeline can ship an empty changelog (2026-08-18)
|
||||||
|
|
||||||
|
`conventional-changelog-conventionalcommits@10` is silently incompatible
|
||||||
|
with the writer `@semantic-release/release-notes-generator@14` depends on
|
||||||
|
(`conventional-changelog-writer@^8`). Every release note renders as a bare
|
||||||
|
`## 0.0.1 (date)` heading with **no sections and no commits under it**, no
|
||||||
|
step fails, and the release ships with an empty body.
|
||||||
|
|
||||||
|
It is pinned to `9` in `.gitea/workflows/release.yml` and in
|
||||||
|
`make release-dry`, which must stay identical. **Check the rendered notes,
|
||||||
|
never the exit code** — this is invisible to every tick in the pipeline.
|
||||||
|
|
||||||
|
## semantic-release needs push rights to the branch even when it never pushes to it (2026-08-18)
|
||||||
|
|
||||||
|
Core runs `git push --dry-run HEAD:<branch>` as a permission check, before
|
||||||
|
and independently of any plugin. With `@semantic-release/git` removed
|
||||||
|
nothing ever pushes to `main`, and the check still runs.
|
||||||
|
|
||||||
|
Two things this looked like and was not:
|
||||||
|
|
||||||
|
- **Not branch protection.** A `--dry-run` push does not reach the
|
||||||
|
pre-receive hook: pushing one to protected `main` with a write-scoped
|
||||||
|
token succeeds. So `main`'s `enable_push: false` is not what fails here.
|
||||||
|
- **A flat `403 Forbidden`, not Gitea's protection message.** That is the
|
||||||
|
tell. `PACKAGE_TOKEN` had package-write and repo-*read* — enough to
|
||||||
|
clone a private repo, so every other workflow was fine — and needed
|
||||||
|
`write:repository`.
|
||||||
|
|
||||||
|
## A tag-triggered workflow runs the workflow file at the *tagged* commit (2026-08-18)
|
||||||
|
|
||||||
|
Not the one on `main`. Moving `v0.0.0` onto a pre-merge commit ran that
|
||||||
|
commit's version of `homebrew-formula.yml`, which predated the `v0.0.0`
|
||||||
|
skip guard added in the same plan, and it pushed a `0.0.0` formula to the
|
||||||
|
public tap.
|
||||||
|
|
||||||
|
A guard added today does not protect a tag that points at yesterday. When
|
||||||
|
re-pointing a tag, check what the workflows looked like *there*.
|
||||||
|
|
||||||
|
## A tag reader looks at exactly one spelling of "total" (measured 2026-08-18)
|
||||||
|
|
||||||
|
Writing #16's totals means matching the reader, which is
|
||||||
|
`dhowden/tag`, and it is narrower than the specs are:
|
||||||
|
|
||||||
|
- **Vorbis (FLAC, OGG): `TRACKTOTAL` and `DISCTOTAL` only.**
|
||||||
|
`vorbis.go`'s `Track()` reads `tracknumber` and `tracktotal` and
|
||||||
|
nothing else, so `TOTALTRACKS` — which several taggers write and
|
||||||
|
which xiph lists — and a `1/12` packed into `TRACKNUMBER` both read
|
||||||
|
back as *no total*. They write successfully. Nothing errors.
|
||||||
|
- **ID3v2 (MP3): `TRCK`/`TPOS` as `n/N`**, via `parseXofN`. That is one
|
||||||
|
frame carrying two facts, which is why `applyPositionFrame` reads the
|
||||||
|
existing frame before writing either half.
|
||||||
|
- **WAV: nothing at all.** There is no RIFF reader in the module, so a
|
||||||
|
WAV's `id3 ` chunk is invisible to `metadata.ExtractTags` — every
|
||||||
|
field, not just the totals. Filed as #104.
|
||||||
|
|
||||||
|
The general shape, and the reason this is written down: a tag written
|
||||||
|
under a name the reader does not look at is indistinguishable from one
|
||||||
|
never written. So the tests assert the round trip through
|
||||||
|
`metadata.ExtractTags` — the reader the *scan* uses — rather than
|
||||||
|
through the bytes the writer produced.
|
||||||
|
|
||||||
|
## The published catalog artifact predates `total_tracks` (measured 2026-08-18)
|
||||||
|
|
||||||
|
```
|
||||||
|
$ curl -sSI .../generic/yellowjacket-core-index/latest/core-index.db.zst
|
||||||
|
last-modified: Mon, 10 Aug 2026 04:38:16 GMT
|
||||||
|
content-length: 75417037
|
||||||
|
|
||||||
|
$ sqlite3 core-index.db \
|
||||||
|
"SELECT COUNT(*) FROM pragma_table_info('explore_index') WHERE name='total_tracks';"
|
||||||
|
0
|
||||||
|
$ sqlite3 core-index.db "SELECT COUNT(*) FROM explore_index;"
|
||||||
|
1079667
|
||||||
|
```
|
||||||
|
|
||||||
|
The column landed in the schema on 2026-08-16; the artifact is from
|
||||||
|
08-10, and `index-artifact.yml` is a weekly cron, not a push trigger.
|
||||||
|
So `completenessAnswer()`'s catalog fallback answers 0 for **every**
|
||||||
|
user today — the machinery is correct and `artifactHasTotals()` is
|
||||||
|
doing precisely its job, there is just no data behind it. Same position
|
||||||
|
the credit tables are in; both ride on the next publish (#88).
|
||||||
|
|
||||||
|
The general point, which is why this is written down rather than just
|
||||||
|
fixed: **a probe that makes a column optional also makes its absence
|
||||||
|
silent.** `artifactHasTotals` and `artifactHasCredits` are both correct
|
||||||
|
and both mean a feature can ship, pass every test, and produce nothing
|
||||||
|
for anybody without a single failure anywhere. Checking the *published
|
||||||
|
file* is one query and is not implied by any tick in CI.
|
||||||
|
|
||||||
|
## "Do I own this" has two answers in the schema, and one of them is a flag (2026-08-19)
|
||||||
|
|
||||||
|
Decided while doing #38, and it outlives it because every future
|
||||||
|
catalog surface has to pick one.
|
||||||
|
|
||||||
|
`explore_index` carries both `in_library` and `local_artist_id` /
|
||||||
|
`local_release_group_id` / `local_recording_id`. They are written by
|
||||||
|
the same pass (`collectLibraryEntities`), so on a healthy database they
|
||||||
|
agree, and the code read them as an OR — `inLibrary || localId > 0` —
|
||||||
|
at eight call sites.
|
||||||
|
|
||||||
|
They are not the same kind of thing:
|
||||||
|
|
||||||
|
- **`local_*_id` is a fact with an owner.** Every query that sets one
|
||||||
|
joins `audio_files`, and `pruneStaleLocalCrossReferences` clears it
|
||||||
|
with an existence test that is a file test in all three cases. It is
|
||||||
|
the same rule `explore-album-details`'s `filePaths` implements, one
|
||||||
|
layer down and computed once per scan.
|
||||||
|
- **`in_library` is a ratchet.** `upsertBatch` raises it with
|
||||||
|
`MAX(in_library, excluded.in_library)` and the prune is the only
|
||||||
|
thing that lowers it — gated on the local id being non-null, so a row
|
||||||
|
holding the flag *without* an id is a fixed point nothing can clear.
|
||||||
|
Filed as #118; it still drives search scoring, the popularity-floor
|
||||||
|
bypass and two Explore shelves, so routing the UI around it was not a
|
||||||
|
fix.
|
||||||
|
|
||||||
|
What made the choice concrete rather than theoretical: on
|
||||||
|
`explore-artist-details` the *same card* used both. The context menu
|
||||||
|
gated Play on `localId > 0`; the badge used `inLibrary`. An album with
|
||||||
|
the flag and no local row drew a green tick saying it was in your
|
||||||
|
library, offered no Play, and — the request item being gated on *not*
|
||||||
|
owned — offered no way to ask for it either.
|
||||||
|
|
||||||
|
The rejected alternative is worth keeping: batching a real file lookup
|
||||||
|
per screenful, the way `credit-store` coalesces. It would have answered
|
||||||
|
for **recordings** (`GetFilePathsByRecordingMBIDs`) and most of the
|
||||||
|
cards on these surfaces are release groups, so it would have made track
|
||||||
|
rows strong, left album cards exactly where they were, and cost a new
|
||||||
|
store. The batch that *was* worth adding is a different question —
|
||||||
|
`GetAlbumsCompleteness`, "how much of this album is here", which no
|
||||||
|
per-card flag can answer at all.
|
||||||
|
|
||||||
|
The general point: **two columns that agree today are not one column.**
|
||||||
|
Which of them a new surface reads should be decided by which one has
|
||||||
|
something that can un-set it.
|
||||||
|
|||||||
@@ -13,7 +13,7 @@ reviews. Nothing was changed.
|
|||||||
|
|
||||||
Findings below are numbered `H-n` (hands-on) and cross-reference the
|
Findings below are numbered `H-n` (hands-on) and cross-reference the
|
||||||
static reports where they overlap. The reconciliation plan built from
|
static reports where they overlap. The reconciliation plan built from
|
||||||
all four files is `.planning/plans/pending/007-ui-reconciliation.md`.
|
all four files is `.planning/plans/completed/007-ui-reconciliation.md`.
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
|
|||||||
@@ -1,358 +0,0 @@
|
|||||||
# 017 — Releases that happen by themselves
|
|
||||||
|
|
||||||
> **Status: built, not yet run.** Phases 0–4 have landed on this branch;
|
|
||||||
> phase 5 is the merge itself and cannot be done until then. The old
|
|
||||||
> `v1.x` tags are already deleted from `origin`. Verified locally against
|
|
||||||
> a scratch remote: semantic-release computes **0.0.1** from these
|
|
||||||
> commits and renders correct sectioned notes.
|
|
||||||
>
|
|
||||||
> **One thing found by testing that no amount of reading would have
|
|
||||||
> caught.** `conventional-changelog-conventionalcommits@10` — the current
|
|
||||||
> release, and my first pin — is silently incompatible with the writer
|
|
||||||
> `release-notes-generator@14` depends on: the version is right, the tag
|
|
||||||
> is right, every step reports success, and the release body is a bare
|
|
||||||
> `## 0.0.1 (date)` heading with **nothing under it**. It is pinned to 9
|
|
||||||
> in both `release.yml` and `make release-dry`, with the reason written
|
|
||||||
> beside it. Four of my seven original pins were wrong majors besides;
|
|
||||||
> they were guesses, and `npm view` was the fix.
|
|
||||||
|
|
||||||
The goal in one sentence: **a merge to `main` computes the next version
|
|
||||||
from the commits it contains, cuts a tag and a Gitea release whose body
|
|
||||||
is the changelog, and every publishing channel builds that tag.** The
|
|
||||||
first release under this scheme is `v0.0.1`, and the five existing `v1.x`
|
|
||||||
tags go.
|
|
||||||
|
|
||||||
## What is there now
|
|
||||||
|
|
||||||
Measured, not remembered:
|
|
||||||
|
|
||||||
- **Five tags and zero releases.** `v1.3.0`, `v1.4.0`, `v1.4.1`,
|
|
||||||
`v1.5.0`, `v1.6.0` exist on `origin`;
|
|
||||||
`GET /api/v1/repos/yonlu/yellowjacket/releases` returns `[]`. So there
|
|
||||||
is no release page to preserve and nothing but the tags to remove.
|
|
||||||
- **`CHANGELOG.md` is stale and belongs to another repo.** Its newest
|
|
||||||
entry is `1.3.0` and every link in it points at
|
|
||||||
`github.com/onion-4-dinner/yellowjacket` — it was written by a
|
|
||||||
semantic-release run against a GitHub remote this project no longer
|
|
||||||
has.
|
|
||||||
- **`.releaserc.yml` is a complete semantic-release config that nothing
|
|
||||||
invokes**, which CLAUDE.md already says in as many words.
|
|
||||||
- **Root `package.json` is literally `{}`** — the stub left behind by
|
|
||||||
whatever was going to run it.
|
|
||||||
- The triggers today are: `arch-package` on **push to `main`**,
|
|
||||||
`homebrew-formula` on **`v*`**, `android-apk` on **`v*`**, `ci` on
|
|
||||||
every branch, `index-artifact` on cron/dispatch. So Arch publishes a
|
|
||||||
`git describe` version on every merge and the other two publish only
|
|
||||||
when a human remembers to push a tag.
|
|
||||||
|
|
||||||
## Decision 1 — semantic-release, with `exec` in place of the `github` plugin
|
|
||||||
|
|
||||||
**Revised: the first draft of this plan proposed a shell script and the
|
|
||||||
argument for it does not hold.** Recorded here rather than deleted,
|
|
||||||
because the reasoning is what the decision rests on.
|
|
||||||
|
|
||||||
What I said, and what checking it showed:
|
|
||||||
|
|
||||||
- *"The two plugins that would carry the work do not fit."* Half true.
|
|
||||||
`@semantic-release/github` genuinely does not speak Gitea's `/api/v1`
|
|
||||||
— but the replacement is **`@semantic-release/exec`**, which is
|
|
||||||
first-party, published 2026-06, and peer-deps `semantic-release >=24.1`.
|
|
||||||
Its `publishCmd` is one `curl` at the Gitea release endpoint with
|
|
||||||
`${nextRelease.notes}` as the body. The Gitea-shaped part of this is
|
|
||||||
five lines, and the part I proposed to hand-roll — parsing conventional
|
|
||||||
commits, ordering semver, rendering grouped notes — is the part with
|
|
||||||
the edge cases and none of it is Gitea-shaped at all.
|
|
||||||
- *"`@semantic-release/git` commits the changelog back to `main`, which
|
|
||||||
re-triggers everything."* True, and it is the one real risk — but it
|
|
||||||
is a two-line guard (skip the job when `HEAD`'s subject is
|
|
||||||
`chore(release):`), not a reason to write a version calculator. That
|
|
||||||
guard is needed under **either** design, since either one writes a
|
|
||||||
changelog commit.
|
|
||||||
- *"A Node dependency tree at the root of a Go repo."* The commitlint
|
|
||||||
precedent does not transfer. commitlint was a dependency to regex one
|
|
||||||
line; this is a dependency to do something with real complexity, it is
|
|
||||||
`npx`-only so nothing lands in the repo, and Node is already installed
|
|
||||||
in CI for the frontend.
|
|
||||||
- *"It cannot be told to produce `0.0.1`."* Wrong — that is a property
|
|
||||||
of which commits are in the range, not of the tool. Identical under
|
|
||||||
both designs. See below.
|
|
||||||
|
|
||||||
Note also that **`@saithodev/semantic-release-gitea` is a dead end** and
|
|
||||||
should not be reached for: last published 2022, depends on `got@10` and
|
|
||||||
`fs-extra@8`, and declares no peer dependency on semantic-release at all
|
|
||||||
— i.e. it is untested against anything since v19, against a core now at
|
|
||||||
v25. `exec` + `curl` is both simpler and maintained.
|
|
||||||
|
|
||||||
So `.releaserc.yml` stays, and its plugin list becomes five **first-party**
|
|
||||||
plugins, all published within the last six months:
|
|
||||||
|
|
||||||
| plugin | job |
|
|
||||||
| --- | --- |
|
|
||||||
| `commit-analyzer` | the version |
|
|
||||||
| `release-notes-generator` | the notes |
|
|
||||||
| `changelog` | writes `CHANGELOG.md` |
|
|
||||||
| `git` | commits it back |
|
|
||||||
| `exec` | `curl`s the Gitea release |
|
|
||||||
|
|
||||||
The `releaseRules` and `presetConfig` blocks already in the file are
|
|
||||||
kept verbatim — they are the same bump table `commit-check.sh` already
|
|
||||||
enforces the grammar for, and nothing about the project's commit
|
|
||||||
convention changes.
|
|
||||||
|
|
||||||
Two mechanical details that decide whether this works at all:
|
|
||||||
|
|
||||||
- **semantic-release pushes the tag itself**, as core behaviour, using
|
|
||||||
`repositoryUrl`. The remote here is `ssh://git@git.ljones.me:2222/…`,
|
|
||||||
which would need an SSH key in CI — so the run passes
|
|
||||||
`--repository-url "https://x-access-token:$PACKAGE_TOKEN@git.ljones.me/yonlu/yellowjacket.git"`
|
|
||||||
on the command line rather than committing a token to the config.
|
|
||||||
**That is also what satisfies Decision 2**: the tag push is attributed
|
|
||||||
to a real user, not to the Actions token.
|
|
||||||
- **The empty root `package.json` (`{}`) goes.** semantic-release does
|
|
||||||
not need one when `--repository-url` is explicit, and leaving a
|
|
||||||
package manifest at the root of a Go repo invites the npm plugin and
|
|
||||||
every tool that looks for one.
|
|
||||||
|
|
||||||
Invocation is pinned in the workflow, not installed into the repo:
|
|
||||||
|
|
||||||
```
|
|
||||||
npx --yes \
|
|
||||||
-p semantic-release@25 \
|
|
||||||
-p @semantic-release/commit-analyzer@14 \
|
|
||||||
-p @semantic-release/release-notes-generator@15 \
|
|
||||||
-p @semantic-release/changelog@6 \
|
|
||||||
-p @semantic-release/git@10 \
|
|
||||||
-p @semantic-release/exec@7 \
|
|
||||||
-p conventional-changelog-conventionalcommits@9 \
|
|
||||||
semantic-release --repository-url "…"
|
|
||||||
```
|
|
||||||
|
|
||||||
(Exact majors get pinned from `npm view` at implementation time;
|
|
||||||
`conventional-changelog-conventionalcommits` is in the list because both
|
|
||||||
the analyzer and the notes generator name that preset and neither
|
|
||||||
depends on it.)
|
|
||||||
|
|
||||||
## Decision 2 — how the publish workflows learn about the tag
|
|
||||||
|
|
||||||
**Gitea, like GitHub, does not start a workflow from a tag pushed by a
|
|
||||||
workflow's own token** (go-gitea#33123, and the forum thread it points
|
|
||||||
at). This is the one load-bearing unknown in the plan.
|
|
||||||
|
|
||||||
The remedy is to push the tag with a *user* PAT — `secrets.PACKAGE_TOKEN`
|
|
||||||
is already in this repo and already used by `arch-package` and
|
|
||||||
`android-apk` to clone and to publish — so the push is attributed to a
|
|
||||||
person and the `v*` triggers fire normally. That keeps the three publish
|
|
||||||
workflows completely unchanged in shape.
|
|
||||||
|
|
||||||
**It is verified in phase 5, not assumed.** The fallback, if it does not
|
|
||||||
fire, is an explicit `POST
|
|
||||||
/api/v1/repos/{owner}/{repo}/actions/workflows/{file}/dispatches` per
|
|
||||||
channel from the release job. That needs `workflow_dispatch` (with a
|
|
||||||
`version` input) added to `homebrew-formula.yml` and `arch-package.yml`;
|
|
||||||
`android-apk.yml` already has both. **Add those inputs in phase 3
|
|
||||||
regardless** — a hand-triggered rebuild of one channel is worth having
|
|
||||||
whether or not the fallback is needed.
|
|
||||||
|
|
||||||
The alternative — one `release.yml` with the three publishes as
|
|
||||||
`needs:` jobs — is rejected: it means either copying ~400 lines of
|
|
||||||
Android and Arch setup into it or relying on `workflow_call`, and it
|
|
||||||
puts every merge to `main` behind an up-to-60-minute Android build on a
|
|
||||||
runner with capacity 1.
|
|
||||||
|
|
||||||
## Decision 3 — 1.6.0 → 0.0.1 is a downgrade, and the answer is reinstall
|
|
||||||
|
|
||||||
**Decided: no version-code offset, no epoch. The version number stays
|
|
||||||
honest and existing installs are replaced by hand.** Every channel is a
|
|
||||||
downgrade and each declines differently, so what to expect:
|
|
||||||
|
|
||||||
- **Arch: no upgrade is offered, silently.** `pkgver()` derives from
|
|
||||||
`git describe`, so after the wipe it reads `0.0.1.rN.gHASH`, which
|
|
||||||
pacman orders *below* the `1.3.0.rN.*` in the registry. `pacman -R
|
|
||||||
yellowjacket && pacman -S yellowjacket` is the remedy. (`epoch=1` in
|
|
||||||
the PKGBUILD would have avoided it for one line — but an epoch can
|
|
||||||
never be removed, and it puts a permanent `1:` in front of every
|
|
||||||
version string this project will ever have.)
|
|
||||||
- **Homebrew: no upgrade is offered, silently.** Brew has no epoch at
|
|
||||||
all. `brew uninstall yellowjacket && brew install …`.
|
|
||||||
- **Android: a hard refusal.** `versionCode` is
|
|
||||||
`maj*10000 + min*100 + pat`, so `0.0.1` is **1** against the **10300**
|
|
||||||
an installed 1.3.0 carries, and the install fails with
|
|
||||||
`INSTALL_FAILED_VERSION_DOWNGRADE`. Uninstall first — **and that takes
|
|
||||||
the app's library and config with it**, which is the same data loss
|
|
||||||
`android-apk.yml`'s keystore guard exists to prevent, arrived at from
|
|
||||||
the other direction. The workflow's own `code -le 0` guard still passes
|
|
||||||
at 1, so nothing in CI stops or warns about this.
|
|
||||||
|
|
||||||
All three go in the release notes for `v0.0.1` and in
|
|
||||||
`packaging/homebrew/README.md` / `docs/android-release.md`, because a
|
|
||||||
channel that silently offers no upgrade is indistinguishable from a
|
|
||||||
broken pipeline six months from now.
|
|
||||||
|
|
||||||
## Landing exactly `v0.0.1`
|
|
||||||
|
|
||||||
Determinism comes from two things:
|
|
||||||
|
|
||||||
1. **Seed `v0.0.0` on `6fb7b5e`** (current `origin/main`) after wiping
|
|
||||||
the old tags. That is the floor, and the analyser's range starts
|
|
||||||
there.
|
|
||||||
2. **This branch carries no `feat:` commit.** Everything in it is
|
|
||||||
`ci:`/`docs:`/`chore:`/`build:`, plus at least one `fix:` — which is
|
|
||||||
honest, since wiring up release machinery that was configured and
|
|
||||||
never run *is* a fix. One patch-level commit in `v0.0.0..HEAD`
|
|
||||||
computes `0.0.1` and nothing else can.
|
|
||||||
|
|
||||||
This is a property of the commit range, not of the tool — it would have
|
|
||||||
been the same constraint under the shell script.
|
|
||||||
|
|
||||||
This is a real constraint on the branch, not an accounting trick: a
|
|
||||||
single `feat:` commit here makes the first release `v0.1.0`.
|
|
||||||
|
|
||||||
`v0.0.0` itself gets no release object — it is a floor, not a shipment.
|
|
||||||
|
|
||||||
## Decision 4 — what the release page carries
|
|
||||||
|
|
||||||
Four artifacts, and the fourth is the interesting one. Measured on this
|
|
||||||
machine rather than assumed:
|
|
||||||
|
|
||||||
| asset | built by | state |
|
|
||||||
| --- | --- | --- |
|
|
||||||
| `yellowjacket-<v>-android-arm64.apk` | `android-apk.yml` | already built, verified, signed |
|
|
||||||
| `yellowjacket-<v>-linux-amd64.tar.gz` | new job | binary + `.desktop` + icon |
|
|
||||||
| `yellowjacket-<v>-x86_64.pkg.tar.zst` | `arch-package.yml` | already built; free to attach |
|
|
||||||
| `yellowjacket-<v>-windows-amd64.zip` | new job | **compiles; has never been run** |
|
|
||||||
|
|
||||||
**macOS cannot be one of them.** `GOOS=darwin CGO_ENABLED=0` fails at
|
|
||||||
`wails/v3/pkg/mac: build constraints exclude all Go files` — the darwin
|
|
||||||
backend is Objective-C behind cgo, so a `.app` needs a macOS host and
|
|
||||||
the runner is a Linux container. That is precisely why the Homebrew
|
|
||||||
channel builds from source on the user's own Mac, and it stays the
|
|
||||||
answer for macOS.
|
|
||||||
|
|
||||||
**Windows is newly possible and should be labelled honestly.**
|
|
||||||
`GOOS=windows GOARCH=amd64 CGO_ENABLED=0 go build -tags production`
|
|
||||||
succeeds in 2.5 s and produces a 40 MB `.exe` — nothing in the audio,
|
|
||||||
database or webview path needs cgo on Windows (oto uses WinMM through
|
|
||||||
`x/sys`, sqlite is modernc's pure-Go driver, WebView2 is COM syscalls,
|
|
||||||
and MPRIS is `linux && !android`-tagged). But **compiling is not
|
|
||||||
running**: no Windows build of this app has ever been started, no CI tier
|
|
||||||
can exercise one, and `backend/system`'s `%LOCALAPPDATA%` path has never
|
|
||||||
resolved on a real machine. It ships marked as untested in the release
|
|
||||||
notes, or it does not ship — an unlabelled Windows download is a promise
|
|
||||||
nothing here can keep.
|
|
||||||
|
|
||||||
### The race the ordering creates
|
|
||||||
|
|
||||||
semantic-release runs **prepare** (changelog commit, tag push) before
|
|
||||||
**publish** (the `exec` curl that creates the release object). The tag
|
|
||||||
push is what starts the publishing workflows — so a fast one can reach
|
|
||||||
its upload step *before the release exists*, and
|
|
||||||
`POST /releases/{id}/assets` needs an id.
|
|
||||||
|
|
||||||
The capacity-1 runner serialises things enough that this would usually
|
|
||||||
work, which is the worst kind of bug. So each upload step **polls
|
|
||||||
`GET /api/v1/repos/…/releases/tags/{tag}` with a bounded retry** before
|
|
||||||
uploading, and fails loudly on timeout rather than skipping the asset.
|
|
||||||
That is ~8 lines of shell, shared by all three publishers.
|
|
||||||
|
|
||||||
## Phases
|
|
||||||
|
|
||||||
**Phase 0 — clear the ground.**
|
|
||||||
Delete `v1.3.0`–`v1.6.0` locally and on `origin`; push `v0.0.0` at
|
|
||||||
`6fb7b5e` — this is the floor semantic-release reads, and without it the
|
|
||||||
first release is `1.0.0` by its own rule. Delete the empty root
|
|
||||||
`package.json`. Truncate `CHANGELOG.md` to a header plus a line saying
|
|
||||||
history before `0.0.1` is in `git log` — the existing content is another
|
|
||||||
repo's links and cannot be repaired, only replaced, and the `changelog`
|
|
||||||
plugin prepends to whatever it finds.
|
|
||||||
|
|
||||||
**Phase 1 — `.releaserc.yml`.**
|
|
||||||
Swap `@semantic-release/github` for `@semantic-release/exec`, whose
|
|
||||||
`publishCmd` POSTs to
|
|
||||||
`/api/v1/repos/yonlu/yellowjacket/releases` with `tag_name`, `name` and
|
|
||||||
`body` taken from `${nextRelease.*}`. Keep `commit-analyzer`,
|
|
||||||
`release-notes-generator`, `changelog` and `git` exactly as written; fix
|
|
||||||
the `git` plugin's commit message so it passes `commit-check`
|
|
||||||
(`chore(release): ${nextRelease.version}` — the existing one already
|
|
||||||
does, but the trailing `${nextRelease.notes}` in the body is worth
|
|
||||||
keeping deliberate rather than incidental). `make release-dry` wraps
|
|
||||||
`semantic-release --dry-run` so the next version is answerable without
|
|
||||||
pushing anything.
|
|
||||||
|
|
||||||
`scripts/commit-check.sh`'s header already points at `.releaserc.yml`
|
|
||||||
for the type list and stays correct — that coupling survives this plan
|
|
||||||
rather than being broken by it.
|
|
||||||
|
|
||||||
**Phase 2 — `.gitea/workflows/release.yml`.**
|
|
||||||
On `push: branches: [main]`. Node 22, the pinned `npx` line from
|
|
||||||
Decision 1, `--repository-url` carrying `PACKAGE_TOKEN`. Concurrency
|
|
||||||
group `release-main` with `cancel-in-progress: false` — cutting a tag is
|
|
||||||
not a thing to cancel halfway.
|
|
||||||
|
|
||||||
The one guard that matters: **the job exits early when `HEAD`'s subject
|
|
||||||
starts `chore(release):`**, so the changelog commit the `git` plugin
|
|
||||||
pushes cannot re-enter this workflow. That is checked in shell rather
|
|
||||||
than left to `[skip ci]`, whose handling in Gitea is one more thing that
|
|
||||||
would have to be verified.
|
|
||||||
|
|
||||||
**Phase 3 — rewire the publish workflows.**
|
|
||||||
`arch-package.yml` moves from `push: branches: [main]` to
|
|
||||||
`push: tags: ['v*']` plus `workflow_dispatch`, so a merge no longer
|
|
||||||
publishes an untagged package. `homebrew-formula.yml` gains
|
|
||||||
`workflow_dispatch` with a `version` input and takes its version from
|
|
||||||
the input when there is no tag. `android-apk.yml` needs neither.
|
|
||||||
|
|
||||||
**Phase 3b — the assets.**
|
|
||||||
`scripts/release-asset.sh` is the shared uploader: wait for the release
|
|
||||||
by tag, then `POST /releases/{id}/assets?name=…`. `android-apk.yml` and
|
|
||||||
`arch-package.yml` each call it with the artifact they already built.
|
|
||||||
A new `desktop-assets` job — `push: tags: ['v*']`, in the same
|
|
||||||
`ubuntu:24.04` container `ci.yml` uses — builds the Linux binary via
|
|
||||||
`make build-prod` and the Windows one via the `CGO_ENABLED=0`
|
|
||||||
cross-compile, and uploads both. It is a separate job from the Arch one
|
|
||||||
because that runs in an `archlinux` container as an unprivileged
|
|
||||||
`makepkg` user, and grafting two unrelated builds onto it would make one
|
|
||||||
failure look like the other.
|
|
||||||
|
|
||||||
**Phase 4 — say that the upgrade is a reinstall, and that Windows is untried.**
|
|
||||||
No code change: a note in `packaging/homebrew/README.md`, one in
|
|
||||||
`docs/android-release.md`, the three-channel downgrade warning written
|
|
||||||
into the `v0.0.1` release notes, and a standing line in the notes
|
|
||||||
template marking the Windows asset unverified until someone runs it.
|
|
||||||
|
|
||||||
**Phase 5 — cut it and watch.** *(the only phase left)*
|
|
||||||
Merge, then verify with `gitea_ci` that (a) `release.yml` ran, seeded
|
|
||||||
`v0.0.0` and produced `v0.0.1`, (b) the release exists **with a non-empty
|
|
||||||
body** — check the body, not the exit code — and (c) **all four publish
|
|
||||||
workflows started from the tag**. If (c) is empty, that is Decision 2's
|
|
||||||
fallback and the `workflow_dispatch` inputs added in phase 3 are already
|
|
||||||
there to drive it.
|
|
||||||
|
|
||||||
The expected sequence on the merge is: `release.yml` seeds `v0.0.0`
|
|
||||||
(triggering nothing), releases `0.0.1`, and pushes both the changelog
|
|
||||||
commit and the tag — at which point `release.yml` fires a second time on
|
|
||||||
the changelog commit and exits at the `chore(release):` guard, while the
|
|
||||||
four `v*` workflows start. On a capacity-1 runner they will queue behind
|
|
||||||
each other, Android last and longest.
|
|
||||||
|
|
||||||
**Phase 6 — the documentation that will otherwise be wrong.**
|
|
||||||
CLAUDE.md's *Commits* section currently explains `.releaserc.yml` and
|
|
||||||
says nothing runs it; the CI section says there are five workflows and
|
|
||||||
that only `ci.yml` gates. Both change. `docs/android-release.md`
|
|
||||||
describes tags as hand-pushed. `make skill-check` fails on a `.pi/`
|
|
||||||
reference to a make target that does not exist, so `make release-dry`
|
|
||||||
gets documented or nothing does.
|
|
||||||
|
|
||||||
## Open questions for you
|
|
||||||
|
|
||||||
1. **Ship the Windows `.exe` or not?** It builds, and it has never run.
|
|
||||||
Marked-as-untested is the assumption; say if you would rather hold it
|
|
||||||
back until someone boots it.
|
|
||||||
|
|
||||||
Resolved: semantic-release stays, with `exec` in place of the `github`
|
|
||||||
plugin (Decision 1). Reinstalls are accepted, so no epoch and no
|
|
||||||
versionCode offset (Decision 3). The release carries the APK, a Linux
|
|
||||||
tarball, the Arch package and — pending (1) — a Windows zip; macOS is
|
|
||||||
not buildable here and stays a Homebrew-from-source channel (Decision 4).
|
|
||||||
`v0.0.0` has to be a real tag under this design — semantic-release reads
|
|
||||||
git tags for its floor and has no "treat absence as 0.0.0" knob that
|
|
||||||
also stops it calling the first release `1.0.0`.
|
|
||||||
+2
@@ -1,5 +1,7 @@
|
|||||||
# 012 — What we ask the network for, and what we already had
|
# 012 — What we ask the network for, and what we already had
|
||||||
|
|
||||||
|
> **Completed.** Findings 1, 2 and 4 shipped. Finding 3 — the bound-but-uncalled methods — is now **#86**.
|
||||||
|
|
||||||
**Status:** all four findings fixed. Lint (3 configs), Go tests (3
|
**Status:** all four findings fixed. Lint (3 configs), Go tests (3
|
||||||
configs), `tsc` and 752 Vitest tests pass; **not driven against the
|
configs), `tsc` and 752 Vitest tests pass; **not driven against the
|
||||||
real app**, so the numbers below are read off the code, not measured.
|
real app**, so the numbers below are read off the code, not measured.
|
||||||
+2
@@ -1,5 +1,7 @@
|
|||||||
# 015 — Android release pipeline
|
# 015 — Android release pipeline
|
||||||
|
|
||||||
|
> **Completed.** The pipeline ships a signed APK from CI on every `v*` tag; `docs/android-release.md` is its operating document.
|
||||||
|
|
||||||
Ship an Android APK from CI on every version tag, published to the Gitea
|
Ship an Android APK from CI on every version tag, published to the Gitea
|
||||||
generic package registry so Obtainium can poll a plain URL.
|
generic package registry so Obtainium can poll a plain URL.
|
||||||
|
|
||||||
+2
@@ -1,5 +1,7 @@
|
|||||||
# 015 — Multi-artist credits, navigable
|
# 015 — Multi-artist credits, navigable
|
||||||
|
|
||||||
|
> **Completed.** Phases 1, 2 and 4 shipped. Running the ingest against the real dump and publishing an artifact that carries credits is **#88**; Phase 3 (`file_artists`) is **#89**, blocked on it.
|
||||||
|
|
||||||
## The problem
|
## The problem
|
||||||
|
|
||||||
A track credited to more than one artist has exactly one navigable
|
A track credited to more than one artist has exactly one navigable
|
||||||
+2
@@ -1,5 +1,7 @@
|
|||||||
# 016 — What Android parity would actually take
|
# 016 — What Android parity would actually take
|
||||||
|
|
||||||
|
> **Completed.** Sections A, B1, B2 and B4 shipped. B3, writing tags on the device, is now **#87**; the device-found UI faults are #51–#72, sequenced by #73.
|
||||||
|
|
||||||
> **Status: all of section A is done.** A1–A3 landed with "let the app
|
> **Status: all of section A is done.** A1–A3 landed with "let the app
|
||||||
> reach the user's music"; A4 (MediaSession, transport notification,
|
> reach the user's music"; A4 (MediaSession, transport notification,
|
||||||
> audio focus) landed with "survive the screen locking". The direction
|
> audio focus) landed with "survive the screen locking". The direction
|
||||||
@@ -0,0 +1,87 @@
|
|||||||
|
# 017 — Releases that happen by themselves
|
||||||
|
|
||||||
|
**Shipped as `v0.0.1`.** A merge to `main` now reads the Conventional
|
||||||
|
Commits since the last tag, cuts the tag and the Gitea release whose body
|
||||||
|
is the generated changelog, and the four publishing workflows build that
|
||||||
|
tag and attach their artifacts. Nothing is released by hand.
|
||||||
|
|
||||||
|
## What it looks like now
|
||||||
|
|
||||||
|
`release.yml` on push to `main` → semantic-release → tag → four `v*`
|
||||||
|
workflows in parallel (serialised in practice by the capacity-1 runner):
|
||||||
|
|
||||||
|
| workflow | publishes | attaches |
|
||||||
|
| --- | --- | --- |
|
||||||
|
| `arch-package` | pacman registry | `…-x86_64.pkg.tar.zst` |
|
||||||
|
| `android-apk` | generic registry (Obtainium) | `…-android-arm64.apk` |
|
||||||
|
| `desktop-assets` | — | `…-linux-amd64.tar.gz` |
|
||||||
|
| `homebrew-formula` | the public tap | — (builds from source) |
|
||||||
|
|
||||||
|
Verified on the real thing: all five green, three assets on the release,
|
||||||
|
the tap at `0.0.1`, and the Obtainium `latest` URL serving 200.
|
||||||
|
|
||||||
|
## The five decisions, and what they cost
|
||||||
|
|
||||||
|
1. **semantic-release, not a shell script.** The first draft of this plan
|
||||||
|
proposed hand-rolling it and the argument did not survive checking:
|
||||||
|
`@semantic-release/exec` is first-party and current, and the
|
||||||
|
Gitea-shaped part is one `curl`. What I would have hand-rolled —
|
||||||
|
commit parsing, semver ordering, note rendering — is the part with the
|
||||||
|
edge cases and none of it is Gitea-shaped.
|
||||||
|
2. **`@saithodev/semantic-release-gitea` is a dead end** and was offered
|
||||||
|
before it was checked: last published 2022, `got@10`, and no peer
|
||||||
|
dependency on semantic-release at all.
|
||||||
|
3. **No `@semantic-release/git`.** `main` is protected, so a changelog
|
||||||
|
commit-back is rejected by the pre-receive hook — and would be
|
||||||
|
rejected *after* the tag was pushed, leaving a tagged release the run
|
||||||
|
reports as failed. The release page is the changelog;
|
||||||
|
`.release-notes.md` is a gitignored carrier and `CHANGELOG.md` is a
|
||||||
|
signpost.
|
||||||
|
4. **Versions restart at `0.0.1`**, a downgrade on every channel. No
|
||||||
|
`epoch`, no `versionCode` offset: both are permanent, a reinstall is
|
||||||
|
once. Documented in `packaging/homebrew/README.md` and
|
||||||
|
`docs/android-release.md`.
|
||||||
|
5. **No macOS and no Windows.** `GOOS=darwin CGO_ENABLED=0` fails at
|
||||||
|
`wails/v3/pkg/mac` and there is no macOS runner, so Homebrew-from-source
|
||||||
|
stays that channel. Windows cross-compiles in ~2.5 s and is withheld
|
||||||
|
because no build of it has ever been *run*.
|
||||||
|
|
||||||
|
## Four things that only showed up by running it
|
||||||
|
|
||||||
|
- **`conventional-changelog-conventionalcommits@10` renders empty
|
||||||
|
notes.** Silently: right version, right tag, every step green, and a
|
||||||
|
release body that is a bare `## 0.0.1 (date)` heading with nothing
|
||||||
|
beneath it. Held at `9`, in `release.yml` and `make release-dry`, with
|
||||||
|
the reason beside both. **Check the rendered notes, never the exit
|
||||||
|
code.**
|
||||||
|
- **semantic-release core dry-run-pushes to the release branch** as a
|
||||||
|
permission check, independently of any plugin. `PACKAGE_TOKEN` had
|
||||||
|
package-write and repo-*read* — enough to clone, not enough for this —
|
||||||
|
and it failed with a flat `403 Forbidden` that reads exactly like
|
||||||
|
branch protection. It is not: a `--dry-run` push never reaches the
|
||||||
|
pre-receive hook, which a one-line experiment settled. The token needed
|
||||||
|
`write:repository`.
|
||||||
|
- **The floor tag must go on `HEAD^`, not `HEAD`.** Seeded on the merge
|
||||||
|
commit itself it leaves nothing between the floor and HEAD, and
|
||||||
|
semantic-release correctly reports there is nothing to release. The
|
||||||
|
first run did exactly that and cut nothing.
|
||||||
|
- **A tag-triggered workflow runs from the tagged commit's tree.**
|
||||||
|
Moving `v0.0.0` back to `6fb7b5e` ran the *pre-merge* homebrew
|
||||||
|
workflow, which predates the `v0.0.0` skip guard, and pushed a `0.0.0`
|
||||||
|
formula to the public tap. Self-corrected at `0.0.1`. The corollary is
|
||||||
|
general: a guard added today does not protect a tag pointing at
|
||||||
|
yesterday.
|
||||||
|
|
||||||
|
## Two mechanisms confirmed, having been assumptions
|
||||||
|
|
||||||
|
- **A tag pushed with a user PAT does start the `v*` workflows**; one
|
||||||
|
pushed with the Actions token does not (go-gitea#33123). Both halves
|
||||||
|
are load-bearing and both were observed: the floor seed triggered
|
||||||
|
nothing, and the release tag triggered all four.
|
||||||
|
- **Tags are not protected** on this repo, only `main` — which is what
|
||||||
|
lets semantic-release tag at all.
|
||||||
|
|
||||||
|
## Left behind deliberately
|
||||||
|
|
||||||
|
`v0.0.0` stays on `origin` as the floor. It carries no release, and all
|
||||||
|
four publishers skip it by name.
|
||||||
@@ -1,5 +1,7 @@
|
|||||||
# Autotag (v1.3) — MusicBrainz Autotagger
|
# Autotag (v1.3) — MusicBrainz Autotagger
|
||||||
|
|
||||||
|
> **Historical record.** Phases 008–010 shipped, and the scoring engine was subsequently overhauled (`recommend.go`, `rank.go`, `mixedbag.go`), which makes the 011/012 sections below stale in their details. What is actually left is **#90** (auto-accept and entry points) and **#91** (settings, and a way back from the dismissed file-write warning).
|
||||||
|
|
||||||
The MusicBrainz autotagger, collectively **v1.3**. Builds on the explore-browser API client + cache foundation. Five sequential phases (008–012), each depending on the prior one.
|
The MusicBrainz autotagger, collectively **v1.3**. Builds on the explore-browser API client + cache foundation. Five sequential phases (008–012), each depending on the prior one.
|
||||||
|
|
||||||
| Phase | Title | Status |
|
| Phase | Title | Status |
|
||||||
@@ -1,195 +0,0 @@
|
|||||||
# 010 — Owned albums, offline
|
|
||||||
|
|
||||||
**Status:** not started — and **much smaller than when it was written**
|
|
||||||
**Branch:** none yet
|
|
||||||
**Created:** 2026-08-13
|
|
||||||
**Depends on:** nothing
|
|
||||||
**Related:** the `AlbumReleasesFailed` fix that prompted it, and the
|
|
||||||
tag-derived completeness that landed after it (same session)
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## What already shipped, and what it leaves
|
|
||||||
|
|
||||||
The common case is solved without this plan. `GetAlbumCompleteness`
|
|
||||||
reads the "5/12" denominator off the files' own tags — persisted to
|
|
||||||
`release_group_recordings.total_tracks`, having been extracted at every
|
|
||||||
scan since forever and discarded — and an album that is **MBID-matched
|
|
||||||
and complete** now opens with **no catalog call at all**. Identity from
|
|
||||||
the MBID, tracklist from the tags; those were the two things the browse
|
|
||||||
was being spent on.
|
|
||||||
|
|
||||||
So the set this plan still has to serve is not "albums you own a track
|
|
||||||
of". It is:
|
|
||||||
|
|
||||||
- albums that are genuinely **incomplete** (the catalog is the only way
|
|
||||||
to say *which* tracks are missing — tags give the count, not the
|
|
||||||
names), and
|
|
||||||
- albums whose tags **never declared a total**, where completeness is
|
|
||||||
unknowable locally and the catalog is the only source.
|
|
||||||
|
|
||||||
On a well-tagged library that is a small minority, which changes the
|
|
||||||
economics below considerably: the run is shorter, and the rate limiter
|
|
||||||
contention that dominates this design is proportionally less severe.
|
|
||||||
Re-measure before building — the answer may now be "the prefetch is
|
|
||||||
enough".
|
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
## The problem
|
|
||||||
|
|
||||||
Opening an album detail page for an album **you already own** hits
|
|
||||||
MusicBrainz. Every time it is not in the response cache, which for most
|
|
||||||
of a library is every time, because nothing warms that cache except a
|
|
||||||
capped prefetch on the artist page.
|
|
||||||
|
|
||||||
The user's framing: *this is a classic example of an album we should
|
|
||||||
have had locally.*
|
|
||||||
|
|
||||||
## Why we do not have it, despite the discography backfill
|
|
||||||
|
|
||||||
`BackfillLibraryDiscographies` / `EnsureArtistDiscography`
|
|
||||||
(`backend/explore/searchindex.go:301`, `:397`) do less than the name
|
|
||||||
suggests. Per artist, `indexOneArtist` fetches:
|
|
||||||
|
|
||||||
- `fetchTopReleaseGroups` — capped at `indexMaxRGs` (50)
|
|
||||||
- `fetchTopRecordings` — capped at `indexMaxRecs` (200)
|
|
||||||
|
|
||||||
and writes them as **flat `explore_index` rows**. There is no release
|
|
||||||
group → tracklist relation anywhere in the index, and no release-level
|
|
||||||
rows at all. `explore_index` recordings carry `caa_release_mbid` and
|
|
||||||
`release_name`, which name the release used for cover art — not a
|
|
||||||
tracklist.
|
|
||||||
|
|
||||||
So "we have full discographies for library artists" means *we know
|
|
||||||
which albums the artist made, offline*. It has never meant we know
|
|
||||||
what is on any of them.
|
|
||||||
|
|
||||||
The only store of release-level catalog data in the app is `http_cache`
|
|
||||||
under `mb:browse:releases:<rg>` (90-day TTL, `musicbrainz.go:27`),
|
|
||||||
populated **only** by a live `BrowseReleases` with
|
|
||||||
`Includes: ["recordings", "media"]` at `MaxLimit` — the most expensive
|
|
||||||
call the app makes to MusicBrainz. It is warmed by exactly one thing:
|
|
||||||
`PrefetchReleases` (`explore.go:746`), capped at 8, called only when an
|
|
||||||
artist page renders.
|
|
||||||
|
|
||||||
An album opened from the library grid therefore always browses live.
|
|
||||||
|
|
||||||
## What to build
|
|
||||||
|
|
||||||
**A post-scan backfill that warms the release cache for release groups
|
|
||||||
that are owned but not known-complete** — bounded, resumable, and
|
|
||||||
shaped exactly like `BackfillLibraryDiscographies`, which is the proven
|
|
||||||
pattern for this in the codebase.
|
|
||||||
|
|
||||||
The scoping rule is the user's and it is the right one: not "every
|
|
||||||
album by every artist in the library" (50 release groups per artist,
|
|
||||||
mostly never opened) but albums with owned tracks — narrowed further,
|
|
||||||
now, to the ones a local answer cannot already cover. The query gains
|
|
||||||
one clause: skip release groups whose `GetAlbumCompleteness` reports
|
|
||||||
`complete`.
|
|
||||||
|
|
||||||
Sketch:
|
|
||||||
|
|
||||||
1. A query for release groups with ≥1 owned track and no warm release
|
|
||||||
cache entry. `release_groups.mbid` is the key; the owned-track join
|
|
||||||
is `audio_files → recordings → release_group_recordings`, the same
|
|
||||||
shape `unenrichedLibraryArtistMBIDs` already uses one table over.
|
|
||||||
2. Order by owned-track count descending, so the albums the user has
|
|
||||||
most of are warmed first — same reasoning as the discography
|
|
||||||
backfill's ordering, same benefit if a run is cut short.
|
|
||||||
3. Run through `releasesSF`, so it never double-fetches a release group
|
|
||||||
an interactive open is already handling.
|
|
||||||
4. Bound a run (`discogBackfillMaxPerRun` has a value to copy) and make
|
|
||||||
it resumable: the resume marker is the response cache itself —
|
|
||||||
`BrowseReleasesCached` already answers "is this one done", so unlike
|
|
||||||
the discography path this needs **no new flag column**.
|
|
||||||
5. Trigger it where `BackfillLibraryDiscographies` is triggered, and
|
|
||||||
register it with `jobs` so it has progress, pause and cancel like
|
|
||||||
every other long-running operation.
|
|
||||||
|
|
||||||
### The rate limiter is the whole design constraint
|
|
||||||
|
|
||||||
> **Update (2026-08-13): the priority half is built, and the sentence
|
|
||||||
> below is wrong on a detail.** `e.mb` runs on `mbSearchLimiter`
|
|
||||||
> (`NewRateLimiterBurst(3, 1)`); the 1 req/s `NewRateLimiter()` cited
|
|
||||||
> here is the *artist image* limiter. Both are shared and both were
|
|
||||||
> FIFO. `RateLimiter.WithBackgroundLane` + `WithBackgroundPriority(ctx)`
|
|
||||||
> now make a marked caller yield to interactive work and pace at 1/s,
|
|
||||||
> and `jobs.KindCatalogEnrich` + `startBackfillJob` give the existing
|
|
||||||
> backfills progress and cancel. **"Do not start until the priority
|
|
||||||
> question has an answer" is satisfied** — mark this backfill's context
|
|
||||||
> and register it the way `BackfillLibraryDiscographies` now is.
|
|
||||||
> `PrefetchReleases`' cap of 8 is still unrevisited.
|
|
||||||
|
|
||||||
One shared `NewRateLimiter()` at 1 req/s (`explore.go:84`) serves this,
|
|
||||||
`PrefetchReleases`, and every interactive browse. A backfill over a
|
|
||||||
few thousand owned albums is *hours* of wall clock at that rate — which
|
|
||||||
is fine for a background job, and not fine if it starves the album page
|
|
||||||
the user is looking at right now.
|
|
||||||
|
|
||||||
That is the real work in this plan, and it is not the query:
|
|
||||||
|
|
||||||
- Interactive browses need to **jump the queue**. Today they cannot;
|
|
||||||
there is one limiter and it is FIFO.
|
|
||||||
- `PrefetchReleases`' cap of 8 was sized when nothing else competed for
|
|
||||||
the limiter. Revisit it in the same change.
|
|
||||||
- The 60 s fallback the `AlbumReleasesFailed` fix installed is sized
|
|
||||||
for today's contention. If a backfill can queue behind it, that
|
|
||||||
number is wrong again — which is an argument for priority, not for a
|
|
||||||
bigger number.
|
|
||||||
|
|
||||||
Do not start the query until the priority question has an answer.
|
|
||||||
|
|
||||||
## The alternative that was considered and rejected
|
|
||||||
|
|
||||||
**Project release-group tracklists in the dump build and ship them in
|
|
||||||
the artifact.** The data is there: `canonical_musicbrainz_data.csv`
|
|
||||||
carries `release_mbid` *and* `recording_mbid`
|
|
||||||
(`dumpcatalog.go:520`), and `release_to_rg` already maps release →
|
|
||||||
release group. It is derivable from bytes the index build already
|
|
||||||
streams, with no new API surface at all, and it would work offline on
|
|
||||||
first launch with no per-user backfill.
|
|
||||||
|
|
||||||
It is rejected **for this plan** because the artifact is built
|
|
||||||
centrally and is byte-identical for every user, so "albums the user
|
|
||||||
owns a track of" cannot be a filter on it. Shipping tracklists for the
|
|
||||||
whole catalog means per-recording rows against a ~900 MB artifact
|
|
||||||
budget (~426 B/row measured), and gating on a popularity floor means it
|
|
||||||
is absent for exactly the obscure albums a local backfill would have
|
|
||||||
covered.
|
|
||||||
|
|
||||||
Worse than absent, in fact — and this is the argument that actually
|
|
||||||
kills it. The floor is not one number over artists; it is a **per
|
|
||||||
artist track budget** (`dumpcatalog.go:58-89`): 50 tracks for a tier-A
|
|
||||||
artist, 25 for tier B, 12 for tier C. A projected tracklist would
|
|
||||||
therefore be *whichever* of an album's tracks survived that budget,
|
|
||||||
with nothing marking the rest as absent — so the album page would count
|
|
||||||
owned against a truncated denominator and render "Play 7 of 9" for a
|
|
||||||
twelve-track album. That is a confident lie, where the honest states
|
|
||||||
this plan's alternative produces (complete / incomplete / unknown) are
|
|
||||||
at worst silent.
|
|
||||||
|
|
||||||
Note that `markLibraryArtists` (`dumpcatalog.go:246`) already grants
|
|
||||||
every library artist full coverage — 500 tracks, 100 release groups —
|
|
||||||
by reading the local library, so the per-user tailoring this option
|
|
||||||
supposedly cannot have does exist in code. It is a no-op in the CI
|
|
||||||
build (empty library), and reaching it means a **local** dump build:
|
|
||||||
the ~205 GB, half-a-day download the entire artifact design exists to
|
|
||||||
avoid. Whoever finds that function next should read this paragraph
|
|
||||||
before getting excited about it.
|
|
||||||
|
|
||||||
Worth revisiting if the artifact ever gains per-user tailoring, or if a
|
|
||||||
measurement shows the row count is smaller than feared. Note it also
|
|
||||||
yields the *canonical* tracklist rather than MusicBrainz's full version
|
|
||||||
list, so the versions dropdown would still browse live when opened.
|
|
||||||
|
|
||||||
## Done when
|
|
||||||
|
|
||||||
- Opening an owned album that has never been opened before renders its
|
|
||||||
catalog tracklist with no network call, after one backfill run.
|
|
||||||
- An interactive browse issued while the backfill is running is not
|
|
||||||
delayed by it.
|
|
||||||
- The backfill appears in the jobs indicator, and can be paused and
|
|
||||||
cancelled there.
|
|
||||||
- A second run after a completed one does approximately nothing.
|
|
||||||
+14
-3
@@ -1,8 +1,19 @@
|
|||||||
# semantic-release configuration.
|
# semantic-release configuration.
|
||||||
#
|
#
|
||||||
# Runs on pushes to main from .gitea/workflows/release.yml: determine the
|
# Run by hand from .gitea/workflows/release.yml, which has no push
|
||||||
# version from the Conventional Commits since the last tag, write the
|
# trigger: determine the version from the Conventional Commits since the
|
||||||
# changelog, commit it, push the tag, and create the Gitea release.
|
# last tag, write the changelog, push the tag, and create the Gitea
|
||||||
|
# release. A release is a shipment rather than a merge, and the commits
|
||||||
|
# accumulate until someone says so -- this file needs to know nothing
|
||||||
|
# about that, because reading everything since the last tag is what it
|
||||||
|
# already did.
|
||||||
|
#
|
||||||
|
# `branches` is main and only main. A `prerelease: true` channel is the
|
||||||
|
# obvious next edit here and is the one to think twice about: all four
|
||||||
|
# publishing workflows trigger on `v*`, which matches `v0.4.0-beta.1`.
|
||||||
|
# They carry a prerelease guard now, so the failure is a clean skip
|
||||||
|
# rather than a beta in a public tap -- but they are four separate files
|
||||||
|
# and this is the line that would turn them on.
|
||||||
#
|
#
|
||||||
# **There is no `@semantic-release/github` plugin here and there must not
|
# **There is no `@semantic-release/github` plugin here and there must not
|
||||||
# be.** Gitea's API is `/api/v1` and is not GitHub's surface. The Gitea
|
# be.** Gitea's API is `/api/v1` and is not GitHub's surface. The Gitea
|
||||||
|
|||||||
+10
-5
@@ -5,15 +5,20 @@ The changelog is the releases page:
|
|||||||
<https://git.ljones.me/yonlu/yellowjacket/releases>
|
<https://git.ljones.me/yonlu/yellowjacket/releases>
|
||||||
|
|
||||||
Every release there is generated from the Conventional Commits it
|
Every release there is generated from the Conventional Commits it
|
||||||
contains, by `.gitea/workflows/release.yml` on merge to `main`. Each one
|
contains, by `.gitea/workflows/release.yml`. Each one carries its notes
|
||||||
carries its notes as its body, grouped by change type, with a link to the
|
as its body, grouped by change type, with a link to the commit behind
|
||||||
commit behind every line.
|
every line.
|
||||||
|
|
||||||
|
That workflow is **run by hand**, so a release holds everything merged
|
||||||
|
since the last one rather than one PR's worth. It used to fire on every
|
||||||
|
push to `main`, which made a version per merged PR (issue #115).
|
||||||
|
|
||||||
**This file is not generated and is not a copy of that.** `main` is a
|
**This file is not generated and is not a copy of that.** `main` is a
|
||||||
protected branch, so nothing pushes a changelog commit back to it — and a
|
protected branch, so nothing pushes a changelog commit back to it — and a
|
||||||
file that claimed to be a changelog while silently never updating would
|
file that claimed to be a changelog while silently never updating would
|
||||||
be worse than no file at all. `make release-dry` prints what the next
|
be worse than no file at all. `make release-dry` prints what a release
|
||||||
merge would release.
|
run would cut right now, and the workflow's own `dry_run` input answers
|
||||||
|
the same question from CI.
|
||||||
|
|
||||||
History before `v0.0.1` is in `git log`. The versions before it were cut
|
History before `v0.0.1` is in `git log`. The versions before it were cut
|
||||||
by hand and are not on the releases page; the entries this file used to
|
by hand and are not on the releases page; the entries this file used to
|
||||||
|
|||||||
@@ -6,16 +6,121 @@ This file provides guidance to Claude Code (claude.ai/code) when working with co
|
|||||||
|
|
||||||
YellowJacket is a cross-platform desktop music player built with Go (backend) and TypeScript/Lit (frontend), using the Wails framework to bridge them. It supports MP3, FLAC, OGG Vorbis, and WAV playback.
|
YellowJacket is a cross-platform desktop music player built with Go (backend) and TypeScript/Lit (frontend), using the Wails framework to bridge them. It supports MP3, FLAC, OGG Vorbis, and WAV playback.
|
||||||
|
|
||||||
|
## Issues
|
||||||
|
|
||||||
|
**The tracker is the source of truth for what is wanted and what is
|
||||||
|
already being worked on**, and it is shared with a collaborator who
|
||||||
|
cannot see this session. `scripts/issue.sh` is the whole interface to
|
||||||
|
it (`list`, `mine`, `search`, `show`, `new`, `claim`, `unclaim`,
|
||||||
|
`comment`, `close`, `label`, `depends`, `labels`); it needs a
|
||||||
|
`GITEA_TOKEN` with `write:issue`.
|
||||||
|
|
||||||
|
**Search the tracker before starting any work, and claim what you
|
||||||
|
find.** Fifty-odd issues make that a real lookup rather than a
|
||||||
|
formality. `./scripts/issue.sh search <terms>` covers open and closed —
|
||||||
|
closed matters, because "that was fixed three weeks ago" is the
|
||||||
|
cheapest possible answer.
|
||||||
|
|
||||||
|
**Claiming happens before the first edit, not before the commit.** The
|
||||||
|
whole point is that the collaborator can see the work is taken *while
|
||||||
|
it is being done*, so `claim` sets the assignee, applies
|
||||||
|
`Status/In Progress` and posts a comment naming the branch and the
|
||||||
|
approach — all three, or none. It refuses outright if somebody else
|
||||||
|
already holds it, and that refusal is the feature: talk to them rather
|
||||||
|
than working around it.
|
||||||
|
|
||||||
|
**If no issue covers the work, open one first.** The issue exists
|
||||||
|
before the branch does. That is what makes the tracker a description
|
||||||
|
of the project rather than a description of the past.
|
||||||
|
|
||||||
|
**Findings get filed.** A bug tripped over while doing something else
|
||||||
|
is an issue with a reproduction, not a sentence in a chat message
|
||||||
|
nobody can search. So is a piece of work deliberately not done — the
|
||||||
|
issue is where "we decided not to, and here is why" survives.
|
||||||
|
|
||||||
|
Four conventions are already established and are not up for
|
||||||
|
reinvention:
|
||||||
|
|
||||||
|
- **The labels are a taxonomy**, not tags: `Kind/*`, `Area/*`,
|
||||||
|
`Priority/*`, `Platform/*`, plus `Reviewed/Confirmed` (the code was
|
||||||
|
read and the defect confirmed) and the `Status/*` family. `Status/*`
|
||||||
|
and `Reviewed/*` are **exclusive scopes** — one of each at most, so
|
||||||
|
applying a second replaces the first.
|
||||||
|
- **#73 is the roadmap.** It states the order the backlog should be
|
||||||
|
worked in and the soft relations that are not expressible as
|
||||||
|
blockers. Picking work off the open list by eye when a meta issue
|
||||||
|
states the sequence is how the sequence stops meaning anything.
|
||||||
|
- **Hard blockers are real Gitea dependencies**, which render on the
|
||||||
|
issue itself, and the blocked issue carries `Status/Blocked`.
|
||||||
|
- **A PR body carries a commit-to-issue table, the verification
|
||||||
|
actually run, and a `Closes` list** — PR #83 is the shape. That list
|
||||||
|
is for whoever reads the PR; what actually closes an issue is the
|
||||||
|
footer below.
|
||||||
|
|
||||||
|
**The closing keyword goes in the commit body, one issue per line.**
|
||||||
|
|
||||||
|
```
|
||||||
|
docs: delete four documents that contradict the code
|
||||||
|
|
||||||
|
<body>
|
||||||
|
|
||||||
|
Closes #98
|
||||||
|
```
|
||||||
|
|
||||||
|
**Gitea parses commit messages that reach `main`; it does not parse the
|
||||||
|
PR body**, which only closes anything if the merge happens to copy it
|
||||||
|
into the merge commit. Both halves of that were measured. #83's merge
|
||||||
|
commit carried `Closes #9, #13, #14, …` and closed **five of ten** — a
|
||||||
|
comma list is partially matched. #93's merge commit body was one
|
||||||
|
`Reviewed-on:` trailer, so #92 stayed open behind a perfectly correct
|
||||||
|
`Closes` line in the PR description.
|
||||||
|
|
||||||
|
A footer costs nothing elsewhere: Conventional Commits allows one,
|
||||||
|
`scripts/commit-check.sh` only regexes the subject, and
|
||||||
|
semantic-release reads the type from the subject — so this changes no
|
||||||
|
release decision. The rule that the issue number stays out of the
|
||||||
|
**subject** is unaffected, and was never about the body.
|
||||||
|
|
||||||
|
**Check it anyway.** A squash, or a merge message edited by hand,
|
||||||
|
still drops the footer. `./scripts/issue.sh list --state open` after a
|
||||||
|
merge, looking for what you just shipped; `./scripts/issue.sh close
|
||||||
|
<n>` for whatever did not take, with a comment naming the commit.
|
||||||
|
|
||||||
|
**Unclaiming is automatic, and it is hooked to the close rather than
|
||||||
|
to the merge.** Gitea's auto-close changes state and nothing else, so a
|
||||||
|
footer left `Status/In Progress` on a closed issue — #100 was closed
|
||||||
|
and marked as being actively worked on at the same time.
|
||||||
|
`.gitea/workflows/unclaim.yml` runs on `issues: [closed]`, which covers
|
||||||
|
the footer, `issue.sh close` and a click in the web UI alike; stripping
|
||||||
|
the label in the PR instead would have been a per-PR habit, and habits
|
||||||
|
are what the footer removed. It is not instant — the runner has
|
||||||
|
capacity 1 — and reopening deliberately does not restore the label.
|
||||||
|
`./scripts/issue.sh list --state closed --label "Status/In Progress"`
|
||||||
|
is how you find out it has stopped firing.
|
||||||
|
|
||||||
## Planning
|
## Planning
|
||||||
|
|
||||||
Active and historical plans live in `.planning/`:
|
`.planning/` is **design documents and measured history**, not a queue
|
||||||
|
— the queue is the tracker, and a plan file that describes work nobody
|
||||||
|
has started is a second, staler answer to "what are we doing next".
|
||||||
|
|
||||||
- `.planning/NOTES.md` — gotchas, deferred items, open architecture questions, the "we already considered and rejected" list.
|
- `.planning/NOTES.md` — gotchas, measured facts, open architecture
|
||||||
- `.planning/plans/active/` — work currently in progress (read first).
|
questions, and the "we already considered and rejected" list. Dated,
|
||||||
- `.planning/plans/pending/` — sequenced future work.
|
because several are properties of someone else's server. **This is
|
||||||
- `.planning/plans/completed/` — one concise recap per shipped milestone.
|
where a decision reached on an issue gets written down** when it
|
||||||
|
outlives the issue.
|
||||||
|
- `.planning/plans/completed/` — one recap per shipped milestone, kept
|
||||||
|
for the arguments in it. Where a plan shipped incompletely, its
|
||||||
|
header says which issue carries the remainder.
|
||||||
|
- `.planning/audits/` — the read-only audits that produced the
|
||||||
|
reconciliation plans. Historical evidence; not a backlog.
|
||||||
|
- `.planning/plans/active/` — a multi-phase design document for work
|
||||||
|
**in flight**, linked from the issue that tracks it. Empty is the
|
||||||
|
normal state. There is no `pending/`: a plan nobody is executing is
|
||||||
|
an issue.
|
||||||
|
|
||||||
Numbering is sequential and stable across status moves (a plan keeps its `NNN-` prefix as it migrates between `pending → active → completed`). Abandoned plans are deleted; paused work stays in `pending/`.
|
Numbering is sequential and stable across status moves (a plan keeps
|
||||||
|
its `NNN-` prefix). Abandoned plans are deleted.
|
||||||
|
|
||||||
## Commands
|
## Commands
|
||||||
|
|
||||||
@@ -1343,6 +1448,52 @@ is therefore **reported at runtime** to `window.__yjIconMisses` and
|
|||||||
drawn as a fallback — an e2e sweep asserts there are none — since a
|
drawn as a fallback — an e2e sweep asserts there are none — since a
|
||||||
missing icon used to be impossible, the CDN having had everything.
|
missing icon used to be impossible, the CDN having had everything.
|
||||||
|
|
||||||
|
**What each icon *means* is a second table, and it is
|
||||||
|
`utils/icon-language.ts`.** Bundling answers "does this name resolve";
|
||||||
|
nothing answered "does this name mean what the one next to it means",
|
||||||
|
and a wrong-but-real icon renders perfectly. So `plus` came to mean add
|
||||||
|
to the queue, add to a playlist, make a new playlist **and** you do not
|
||||||
|
own this — the first two *adjacent in the same context menu* — while
|
||||||
|
`list` meant the queue, the Playlists destination and adding to the
|
||||||
|
queue.
|
||||||
|
|
||||||
|
The rule the table is built on: **an icon names the noun it acts on,
|
||||||
|
not the verb.** "Add to queue" and "add to playlist" are one verb on
|
||||||
|
two nouns, so the noun is what has to differ — which is why adding to a
|
||||||
|
playlist wears the Playlists destination's own icon, and why the queue
|
||||||
|
got `bars-staggered` and stopped wearing Playlists'. `plus` keeps the
|
||||||
|
one meaning it is unambiguous about, making something that is not there
|
||||||
|
yet.
|
||||||
|
|
||||||
|
Four things about it are load-bearing:
|
||||||
|
|
||||||
|
- **The request toggle is one glyph in two weights**
|
||||||
|
(`regular/bookmark` → `solid/bookmark`), because two states of a
|
||||||
|
toggle have to read as each other's opposite and a plus against a
|
||||||
|
bookmark does not. The pair was *already in the app and already
|
||||||
|
right* on `explore-album-details`'s "Request this" button while the
|
||||||
|
badge forty pixels away showed a plus — `utils/library-status.ts`'s
|
||||||
|
fault one layer down, having made the two agree on what wanting means
|
||||||
|
and left them disagreeing on what it looks like.
|
||||||
|
- **Downloads keeps the solid bookmark, deliberately.** That is the
|
||||||
|
same word twice, not two words: the badge says "this is on your
|
||||||
|
list" and the nav item is that list.
|
||||||
|
- **`icon-language.test.ts` sweeps the source**, because the rule is
|
||||||
|
about every call site and checking one checks nothing — the same
|
||||||
|
shape as `TestNoDirectRuntimeEmits`. It reads every `src/**/*.ts` as
|
||||||
|
raw text and fails on a literal `name="plus"` or `icon: 'list'`
|
||||||
|
outside the table, and its **first assertion is that it read
|
||||||
|
anything at all**, since a sweep over an empty glob passes.
|
||||||
|
- **It also asserts every `ICON_*` is bundled**, which closes the loop
|
||||||
|
the runtime cannot: `bookmark-check` is Font Awesome **Pro** and sat
|
||||||
|
on `explore-artist-details`'s Follow button, drawn for every followed
|
||||||
|
artist as a circled question mark. `offline-icons.spec.ts` sweeps
|
||||||
|
`__yjIconMisses` and could not see it, because no spec had ever
|
||||||
|
followed an artist — the same fault `requested-badge.spec.ts` was
|
||||||
|
written for, one component over, still live. A name computed from
|
||||||
|
state was only checkable from the state; now it is checkable from the
|
||||||
|
table.
|
||||||
|
|
||||||
**An album page says how much of the album is yours.**
|
**An album page says how much of the album is yours.**
|
||||||
`explore-album-details` is a *catalog* page and there is no
|
`explore-album-details` is a *catalog* page and there is no
|
||||||
library-side album detail page at all, so the album on it may be
|
library-side album detail page at all, so the album on it may be
|
||||||
@@ -1442,11 +1593,55 @@ shape as the encoding probe beside it.
|
|||||||
|
|
||||||
What neither side can give is *which* tracks are missing, only how many
|
What neither side can give is *which* tracks are missing, only how many
|
||||||
— so an incomplete album still browses, and that is now the exception
|
— so an incomplete album still browses, and that is now the exception
|
||||||
rather than every album load. Two smaller consequences: existing databases
|
rather than every album load. One smaller consequence: existing databases
|
||||||
read "unknown" until a rescan repopulates the column (which degrades to
|
read "unknown" until a rescan repopulates the column, which degrades to
|
||||||
exactly the old behaviour, so nothing breaks), and our own `tagwriter`
|
exactly the old behaviour, so nothing breaks.
|
||||||
writes track and disc *numbers* but not totals, so autotagging a folder
|
|
||||||
currently degrades the field this rests on.
|
**And our own writers declare the total, because for a long time they
|
||||||
|
did not.** `tagwriter` wrote track and disc *numbers* and dropped the
|
||||||
|
totals, so autotagging an album actively **erased** the evidence this
|
||||||
|
rests on: the release became MBID-matched — a green tick — while the
|
||||||
|
field `GetAlbumCompleteness` reads stayed absent, which is exactly the
|
||||||
|
"2 of 10 tracks, reported as in your library" the report described.
|
||||||
|
`FieldTotalTracks` / `FieldTotalDiscs` are written by the autotag apply
|
||||||
|
pass and by the download importer, and `dbsync` persists the track
|
||||||
|
total to the row so the album page agrees with the file without waiting
|
||||||
|
for a rescan.
|
||||||
|
|
||||||
|
Five things about it are load-bearing, and four of them fail silently:
|
||||||
|
|
||||||
|
- **The total is per *disc*, not per release**, because that is what
|
||||||
|
the tag form declares and what `GetAlbumCompleteness` **sums** per
|
||||||
|
disc — a release total written on every file multiplies a two-disc
|
||||||
|
album's expectation by two, and no library can then satisfy it.
|
||||||
|
`backend/tagtotals` is that derivation, once, because the two callers
|
||||||
|
must not import each other or the writer.
|
||||||
|
- **The Vorbis names are `TRACKTOTAL` and `DISCTOTAL` and no other
|
||||||
|
spelling.** `dhowden/tag`'s Vorbis reader looks at exactly those two
|
||||||
|
keys, so a perfectly reasonable `TOTALTRACKS`, or a `1/12` inside
|
||||||
|
`TRACKNUMBER`, is written successfully and reads back as no total at
|
||||||
|
all. The tests assert the round trip through the reader the *scan*
|
||||||
|
uses rather than through the bytes, for that reason.
|
||||||
|
- **ID3's number and total share one frame**, so writing either alone
|
||||||
|
has to read the other off the existing tag or it silently discards
|
||||||
|
it. A total with no number is not written: `/12` is what a reader
|
||||||
|
parses as track 0.
|
||||||
|
- **The totals are written unconditionally, not on a diff.** The case
|
||||||
|
this exists for is a file that declares *no* total, which compares
|
||||||
|
equal to nothing and is exactly what a "only if it changed" guard
|
||||||
|
skips.
|
||||||
|
- **A single-track download must not be totalled.** A `RecordingMBID`
|
||||||
|
anchor resolves `Expected` to that one track, so the same code would
|
||||||
|
tag a track off a twelve-track album "1 of 1" — and a declared total
|
||||||
|
outranks the catalog total that would otherwise have answered
|
||||||
|
correctly. Confidently wrong is worse than absent here, which is the
|
||||||
|
same rule `Known` exists for.
|
||||||
|
|
||||||
|
One gap this did not close, and it is older: **`dhowden/tag` has no
|
||||||
|
RIFF reader**, so nothing the tag writer puts in a WAV's `id3 ` chunk
|
||||||
|
is visible to `metadata.ExtractTags` — not the totals and not the title
|
||||||
|
either. `wav_test.go` reads that chunk itself, which is why no test
|
||||||
|
ever noticed.
|
||||||
|
|
||||||
**The absence is what gets marked, not the presence.** The tracklist
|
**The absence is what gets marked, not the presence.** The tracklist
|
||||||
put a green tick against every owned track and a legend underneath
|
put a green tick against every owned track and a legend underneath
|
||||||
@@ -1463,6 +1658,59 @@ not about plumbing — it says rows may be missing from the page
|
|||||||
altogether, which nothing on screen can show. (`explore-artist-details`
|
altogether, which nothing on screen can show. (`explore-artist-details`
|
||||||
still uses `loading`; it has no equivalent per-row signal.)
|
still uses `loading`; it has no equivalent per-row signal.)
|
||||||
|
|
||||||
|
**And that treatment is the app's, not the page's.**
|
||||||
|
`utils/ownership.ts` is the rule written once, because it was written
|
||||||
|
at eight call sites and so none of them had the whole of it: Explore's
|
||||||
|
cards, `top-results-row` and the artist page's three card shapes all
|
||||||
|
mixed owned and unowned with a small badge as the only difference, and
|
||||||
|
the badge on the *owned* ones was a green tick — the mark on the common
|
||||||
|
case this tracklist removed. Owned is plain and draws no badge at all;
|
||||||
|
unowned is dimmed, says so in its accessible name, and keeps its
|
||||||
|
request affordance; a partly-held album says how partly.
|
||||||
|
|
||||||
|
Four things about it are load-bearing.
|
||||||
|
|
||||||
|
**Ownership is `localId`, and `inLibrary` is deliberately not
|
||||||
|
consulted.** The album page answers with `filePaths`, a real file per
|
||||||
|
displayed track, and a card grid cannot afford that — but it does not
|
||||||
|
need to, because `explore_index.local_*_id` is built by
|
||||||
|
`collectLibraryEntities` from queries that every one join `audio_files`
|
||||||
|
and cleared by `pruneStaleLocalCrossReferences`, whose existence test
|
||||||
|
is a file test in all three cases. That is the same "ownership is a
|
||||||
|
file" rule computed once per scan instead of once per screenful.
|
||||||
|
`in_library` is written by the same pass, so the two agree in a healthy
|
||||||
|
database, but it is a one-way ratchet
|
||||||
|
(`MAX(in_library, excluded.in_library)`) whose only clearing pass is
|
||||||
|
gated on a non-null local id: it cannot be un-set on its own (#118).
|
||||||
|
One is a fact with an owner; the other is a flag that happens to agree.
|
||||||
|
Both `explore-view` and `explore-artist-details` additionally kept a
|
||||||
|
`libraryMBIDs` set that accumulated every MBID ever seen with the flag
|
||||||
|
and cleared it never, in views that never unmount; both are gone.
|
||||||
|
|
||||||
|
**The two answers used to sit on one card.**
|
||||||
|
`renderReleaseMenuItems` gates Play on `release.localId > 0` while the
|
||||||
|
badge used `inLibrary`, so an album with the flag and no local row drew
|
||||||
|
a tick saying it was in your library, offered no Play, and — the
|
||||||
|
request item being gated on *not* owned — offered no way to ask for it
|
||||||
|
either. Any new surface that asks the question twice will reproduce it.
|
||||||
|
|
||||||
|
**`aria-disabled` goes on rows and not on cards.** An unowned *row*
|
||||||
|
cannot be activated; an unowned *card* still navigates to the catalog
|
||||||
|
page for it, which is a perfectly good thing to do with something you
|
||||||
|
do not own. The accessible name carries the state either way, which is
|
||||||
|
why it is one helper and not a class.
|
||||||
|
|
||||||
|
**The count is batched, not looked up.** `store/completeness-store.ts`
|
||||||
|
is `credit-store` one question over: `request()` is per-card and
|
||||||
|
coalesces a screenful into one `GetAlbumsCompleteness`, absence is
|
||||||
|
cached as an answer (or the albums with no totals re-ask forever), and
|
||||||
|
the whole cache is dropped on a scan, a retag or a removal rather than
|
||||||
|
aged. `library-status.ts`'s `albumBadgeFor` is where that meets
|
||||||
|
`Known`: a total that was never declared is a plain `in-library`, never
|
||||||
|
a ring at 0%. One consequence in the badge itself — a `partial` badge
|
||||||
|
is *actionable*, and a control named after its action alone dropped the
|
||||||
|
count from the one state the ring exists for, so its name is both.
|
||||||
|
|
||||||
**A partly-owned album draws the release, not the part.** Once the tags
|
**A partly-owned album draws the release, not the part.** Once the tags
|
||||||
say nine of twelve, `buildLibraryEntry` shows the *catalog's* twelve
|
say nine of twelve, `buildLibraryEntry` shows the *catalog's* twelve
|
||||||
with three dimmed, rather than the nine on disk — the missing tracks
|
with three dimmed, rather than the nine on disk — the missing tracks
|
||||||
@@ -1474,6 +1722,32 @@ side-effect worth knowing: this is what finally makes `ownership()`
|
|||||||
say something true here, since counting the displayed tracklist of a
|
say something true here, since counting the displayed tracklist of a
|
||||||
library-only entry could only ever produce "9 of 9".
|
library-only entry could only ever produce "9 of 9".
|
||||||
|
|
||||||
|
**And it can be asked, because the rule alone reaches too few albums.**
|
||||||
|
That guard depends on two inputs the user does not control: the files
|
||||||
|
declaring a per-disc total, and the catalog's own `total_tracks`. Where
|
||||||
|
neither says — which is a great deal of any library, and *every* library
|
||||||
|
until an artifact carrying the column is published — a partly-owned
|
||||||
|
album showed only the tracks on disk with nothing to say the rest
|
||||||
|
existed. `renderTracklistScope()` is the explicit route: a
|
||||||
|
"Show the whole album" switch that flips the synthetic "Your Library"
|
||||||
|
entry between the local files and the release, which is the rendering
|
||||||
|
the page could already do and could only be *triggered* automatically.
|
||||||
|
|
||||||
|
Three things about it are load-bearing. **`showFullTracklist` is a
|
||||||
|
tri-state**, `null` meaning "follow the automatic rule": the rule is
|
||||||
|
right when it fires and the switch has to be able to agree with the page
|
||||||
|
it sits on rather than starting out contradicting it, which a plain
|
||||||
|
boolean would need recomputed every time the completeness answer moved
|
||||||
|
underneath it. **`fullReleaseCluster()` falls back to the
|
||||||
|
highest-scoring cluster**, because `findLibraryCluster` is a guess over
|
||||||
|
the `inLibrary` flags and returns *nothing* when none are set — which is
|
||||||
|
exactly the untagged library the switch exists for, so without the
|
||||||
|
fallback the control would be absent precisely where it is needed. And
|
||||||
|
**it is shown only where it can change what is on screen**: against the
|
||||||
|
library entry, with a release to switch to, and only when the two
|
||||||
|
tracklists differ — the same test the version dropdown answers, one
|
||||||
|
control over.
|
||||||
|
|
||||||
**A dropdown is only a choice if the choices differ.** The version
|
**A dropdown is only a choice if the choices differ.** The version
|
||||||
selector tested `versionEntries.length`, but a release group routinely
|
selector tested `versionEntries.length`, but a release group routinely
|
||||||
has several releases — reissues, regional pressings, a remaster — whose
|
has several releases — reissues, regional pressings, a remaster — whose
|
||||||
@@ -2066,23 +2340,75 @@ branch** (`enable_push: false`, an empty push whitelist, and `CI / check*`
|
|||||||
the pre-receive hook. This file said otherwise for a long time. Tags are
|
the pre-receive hook. This file said otherwise for a long time. Tags are
|
||||||
*not* protected, which is what lets `release.yml` push one.
|
*not* protected, which is what lets `release.yml` push one.
|
||||||
|
|
||||||
|
**A branch answers a claimed issue** — see "Issues" above. The commit
|
||||||
|
grammar is unchanged and is load-bearing for a different reason
|
||||||
|
(semantic-release reads it), so the issue number lives in the branch
|
||||||
|
name and the PR body rather than in the commit subject.
|
||||||
|
|
||||||
|
**A batch of small fixes can be one PR**, which is what #83 did: eight
|
||||||
|
branches preserved as merges under one integration branch, so
|
||||||
|
authorship survives and the batch lands as one release rather than
|
||||||
|
eight. The cost is that its `Closes` list has to be checked afterwards
|
||||||
|
— it half-worked.
|
||||||
|
|
||||||
Pre-commit runs vet, lint, codegen check, and frontend typecheck in parallel. Pre-push runs the full test suite.
|
Pre-commit runs vet, lint, codegen check, and frontend typecheck in parallel. Pre-push runs the full test suite.
|
||||||
|
|
||||||
## CI
|
## CI
|
||||||
|
|
||||||
Seven workflows in `.gitea/workflows/`. Five of them package and
|
Eight workflows in `.gitea/workflows/`. Five of them package and
|
||||||
publish (`arch-package`, `homebrew-formula`, `index-artifact`,
|
publish (`arch-package`, `homebrew-formula`, `index-artifact`,
|
||||||
`android-apk`, `desktop-assets`); `release.yml` decides *whether* four of
|
`android-apk`, `desktop-assets`); `release.yml` decides *whether* four of
|
||||||
those run at all; only `ci.yml` gates, and it is the one to look at when
|
those run at all; `unclaim.yml` is housekeeping on the tracker and
|
||||||
|
touches no code; only `ci.yml` gates, and it is the one to look at when
|
||||||
deciding whether a push was healthy.
|
deciding whether a push was healthy.
|
||||||
|
|
||||||
**`release.yml` is the entry point for all of it.** On every push to
|
**`release.yml` is the entry point for all of it, and it is triggered by
|
||||||
`main` it reads the Conventional Commits since the last tag and, if any
|
hand.** It reads the Conventional Commits since the last tag and, if any
|
||||||
is releasable, writes the changelog, pushes the tag and creates the Gitea
|
is releasable, writes the changelog, pushes the tag and creates the Gitea
|
||||||
release whose body is that changelog section. `arch-package`,
|
release whose body is that changelog section. `arch-package`,
|
||||||
`homebrew-formula`, `android-apk` and `desktop-assets` are all keyed on
|
`homebrew-formula`, `android-apk` and `desktop-assets` are all keyed on
|
||||||
`v*`, so **the tag push is what starts them** — nothing is released by
|
`v*`, so **the tag push is what starts them** — the version, the notes
|
||||||
hand any more.
|
and the packaging are still nobody's manual work; *when* is the only
|
||||||
|
decision left to a person.
|
||||||
|
|
||||||
|
**It used to fire on every push to `main`, which made the trigger "a PR
|
||||||
|
was merged".** That is a version per unit of *work* rather than per
|
||||||
|
*shipment*: eight releases in twenty-two hours (`v0.0.1` → `v0.3.1`) for
|
||||||
|
one session, each fanning out to four publishers on a runner with
|
||||||
|
capacity 1 — ~40 packaging jobs to ship three issues, with ordinary PR CI
|
||||||
|
queued behind them. Nothing else had to change to batch them, because
|
||||||
|
**semantic-release already reads every commit since the last tag**: five
|
||||||
|
`fix`es and two `feat`s become one minor release with all seven in the
|
||||||
|
notes. Release frequency was only ever how often the workflow fired.
|
||||||
|
|
||||||
|
This is the same rule `index-artifact.yml` states — *a job that mutates
|
||||||
|
state which cannot be rebuilt in ten minutes is triggered deliberately,
|
||||||
|
not by a push* — and the two are now the only workflows with no push
|
||||||
|
trigger. A schedule was considered and rejected: a cron batches without
|
||||||
|
anyone having to remember, but it puts the decision back on a timer,
|
||||||
|
which is the thing being removed. A `beta` integration branch was
|
||||||
|
considered and rejected too (#115): it relocates the trigger rather than
|
||||||
|
removing one, needs a second protected branch carrying the same required
|
||||||
|
checks, and *adds* a full `check` + `e2e` run per batch on the very
|
||||||
|
runner whose queue is the complaint.
|
||||||
|
|
||||||
|
**`dry_run` is why the manual trigger is usable.** The point of pulling
|
||||||
|
a lever by hand is being able to look first, so the dispatch takes a
|
||||||
|
flag that runs `semantic-release --dry-run`: the version and the notes,
|
||||||
|
no tag, no release, no publishers. Anything but the literal string
|
||||||
|
`true` releases for real — a typo in a dispatch box must not silently
|
||||||
|
turn a shipment into a green no-op.
|
||||||
|
|
||||||
|
**A prerelease tag is not a shipment, and all four publishers now say
|
||||||
|
so.** Their trigger is `v*`, which matches `v0.4.0-beta.1`; they guarded
|
||||||
|
`v0.0.0` and nothing else. Nothing produces a prerelease today — the
|
||||||
|
guard is there because the thing that would is `prerelease: true` in
|
||||||
|
`.releaserc.yml`, one line whose blast radius is a public Homebrew tap
|
||||||
|
and a credential-free APK registry that Obtainium polls. `android-apk`
|
||||||
|
is the worst of the four twice over, since its `versionCode` maths
|
||||||
|
splits on dots and would read `1` out of `0-beta` — a wrong number
|
||||||
|
rather than a failed build, and Android refuses anything not greater
|
||||||
|
than what is installed.
|
||||||
|
|
||||||
Four things about it are load-bearing:
|
Four things about it are load-bearing:
|
||||||
|
|
||||||
|
|||||||
@@ -192,15 +192,21 @@ skill-check: ## Fail if the agent docs name a missing make target, or AGENTS.md
|
|||||||
commit-check: ## Fail if a commit subject is not a Conventional Commit
|
commit-check: ## Fail if a commit subject is not a Conventional Commit
|
||||||
@./scripts/commit-check.sh $(if $(RANGE),--range $(RANGE))
|
@./scripts/commit-check.sh $(if $(RANGE),--range $(RANGE))
|
||||||
|
|
||||||
# What a merge to main would release, without releasing it. Reads the
|
# What running the release workflow now would ship, without shipping it.
|
||||||
# same .releaserc.yml CI does, so "why did that not cut a version" is
|
# Reads the same .releaserc.yml CI does, so "why did that not cut a
|
||||||
# answerable locally instead of by pushing and watching. Needs no
|
# version" is answerable locally instead of by pushing and watching.
|
||||||
# credentials: --dry-run neither tags nor publishes.
|
# Needs no credentials: --dry-run neither tags nor publishes.
|
||||||
|
#
|
||||||
|
# release.yml is dispatch-only, so this answers the question that
|
||||||
|
# actually gets asked now -- what has accumulated since the last tag --
|
||||||
|
# rather than what one merge would have done. The workflow's own
|
||||||
|
# `dry_run` input is the same answer from the runner, against whatever
|
||||||
|
# main points at rather than the working tree.
|
||||||
#
|
#
|
||||||
# The pins must stay identical to release.yml's, which is where the note
|
# The pins must stay identical to release.yml's, which is where the note
|
||||||
# on holding the conventionalcommits preset at 9 lives -- at 10 the
|
# on holding the conventionalcommits preset at 9 lives -- at 10 the
|
||||||
# release notes come out empty with everything green.
|
# release notes come out empty with everything green.
|
||||||
release-dry: ## Print the version a merge to main would release
|
release-dry: ## Print the version a release run would cut right now
|
||||||
@npx --yes \
|
@npx --yes \
|
||||||
-p semantic-release@25 \
|
-p semantic-release@25 \
|
||||||
-p @semantic-release/commit-analyzer@13 \
|
-p @semantic-release/commit-analyzer@13 \
|
||||||
|
|||||||
@@ -106,5 +106,8 @@ make dev # run with hot-reload
|
|||||||
make build-prod # produce a release binary
|
make build-prod # produce a release binary
|
||||||
```
|
```
|
||||||
|
|
||||||
More detail for contributors lives in
|
More detail for contributors lives in [`CLAUDE.md`](./CLAUDE.md) — the
|
||||||
[`docs/dev/overview.md`](./docs/dev/overview.md) and [`CLAUDE.md`](./CLAUDE.md).
|
architecture, the conventions and the reasons behind them. What is
|
||||||
|
being worked on is [the issue
|
||||||
|
tracker](https://git.ljones.me/yonlu/yellowjacket/issues); #73 is the
|
||||||
|
roadmap.
|
||||||
|
|||||||
@@ -8,6 +8,7 @@ import (
|
|||||||
"log/slog"
|
"log/slog"
|
||||||
|
|
||||||
"yellowjacket/backend/database/sql/sqlcgen"
|
"yellowjacket/backend/database/sql/sqlcgen"
|
||||||
|
"yellowjacket/backend/tagtotals"
|
||||||
)
|
)
|
||||||
|
|
||||||
// TagChanges mirrors tagwriter.TagChanges — redefined here so the
|
// TagChanges mirrors tagwriter.TagChanges — redefined here so the
|
||||||
@@ -28,6 +29,8 @@ const (
|
|||||||
FieldYear = "year"
|
FieldYear = "year"
|
||||||
FieldTrackNumber = "track_number"
|
FieldTrackNumber = "track_number"
|
||||||
FieldDiscNumber = "disc_number"
|
FieldDiscNumber = "disc_number"
|
||||||
|
FieldTotalTracks = "total_tracks"
|
||||||
|
FieldTotalDiscs = "total_discs"
|
||||||
FieldCoverArt = "cover_art"
|
FieldCoverArt = "cover_art"
|
||||||
)
|
)
|
||||||
|
|
||||||
@@ -418,5 +421,32 @@ func buildChanges(
|
|||||||
changes[FieldDiscNumber] = track.DiscNumber
|
changes[FieldDiscNumber] = track.DiscNumber
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// The totals are what says "2 of 10" rather than a bare tick, and
|
||||||
|
// dropping them here is what made autotagging an album *erase* the
|
||||||
|
// evidence: the release becomes MBID-matched while the field
|
||||||
|
// GetAlbumCompleteness reads stays absent.
|
||||||
|
//
|
||||||
|
// They are written unconditionally where the candidate has a
|
||||||
|
// tracklist, not only when they differ from the local value, because
|
||||||
|
// the common case is a file that declares no total at all -- which
|
||||||
|
// compares equal to nothing and would be skipped by a diff guard.
|
||||||
|
if tracks, discs := tagtotals.For(
|
||||||
|
candidatePositions(cand), track.DiscNumber,
|
||||||
|
); tracks > 0 {
|
||||||
|
changes[FieldTotalTracks] = tracks
|
||||||
|
changes[FieldTotalDiscs] = discs
|
||||||
|
}
|
||||||
|
|
||||||
return changes
|
return changes
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// candidatePositions is the candidate's tracklist as bare positions.
|
||||||
|
func candidatePositions(cand Candidate) []tagtotals.Position {
|
||||||
|
out := make([]tagtotals.Position, 0, len(cand.Tracks))
|
||||||
|
|
||||||
|
for _, t := range cand.Tracks {
|
||||||
|
out = append(out, tagtotals.Position{Disc: t.DiscNumber, Track: t.Position})
|
||||||
|
}
|
||||||
|
|
||||||
|
return out
|
||||||
|
}
|
||||||
|
|||||||
@@ -0,0 +1,90 @@
|
|||||||
|
package autotag
|
||||||
|
|
||||||
|
import "testing"
|
||||||
|
|
||||||
|
// Autotagging an album used to *erase* the evidence that says "2 of 10":
|
||||||
|
// the release became MBID-matched while the totals the files declared
|
||||||
|
// went unwritten, so the album page showed a plain tick. These pin the
|
||||||
|
// two halves of the fix that are easy to get wrong silently.
|
||||||
|
func TestBuildChanges_Totals(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
twoDiscs := Candidate{
|
||||||
|
Tracks: []CandidateTrack{
|
||||||
|
{DiscNumber: 1, Position: 1},
|
||||||
|
{DiscNumber: 1, Position: 2},
|
||||||
|
{DiscNumber: 2, Position: 1},
|
||||||
|
{DiscNumber: 2, Position: 2},
|
||||||
|
{DiscNumber: 2, Position: 3},
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
cand Candidate
|
||||||
|
local LocalTrack
|
||||||
|
track CandidateTrack
|
||||||
|
wantTracks any
|
||||||
|
wantDiscs any
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
// The common case, and the one a diff guard would skip: the
|
||||||
|
// file declares no total at all, so the total "has not
|
||||||
|
// changed" and would never be written.
|
||||||
|
name: "a file with no total gets one",
|
||||||
|
cand: Candidate{Tracks: []CandidateTrack{
|
||||||
|
{Position: 1}, {Position: 2}, {Position: 3},
|
||||||
|
}},
|
||||||
|
local: LocalTrack{TrackNumber: 1},
|
||||||
|
track: CandidateTrack{Position: 1},
|
||||||
|
wantTracks: 3,
|
||||||
|
wantDiscs: 1,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// 5 here would be the release's track count. Summed once
|
||||||
|
// per disc by GetAlbumCompleteness that claims a ten-track
|
||||||
|
// expectation for a five-track album, which no library can
|
||||||
|
// ever satisfy.
|
||||||
|
name: "a multi-disc release totals the track's own disc",
|
||||||
|
cand: twoDiscs,
|
||||||
|
local: LocalTrack{},
|
||||||
|
track: CandidateTrack{DiscNumber: 2, Position: 1},
|
||||||
|
wantTracks: 3,
|
||||||
|
wantDiscs: 2,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "the other disc gets its own total",
|
||||||
|
cand: twoDiscs,
|
||||||
|
local: LocalTrack{},
|
||||||
|
track: CandidateTrack{DiscNumber: 1, Position: 1},
|
||||||
|
wantTracks: 2,
|
||||||
|
wantDiscs: 2,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// A candidate with no tracklist knows nothing, and writing
|
||||||
|
// a zero would claim it did.
|
||||||
|
name: "a candidate with no tracklist writes no total",
|
||||||
|
cand: Candidate{},
|
||||||
|
local: LocalTrack{},
|
||||||
|
track: CandidateTrack{Position: 1},
|
||||||
|
wantTracks: nil,
|
||||||
|
wantDiscs: nil,
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tc := range tests {
|
||||||
|
t.Run(tc.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
changes := buildChanges(tc.local, tc.cand, tc.track)
|
||||||
|
|
||||||
|
if got := changes[FieldTotalTracks]; got != tc.wantTracks {
|
||||||
|
t.Errorf("%s: got %v, want %v", FieldTotalTracks, got, tc.wantTracks)
|
||||||
|
}
|
||||||
|
|
||||||
|
if got := changes[FieldTotalDiscs]; got != tc.wantDiscs {
|
||||||
|
t.Errorf("%s: got %v, want %v", FieldTotalDiscs, got, tc.wantDiscs)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,38 @@
|
|||||||
|
package autotagservice
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"yellowjacket/backend/autotag"
|
||||||
|
"yellowjacket/backend/tagwriter"
|
||||||
|
)
|
||||||
|
|
||||||
|
// twAdapter passes the diff map through unchanged, so autotag's field
|
||||||
|
// constants and tagwriter's are the same keys written down twice --
|
||||||
|
// deliberately, to keep autotag out of the write pipeline's import
|
||||||
|
// graph. A key that drifts does not fail to compile and does not fail
|
||||||
|
// to write: the writer simply finds no entry under the name it looks
|
||||||
|
// for, and the field is silently dropped. That is what this pins, and
|
||||||
|
// this package is the one place that imports both.
|
||||||
|
func TestAutotagAndTagwriterAgreeOnFieldNames(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
pairs := map[string][2]string{
|
||||||
|
"title": {autotag.FieldTitle, tagwriter.FieldTitle},
|
||||||
|
"artist": {autotag.FieldArtist, tagwriter.FieldArtist},
|
||||||
|
"album": {autotag.FieldAlbum, tagwriter.FieldAlbum},
|
||||||
|
"album artist": {autotag.FieldAlbumArtist, tagwriter.FieldAlbumArtist},
|
||||||
|
"year": {autotag.FieldYear, tagwriter.FieldYear},
|
||||||
|
"track number": {autotag.FieldTrackNumber, tagwriter.FieldTrackNumber},
|
||||||
|
"disc number": {autotag.FieldDiscNumber, tagwriter.FieldDiscNumber},
|
||||||
|
"total tracks": {autotag.FieldTotalTracks, tagwriter.FieldTotalTracks},
|
||||||
|
"total discs": {autotag.FieldTotalDiscs, tagwriter.FieldTotalDiscs},
|
||||||
|
"cover art": {autotag.FieldCoverArt, tagwriter.FieldCoverArt},
|
||||||
|
}
|
||||||
|
|
||||||
|
for name, pair := range pairs {
|
||||||
|
if pair[0] != pair[1] {
|
||||||
|
t.Errorf("%s: autotag says %q, tagwriter says %q", name, pair[0], pair[1])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -411,9 +411,10 @@ func (c *Config) SetDownloadPreferences(prefs download.AutoDownloadPrefs) error
|
|||||||
formats = append(formats, string(f))
|
formats = append(formats, string(f))
|
||||||
}
|
}
|
||||||
|
|
||||||
c.Downloads.MinFileSizeMB = prefs.MinSizeMB
|
c.Downloads.MinKbps = prefs.MinKbps
|
||||||
|
c.Downloads.MaxKbps = prefs.MaxKbps
|
||||||
|
c.Downloads.PreferredKbps = prefs.PreferredKbps
|
||||||
c.Downloads.MaxFileSizeMB = prefs.MaxSizeMB
|
c.Downloads.MaxFileSizeMB = prefs.MaxSizeMB
|
||||||
c.Downloads.PreferredFileSizeMB = prefs.PreferredSizeMB
|
|
||||||
c.Downloads.AllowedFormats = formats
|
c.Downloads.AllowedFormats = formats
|
||||||
|
|
||||||
if err := c.Save(); err != nil {
|
if err := c.Save(); err != nil {
|
||||||
|
|||||||
@@ -135,3 +135,49 @@ SELECT
|
|||||||
) AS INTEGER) AS known
|
) AS INTEGER) AS known
|
||||||
FROM audio_files a
|
FROM audio_files a
|
||||||
WHERE a.album_id = sqlc.arg(album_id);
|
WHERE a.album_id = sqlc.arg(album_id);
|
||||||
|
|
||||||
|
-- name: GetAlbumsCompleteness :many
|
||||||
|
-- The same question as GetAlbumCompleteness, asked of a screenful of
|
||||||
|
-- albums at once.
|
||||||
|
--
|
||||||
|
-- A card grid cannot afford one query per card, and the answer it wants
|
||||||
|
-- is the one thing a badge cannot guess: an album held 9 tracks of 12
|
||||||
|
-- must show the count, never a bare tick. So this is one query for the
|
||||||
|
-- whole grid, asked only of the cards that have a local album id.
|
||||||
|
--
|
||||||
|
-- It is two grouping levels rather than the single-album form's
|
||||||
|
-- correlated subqueries, because a correlated subquery in the FROM
|
||||||
|
-- clause is not something SQLite will reliably do -- and because the
|
||||||
|
-- slice may only be spelled once, or sqlc expands it twice with
|
||||||
|
-- independently numbered placeholders.
|
||||||
|
--
|
||||||
|
-- The per-disc level is where the meaning is, and it is the same
|
||||||
|
-- meaning as the single-album query. `owned` counts DISTINCT track
|
||||||
|
-- numbers within a disc (this app detects duplicates, and counting two
|
||||||
|
-- files of track 3 twice would report a short album as complete), with
|
||||||
|
-- a file that declares no track number falling back to its own id
|
||||||
|
-- because three untagged files are three tracks and not one.
|
||||||
|
-- `expected` takes each disc's declared total and sums over discs,
|
||||||
|
-- since a total is declared per disc and a release total written on
|
||||||
|
-- every file of a two-disc album would double its expectation. A disc
|
||||||
|
-- whose files declared nothing contributes a NULL that SUM ignores,
|
||||||
|
-- and `known` is what says the album is therefore unanswerable.
|
||||||
|
WITH per_disc AS (
|
||||||
|
SELECT
|
||||||
|
album_id AS album_id,
|
||||||
|
COUNT(DISTINCT COALESCE(CAST(track_number AS TEXT), 'f' || id))
|
||||||
|
AS owned_on_disc,
|
||||||
|
MAX(total_tracks) AS disc_total,
|
||||||
|
SUM(CASE WHEN total_tracks IS NULL THEN 1 ELSE 0 END)
|
||||||
|
AS discs_without_a_total
|
||||||
|
FROM audio_files
|
||||||
|
WHERE album_id IN (sqlc.slice('album_ids'))
|
||||||
|
GROUP BY album_id, COALESCE(disc_number, 1)
|
||||||
|
)
|
||||||
|
SELECT
|
||||||
|
CAST(album_id AS INTEGER) AS album_id,
|
||||||
|
CAST(SUM(owned_on_disc) AS INTEGER) AS owned,
|
||||||
|
CAST(COALESCE(SUM(disc_total), 0) AS INTEGER) AS expected,
|
||||||
|
CAST(SUM(discs_without_a_total) = 0 AS INTEGER) AS known
|
||||||
|
FROM per_disc
|
||||||
|
GROUP BY album_id;
|
||||||
|
|||||||
@@ -8,6 +8,7 @@ package sqlcgen
|
|||||||
import (
|
import (
|
||||||
"context"
|
"context"
|
||||||
"database/sql"
|
"database/sql"
|
||||||
|
"strings"
|
||||||
)
|
)
|
||||||
|
|
||||||
const deleteAlbum = `-- name: DeleteAlbum :exec
|
const deleteAlbum = `-- name: DeleteAlbum :exec
|
||||||
@@ -234,6 +235,98 @@ func (q *Queries) GetAlbumsByArtistName(ctx context.Context, arg GetAlbumsByArti
|
|||||||
return items, nil
|
return items, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
const getAlbumsCompleteness = `-- name: GetAlbumsCompleteness :many
|
||||||
|
WITH per_disc AS (
|
||||||
|
SELECT
|
||||||
|
album_id AS album_id,
|
||||||
|
COUNT(DISTINCT COALESCE(CAST(track_number AS TEXT), 'f' || id))
|
||||||
|
AS owned_on_disc,
|
||||||
|
MAX(total_tracks) AS disc_total,
|
||||||
|
SUM(CASE WHEN total_tracks IS NULL THEN 1 ELSE 0 END)
|
||||||
|
AS discs_without_a_total
|
||||||
|
FROM audio_files
|
||||||
|
WHERE album_id IN (/*SLICE:album_ids*/?)
|
||||||
|
GROUP BY album_id, COALESCE(disc_number, 1)
|
||||||
|
)
|
||||||
|
SELECT
|
||||||
|
CAST(album_id AS INTEGER) AS album_id,
|
||||||
|
CAST(SUM(owned_on_disc) AS INTEGER) AS owned,
|
||||||
|
CAST(COALESCE(SUM(disc_total), 0) AS INTEGER) AS expected,
|
||||||
|
CAST(SUM(discs_without_a_total) = 0 AS INTEGER) AS known
|
||||||
|
FROM per_disc
|
||||||
|
GROUP BY album_id
|
||||||
|
`
|
||||||
|
|
||||||
|
type GetAlbumsCompletenessRow struct {
|
||||||
|
AlbumID int64
|
||||||
|
Owned int64
|
||||||
|
Expected int64
|
||||||
|
Known int64
|
||||||
|
}
|
||||||
|
|
||||||
|
// The same question as GetAlbumCompleteness, asked of a screenful of
|
||||||
|
// albums at once.
|
||||||
|
//
|
||||||
|
// A card grid cannot afford one query per card, and the answer it wants
|
||||||
|
// is the one thing a badge cannot guess: an album held 9 tracks of 12
|
||||||
|
// must show the count, never a bare tick. So this is one query for the
|
||||||
|
// whole grid, asked only of the cards that have a local album id.
|
||||||
|
//
|
||||||
|
// It is two grouping levels rather than the single-album form's
|
||||||
|
// correlated subqueries, because a correlated subquery in the FROM
|
||||||
|
// clause is not something SQLite will reliably do -- and because the
|
||||||
|
// slice may only be spelled once, or sqlc expands it twice with
|
||||||
|
// independently numbered placeholders.
|
||||||
|
//
|
||||||
|
// The per-disc level is where the meaning is, and it is the same
|
||||||
|
// meaning as the single-album query. `owned` counts DISTINCT track
|
||||||
|
// numbers within a disc (this app detects duplicates, and counting two
|
||||||
|
// files of track 3 twice would report a short album as complete), with
|
||||||
|
// a file that declares no track number falling back to its own id
|
||||||
|
// because three untagged files are three tracks and not one.
|
||||||
|
// `expected` takes each disc's declared total and sums over discs,
|
||||||
|
// since a total is declared per disc and a release total written on
|
||||||
|
// every file of a two-disc album would double its expectation. A disc
|
||||||
|
// whose files declared nothing contributes a NULL that SUM ignores,
|
||||||
|
// and `known` is what says the album is therefore unanswerable.
|
||||||
|
func (q *Queries) GetAlbumsCompleteness(ctx context.Context, albumIds []sql.NullInt64) ([]GetAlbumsCompletenessRow, error) {
|
||||||
|
query := getAlbumsCompleteness
|
||||||
|
var queryParams []interface{}
|
||||||
|
if len(albumIds) > 0 {
|
||||||
|
for _, v := range albumIds {
|
||||||
|
queryParams = append(queryParams, v)
|
||||||
|
}
|
||||||
|
query = strings.Replace(query, "/*SLICE:album_ids*/?", strings.Repeat(",?", len(albumIds))[1:], 1)
|
||||||
|
} else {
|
||||||
|
query = strings.Replace(query, "/*SLICE:album_ids*/?", "NULL", 1)
|
||||||
|
}
|
||||||
|
rows, err := q.db.QueryContext(ctx, query, queryParams...)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
defer rows.Close()
|
||||||
|
var items []GetAlbumsCompletenessRow
|
||||||
|
for rows.Next() {
|
||||||
|
var i GetAlbumsCompletenessRow
|
||||||
|
if err := rows.Scan(
|
||||||
|
&i.AlbumID,
|
||||||
|
&i.Owned,
|
||||||
|
&i.Expected,
|
||||||
|
&i.Known,
|
||||||
|
); err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
items = append(items, i)
|
||||||
|
}
|
||||||
|
if err := rows.Close(); err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
if err := rows.Err(); err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
return items, nil
|
||||||
|
}
|
||||||
|
|
||||||
const getAlbumsWithPendingReleaseMBID = `-- name: GetAlbumsWithPendingReleaseMBID :many
|
const getAlbumsWithPendingReleaseMBID = `-- name: GetAlbumsWithPendingReleaseMBID :many
|
||||||
SELECT id, pending_release_mbid FROM albums
|
SELECT id, pending_release_mbid FROM albums
|
||||||
WHERE pending_release_mbid IS NOT NULL AND pending_release_mbid != ''
|
WHERE pending_release_mbid IS NOT NULL AND pending_release_mbid != ''
|
||||||
|
|||||||
+28
-11
@@ -34,13 +34,29 @@ type UserConfig struct {
|
|||||||
// in one burst that every provider sees as a flood.
|
// in one burst that every provider sees as a flood.
|
||||||
WantedBatch int `toml:"WantedBatch"`
|
WantedBatch int `toml:"WantedBatch"`
|
||||||
|
|
||||||
// MinFileSizeMB, MaxFileSizeMB and PreferredFileSizeMB bound and
|
// MinKbps, MaxKbps and PreferredKbps bound and nudge what auto-pick
|
||||||
// nudge what auto-pick (interactive or via the request list) may
|
// (interactive or via the request list) may grab without asking.
|
||||||
// grab without asking. Zero on any of them is permissive: see
|
// Zero on any of them is permissive: see AutoDownloadPrefs.
|
||||||
// AutoDownloadPrefs.
|
//
|
||||||
MinFileSizeMB int `toml:"MinFileSizeMB"`
|
// They replaced MinFileSizeMB / MaxFileSizeMB /
|
||||||
MaxFileSizeMB int `toml:"MaxFileSizeMB"`
|
// PreferredFileSizeMB, which were megabytes and so said nothing
|
||||||
PreferredFileSizeMB int `toml:"PreferredFileSizeMB"`
|
// without knowing how long the release was. The old keys are
|
||||||
|
// deliberately *not* read back: a number that meant "300 MB" cannot
|
||||||
|
// be reinterpreted as a bitrate without knowing the album it was
|
||||||
|
// aimed at, so migrating it would be inventing an intent the user
|
||||||
|
// never expressed. An existing config falls back to no window,
|
||||||
|
// which is the permissive default and matches a fresh install —
|
||||||
|
// and MaxFileSizeMB is the one that does carry over, because a
|
||||||
|
// ceiling on total bytes still means exactly what it did.
|
||||||
|
MinKbps int `toml:"MinKbps"`
|
||||||
|
MaxKbps int `toml:"MaxKbps"`
|
||||||
|
PreferredKbps int `toml:"PreferredKbps"`
|
||||||
|
|
||||||
|
// MaxFileSizeMB is a hard ceiling on a candidate's total size, kept
|
||||||
|
// in megabytes on purpose — it is a question about disk space, not
|
||||||
|
// about quality, and it has to apply to a candidate whose bitrate
|
||||||
|
// cannot be worked out at all.
|
||||||
|
MaxFileSizeMB int `toml:"MaxFileSizeMB"`
|
||||||
|
|
||||||
// AllowedFormats restricts auto-pick to these formats. Empty means
|
// AllowedFormats restricts auto-pick to these formats. Empty means
|
||||||
// no restriction. Values are Format strings ("flac", "mp3", ...).
|
// no restriction. Values are Format strings ("flac", "mp3", ...).
|
||||||
@@ -56,10 +72,11 @@ func (c *UserConfig) AutoDownloadPrefs() AutoDownloadPrefs {
|
|||||||
}
|
}
|
||||||
|
|
||||||
return AutoDownloadPrefs{
|
return AutoDownloadPrefs{
|
||||||
MinSizeMB: c.MinFileSizeMB,
|
MinKbps: c.MinKbps,
|
||||||
MaxSizeMB: c.MaxFileSizeMB,
|
MaxKbps: c.MaxKbps,
|
||||||
PreferredSizeMB: c.PreferredFileSizeMB,
|
PreferredKbps: c.PreferredKbps,
|
||||||
AllowedFormats: formats,
|
MaxSizeMB: c.MaxFileSizeMB,
|
||||||
|
AllowedFormats: formats,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -12,6 +12,7 @@ import (
|
|||||||
"strconv"
|
"strconv"
|
||||||
"strings"
|
"strings"
|
||||||
|
|
||||||
|
"yellowjacket/backend/tagtotals"
|
||||||
"yellowjacket/backend/tagwriter"
|
"yellowjacket/backend/tagwriter"
|
||||||
)
|
)
|
||||||
|
|
||||||
@@ -275,6 +276,25 @@ func (i *Importer) tagFile(p plannedFile, dl Download) error {
|
|||||||
changes[tagwriter.FieldDiscNumber] = p.Track.DiscNumber
|
changes[tagwriter.FieldDiscNumber] = p.Track.DiscNumber
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// An imported file should arrive knowing how much of the album it
|
||||||
|
// is one of, or the album reads as "in your library" from its first
|
||||||
|
// imported track onward.
|
||||||
|
//
|
||||||
|
// A *track* download is the case this must not touch: a
|
||||||
|
// RecordingMBID anchor resolves Expected to exactly that one track,
|
||||||
|
// so totalling it would write "1 of 1" onto a track off a
|
||||||
|
// twelve-track album -- a confident lie, and one that outranks the
|
||||||
|
// catalog's own total, which is the fallback that would otherwise
|
||||||
|
// have answered correctly.
|
||||||
|
if dl.RecordingMBID == "" {
|
||||||
|
if tracks, discs := tagtotals.For(
|
||||||
|
expectedPositions(dl.Expected), p.Track.DiscNumber,
|
||||||
|
); tracks > 0 {
|
||||||
|
changes[tagwriter.FieldTotalTracks] = tracks
|
||||||
|
changes[tagwriter.FieldTotalDiscs] = discs
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
if err := i.tags.WriteUntrackedFileTags(p.Source, changes); err != nil {
|
if err := i.tags.WriteUntrackedFileTags(p.Source, changes); err != nil {
|
||||||
return fmt.Errorf("write tags: %w", err)
|
return fmt.Errorf("write tags: %w", err)
|
||||||
}
|
}
|
||||||
@@ -282,6 +302,18 @@ func (i *Importer) tagFile(p plannedFile, dl Download) error {
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// expectedPositions is the download's resolved tracklist as bare
|
||||||
|
// positions.
|
||||||
|
func expectedPositions(expected []ExpectedTrack) []tagtotals.Position {
|
||||||
|
out := make([]tagtotals.Position, 0, len(expected))
|
||||||
|
|
||||||
|
for _, t := range expected {
|
||||||
|
out = append(out, tagtotals.Position{Disc: t.DiscNumber, Track: t.Position})
|
||||||
|
}
|
||||||
|
|
||||||
|
return out
|
||||||
|
}
|
||||||
|
|
||||||
// destinationFor computes a file's library path from the template.
|
// destinationFor computes a file's library path from the template.
|
||||||
func (i *Importer) destinationFor(
|
func (i *Importer) destinationFor(
|
||||||
p plannedFile,
|
p plannedFile,
|
||||||
|
|||||||
@@ -446,3 +446,77 @@ func keysOf(m map[string]tagwriter.TagChanges) []string {
|
|||||||
|
|
||||||
return out
|
return out
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// An imported album should arrive knowing its own size, or the album
|
||||||
|
// page reads "in your library" from its first imported track onward --
|
||||||
|
// which is the badge complaint this exists to answer.
|
||||||
|
func TestImportWritesTheAlbumTotals(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
f := newImportFixture(t,
|
||||||
|
"01 - Airbag.flac",
|
||||||
|
"02 - Paranoid Android.flac",
|
||||||
|
"03 - Subterranean Homesick Alien.flac",
|
||||||
|
"04 - Exit Music (For a Film).flac",
|
||||||
|
)
|
||||||
|
|
||||||
|
if _, err := f.importer.Import(
|
||||||
|
context.Background(),
|
||||||
|
fourTrackDownload(),
|
||||||
|
Result{Dir: f.dir, Files: f.files},
|
||||||
|
ImportOptions{LibraryRoot: f.root, WriteTags: true},
|
||||||
|
); err != nil {
|
||||||
|
t.Fatalf("Import: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
changes := f.tags.writes["01 - Airbag.flac"]
|
||||||
|
if changes == nil {
|
||||||
|
t.Fatal("no tag write recorded for the first track")
|
||||||
|
}
|
||||||
|
|
||||||
|
if got := changes[tagwriter.FieldTotalTracks]; got != 4 {
|
||||||
|
t.Errorf("%s: got %v, want 4", tagwriter.FieldTotalTracks, got)
|
||||||
|
}
|
||||||
|
|
||||||
|
if got := changes[tagwriter.FieldTotalDiscs]; got != 1 {
|
||||||
|
t.Errorf("%s: got %v, want 1", tagwriter.FieldTotalDiscs, got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A RecordingMBID anchor resolves Expected to exactly the one track it
|
||||||
|
// asked for, so totalling it would tag a track off a twelve-track album
|
||||||
|
// as "1 of 1" -- worse than saying nothing, because a declared total
|
||||||
|
// outranks the catalog total that would have answered correctly.
|
||||||
|
func TestImportWritesNoTotalsForATrackDownload(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
f := newImportFixture(t, "01 - Airbag.flac")
|
||||||
|
|
||||||
|
dl := Download{
|
||||||
|
ID: "dl-track",
|
||||||
|
LibraryID: 1,
|
||||||
|
RecordingMBID: "mbid-recording",
|
||||||
|
Artist: "Radiohead",
|
||||||
|
Album: "OK Computer",
|
||||||
|
Expected: []ExpectedTrack{{Position: 1, Title: "Airbag"}},
|
||||||
|
}
|
||||||
|
|
||||||
|
if _, err := f.importer.Import(
|
||||||
|
context.Background(),
|
||||||
|
dl,
|
||||||
|
Result{Dir: f.dir, Files: f.files},
|
||||||
|
ImportOptions{LibraryRoot: f.root, WriteTags: true},
|
||||||
|
); err != nil {
|
||||||
|
t.Fatalf("Import: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
changes := f.tags.writes["01 - Airbag.flac"]
|
||||||
|
if changes == nil {
|
||||||
|
t.Fatal("no tag write recorded")
|
||||||
|
}
|
||||||
|
|
||||||
|
if _, ok := changes[tagwriter.FieldTotalTracks]; ok {
|
||||||
|
t.Errorf("%s written for a single-track download: %v",
|
||||||
|
tagwriter.FieldTotalTracks, changes[tagwriter.FieldTotalTracks])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -236,6 +236,12 @@ func (m *Manager) AutoPickable(dl Download, ranked []Candidate) bool {
|
|||||||
return AutoPickable(dl, ranked, m.preferences())
|
return AutoPickable(dl, ranked, m.preferences())
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// AutoPickVeto wraps the package function the same way, and is what the
|
||||||
|
// request list quotes back to the user.
|
||||||
|
func (m *Manager) AutoPickVeto(dl Download, ranked []Candidate) string {
|
||||||
|
return AutoPickVeto(dl, ranked, m.preferences())
|
||||||
|
}
|
||||||
|
|
||||||
// Reload rebuilds every provider from stored config. Called at startup
|
// Reload rebuilds every provider from stored config. Called at startup
|
||||||
// and after any provider settings change.
|
// and after any provider settings change.
|
||||||
//
|
//
|
||||||
@@ -612,16 +618,8 @@ func (m *Manager) Attempt(
|
|||||||
return false, "", err
|
return false, "", err
|
||||||
}
|
}
|
||||||
|
|
||||||
if !m.AutoPickable(dl, ranked) {
|
if veto := m.AutoPickVeto(dl, ranked); veto != "" {
|
||||||
best := ranked[0]
|
return false, veto, nil
|
||||||
|
|
||||||
return false, fmt.Sprintf(
|
|
||||||
"best of %d found is not a confident enough match "+
|
|
||||||
"(match %.0f%%, quality %.0f%%)",
|
|
||||||
len(ranked),
|
|
||||||
best.Match.Overall*100, //nolint:mnd // percent
|
|
||||||
best.Quality.Overall*100,
|
|
||||||
), nil
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if err := m.store.CreateDownload(ctx, dl); err != nil {
|
if err := m.store.CreateDownload(ctx, dl); err != nil {
|
||||||
|
|||||||
@@ -218,8 +218,17 @@ func TestManagerEndToEndAutoPick(t *testing.T) {
|
|||||||
}, "staging was never released, or the library was never rescanned")
|
}, "staging was never released, or the library was never rescanned")
|
||||||
}
|
}
|
||||||
|
|
||||||
// An ambiguous result set must park for the user rather than guess.
|
// Two equally good copies are not an ambiguity — they are a spare.
|
||||||
func TestManagerWaitsWhenAmbiguous(t *testing.T) {
|
//
|
||||||
|
// This asserted the opposite for as long as auto-pick required 0.08 of
|
||||||
|
// daylight over the runner-up, and that rule was wrong in exactly the
|
||||||
|
// case it fired hardest: a popular album turns up several *correct*
|
||||||
|
// copies, all matching the tracklist, differing only in format and
|
||||||
|
// seeders. There is no question there about what to fetch, only about
|
||||||
|
// which copy, and the ranking already answers that — closest to the
|
||||||
|
// preferred bitrate first. A candidate does not have to be better than
|
||||||
|
// the field, only good enough on its own terms.
|
||||||
|
func TestManagerAutoPicksAmongEquallyGoodCopies(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
f := newManagerFixture(t)
|
f := newManagerFixture(t)
|
||||||
@@ -237,11 +246,41 @@ func TestManagerWaitsWhenAmbiguous(t *testing.T) {
|
|||||||
t.Fatalf("Start: %v", err)
|
t.Fatalf("Start: %v", err)
|
||||||
}
|
}
|
||||||
|
|
||||||
if f.manager.AutoPickable(dl, ranked) {
|
if veto := f.manager.AutoPickVeto(dl, ranked); veto != "" {
|
||||||
t.Fatal("two equivalent candidates must not auto-pick")
|
t.Fatalf("two equally good copies must auto-pick, got veto: %s", veto)
|
||||||
|
}
|
||||||
|
|
||||||
|
waitForDownloadState(t, f.store, dl.ID, StateComplete)
|
||||||
|
|
||||||
|
// Exactly one of them was fetched, not both.
|
||||||
|
if grabs := a.GrabCalls + b.GrabCalls; grabs != 1 {
|
||||||
|
t.Errorf("grabs = %d, want exactly 1", grabs)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The user can still pick explicitly when auto-pick is not what
|
||||||
|
// happened — a candidate the ranking did not choose is still grabbable.
|
||||||
|
func TestManagerPickIsExplicit(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
f := newManagerFixture(t)
|
||||||
|
|
||||||
|
a := fakeWithAlbum(1, "source-a", ".flac")
|
||||||
|
b := fakeWithAlbum(2, "source-b", ".flac")
|
||||||
|
|
||||||
|
f.manager.installProvider(Config{ID: 1, Priority: 50}, a)
|
||||||
|
f.manager.installProvider(Config{ID: 2, Priority: 50}, b)
|
||||||
|
|
||||||
|
// No tracklist: never auto-picks, so the result set parks for the
|
||||||
|
// user and Pick is the only way anything is fetched.
|
||||||
|
dl := fourTrackDownload()
|
||||||
|
dl.Expected = nil
|
||||||
|
|
||||||
|
ranked, err := f.manager.Start(context.Background(), dl)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("Start: %v", err)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Nothing was grabbed while waiting for the user.
|
|
||||||
if a.GrabCalls != 0 || b.GrabCalls != 0 {
|
if a.GrabCalls != 0 || b.GrabCalls != 0 {
|
||||||
t.Errorf(
|
t.Errorf(
|
||||||
"grabs happened without a pick: a=%d b=%d",
|
"grabs happened without a pick: a=%d b=%d",
|
||||||
@@ -258,7 +297,6 @@ func TestManagerWaitsWhenAmbiguous(t *testing.T) {
|
|||||||
t.Errorf("stored request id = %s, want %s", stored.ID, dl.ID)
|
t.Errorf("stored request id = %s, want %s", stored.ID, dl.ID)
|
||||||
}
|
}
|
||||||
|
|
||||||
// The user picks the second one explicitly.
|
|
||||||
if err := f.manager.Pick(
|
if err := f.manager.Pick(
|
||||||
context.Background(), dl.ID, ranked[1].ID,
|
context.Background(), dl.ID, ranked[1].ID,
|
||||||
); err != nil {
|
); err != nil {
|
||||||
|
|||||||
+313
-77
@@ -1,6 +1,7 @@
|
|||||||
package download
|
package download
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"fmt"
|
||||||
"math"
|
"math"
|
||||||
"sort"
|
"sort"
|
||||||
"strings"
|
"strings"
|
||||||
@@ -34,38 +35,102 @@ const (
|
|||||||
weightArtistFit = 0.12
|
weightArtistFit = 0.12
|
||||||
)
|
)
|
||||||
|
|
||||||
// Quality sub-weights. They sum to 1.0 along with weightSizeFit below.
|
// Quality sub-weights. Each set sums to 1.0.
|
||||||
|
//
|
||||||
|
// There are two of them because a stated preference changes what the
|
||||||
|
// other numbers are *for*. `formatRank` and `bitrateScore` are the
|
||||||
|
// app guessing at how good a copy is — FLAC over MP3, 320 over 128 —
|
||||||
|
// and that guess exists precisely because the user has not said. Once
|
||||||
|
// they have, the guess should not outvote them: with the old single set
|
||||||
|
// a preference of 320 kbps moved a candidate's score by at most 0.05
|
||||||
|
// against the 0.42 riding on format, so asking for 320 and being handed
|
||||||
|
// a FLAC every time was the *designed* behaviour. That is the same
|
||||||
|
// fault the megabyte window had — a preference the user can express and
|
||||||
|
// the ranking can ignore.
|
||||||
const (
|
const (
|
||||||
weightFormat = 0.42
|
weightFormat = 0.42
|
||||||
weightBitrate = 0.23
|
weightBitrate = 0.23
|
||||||
weightHealth = 0.20
|
weightHealth = 0.20
|
||||||
weightPriority = 0.10
|
weightPriority = 0.10
|
||||||
weightSizeFit = 0.05
|
weightBitrateFit = 0.05
|
||||||
)
|
)
|
||||||
|
|
||||||
|
// Quality sub-weights when the user has named a preferred bitrate.
|
||||||
|
// The weight comes off format and bitrate — the two proxies the
|
||||||
|
// preference replaces — and health and priority are untouched, since
|
||||||
|
// neither is a stand-in for anything the user just said.
|
||||||
|
const (
|
||||||
|
statedWeightFormat = 0.20
|
||||||
|
statedWeightBitrate = 0.10
|
||||||
|
statedWeightHealth = 0.20
|
||||||
|
statedWeightPriority = 0.10
|
||||||
|
statedWeightBitrateFit = 0.40
|
||||||
|
)
|
||||||
|
|
||||||
|
// qualityWeights picks the set, in the order scoreQuality applies them.
|
||||||
|
func qualityWeights(p AutoDownloadPrefs) (
|
||||||
|
format, bitrate, health, priority, fit float64,
|
||||||
|
) {
|
||||||
|
if p.PreferredKbps > 0 {
|
||||||
|
return statedWeightFormat,
|
||||||
|
statedWeightBitrate,
|
||||||
|
statedWeightHealth,
|
||||||
|
statedWeightPriority,
|
||||||
|
statedWeightBitrateFit
|
||||||
|
}
|
||||||
|
|
||||||
|
return weightFormat,
|
||||||
|
weightBitrate,
|
||||||
|
weightHealth,
|
||||||
|
weightPriority,
|
||||||
|
weightBitrateFit
|
||||||
|
}
|
||||||
|
|
||||||
// unanchoredCap bounds the match score of a free-text request. Without
|
// unanchoredCap bounds the match score of a free-text request. Without
|
||||||
// an MBID there is no tracklist to be right about, so a confident-
|
// an MBID there is no tracklist to be right about, so a confident-
|
||||||
// looking score would be a lie — and auto-pick keys off this.
|
// looking score would be a lie — and auto-pick keys off this.
|
||||||
const unanchoredCap = 0.65
|
const unanchoredCap = 0.65
|
||||||
|
|
||||||
// AutoDownloadPrefs gates and scores what AutoPickable may choose
|
// AutoDownloadPrefs gates and scores what AutoPickable may choose
|
||||||
// without asking. Zero values are permissive: no size window and no
|
// without asking. Zero values are permissive: no bitrate window, no
|
||||||
// format restriction.
|
// size ceiling and no format restriction.
|
||||||
|
//
|
||||||
|
// **The window is a rate, not a size.** It used to be three numbers in
|
||||||
|
// megabytes, which cannot mean anything on their own: 300 MB is a
|
||||||
|
// generous FLAC single and a suspiciously small boxset, and the user
|
||||||
|
// setting the number has no idea which release the pipeline will
|
||||||
|
// eventually apply it to. A bitrate is the same statement normalised
|
||||||
|
// by how long the music is, so one number holds across a 9-minute EP
|
||||||
|
// and a 3-hour opera — and it is the unit the thing being described is
|
||||||
|
// actually measured in. The runtime is known for every request
|
||||||
|
// auto-pick can act on (`Download.Expected` carries per-track lengths,
|
||||||
|
// and an anchored request is the only kind that reaches here), so this
|
||||||
|
// costs no extra lookup.
|
||||||
type AutoDownloadPrefs struct {
|
type AutoDownloadPrefs struct {
|
||||||
// MinSizeMB and MaxSizeMB bound what auto-pick will grab. Zero
|
// MinKbps and MaxKbps bound the average bitrate auto-pick will
|
||||||
// means no bound on that side. A candidate outside the window is
|
// grab. Zero means no bound on that side. A candidate outside the
|
||||||
// filtered out of auto-pick entirely, not merely scored down — a
|
// window is filtered out of auto-pick entirely, not merely scored
|
||||||
// tiny "sampler" torrent or a boxset ten times the expected size is
|
// down — a 96 kbps rip of the right album is not a worse copy the
|
||||||
// usually the wrong thing entirely, not a worse copy of the right
|
// user might accept, it is one they said not to take unattended.
|
||||||
// thing.
|
//
|
||||||
MinSizeMB int `json:"minSizeMb"`
|
// For reference: 320 is the top of MP3, ~500–1000 is FLAC depending
|
||||||
MaxSizeMB int `json:"maxSizeMb"`
|
// on the material, and anything under ~128 is a transcode.
|
||||||
|
MinKbps int `json:"minKbps"`
|
||||||
|
MaxKbps int `json:"maxKbps"`
|
||||||
|
|
||||||
// PreferredSizeMB nudges the score toward a target size within the
|
// PreferredKbps nudges the score toward a target rate within the
|
||||||
// min/max window (a lossless rip and a heavily-padded lossless rip
|
// window, and breaks the tie when several candidates are equally
|
||||||
// can both pass the window). Zero disables the nudge; sizeFit then
|
// good matches. Zero disables the nudge; bitrateFit then returns a
|
||||||
// returns a neutral value that does not affect ranking.
|
// neutral value that does not affect ranking.
|
||||||
PreferredSizeMB int `json:"preferredSizeMb"`
|
PreferredKbps int `json:"preferredKbps"`
|
||||||
|
|
||||||
|
// MaxSizeMB is a hard ceiling on the whole candidate, and it is
|
||||||
|
// deliberately still a size. It answers a different question from
|
||||||
|
// the window above — not "is this the quality I want" but "is this
|
||||||
|
// going to fill the disk" — and it has to hold even for a candidate
|
||||||
|
// whose bitrate cannot be worked out, which is exactly the shape a
|
||||||
|
// mislabelled boxset arrives in. Zero means no ceiling.
|
||||||
|
MaxSizeMB int `json:"maxSizeMb"`
|
||||||
|
|
||||||
// AllowedFormats restricts auto-pick to candidates whose audio
|
// AllowedFormats restricts auto-pick to candidates whose audio
|
||||||
// files are all in one of these formats. Empty means no
|
// files are all in one of these formats. Empty means no
|
||||||
@@ -74,19 +139,33 @@ type AutoDownloadPrefs struct {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// eligible reports whether a candidate may be auto-picked under these
|
// eligible reports whether a candidate may be auto-picked under these
|
||||||
// preferences: within the size window (when set) and, when a format
|
// preferences: inside the bitrate window and the size ceiling (when
|
||||||
// list is given, every audio file in an allowed format.
|
// set) and, when a format list is given, every audio file in an
|
||||||
func (p AutoDownloadPrefs) eligible(c Candidate) bool {
|
// allowed format.
|
||||||
|
//
|
||||||
|
// `runtimeMillis` is how long the requested release is, and 0 means
|
||||||
|
// nobody knows. An unknown runtime **passes** the bitrate window
|
||||||
|
// rather than failing it: the window is a statement about quality, and
|
||||||
|
// refusing everything the moment a tracklist is missing a length would
|
||||||
|
// turn a gap in MusicBrainz into a silent embargo. The size ceiling
|
||||||
|
// still applies, which is why it exists separately.
|
||||||
|
func (p AutoDownloadPrefs) eligible(c Candidate, runtimeMillis int64) bool {
|
||||||
const bytesPerMB = 1 << 20
|
const bytesPerMB = 1 << 20
|
||||||
|
|
||||||
if p.MinSizeMB > 0 && c.TotalSize < int64(p.MinSizeMB)*bytesPerMB {
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
if p.MaxSizeMB > 0 && c.TotalSize > int64(p.MaxSizeMB)*bytesPerMB {
|
if p.MaxSizeMB > 0 && c.TotalSize > int64(p.MaxSizeMB)*bytesPerMB {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if kbps := candidateKbps(c, runtimeMillis); kbps > 0 {
|
||||||
|
if p.MinKbps > 0 && kbps < float64(p.MinKbps) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
if p.MaxKbps > 0 && kbps > float64(p.MaxKbps) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
if len(p.AllowedFormats) == 0 {
|
if len(p.AllowedFormats) == 0 {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
@@ -107,11 +186,14 @@ func (p AutoDownloadPrefs) eligible(c Candidate) bool {
|
|||||||
|
|
||||||
// filter returns only the candidates these preferences allow to be
|
// filter returns only the candidates these preferences allow to be
|
||||||
// auto-picked, in the same (already ranked) order.
|
// auto-picked, in the same (already ranked) order.
|
||||||
func (p AutoDownloadPrefs) filter(ranked []Candidate) []Candidate {
|
func (p AutoDownloadPrefs) filter(
|
||||||
|
ranked []Candidate,
|
||||||
|
runtimeMillis int64,
|
||||||
|
) []Candidate {
|
||||||
out := make([]Candidate, 0, len(ranked))
|
out := make([]Candidate, 0, len(ranked))
|
||||||
|
|
||||||
for _, c := range ranked {
|
for _, c := range ranked {
|
||||||
if p.eligible(c) {
|
if p.eligible(c, runtimeMillis) {
|
||||||
out = append(out, c)
|
out = append(out, c)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -119,32 +201,116 @@ func (p AutoDownloadPrefs) filter(ranked []Candidate) []Candidate {
|
|||||||
return out
|
return out
|
||||||
}
|
}
|
||||||
|
|
||||||
// sizeFit scores how close totalSize is to PreferredSizeMB, 0..1,
|
// bitrateFit scores how close a candidate's average bitrate is to
|
||||||
// falling off linearly as the size doubles or halves away from it.
|
// PreferredKbps, falling off linearly as it doubles or halves away
|
||||||
// Returns a neutral 0.5 when no preference is set, so the absence of a
|
// from it.
|
||||||
// preference does not bias ranking.
|
//
|
||||||
func (p AutoDownloadPrefs) sizeFit(totalSize int64) float64 {
|
// The range is **0.5 to 1.0, not 0 to 1**, and the floor is the point.
|
||||||
|
// This carries 0.40 of the quality score once a preference is set, so a
|
||||||
|
// span down to zero would let a preference of 320 kbps push a perfectly
|
||||||
|
// good FLAC under `minQuality` and out of auto-pick altogether —
|
||||||
|
// turning "I like 320" into "never take anything else", silently. A
|
||||||
|
// preference may promote the copy that matches it; it may not
|
||||||
|
// disqualify the others. That is what `MinKbps`/`MaxKbps` are for, and
|
||||||
|
// they say so out loud.
|
||||||
|
//
|
||||||
|
// Returns the neutral floor when no preference is set or the rate
|
||||||
|
// cannot be worked out, so neither an absent preference nor an absent
|
||||||
|
// runtime biases ranking.
|
||||||
|
func (p AutoDownloadPrefs) bitrateFit(
|
||||||
|
c Candidate,
|
||||||
|
runtimeMillis int64,
|
||||||
|
) float64 {
|
||||||
const (
|
const (
|
||||||
bytesPerMB = 1 << 20
|
neutral = 0.5
|
||||||
neutral = 0.5
|
span = 0.5
|
||||||
)
|
)
|
||||||
|
|
||||||
if p.PreferredSizeMB <= 0 || totalSize <= 0 {
|
if p.PreferredKbps <= 0 {
|
||||||
return neutral
|
return neutral
|
||||||
}
|
}
|
||||||
|
|
||||||
preferred := float64(p.PreferredSizeMB) * bytesPerMB
|
kbps := candidateKbps(c, runtimeMillis)
|
||||||
ratio := float64(totalSize) / preferred
|
if kbps <= 0 {
|
||||||
|
return neutral
|
||||||
|
}
|
||||||
|
|
||||||
|
ratio := kbps / float64(p.PreferredKbps)
|
||||||
if ratio < 1 {
|
if ratio < 1 {
|
||||||
ratio = 1 / ratio
|
ratio = 1 / ratio
|
||||||
}
|
}
|
||||||
|
|
||||||
// ratio is now >= 1: 1.0 is an exact match, 2.0 is double or half
|
// ratio is now >= 1: 1.0 is an exact match, 2.0 is double or half
|
||||||
// the preferred size. Falls to 0 at 2x away and beyond.
|
// the preferred rate, where the closeness term reaches 0.
|
||||||
fit := 1 - (ratio - 1)
|
return neutral + span*clamp01(1-(ratio-1))
|
||||||
|
}
|
||||||
|
|
||||||
return clamp01(fit)
|
// candidateKbps is a candidate's average audio bitrate, or 0 when it
|
||||||
|
// cannot be worked out.
|
||||||
|
//
|
||||||
|
// Two sources, in this order, and the order matters:
|
||||||
|
//
|
||||||
|
// - **Derived from bytes over runtime**, which is the honest one. It
|
||||||
|
// covers lossless (where a stated bitrate rarely exists), it cannot
|
||||||
|
// be lied to by a filename, and it is what the user's window means.
|
||||||
|
// Only the *audio* files count: cover scans and a log file are not
|
||||||
|
// part of the bitrate, and a folder with 30 MB of artwork would
|
||||||
|
// otherwise read as a better rip than the same music without it.
|
||||||
|
// - **The mean stated bitrate**, when the runtime is unknown. Weaker
|
||||||
|
// — a provider that parses it from an MP3 header states it and one
|
||||||
|
// that guesses from the filename also "states" it — but a number
|
||||||
|
// from the file itself beats no number at all.
|
||||||
|
func candidateKbps(c Candidate, runtimeMillis int64) float64 {
|
||||||
|
const bitsPerByte = 8
|
||||||
|
|
||||||
|
audio := c.AudioFiles()
|
||||||
|
if len(audio) == 0 {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
|
||||||
|
if runtimeMillis > 0 {
|
||||||
|
var bytes int64
|
||||||
|
for _, f := range audio {
|
||||||
|
bytes += f.Size
|
||||||
|
}
|
||||||
|
|
||||||
|
if bytes > 0 {
|
||||||
|
// bytes×8 bits over seconds, expressed in kbps: the two
|
||||||
|
// factors of 1000 (millis→seconds, bits→kilobits) cancel.
|
||||||
|
return float64(bytes) * bitsPerByte /
|
||||||
|
float64(runtimeMillis)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
var (
|
||||||
|
sum int
|
||||||
|
count int
|
||||||
|
)
|
||||||
|
|
||||||
|
for _, f := range audio {
|
||||||
|
if f.Bitrate > 0 {
|
||||||
|
sum += f.Bitrate
|
||||||
|
count++
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if count == 0 {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
|
||||||
|
return float64(sum) / float64(count)
|
||||||
|
}
|
||||||
|
|
||||||
|
// runtimeMillis is how long the requested release is, summed over its
|
||||||
|
// expected tracklist. Zero when the tracklist is absent or carries no
|
||||||
|
// lengths, which is what every caller here treats as "unknown".
|
||||||
|
func (d Download) runtimeMillis() int64 {
|
||||||
|
var total int64
|
||||||
|
for _, t := range d.Expected {
|
||||||
|
total += t.LengthMillis
|
||||||
|
}
|
||||||
|
|
||||||
|
return total
|
||||||
}
|
}
|
||||||
|
|
||||||
// Score fills a candidate's Match, Quality and Score fields.
|
// Score fills a candidate's Match, Quality and Score fields.
|
||||||
@@ -160,7 +326,9 @@ func Score(dl Download, c Candidate, priority int, prefs AutoDownloadPrefs) Cand
|
|||||||
c.Files = mergeMatched(c.Files, matched)
|
c.Files = mergeMatched(c.Files, matched)
|
||||||
|
|
||||||
c.Match = scoreMatch(dl, c, audio, titleFit)
|
c.Match = scoreMatch(dl, c, audio, titleFit)
|
||||||
c.Quality = scoreQuality(c, audio, priority, prefs)
|
c.Quality = scoreQuality(
|
||||||
|
c, audio, priority, prefs, dl.runtimeMillis(),
|
||||||
|
)
|
||||||
|
|
||||||
c.Score = weightMatch*c.Match.Overall + weightQuality*c.Quality.Overall
|
c.Score = weightMatch*c.Match.Overall + weightQuality*c.Quality.Overall
|
||||||
|
|
||||||
@@ -279,11 +447,12 @@ func scoreQuality(
|
|||||||
audio []CandidateFile,
|
audio []CandidateFile,
|
||||||
priority int,
|
priority int,
|
||||||
prefs AutoDownloadPrefs,
|
prefs AutoDownloadPrefs,
|
||||||
|
runtimeMillis int64,
|
||||||
) QualityScore {
|
) QualityScore {
|
||||||
q := QualityScore{
|
q := QualityScore{
|
||||||
Health: clamp01(c.Health),
|
Health: clamp01(c.Health),
|
||||||
Priority: clamp01(float64(priority) / 100.0),
|
Priority: clamp01(float64(priority) / 100.0),
|
||||||
SizeFit: prefs.sizeFit(c.TotalSize),
|
BitrateFit: prefs.bitrateFit(c, runtimeMillis),
|
||||||
}
|
}
|
||||||
|
|
||||||
if len(audio) == 0 {
|
if len(audio) == 0 {
|
||||||
@@ -310,11 +479,13 @@ func scoreQuality(
|
|||||||
q.FormatRank = worst
|
q.FormatRank = worst
|
||||||
q.Bitrate = bitrateScore(audio)
|
q.Bitrate = bitrateScore(audio)
|
||||||
|
|
||||||
q.Overall = weightFormat*q.FormatRank +
|
wFormat, wBitrate, wHealth, wPriority, wFit := qualityWeights(prefs)
|
||||||
weightBitrate*q.Bitrate +
|
|
||||||
weightHealth*q.Health +
|
q.Overall = wFormat*q.FormatRank +
|
||||||
weightPriority*q.Priority +
|
wBitrate*q.Bitrate +
|
||||||
weightSizeFit*q.SizeFit
|
wHealth*q.Health +
|
||||||
|
wPriority*q.Priority +
|
||||||
|
wFit*q.BitrateFit
|
||||||
|
|
||||||
if q.Mixed {
|
if q.Mixed {
|
||||||
q.Overall *= 0.9
|
q.Overall *= 0.9
|
||||||
@@ -444,6 +615,19 @@ func Rank(
|
|||||||
return out[i].Match.Overall > out[j].Match.Overall
|
return out[i].Match.Overall > out[j].Match.Overall
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Closest to the preferred bitrate wins the tie.
|
||||||
|
//
|
||||||
|
// This is what decides which copy is taken now that auto-pick
|
||||||
|
// no longer requires the winner to be clear of the field: when
|
||||||
|
// several candidates are equally good matches of equal overall
|
||||||
|
// quality, the one the user said they wanted the shape of is
|
||||||
|
// the answer, ahead of provider priority. With no preference
|
||||||
|
// set every BitrateFit is the same neutral value and this
|
||||||
|
// falls through, exactly as before.
|
||||||
|
if out[i].Quality.BitrateFit != out[j].Quality.BitrateFit {
|
||||||
|
return out[i].Quality.BitrateFit > out[j].Quality.BitrateFit
|
||||||
|
}
|
||||||
|
|
||||||
if out[i].Quality.Priority != out[j].Quality.Priority {
|
if out[i].Quality.Priority != out[j].Quality.Priority {
|
||||||
return out[i].Quality.Priority > out[j].Quality.Priority
|
return out[i].Quality.Priority > out[j].Quality.Priority
|
||||||
}
|
}
|
||||||
@@ -454,19 +638,58 @@ func Rank(
|
|||||||
return out
|
return out
|
||||||
}
|
}
|
||||||
|
|
||||||
// AutoPickable reports whether a ranked list has a clear enough winner
|
// Auto-pick gates. Named rather than inlined because AutoPickVeto
|
||||||
// to grab without asking. It demands an anchored request, a high match,
|
// reports which of them refused, and a number in a sentence the user
|
||||||
// decent quality, and daylight between first and second place — if two
|
// reads should be the same number the decision used.
|
||||||
// candidates are close, the choice is the user's.
|
const (
|
||||||
func AutoPickable(dl Download, ranked []Candidate, prefs AutoDownloadPrefs) bool {
|
minMatch = 0.85
|
||||||
const (
|
minQuality = 0.5
|
||||||
minMatch = 0.85
|
)
|
||||||
minQuality = 0.5
|
|
||||||
minLead = 0.08
|
|
||||||
)
|
|
||||||
|
|
||||||
if !dl.Anchored() || len(ranked) == 0 {
|
// AutoPickable reports whether a ranked list has a candidate worth
|
||||||
return false
|
// grabbing without asking: an anchored request with a tracklist behind
|
||||||
|
// it, and a candidate that clears the match and quality bars inside the
|
||||||
|
// user's guardrails.
|
||||||
|
//
|
||||||
|
// **It does not require the winner to be better than the runner-up.**
|
||||||
|
// It used to demand 0.08 of daylight on the combined score, which meant
|
||||||
|
// the check fired hardest in the case it was never written for: a
|
||||||
|
// popular album turns up five *correct* copies, all matching the
|
||||||
|
// tracklist at 95%+ and differing only in format and seeders, their
|
||||||
|
// scores land within a point of each other, and auto-pick refused
|
||||||
|
// forever on the grounds that the choice was the user's. It was not.
|
||||||
|
// There was no question about *what* to fetch, only about which copy —
|
||||||
|
// and abundance is the one condition under which that question matters
|
||||||
|
// least. A candidate does not need to be the best one, only one that
|
||||||
|
// meets the criteria; where several do, `Rank` puts the one closest to
|
||||||
|
// the preferred bitrate first.
|
||||||
|
func AutoPickable(dl Download, ranked []Candidate, prefs AutoDownloadPrefs) bool {
|
||||||
|
return AutoPickVeto(dl, ranked, prefs) == ""
|
||||||
|
}
|
||||||
|
|
||||||
|
// AutoPickVeto returns the reason auto-pick declined, or "" when it
|
||||||
|
// would go ahead.
|
||||||
|
//
|
||||||
|
// It exists because "it rejected all of them" was indistinguishable
|
||||||
|
// from "it found nothing good". The request list's message was built
|
||||||
|
// from `ranked[0]` — the best candidate *before* the size and format
|
||||||
|
// guardrails, and before the lead check — so a request refused because
|
||||||
|
// the user's maximum size excluded every copy, or because three equally
|
||||||
|
// good copies were found, reported "best of 12 found is not a confident
|
||||||
|
// enough match (match 96%, quality 88%)". Numbers that clear both
|
||||||
|
// thresholds, beside a refusal, is a message that teaches the user the
|
||||||
|
// matcher is broken. Each gate names itself now.
|
||||||
|
func AutoPickVeto(
|
||||||
|
dl Download,
|
||||||
|
ranked []Candidate,
|
||||||
|
prefs AutoDownloadPrefs,
|
||||||
|
) string {
|
||||||
|
if len(ranked) == 0 {
|
||||||
|
return "nothing found"
|
||||||
|
}
|
||||||
|
|
||||||
|
if !dl.Anchored() {
|
||||||
|
return "the request is free text, so there is no release to be right about"
|
||||||
}
|
}
|
||||||
|
|
||||||
// An anchor with no tracklist behind it is an anchor in name only:
|
// An anchor with no tracklist behind it is an anchor in name only:
|
||||||
@@ -474,29 +697,42 @@ func AutoPickable(dl Download, ranked []Candidate, prefs AutoDownloadPrefs) bool
|
|||||||
// is exactly the evidence a wrong-album candidate also has. This
|
// is exactly the evidence a wrong-album candidate also has. This
|
||||||
// matters most for the request list, where nobody is watching.
|
// matters most for the request list, where nobody is watching.
|
||||||
if len(dl.Expected) == 0 {
|
if len(dl.Expected) == 0 {
|
||||||
return false
|
return "no tracklist for this release is known yet, so a candidate cannot be checked against it"
|
||||||
}
|
}
|
||||||
|
|
||||||
// The guardrails apply before the match/quality/lead checks: a
|
// The guardrails apply before the match and quality checks: a
|
||||||
// candidate outside the allowed size or format is not a worse
|
// candidate outside the allowed bitrate, size or format is not a
|
||||||
// choice, it is not a choice auto-pick may make at all, so it must
|
// worse choice, it is not a choice auto-pick may make at all, so it
|
||||||
// not count as "the winner" nor as "second place" for the lead
|
// must not count as "the winner" either.
|
||||||
// check below.
|
eligible := prefs.filter(ranked, dl.runtimeMillis())
|
||||||
eligible := prefs.filter(ranked)
|
|
||||||
if len(eligible) == 0 {
|
if len(eligible) == 0 {
|
||||||
return false
|
return fmt.Sprintf(
|
||||||
|
"all %d found are outside the auto-download bitrate, size or format limits",
|
||||||
|
len(ranked),
|
||||||
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
best := eligible[0]
|
best := eligible[0]
|
||||||
if best.Match.Overall < minMatch || best.Quality.Overall < minQuality {
|
|
||||||
return false
|
if best.Match.Overall < minMatch {
|
||||||
|
return fmt.Sprintf(
|
||||||
|
"best of %d found matches this release only %.0f%% (needs %.0f%%)",
|
||||||
|
len(ranked),
|
||||||
|
best.Match.Overall*100, //nolint:mnd // percent
|
||||||
|
minMatch*100, //nolint:mnd // percent
|
||||||
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
if len(eligible) > 1 && best.Score-eligible[1].Score < minLead {
|
if best.Quality.Overall < minQuality {
|
||||||
return false
|
return fmt.Sprintf(
|
||||||
|
"best of %d found is the right release but scores %.0f%% on quality (needs %.0f%%)",
|
||||||
|
len(ranked),
|
||||||
|
best.Quality.Overall*100, //nolint:mnd // percent
|
||||||
|
minQuality*100, //nolint:mnd // percent
|
||||||
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
return true
|
return ""
|
||||||
}
|
}
|
||||||
|
|
||||||
// mergeMatched copies MatchedTo assignments from the audio-only slice
|
// mergeMatched copies MatchedTo assignments from the audio-only slice
|
||||||
|
|||||||
+360
-57
@@ -1,6 +1,34 @@
|
|||||||
package download
|
package download
|
||||||
|
|
||||||
import "testing"
|
import (
|
||||||
|
"strings"
|
||||||
|
"testing"
|
||||||
|
)
|
||||||
|
|
||||||
|
// trackMillis is five minutes; okComputer's four of them make a
|
||||||
|
// twenty-minute release, which is what turns a candidate's byte count
|
||||||
|
// into a bitrate the assertions below can name.
|
||||||
|
const trackMillis = 5 * 60 * 1000
|
||||||
|
|
||||||
|
// okComputerRuntime is that release's runtime, for the helpers that
|
||||||
|
// need it directly.
|
||||||
|
const okComputerRuntime = 4 * trackMillis
|
||||||
|
|
||||||
|
// kbpsCandidate builds an annotated candidate whose audio adds up to
|
||||||
|
// the given average bitrate over okComputer's runtime.
|
||||||
|
func kbpsCandidate(id, ext string, kbps int) Candidate {
|
||||||
|
// bits = kbps × 1000 × (runtimeMillis / 1000), so the thousands
|
||||||
|
// cancel and the byte count is kbps × runtimeMillis / 8.
|
||||||
|
const bitsPerByte = 8
|
||||||
|
|
||||||
|
total := int64(kbps) * okComputerRuntime / bitsPerByte
|
||||||
|
|
||||||
|
c := candidateFor(id, allTitles(), ext, total/int64(len(allTitles())))
|
||||||
|
c.Files = AnnotateFiles(c.Files)
|
||||||
|
c.TotalSize = total
|
||||||
|
|
||||||
|
return c
|
||||||
|
}
|
||||||
|
|
||||||
// okComputer is the reference request used across ranking tests.
|
// okComputer is the reference request used across ranking tests.
|
||||||
func okComputer() Download {
|
func okComputer() Download {
|
||||||
@@ -8,11 +36,15 @@ func okComputer() Download {
|
|||||||
ReleaseMBID: "mbid-ok-computer",
|
ReleaseMBID: "mbid-ok-computer",
|
||||||
Artist: "Radiohead",
|
Artist: "Radiohead",
|
||||||
Album: "OK Computer",
|
Album: "OK Computer",
|
||||||
|
// Four five-minute tracks: twenty minutes, so a candidate's
|
||||||
|
// bitrate is a number these tests can state exactly. Without
|
||||||
|
// lengths there is no runtime and the bitrate window has
|
||||||
|
// nothing to divide by.
|
||||||
Expected: []ExpectedTrack{
|
Expected: []ExpectedTrack{
|
||||||
{Position: 1, Title: "Airbag"},
|
{Position: 1, Title: "Airbag", LengthMillis: trackMillis},
|
||||||
{Position: 2, Title: "Paranoid Android"},
|
{Position: 2, Title: "Paranoid Android", LengthMillis: trackMillis},
|
||||||
{Position: 3, Title: "Subterranean Homesick Alien"},
|
{Position: 3, Title: "Subterranean Homesick Alien", LengthMillis: trackMillis},
|
||||||
{Position: 4, Title: "Exit Music (For a Film)"},
|
{Position: 4, Title: "Exit Music (For a Film)", LengthMillis: trackMillis},
|
||||||
},
|
},
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -187,7 +219,7 @@ func TestUnanchoredMatchIsCapped(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestAutoPickableRequiresAnchorAndLead(t *testing.T) {
|
func TestAutoPickableRequiresAnchorAndTracklist(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
dl := okComputer()
|
dl := okComputer()
|
||||||
@@ -211,14 +243,18 @@ func TestAutoPickableRequiresAnchorAndLead(t *testing.T) {
|
|||||||
}
|
}
|
||||||
})
|
})
|
||||||
|
|
||||||
t.Run("two close candidates are not", func(t *testing.T) {
|
// Two identical copies are a spare, not an ambiguity. This
|
||||||
|
// asserted the opposite while auto-pick required daylight over the
|
||||||
|
// runner-up — a rule that made abundance the thing that stopped a
|
||||||
|
// request being satisfied, which is backwards.
|
||||||
|
t.Run("two equally good candidates still are", func(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
twin := best
|
twin := best
|
||||||
twin.ID = "twin"
|
twin.ID = "twin"
|
||||||
|
|
||||||
if AutoPickable(dl, []Candidate{best, twin}, AutoDownloadPrefs{}) {
|
if !AutoPickable(dl, []Candidate{best, twin}, AutoDownloadPrefs{}) {
|
||||||
t.Error("identical candidates must not auto-pick")
|
t.Error("identical good candidates must auto-pick")
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
|
|
||||||
@@ -300,18 +336,11 @@ func TestProviderPriorityBreaksTies(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
const mb = 1 << 20
|
|
||||||
|
|
||||||
func TestAutoDownloadPrefsEligible(t *testing.T) {
|
func TestAutoDownloadPrefsEligible(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
flacCandidate := candidateFor("c", allTitles(), ".flac", 30_000_000)
|
flacCandidate := kbpsCandidate("c", ".flac", 900)
|
||||||
flacCandidate.Files = AnnotateFiles(flacCandidate.Files)
|
mp3Candidate := kbpsCandidate("c", ".mp3", 128)
|
||||||
flacCandidate.TotalSize = 300 * mb
|
|
||||||
|
|
||||||
mp3Candidate := candidateFor("c", allTitles(), ".mp3", 3_000_000)
|
|
||||||
mp3Candidate.Files = AnnotateFiles(mp3Candidate.Files)
|
|
||||||
mp3Candidate.TotalSize = 30 * mb
|
|
||||||
|
|
||||||
tests := []struct {
|
tests := []struct {
|
||||||
name string
|
name string
|
||||||
@@ -321,18 +350,25 @@ func TestAutoDownloadPrefsEligible(t *testing.T) {
|
|||||||
}{
|
}{
|
||||||
{"zero value is permissive", AutoDownloadPrefs{}, flacCandidate, true},
|
{"zero value is permissive", AutoDownloadPrefs{}, flacCandidate, true},
|
||||||
{
|
{
|
||||||
"within min/max window",
|
"within the bitrate window",
|
||||||
AutoDownloadPrefs{MinSizeMB: 100, MaxSizeMB: 500},
|
AutoDownloadPrefs{MinKbps: 320, MaxKbps: 1200},
|
||||||
flacCandidate, true,
|
flacCandidate, true,
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"below minimum",
|
"below the minimum bitrate",
|
||||||
AutoDownloadPrefs{MinSizeMB: 400},
|
AutoDownloadPrefs{MinKbps: 500},
|
||||||
|
mp3Candidate, false,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
"above the maximum bitrate",
|
||||||
|
AutoDownloadPrefs{MaxKbps: 500},
|
||||||
flacCandidate, false,
|
flacCandidate, false,
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"above maximum",
|
// The ceiling is bytes, not a rate, and it is the guard
|
||||||
AutoDownloadPrefs{MaxSizeMB: 200},
|
// that still works when the bitrate cannot be worked out.
|
||||||
|
"above the hard size ceiling",
|
||||||
|
AutoDownloadPrefs{MaxSizeMB: 50},
|
||||||
flacCandidate, false,
|
flacCandidate, false,
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
@@ -351,57 +387,131 @@ func TestAutoDownloadPrefsEligible(t *testing.T) {
|
|||||||
t.Run(tt.name, func(t *testing.T) {
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
if got := tt.prefs.eligible(tt.c); got != tt.want {
|
got := tt.prefs.eligible(tt.c, okComputerRuntime)
|
||||||
|
if got != tt.want {
|
||||||
t.Errorf("eligible() = %v, want %v", got, tt.want)
|
t.Errorf("eligible() = %v, want %v", got, tt.want)
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// A release nobody knows the length of cannot be judged on bitrate, and
|
||||||
|
// the window must not become a silent embargo because MusicBrainz is
|
||||||
|
// missing a track length. The size ceiling still applies — that is why
|
||||||
|
// it is a separate field.
|
||||||
|
func TestBitrateWindowPassesAnUnknownRuntime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
c := kbpsCandidate("c", ".mp3", 128)
|
||||||
|
prefs := AutoDownloadPrefs{MinKbps: 900}
|
||||||
|
|
||||||
|
if !prefs.eligible(c, 0) {
|
||||||
|
t.Error("an unknown runtime must pass the bitrate window")
|
||||||
|
}
|
||||||
|
|
||||||
|
if prefs.eligible(c, okComputerRuntime) {
|
||||||
|
t.Error("a known runtime must still be judged")
|
||||||
|
}
|
||||||
|
|
||||||
|
ceiling := AutoDownloadPrefs{MaxSizeMB: 1}
|
||||||
|
if ceiling.eligible(c, 0) {
|
||||||
|
t.Error("the size ceiling must apply even with no runtime")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Artwork is not part of the bitrate. A folder carrying 30 MB of
|
||||||
|
// scans would otherwise read as a better rip than the same music
|
||||||
|
// without them, which is backwards.
|
||||||
|
func TestBitrateIgnoresNonAudioFiles(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
c := kbpsCandidate("c", ".mp3", 320)
|
||||||
|
bare := candidateKbps(c, okComputerRuntime)
|
||||||
|
|
||||||
|
c.Files = append(c.Files, CandidateFile{
|
||||||
|
Path: "Radiohead - OK Computer/cover.jpg",
|
||||||
|
Size: 30 << 20,
|
||||||
|
})
|
||||||
|
c.Files = AnnotateFiles(c.Files)
|
||||||
|
|
||||||
|
if got := candidateKbps(c, okComputerRuntime); got != bare {
|
||||||
|
t.Errorf("bitrate with artwork = %f, want %f", got, bare)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Where no runtime is known, a stated per-file bitrate is better than
|
||||||
|
// no answer at all.
|
||||||
|
func TestBitrateFallsBackToTheStatedRate(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
c := candidateFor("c", allTitles(), ".mp3", 3_000_000)
|
||||||
|
for i := range c.Files {
|
||||||
|
c.Files[i].Bitrate = 192
|
||||||
|
}
|
||||||
|
|
||||||
|
c.Files = AnnotateFiles(c.Files)
|
||||||
|
|
||||||
|
if got := candidateKbps(c, 0); got != 192 {
|
||||||
|
t.Errorf("stated bitrate = %f, want 192", got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
func TestAutoDownloadPrefsFilter(t *testing.T) {
|
func TestAutoDownloadPrefsFilter(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
small := candidateFor("small", allTitles(), ".flac", 10_000_000)
|
lossy := kbpsCandidate("lossy", ".mp3", 128)
|
||||||
small.TotalSize = 50 * mb
|
lossless := kbpsCandidate("lossless", ".flac", 900)
|
||||||
|
|
||||||
big := candidateFor("big", allTitles(), ".flac", 30_000_000)
|
prefs := AutoDownloadPrefs{MinKbps: 500}
|
||||||
big.TotalSize = 500 * mb
|
|
||||||
|
|
||||||
prefs := AutoDownloadPrefs{MinSizeMB: 100, MaxSizeMB: 600}
|
filtered := prefs.filter(
|
||||||
|
[]Candidate{lossy, lossless}, okComputerRuntime,
|
||||||
|
)
|
||||||
|
|
||||||
filtered := prefs.filter([]Candidate{small, big})
|
if len(filtered) != 1 || filtered[0].ID != "lossless" {
|
||||||
|
|
||||||
if len(filtered) != 1 || filtered[0].ID != "big" {
|
|
||||||
t.Errorf("filter() = %v, want only the in-window candidate", filtered)
|
t.Errorf("filter() = %v, want only the in-window candidate", filtered)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestAutoDownloadPrefsSizeFit(t *testing.T) {
|
func TestAutoDownloadPrefsBitrateFit(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
const neutral = 0.5
|
const neutral = 0.5
|
||||||
|
|
||||||
tests := []struct {
|
tests := []struct {
|
||||||
name string
|
name string
|
||||||
prefs AutoDownloadPrefs
|
prefs AutoDownloadPrefs
|
||||||
totalSize int64
|
c Candidate
|
||||||
want float64
|
want float64
|
||||||
}{
|
}{
|
||||||
{"no preference is neutral", AutoDownloadPrefs{}, 300 * mb, neutral},
|
{
|
||||||
|
"no preference is neutral",
|
||||||
|
AutoDownloadPrefs{},
|
||||||
|
kbpsCandidate("c", ".flac", 900), neutral,
|
||||||
|
},
|
||||||
{
|
{
|
||||||
"exact match scores 1",
|
"exact match scores 1",
|
||||||
AutoDownloadPrefs{PreferredSizeMB: 300},
|
AutoDownloadPrefs{PreferredKbps: 320},
|
||||||
300 * mb, 1.0,
|
kbpsCandidate("c", ".mp3", 320), 1.0,
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"double the preferred size scores 0",
|
// The floor is neutral, not zero: this term carries 0.40
|
||||||
AutoDownloadPrefs{PreferredSizeMB: 300},
|
// of the quality score once a preference is set, and a
|
||||||
600 * mb, 0.0,
|
// span to zero would let "I like 320" quietly disqualify
|
||||||
|
// every FLAC from auto-pick.
|
||||||
|
"double the preferred rate falls to the neutral floor",
|
||||||
|
AutoDownloadPrefs{PreferredKbps: 320},
|
||||||
|
kbpsCandidate("c", ".flac", 640), neutral,
|
||||||
},
|
},
|
||||||
{
|
{
|
||||||
"half the preferred size scores 0",
|
"half the preferred rate falls to the neutral floor",
|
||||||
AutoDownloadPrefs{PreferredSizeMB: 300},
|
AutoDownloadPrefs{PreferredKbps: 320},
|
||||||
150 * mb, 0.0,
|
kbpsCandidate("c", ".mp3", 160), neutral,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
"an unknowable rate is neutral",
|
||||||
|
AutoDownloadPrefs{PreferredKbps: 320},
|
||||||
|
kbpsCandidate("c", ".mp3", 320), neutral,
|
||||||
},
|
},
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -409,30 +519,223 @@ func TestAutoDownloadPrefsSizeFit(t *testing.T) {
|
|||||||
t.Run(tt.name, func(t *testing.T) {
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
if got := tt.prefs.sizeFit(tt.totalSize); got != tt.want {
|
// The last case deliberately withholds the runtime.
|
||||||
t.Errorf("sizeFit(%d) = %f, want %f", tt.totalSize, got, tt.want)
|
runtime := int64(okComputerRuntime)
|
||||||
|
if tt.name == "an unknowable rate is neutral" {
|
||||||
|
runtime = 0
|
||||||
|
}
|
||||||
|
|
||||||
|
if got := tt.prefs.bitrateFit(tt.c, runtime); got != tt.want {
|
||||||
|
t.Errorf("bitrateFit() = %f, want %f", got, tt.want)
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// An otherwise-perfect candidate must not auto-pick when it falls
|
// An otherwise-perfect candidate must not auto-pick when it falls
|
||||||
// outside the configured size guard: the guardrail applies before the
|
// outside the configured guardrails: they apply before the match and
|
||||||
// match/quality/lead checks, not as one more input averaged into them.
|
// quality checks, not as one more input averaged into them.
|
||||||
func TestAutoPickableRejectsCandidateOutsideSizeGuard(t *testing.T) {
|
func TestAutoPickableRejectsCandidateOutsideTheGuardrails(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
dl := okComputer()
|
dl := okComputer()
|
||||||
best := Score(dl, candidateFor("a", allTitles(), ".flac", 30_000_000), 50, AutoDownloadPrefs{})
|
best := Score(dl, kbpsCandidate("a", ".flac", 900), 50, AutoDownloadPrefs{})
|
||||||
best.TotalSize = 500 * mb
|
|
||||||
|
|
||||||
if !AutoPickable(dl, []Candidate{best}, AutoDownloadPrefs{}) {
|
if !AutoPickable(dl, []Candidate{best}, AutoDownloadPrefs{}) {
|
||||||
t.Fatal("expected this candidate to be auto-pickable with no guardrails")
|
t.Fatal("expected this candidate to be auto-pickable with no guardrails")
|
||||||
}
|
}
|
||||||
|
|
||||||
tight := AutoDownloadPrefs{MinSizeMB: 10, MaxSizeMB: 100}
|
if AutoPickable(dl, []Candidate{best}, AutoDownloadPrefs{MaxKbps: 320}) {
|
||||||
|
t.Error("candidate above the bitrate window must not auto-pick")
|
||||||
|
}
|
||||||
|
|
||||||
if AutoPickable(dl, []Candidate{best}, tight) {
|
if AutoPickable(dl, []Candidate{best}, AutoDownloadPrefs{MaxSizeMB: 1}) {
|
||||||
t.Error("candidate outside the size guard must not auto-pick")
|
t.Error("candidate above the size ceiling must not auto-pick")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The refusal has to name the gate that refused.
|
||||||
|
//
|
||||||
|
// Before AutoPickVeto, every one of these came back as the same
|
||||||
|
// sentence built from `ranked[0]` — the best candidate before the size
|
||||||
|
// and format guardrails — so a request refused because the user's size
|
||||||
|
// window excluded every copy reported a match and a quality that both
|
||||||
|
// cleared their thresholds. A refusal quoting numbers that pass is
|
||||||
|
// what made the matcher look broken from outside.
|
||||||
|
func TestAutoPickVetoNamesTheGate(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dl := okComputer()
|
||||||
|
best := Score(
|
||||||
|
dl,
|
||||||
|
candidateFor("a", allTitles(), ".flac", 30_000_000),
|
||||||
|
50,
|
||||||
|
AutoDownloadPrefs{},
|
||||||
|
)
|
||||||
|
|
||||||
|
// candidateFor sizes the files and leaves TotalSize at 0, which is
|
||||||
|
// what the guardrails read.
|
||||||
|
sized := func(c Candidate, total int64) Candidate {
|
||||||
|
c.TotalSize = total
|
||||||
|
|
||||||
|
return c
|
||||||
|
}
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
dl Download
|
||||||
|
ranked []Candidate
|
||||||
|
prefs AutoDownloadPrefs
|
||||||
|
wantSub string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
name: "nothing found",
|
||||||
|
dl: dl,
|
||||||
|
ranked: nil,
|
||||||
|
wantSub: "nothing found",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "free text",
|
||||||
|
dl: Download{Artist: "Radiohead", Album: "OK Computer"},
|
||||||
|
ranked: []Candidate{best},
|
||||||
|
wantSub: "free text",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "no tracklist behind the anchor",
|
||||||
|
dl: Download{
|
||||||
|
ReleaseMBID: "mbid-ok-computer",
|
||||||
|
Artist: "Radiohead",
|
||||||
|
Album: "OK Computer",
|
||||||
|
},
|
||||||
|
ranked: []Candidate{best},
|
||||||
|
wantSub: "no tracklist",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// The candidate is 120 MB and the window tops out at 1 MB:
|
||||||
|
// the old message reported its match and quality instead.
|
||||||
|
name: "outside the size window",
|
||||||
|
dl: dl,
|
||||||
|
ranked: []Candidate{sized(best, 120<<20)},
|
||||||
|
prefs: AutoDownloadPrefs{MaxSizeMB: 1},
|
||||||
|
wantSub: "bitrate, size or format limits",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
got := AutoPickVeto(tt.dl, tt.ranked, tt.prefs)
|
||||||
|
if !strings.Contains(got, tt.wantSub) {
|
||||||
|
t.Errorf("veto = %q, want it to mention %q", got, tt.wantSub)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A clear winner has no veto at all — the sentence is empty, which is
|
||||||
|
// what AutoPickable reads.
|
||||||
|
func TestAutoPickVetoIsEmptyForAClearWinner(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dl := okComputer()
|
||||||
|
best := Score(
|
||||||
|
dl,
|
||||||
|
candidateFor("a", allTitles(), ".flac", 30_000_000),
|
||||||
|
50,
|
||||||
|
AutoDownloadPrefs{},
|
||||||
|
)
|
||||||
|
weak := Score(
|
||||||
|
dl,
|
||||||
|
candidateFor("b", allTitles()[:2], ".mp3", 1_000_000),
|
||||||
|
50,
|
||||||
|
AutoDownloadPrefs{},
|
||||||
|
)
|
||||||
|
|
||||||
|
if got := AutoPickVeto(dl, []Candidate{best, weak}, AutoDownloadPrefs{}); got != "" {
|
||||||
|
t.Errorf("veto = %q, want none", got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// With several candidates that all clear the bar, the preferred
|
||||||
|
// bitrate decides which one is taken.
|
||||||
|
//
|
||||||
|
// This is what replaced the daylight requirement. Auto-pick no longer
|
||||||
|
// refuses when the field is close; it takes the copy nearest the shape
|
||||||
|
// the user asked for, which is the question they actually answered in
|
||||||
|
// Settings.
|
||||||
|
func TestPreferredBitrateBreaksTheTie(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dl := okComputer()
|
||||||
|
prefs := AutoDownloadPrefs{PreferredKbps: 320}
|
||||||
|
|
||||||
|
// Same album, same completeness, same health, same provider — the
|
||||||
|
// only difference between them is the rate.
|
||||||
|
lossless := kbpsCandidate("lossless", ".flac", 900)
|
||||||
|
perfect := kbpsCandidate("perfect", ".mp3", 320)
|
||||||
|
|
||||||
|
ranked := Rank(
|
||||||
|
dl, []Candidate{lossless, perfect}, nil, prefs,
|
||||||
|
)
|
||||||
|
|
||||||
|
if ranked[0].ID != "perfect" {
|
||||||
|
t.Errorf(
|
||||||
|
"winner = %q (fit %f) over %q (fit %f), want the 320 kbps copy",
|
||||||
|
ranked[0].ID, ranked[0].Quality.BitrateFit,
|
||||||
|
ranked[1].ID, ranked[1].Quality.BitrateFit,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
if AutoPickVeto(dl, ranked, prefs) != "" {
|
||||||
|
t.Error("a close field must still auto-pick")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// With no preference set, nothing changes: BitrateFit is the same
|
||||||
|
// neutral value for every candidate and the older tie-breaks decide.
|
||||||
|
func TestNoPreferredBitrateLeavesRankingAlone(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dl := okComputer()
|
||||||
|
|
||||||
|
lossless := kbpsCandidate("lossless", ".flac", 900)
|
||||||
|
lossy := kbpsCandidate("lossy", ".mp3", 320)
|
||||||
|
|
||||||
|
ranked := Rank(
|
||||||
|
dl, []Candidate{lossy, lossless}, nil, AutoDownloadPrefs{},
|
||||||
|
)
|
||||||
|
|
||||||
|
if ranked[0].ID != "lossless" {
|
||||||
|
t.Errorf(
|
||||||
|
"winner = %q, want the lossless copy on format alone",
|
||||||
|
ranked[0].ID,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A preferred bitrate promotes the copy that matches it and must never
|
||||||
|
// disqualify the ones that do not. It carries 0.40 of the quality
|
||||||
|
// score, so a fit spanning down to zero would put a perfectly good FLAC
|
||||||
|
// under minQuality and out of auto-pick — turning a preference into a
|
||||||
|
// prohibition without saying so. MinKbps and MaxKbps are how a user
|
||||||
|
// says that on purpose.
|
||||||
|
func TestAPreferredBitrateNeverDisqualifies(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dl := okComputer()
|
||||||
|
far := AutoDownloadPrefs{PreferredKbps: 128}
|
||||||
|
|
||||||
|
lossless := Score(dl, kbpsCandidate("flac", ".flac", 900), 50, far)
|
||||||
|
|
||||||
|
if lossless.Quality.Overall < minQuality {
|
||||||
|
t.Errorf(
|
||||||
|
"quality = %f under a far-off preference, want >= %f",
|
||||||
|
lossless.Quality.Overall, minQuality,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
if veto := AutoPickVeto(dl, []Candidate{lossless}, far); veto != "" {
|
||||||
|
t.Errorf("a far-off preference vetoed the candidate: %s", veto)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -310,15 +310,35 @@ func (r *Reconciler) run(ctx context.Context, force bool) (Summary, error) {
|
|||||||
|
|
||||||
summary.Synced = r.syncExternalLists(ctx)
|
summary.Synced = r.syncExternalLists(ctx)
|
||||||
|
|
||||||
attempted, started, err := r.attemptDue(ctx, force)
|
// Nothing is searched for when there is nothing to search with, and
|
||||||
if err != nil {
|
// the point is what that *does not* do to the list.
|
||||||
return summary, err
|
//
|
||||||
|
// Attempting anyway is not merely wasted work: every request comes
|
||||||
|
// back "no download clients are enabled", which RecordAttempt writes
|
||||||
|
// down as an attempt and schedules a retry for -- so a user who has
|
||||||
|
// deliberately built a wanted list with no client watched their
|
||||||
|
// requests accrue failures and announce "next check in 6 hours"
|
||||||
|
// about a check that cannot happen. Wanting something without a way
|
||||||
|
// to fetch it is a supported thing to do; being told it is being
|
||||||
|
// looked for is a lie.
|
||||||
|
//
|
||||||
|
// Everything above this line still runs: an artist subscription
|
||||||
|
// still expands, and a request the user satisfied by some other
|
||||||
|
// route -- ripped, bought, copied in -- is still retired, because
|
||||||
|
// neither needs a provider.
|
||||||
|
summary.NoProviders = len(r.manager.enabledProviders()) == 0
|
||||||
|
|
||||||
|
if !summary.NoProviders {
|
||||||
|
attempted, started, err := r.attemptDue(ctx, force)
|
||||||
|
if err != nil {
|
||||||
|
return summary, err
|
||||||
|
}
|
||||||
|
|
||||||
|
summary.Attempted = attempted
|
||||||
|
summary.Started = started
|
||||||
}
|
}
|
||||||
|
|
||||||
summary.Attempted = attempted
|
|
||||||
summary.Started = started
|
|
||||||
summary.Waiting = r.countWaiting(ctx)
|
summary.Waiting = r.countWaiting(ctx)
|
||||||
summary.NoProviders = len(r.manager.enabledProviders()) == 0
|
|
||||||
|
|
||||||
r.logger.Info(
|
r.logger.Info(
|
||||||
"reconciled request list",
|
"reconciled request list",
|
||||||
|
|||||||
@@ -453,6 +453,15 @@ func TestReconcileRespectsBatchSize(t *testing.T) {
|
|||||||
f := newReconcileFixture(t)
|
f := newReconcileFixture(t)
|
||||||
ctx := context.Background()
|
ctx := context.Background()
|
||||||
|
|
||||||
|
// A client that searches and finds nothing. The batch size is about
|
||||||
|
// how many requests one pass *searches for*, which only means
|
||||||
|
// anything when there is something to search with -- a pass with no
|
||||||
|
// provider now attempts nothing at all, deliberately.
|
||||||
|
f.manager.installProvider(
|
||||||
|
Config{ID: 1, Priority: 50},
|
||||||
|
NewFakeProvider(1, "finds-nothing", Caps{CanSearch: true}),
|
||||||
|
)
|
||||||
|
|
||||||
f.reconciler.SetBatch(2)
|
f.reconciler.SetBatch(2)
|
||||||
|
|
||||||
for _, mbid := range []string{"rg-1", "rg-2", "rg-3", "rg-4"} {
|
for _, mbid := range []string{"rg-1", "rg-2", "rg-3", "rg-4"} {
|
||||||
@@ -593,3 +602,72 @@ func TestSummaryReportsNoProviders(t *testing.T) {
|
|||||||
t.Error("summary did not report that no download client is enabled")
|
t.Error("summary did not report that no download client is enabled")
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// ...and it does not search, which is the part the user sees.
|
||||||
|
//
|
||||||
|
// Attempting with no provider fails every request with "no download
|
||||||
|
// clients are enabled", and RecordAttempt writes that down as an
|
||||||
|
// attempt and schedules a retry -- so a wanted list built deliberately
|
||||||
|
// without a client accrued failures and announced "next check in 6
|
||||||
|
// hours" about a check that cannot happen. Wanting something with no
|
||||||
|
// way to fetch it is supported; being told it is being looked for is
|
||||||
|
// a lie.
|
||||||
|
func TestNoProvidersMeansNoAttempt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
f := newReconcileFixture(t)
|
||||||
|
ctx := context.Background()
|
||||||
|
|
||||||
|
id, err := f.store.AddRequest(ctx, Request{
|
||||||
|
MBID: "rg-1",
|
||||||
|
Entity: EntityReleaseGroup,
|
||||||
|
LibraryID: 1,
|
||||||
|
Title: "OK Computer",
|
||||||
|
})
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("AddRequest: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
f.catalog.tracklists["rg-1"] = fourTrackDownload().Expected
|
||||||
|
|
||||||
|
summary, err := f.reconciler.RunNow(ctx)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("RunNow: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if summary.Attempted != 0 {
|
||||||
|
t.Errorf("attempted %d requests with no client to search with, want 0",
|
||||||
|
summary.Attempted)
|
||||||
|
}
|
||||||
|
|
||||||
|
// The list still knows what is on it: "nothing happened" has to be
|
||||||
|
// reportable as "nothing was searched for, of the one thing you
|
||||||
|
// want" rather than as silence.
|
||||||
|
if summary.Waiting != 1 {
|
||||||
|
t.Errorf("summary reported %d waiting, want 1", summary.Waiting)
|
||||||
|
}
|
||||||
|
|
||||||
|
req, err := f.store.GetRequest(ctx, id)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("GetRequest: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if req.Attempts != 0 {
|
||||||
|
t.Errorf("attempts = %d, want 0: a pass that could not search did not",
|
||||||
|
req.Attempts)
|
||||||
|
}
|
||||||
|
|
||||||
|
if req.LastError != "" {
|
||||||
|
t.Errorf("lastError = %q, want empty: the request did not fail, it "+
|
||||||
|
"was never tried", req.LastError)
|
||||||
|
}
|
||||||
|
|
||||||
|
// A new request is due immediately (next_try_at is set to now on
|
||||||
|
// insert), so the fault is not the presence of a time -- it is a
|
||||||
|
// time pushed into the future by a failed attempt, which is what the
|
||||||
|
// UI renders as "next check in 6 hours".
|
||||||
|
if req.NextTryAt.After(time.Now().Add(time.Minute)) {
|
||||||
|
t.Errorf("next try scheduled for %v: a check that cannot happen was "+
|
||||||
|
"put on the clock", req.NextTryAt)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -36,13 +36,24 @@ func newServiceFixture(t *testing.T) serviceFixture {
|
|||||||
// assertion read it; the second is that same goroutine still writing
|
// assertion read it; the second is that same goroutine still writing
|
||||||
// into `t.TempDir()` after the test returned. One cause, two shapes.
|
// into `t.TempDir()` after the test returned. One cause, two shapes.
|
||||||
//
|
//
|
||||||
// Putting the candidate outside the auto-pick size window stops the
|
// Putting the candidate outside the auto-pick guardrails stops the
|
||||||
// grab from ever starting, which is better than waiting for it: there
|
// grab from ever starting, which is better than waiting for it: there
|
||||||
// is no goroutine to be slow, so the tests state what they mean
|
// is no goroutine to be slow, so the tests state what they mean
|
||||||
// ("the request exists, in this state") without a timing assumption
|
// ("the request exists, in this state") without a timing assumption
|
||||||
// underneath. A test that does want the download has `managerFixture`
|
// underneath. A test that does want the download has `managerFixture`
|
||||||
// and sets its own preferences.
|
// and sets its own preferences.
|
||||||
mf.manager.SetPreferences(AutoDownloadPrefs{MaxSizeMB: 1})
|
//
|
||||||
|
// The guard is a *format* the fake never produces, and it used to be
|
||||||
|
// `MaxSizeMB: 1`, which never fired: the size gates read
|
||||||
|
// `Candidate.TotalSize`, which real providers fill and the fake
|
||||||
|
// leaves at zero, and zero is under every ceiling. So the grab went
|
||||||
|
// ahead anyway and the second failure shape above — the TempDir
|
||||||
|
// cleanup race — kept happening, reproducibly, roughly one run in
|
||||||
|
// fifteen. A guard has to be keyed on something the fixture
|
||||||
|
// actually sets.
|
||||||
|
mf.manager.SetPreferences(AutoDownloadPrefs{
|
||||||
|
AllowedFormats: []Format{FormatWMA},
|
||||||
|
})
|
||||||
|
|
||||||
return serviceFixture{managerFixture: mf, svc: svc}
|
return serviceFixture{managerFixture: mf, svc: svc}
|
||||||
}
|
}
|
||||||
@@ -182,6 +193,11 @@ func TestManualDownloadSatisfiesRequestOnSuccess(t *testing.T) {
|
|||||||
f := newServiceFixture(t)
|
f := newServiceFixture(t)
|
||||||
ctx := context.Background()
|
ctx := context.Background()
|
||||||
|
|
||||||
|
// This is the one test here that is *about* the download, so it
|
||||||
|
// undoes the fixture's guard rather than relying on it — which is
|
||||||
|
// what it was doing implicitly while the guard did not work.
|
||||||
|
f.manager.SetPreferences(AutoDownloadPrefs{})
|
||||||
|
|
||||||
provider := fakeWithAlbum(1, "source", ".flac")
|
provider := fakeWithAlbum(1, "source", ".flac")
|
||||||
f.manager.installProvider(Config{ID: 1, Priority: 50}, provider)
|
f.manager.installProvider(Config{ID: 1, Priority: 50}, provider)
|
||||||
|
|
||||||
|
|||||||
@@ -302,7 +302,12 @@ type QualityScore struct {
|
|||||||
Bitrate float64 `json:"bitrate"`
|
Bitrate float64 `json:"bitrate"`
|
||||||
Health float64 `json:"health"` // seeders, free slots
|
Health float64 `json:"health"` // seeders, free slots
|
||||||
Priority float64 `json:"priority"` // user's per-provider preference
|
Priority float64 `json:"priority"` // user's per-provider preference
|
||||||
SizeFit float64 `json:"sizeFit"` // closeness to the preferred download size
|
// BitrateFit is closeness to the preferred *rate*, which is what
|
||||||
|
// the auto-download window is expressed in. It replaced a
|
||||||
|
// `SizeFit` measured in megabytes: a size means nothing without
|
||||||
|
// knowing how long the music is, so the same number described a
|
||||||
|
// generous single and a suspiciously small boxset.
|
||||||
|
BitrateFit float64 `json:"bitrateFit"`
|
||||||
|
|
||||||
// Mixed marks a candidate whose files are not all the same format,
|
// Mixed marks a candidate whose files are not all the same format,
|
||||||
// which usually means a hand-assembled folder rather than a rip.
|
// which usually means a hand-assembled folder rather than a rip.
|
||||||
|
|||||||
@@ -25,8 +25,26 @@ const (
|
|||||||
// where cached cover art thumbnails are stored.
|
// where cached cover art thumbnails are stored.
|
||||||
thumbnailDir = CoverArtCacheDirName
|
thumbnailDir = CoverArtCacheDirName
|
||||||
|
|
||||||
// thumbnailTimeout is the HTTP timeout for fetching a thumbnail.
|
// thumbnailTimeout is the HTTP timeout for fetching a thumbnail,
|
||||||
thumbnailTimeout = 10 * time.Second
|
// and it has to cover a redirect the Cover Art Archive does not
|
||||||
|
// serve itself.
|
||||||
|
//
|
||||||
|
// `coverartarchive.org` answers `front-250` with a 307 to an
|
||||||
|
// Internet Archive storage node (`dn######.us.archive.org`), and
|
||||||
|
// those nodes are routinely slow: measured against the twelve
|
||||||
|
// albums on Explore's own shelves, a successful fetch took 14–16 s
|
||||||
|
// and a failing one 13–17 s. At 10 s *every* cover on the page
|
||||||
|
// timed out — 24 cards, 5 of which had art, all of those from the
|
||||||
|
// disk cache — which reads as "Explore has no album art" rather
|
||||||
|
// than as a slow upstream, because a timeout writes nothing and
|
||||||
|
// says nothing.
|
||||||
|
//
|
||||||
|
// 30 s is chosen to clear that measured range with room, not to be
|
||||||
|
// generous: the fetch is off the critical path (each one is its own
|
||||||
|
// goroutine behind an 8/s limiter, and the frontend renders a
|
||||||
|
// placeholder until it lands), so the cost of waiting is nothing
|
||||||
|
// and the cost of giving up early is a blank page.
|
||||||
|
thumbnailTimeout = 30 * time.Second
|
||||||
|
|
||||||
// thumbnailMaxSize is the maximum image size to cache (2 MB).
|
// thumbnailMaxSize is the maximum image size to cache (2 MB).
|
||||||
thumbnailMaxSize = 2 * 1024 * 1024
|
thumbnailMaxSize = 2 * 1024 * 1024
|
||||||
@@ -97,6 +115,20 @@ func (p *CoverArtProxy) GetThumbnail(
|
|||||||
return ""
|
return ""
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// A 404 is an answer, and it is already on disk.
|
||||||
|
//
|
||||||
|
// `writeCache(mbid, nil)` has recorded "the archive has no art for
|
||||||
|
// this" as an empty file since this was written, and nothing has
|
||||||
|
// ever read it back: `readCache` returns "" for an empty file,
|
||||||
|
// which is indistinguishable from a miss, so every art-less release
|
||||||
|
// group was re-fetched from the network on every render that asked
|
||||||
|
// about it. On Explore's shelves a third of the cards are art-less,
|
||||||
|
// so that was a third of the page spending a live CAA request to be
|
||||||
|
// told again what the last one said.
|
||||||
|
if p.knownMissing(releaseGroupMBID) {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
// Source 3: fetch from Cover Art Archive (slow, cached to disk).
|
// Source 3: fetch from Cover Art Archive (slow, cached to disk).
|
||||||
url := CoverArtGroupURL(releaseGroupMBID)
|
url := CoverArtGroupURL(releaseGroupMBID)
|
||||||
data, cacheable, err := p.fetch(url)
|
data, cacheable, err := p.fetch(url)
|
||||||
@@ -177,8 +209,9 @@ func (p *CoverArtProxy) GetCandidateThumbnail(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// Network fetch on release group.
|
// Network fetch on release group — unless a previous one was told
|
||||||
if releaseGroupMBID != "" {
|
// there is none. See `knownMissing`.
|
||||||
|
if releaseGroupMBID != "" && !p.knownMissing(releaseGroupMBID) {
|
||||||
url := CoverArtGroupURL(releaseGroupMBID)
|
url := CoverArtGroupURL(releaseGroupMBID)
|
||||||
data, cacheable, err := p.fetch(url)
|
data, cacheable, err := p.fetch(url)
|
||||||
|
|
||||||
@@ -194,7 +227,7 @@ func (p *CoverArtProxy) GetCandidateThumbnail(
|
|||||||
}
|
}
|
||||||
|
|
||||||
// Network fetch on release (fallback).
|
// Network fetch on release (fallback).
|
||||||
if releaseMBID != "" {
|
if releaseMBID != "" && !p.knownMissing(releaseMBID) {
|
||||||
url := CoverArtURL(releaseMBID)
|
url := CoverArtURL(releaseMBID)
|
||||||
data, cacheable, err := p.fetch(url)
|
data, cacheable, err := p.fetch(url)
|
||||||
|
|
||||||
@@ -285,6 +318,17 @@ func (p *CoverArtProxy) cachePath(mbid string) string {
|
|||||||
return filepath.Join(p.cacheDir, mbid+".jpg")
|
return filepath.Join(p.cacheDir, mbid+".jpg")
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// knownMissing reports whether a previous fetch was told the archive
|
||||||
|
// has no art for this MBID — the empty file `writeCache(mbid, nil)`
|
||||||
|
// leaves behind. It is deliberately separate from `readCache`, which
|
||||||
|
// answers "what are the bytes" and cannot express the difference
|
||||||
|
// between no answer and an answer of none.
|
||||||
|
func (p *CoverArtProxy) knownMissing(mbid string) bool {
|
||||||
|
info, err := os.Stat(p.cachePath(mbid))
|
||||||
|
|
||||||
|
return err == nil && info.Size() == 0
|
||||||
|
}
|
||||||
|
|
||||||
func (p *CoverArtProxy) readCache(mbid string) string {
|
func (p *CoverArtProxy) readCache(mbid string) string {
|
||||||
path := p.cachePath(mbid)
|
path := p.cachePath(mbid)
|
||||||
|
|
||||||
|
|||||||
@@ -2212,6 +2212,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
ArtistType: a.Type,
|
ArtistType: a.Type,
|
||||||
Country: a.Country,
|
Country: a.Country,
|
||||||
InLibrary: a.InLibrary,
|
InLibrary: a.InLibrary,
|
||||||
|
LocalID: a.LocalID,
|
||||||
},
|
},
|
||||||
category: "artist",
|
category: "artist",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2243,6 +2244,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
ArtistType: a.Type,
|
ArtistType: a.Type,
|
||||||
Country: a.Country,
|
Country: a.Country,
|
||||||
InLibrary: a.InLibrary,
|
InLibrary: a.InLibrary,
|
||||||
|
LocalID: a.LocalID,
|
||||||
},
|
},
|
||||||
category: "artist",
|
category: "artist",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2275,6 +2277,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
PrimaryType: rg.PrimaryType,
|
PrimaryType: rg.PrimaryType,
|
||||||
Year: year,
|
Year: year,
|
||||||
InLibrary: rg.InLibrary,
|
InLibrary: rg.InLibrary,
|
||||||
|
LocalID: rg.LocalID,
|
||||||
},
|
},
|
||||||
category: "release_group",
|
category: "release_group",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2320,6 +2323,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
PrimaryType: rg.PrimaryType,
|
PrimaryType: rg.PrimaryType,
|
||||||
Year: year,
|
Year: year,
|
||||||
InLibrary: rg.InLibrary,
|
InLibrary: rg.InLibrary,
|
||||||
|
LocalID: rg.LocalID,
|
||||||
},
|
},
|
||||||
category: "release_group",
|
category: "release_group",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2347,6 +2351,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
CAAReleaseMBID: r.CAAReleaseMBID,
|
CAAReleaseMBID: r.CAAReleaseMBID,
|
||||||
ReleaseName: r.ReleaseName,
|
ReleaseName: r.ReleaseName,
|
||||||
InLibrary: r.InLibrary,
|
InLibrary: r.InLibrary,
|
||||||
|
LocalID: r.LocalID,
|
||||||
},
|
},
|
||||||
category: "recording",
|
category: "recording",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2403,6 +2408,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
CAAReleaseMBID: r.CAAReleaseMBID,
|
CAAReleaseMBID: r.CAAReleaseMBID,
|
||||||
ReleaseName: r.ReleaseName,
|
ReleaseName: r.ReleaseName,
|
||||||
InLibrary: r.InLibrary,
|
InLibrary: r.InLibrary,
|
||||||
|
LocalID: r.LocalID,
|
||||||
},
|
},
|
||||||
category: "recording",
|
category: "recording",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2425,6 +2431,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
ArtistType: m.ArtistType,
|
ArtistType: m.ArtistType,
|
||||||
Country: m.Country,
|
Country: m.Country,
|
||||||
InLibrary: m.InLibrary || m.LocalArtistID > 0,
|
InLibrary: m.InLibrary || m.LocalArtistID > 0,
|
||||||
|
LocalID: m.LocalArtistID,
|
||||||
},
|
},
|
||||||
category: "artist",
|
category: "artist",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2445,6 +2452,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
PrimaryType: m.PrimaryType,
|
PrimaryType: m.PrimaryType,
|
||||||
Year: year,
|
Year: year,
|
||||||
InLibrary: m.InLibrary || m.LocalReleaseGroupID > 0,
|
InLibrary: m.InLibrary || m.LocalReleaseGroupID > 0,
|
||||||
|
LocalID: m.LocalReleaseGroupID,
|
||||||
},
|
},
|
||||||
category: "release_group",
|
category: "release_group",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
@@ -2459,6 +2467,7 @@ func (e *Service) gatherTopCandidates(
|
|||||||
ArtistMBID: m.ArtistMBID,
|
ArtistMBID: m.ArtistMBID,
|
||||||
Length: m.Duration,
|
Length: m.Duration,
|
||||||
InLibrary: m.InLibrary || m.LocalRecordingID > 0,
|
InLibrary: m.InLibrary || m.LocalRecordingID > 0,
|
||||||
|
LocalID: m.LocalRecordingID,
|
||||||
},
|
},
|
||||||
category: "recording",
|
category: "recording",
|
||||||
qualityScore: quality,
|
qualityScore: quality,
|
||||||
|
|||||||
@@ -41,7 +41,16 @@ type TopResult struct {
|
|||||||
ReleaseGroupMBID string `json:"releaseGroupMbid,omitempty"`
|
ReleaseGroupMBID string `json:"releaseGroupMbid,omitempty"`
|
||||||
ReleaseName string `json:"releaseName,omitempty"`
|
ReleaseName string `json:"releaseName,omitempty"`
|
||||||
// Library status — populated from index cross-reference columns.
|
// Library status — populated from index cross-reference columns.
|
||||||
InLibrary bool `json:"inLibrary"`
|
//
|
||||||
|
// LocalID is the one the cards read. It is the local row behind
|
||||||
|
// this entity — an album, a file, an artist — and it is set and
|
||||||
|
// cleared by a test against `audio_files`, so it means "there is
|
||||||
|
// something of mine here". InLibrary is written by the same pass
|
||||||
|
// but is a one-way ratchet the prune can only clear alongside a
|
||||||
|
// local id, so it is the weaker of the two and stays for scoring
|
||||||
|
// (`fwInLibrary`), which is where an approximate answer is fine.
|
||||||
|
InLibrary bool `json:"inLibrary"`
|
||||||
|
LocalID int64 `json:"localId,omitempty"`
|
||||||
}
|
}
|
||||||
|
|
||||||
// MBArtist is a Wails-friendly projection of a MusicBrainz artist.
|
// MBArtist is a Wails-friendly projection of a MusicBrainz artist.
|
||||||
|
|||||||
@@ -232,3 +232,112 @@ func TestGetAlbumCompleteness_EmptyAlbum(t *testing.T) {
|
|||||||
t.Errorf("empty album reported %+v, want zero and unknown", got)
|
t.Errorf("empty album reported %+v, want zero and unknown", got)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// The batch and the single-album query are two spellings of one
|
||||||
|
// question, and the thing worth pinning is that they never disagree.
|
||||||
|
//
|
||||||
|
// They are genuinely different SQL — the single-album form is
|
||||||
|
// correlated subqueries over one album, the batch is two grouping
|
||||||
|
// levels over a slice — so the risk is not a typo but a drift in
|
||||||
|
// meaning: a disc's total counted once per file, a duplicate counted
|
||||||
|
// twice, a disc with no total silently covered by one that had one.
|
||||||
|
// Every shape the table above cares about is staged here at once,
|
||||||
|
// because a batch that is only ever asked about one album is not being
|
||||||
|
// asked the question that can go wrong.
|
||||||
|
func TestGetAlbumsCompletenessAgreesWithTheSingleAlbumQuery(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
lib, _ := setupTestLibrary(t)
|
||||||
|
|
||||||
|
shapes := map[int][]track{
|
||||||
|
1: disc(1, 100, 12, 12),
|
||||||
|
2: disc(1, 200, 9, 12),
|
||||||
|
3: disc(1, 300, 13, 12),
|
||||||
|
4: {{recordingID: 400, disc: 1, number: 1}},
|
||||||
|
5: append(disc(1, 500, 10, 10), disc(2, 600, 2, 5)...),
|
||||||
|
6: append(
|
||||||
|
disc(1, 700, 10, 10),
|
||||||
|
track{recordingID: 750, disc: 2, number: 1},
|
||||||
|
),
|
||||||
|
7: append(
|
||||||
|
disc(1, 800, 5, 6),
|
||||||
|
track{recordingID: 899, disc: 1, number: 3, total: 6},
|
||||||
|
),
|
||||||
|
}
|
||||||
|
|
||||||
|
ids := make([]int64, 0, len(shapes))
|
||||||
|
|
||||||
|
for albumID, tracks := range shapes {
|
||||||
|
stageAlbum(t, lib, albumID, tracks)
|
||||||
|
ids = append(ids, albumIDFor(t, lib, albumID))
|
||||||
|
}
|
||||||
|
|
||||||
|
batch, err := lib.GetAlbumsCompleteness(ids)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("GetAlbumsCompleteness: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(batch) != len(ids) {
|
||||||
|
t.Fatalf("batch answered for %d albums, want %d", len(batch), len(ids))
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, id := range ids {
|
||||||
|
one, err := lib.GetAlbumCompleteness(id)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("GetAlbumCompleteness(%d): %v", id, err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if got := batch[id]; got != one {
|
||||||
|
t.Errorf("album %d: batch says %+v, single says %+v", id, got, one)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// An album with no files is absent from the batch, not zeroed.
|
||||||
|
//
|
||||||
|
// "I have none of this" and "I have no idea" are the third state Known
|
||||||
|
// exists to keep apart, and a caller reading a missing key gets nothing
|
||||||
|
// rather than a confident zero it would have to know to distrust.
|
||||||
|
func TestGetAlbumsCompletenessOmitsAnAlbumWithNoFiles(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
lib, _ := setupTestLibrary(t)
|
||||||
|
|
||||||
|
stageAlbum(t, lib, 1, disc(1, 100, 3, 3))
|
||||||
|
|
||||||
|
held := albumIDFor(t, lib, 1)
|
||||||
|
|
||||||
|
got, err := lib.GetAlbumsCompleteness([]int64{held, 4242})
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("GetAlbumsCompleteness: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if _, ok := got[4242]; ok {
|
||||||
|
t.Errorf("an album with no files answered %+v, want absent", got[4242])
|
||||||
|
}
|
||||||
|
|
||||||
|
if !got[held].Complete {
|
||||||
|
t.Errorf("held album reported %+v, want complete", got[held])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A caller with nothing to ask about must not issue a query at all —
|
||||||
|
// sqlc's empty-slice branch rewrites the placeholder to NULL, which is
|
||||||
|
// a perfectly valid query returning nothing, so this is about the round
|
||||||
|
// trip rather than the answer.
|
||||||
|
func TestGetAlbumsCompletenessAsksNothingForAnEmptyList(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
lib, _ := setupTestLibrary(t)
|
||||||
|
|
||||||
|
for _, ids := range [][]int64{nil, {}, {0}, {-1, 0}} {
|
||||||
|
got, err := lib.GetAlbumsCompleteness(ids)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("GetAlbumsCompleteness(%v): %v", ids, err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(got) != 0 {
|
||||||
|
t.Errorf("GetAlbumsCompleteness(%v) = %+v, want empty", ids, got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
+141
-15
@@ -289,8 +289,13 @@ func (l *Library) scanInternal(
|
|||||||
l.mu.Unlock()
|
l.mu.Unlock()
|
||||||
}()
|
}()
|
||||||
|
|
||||||
|
// The configured mode, not a hardcoded "auto". `ScanConcurrency`
|
||||||
|
// has been a validated config field with three values and one
|
||||||
|
// caller passing a constant, so choosing `ssd` or `hdd` by hand
|
||||||
|
// did nothing at all.
|
||||||
|
diskProfile := system.ProfileForPath(libraryPath)
|
||||||
workerCount := resolveScanWorkerCount(
|
workerCount := resolveScanWorkerCount(
|
||||||
ScanConcurrencyAuto,
|
l.conf.ScanConcurrency,
|
||||||
libraryPath,
|
libraryPath,
|
||||||
)
|
)
|
||||||
|
|
||||||
@@ -300,6 +305,10 @@ func (l *Library) scanInternal(
|
|||||||
"libraryName", libraryName,
|
"libraryName", libraryName,
|
||||||
"libraryPath", libraryPath,
|
"libraryPath", libraryPath,
|
||||||
"workers", workerCount,
|
"workers", workerCount,
|
||||||
|
"mode", l.conf.ScanConcurrency,
|
||||||
|
"device", diskProfile.Device,
|
||||||
|
"rotational", diskProfile.Rotational,
|
||||||
|
"queueDepth", diskProfile.QueueDepth,
|
||||||
)
|
)
|
||||||
|
|
||||||
// Helper to build a ScanProgress with library identification.
|
// Helper to build a ScanProgress with library identification.
|
||||||
@@ -818,7 +827,7 @@ func (l *Library) scanInternal(
|
|||||||
g := new(errgroup.Group)
|
g := new(errgroup.Group)
|
||||||
g.SetLimit(workerCount)
|
g.SetLimit(workerCount)
|
||||||
|
|
||||||
for work := range workChan {
|
for work := range readaheadWork(scanCtx, workChan, diskProfile) {
|
||||||
g.Go(func() error {
|
g.Go(func() error {
|
||||||
if err := l.waitIfPaused(scanCtx); err != nil {
|
if err := l.waitIfPaused(scanCtx); err != nil {
|
||||||
return err
|
return err
|
||||||
@@ -1285,9 +1294,101 @@ func surveyAudioFiles(
|
|||||||
return count, maxModTime
|
return count, maxModTime
|
||||||
}
|
}
|
||||||
|
|
||||||
// hddWorkerCount is the maximum number of concurrent extraction
|
// How many extraction workers a spinning disk gets, and why it is two
|
||||||
// workers when the library resides on a spinning disk.
|
// numbers rather than one.
|
||||||
const hddWorkerCount = 2
|
//
|
||||||
|
// Extraction is not CPU work — every parser here reads headers and
|
||||||
|
// returns — so on a spinning disk the whole cost is seek latency, and
|
||||||
|
// the only question worth asking is how many reads should be in flight
|
||||||
|
// at once. That has two different right answers and the drive says
|
||||||
|
// which:
|
||||||
|
//
|
||||||
|
// - A drive with command queueing (NCQ: /sys/block/<dev>/device/
|
||||||
|
// queue_depth reports 31 or 32 on any SATA disk with it enabled)
|
||||||
|
// reorders outstanding reads into the order its head passes over
|
||||||
|
// them. Handing it several at once is most of why a parallel scan
|
||||||
|
// beats a serial one at all, and four is where the returns flatten:
|
||||||
|
// the drive needs a few requests to have anything to reorder, and
|
||||||
|
// past that it is queueing requests it was already going to
|
||||||
|
// service in that order.
|
||||||
|
// - A drive without it — queue_depth 1, which is what a USB bridge
|
||||||
|
// or a pre-2004 disk reports — services one command at a time in
|
||||||
|
// the order given. Every extra worker there is one more seek
|
||||||
|
// competing for one head, and the scan gets *slower* the harder it
|
||||||
|
// is pushed. Two is kept rather than one because the readahead
|
||||||
|
// hints (see readaheadWork) do the overlapping that concurrency
|
||||||
|
// was standing in for, and one worker cannot hide a stall.
|
||||||
|
//
|
||||||
|
// This used to be a flat 2 for anything rotational, which is a
|
||||||
|
// pre-NCQ assumption: it left a modern spinning disk with a quarter of
|
||||||
|
// the queue depth it can use.
|
||||||
|
const (
|
||||||
|
hddWorkerCountQueued = 4
|
||||||
|
hddWorkerCountSerial = 2
|
||||||
|
)
|
||||||
|
|
||||||
|
// Readahead tuning.
|
||||||
|
const (
|
||||||
|
// readaheadDepth is how many files ahead of the workers the
|
||||||
|
// prefetcher runs. It is the channel's buffer, so it is also the
|
||||||
|
// number of `WILLNEED` hints outstanding at once — comfortably more
|
||||||
|
// than a queueing drive's 32-command window is worth filling with
|
||||||
|
// one library, and small enough that a cancelled scan is not
|
||||||
|
// holding a long tail of queued reads.
|
||||||
|
readaheadDepth = 16
|
||||||
|
|
||||||
|
// readaheadBytes is how much of each file to pull in. Everything
|
||||||
|
// the scanner reads lives at the head: ID3v2 and FLAC's
|
||||||
|
// STREAMINFO/VORBIS_COMMENT/PICTURE blocks, and the first MPEG
|
||||||
|
// frame with its Xing header. 512 KB covers a tag carrying
|
||||||
|
// embedded cover art, which is the large case — and reading a
|
||||||
|
// little too much sequentially costs a spinning disk almost
|
||||||
|
// nothing next to the seek that got there.
|
||||||
|
readaheadBytes = 512 << 10
|
||||||
|
)
|
||||||
|
|
||||||
|
// readaheadWork forwards scan work while asking the kernel to fetch
|
||||||
|
// each file's header before a worker reaches it.
|
||||||
|
//
|
||||||
|
// The buffered channel *is* the lookahead: this goroutine runs ahead
|
||||||
|
// of the workers until the buffer fills, hinting every file as it goes,
|
||||||
|
// so by the time a worker takes an item the read it needs has been in
|
||||||
|
// flight for `readaheadDepth` files' worth of parsing. That is the
|
||||||
|
// only thing that helps a spinning disk here, because the per-file work
|
||||||
|
// is already header-only — every parser in `backend/metadata` reads a
|
||||||
|
// few hundred bytes and returns, so the scan is not waiting on CPU or
|
||||||
|
// on bytes, it is waiting on the head to arrive.
|
||||||
|
//
|
||||||
|
// It runs on rotational disks only. An SSD has no seek to hide and
|
||||||
|
// already has one worker per core; issuing hints there is pure syscall
|
||||||
|
// overhead against an OS readahead that is already ahead of us.
|
||||||
|
func readaheadWork(
|
||||||
|
ctx context.Context,
|
||||||
|
in <-chan scanWork,
|
||||||
|
profile system.DiskProfile,
|
||||||
|
) <-chan scanWork {
|
||||||
|
if !profile.Rotational {
|
||||||
|
return in
|
||||||
|
}
|
||||||
|
|
||||||
|
out := make(chan scanWork, readaheadDepth)
|
||||||
|
|
||||||
|
go func() {
|
||||||
|
defer close(out)
|
||||||
|
|
||||||
|
for work := range in {
|
||||||
|
hintReadahead(work.absolutePath, readaheadBytes)
|
||||||
|
|
||||||
|
select {
|
||||||
|
case out <- work:
|
||||||
|
case <-ctx.Done():
|
||||||
|
return
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}()
|
||||||
|
|
||||||
|
return out
|
||||||
|
}
|
||||||
|
|
||||||
// resolveScanWorkerCount returns the number of concurrent
|
// resolveScanWorkerCount returns the number of concurrent
|
||||||
// extraction workers based on the configured concurrency mode
|
// extraction workers based on the configured concurrency mode
|
||||||
@@ -1296,20 +1397,45 @@ func resolveScanWorkerCount(
|
|||||||
mode ScanConcurrency,
|
mode ScanConcurrency,
|
||||||
libraryPath string,
|
libraryPath string,
|
||||||
) int {
|
) int {
|
||||||
|
return workersForProfile(
|
||||||
|
mode,
|
||||||
|
system.ProfileForPath(libraryPath),
|
||||||
|
goruntime.NumCPU(),
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
// workersForProfile is the policy on its own, so it can be tested
|
||||||
|
// against drives this machine does not have.
|
||||||
|
//
|
||||||
|
// `hdd` and `ssd` override what the device says rather than being a
|
||||||
|
// separate branch: the mode is the user overruling detection, and
|
||||||
|
// detection is right about the queue depth either way — a user who
|
||||||
|
// picks `hdd` on a queueing drive still wants that drive's queue used.
|
||||||
|
func workersForProfile(
|
||||||
|
mode ScanConcurrency,
|
||||||
|
profile system.DiskProfile,
|
||||||
|
cpus int,
|
||||||
|
) int {
|
||||||
|
spinning := profile.Rotational
|
||||||
|
|
||||||
switch mode {
|
switch mode {
|
||||||
case ScanConcurrencySSD:
|
case ScanConcurrencySSD:
|
||||||
return goruntime.NumCPU()
|
spinning = false
|
||||||
case ScanConcurrencyHDD:
|
case ScanConcurrencyHDD:
|
||||||
return min(hddWorkerCount, goruntime.NumCPU())
|
spinning = true
|
||||||
default: // auto
|
case ScanConcurrencyAuto:
|
||||||
if system.IsRotationalDisk(libraryPath) {
|
|
||||||
return min(
|
|
||||||
hddWorkerCount, goruntime.NumCPU(),
|
|
||||||
)
|
|
||||||
}
|
|
||||||
|
|
||||||
return goruntime.NumCPU()
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if !spinning {
|
||||||
|
return cpus
|
||||||
|
}
|
||||||
|
|
||||||
|
workers := hddWorkerCountSerial
|
||||||
|
if profile.Queues() {
|
||||||
|
workers = hddWorkerCountQueued
|
||||||
|
}
|
||||||
|
|
||||||
|
return min(workers, cpus)
|
||||||
}
|
}
|
||||||
|
|
||||||
// scanWork represents a file to be processed by a worker.
|
// scanWork represents a file to be processed by a worker.
|
||||||
|
|||||||
@@ -244,6 +244,65 @@ func (l *Library) GetAlbumCompleteness(albumID int64) (AlbumCompleteness, error)
|
|||||||
}, nil
|
}, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// GetAlbumsCompleteness answers the same question for a screenful of
|
||||||
|
// albums in one query, keyed by album id.
|
||||||
|
//
|
||||||
|
// A card grid asks this about every card that has a local album behind
|
||||||
|
// it, and one query per card is how a grid of fifty albums becomes
|
||||||
|
// fifty round trips. The answer matters there for the reason it
|
||||||
|
// matters on the album page: an album held 9 tracks of 12 has to show
|
||||||
|
// the count, and a bare tick saying "in your library" is the complaint
|
||||||
|
// this whole rule came from.
|
||||||
|
//
|
||||||
|
// An album with no row in the result is one with no files, and it is
|
||||||
|
// absent rather than zeroed — "I have none of this" and "I have no
|
||||||
|
// idea" are the same third state `Known` exists to keep apart, and a
|
||||||
|
// caller reading a missing key gets nothing rather than a confident 0.
|
||||||
|
func (l *Library) GetAlbumsCompleteness(
|
||||||
|
albumIDs []int64,
|
||||||
|
) (map[int64]AlbumCompleteness, error) {
|
||||||
|
out := make(map[int64]AlbumCompleteness, len(albumIDs))
|
||||||
|
|
||||||
|
if len(albumIDs) == 0 {
|
||||||
|
return out, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
keys := make([]sql.NullInt64, 0, len(albumIDs))
|
||||||
|
|
||||||
|
for _, id := range albumIDs {
|
||||||
|
if id <= 0 {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
|
||||||
|
keys = append(keys, sql.NullInt64{Int64: id, Valid: true})
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(keys) == 0 {
|
||||||
|
return out, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
rows, err := l.db.ReadQueries.GetAlbumsCompleteness(l.ctx, keys)
|
||||||
|
if err != nil {
|
||||||
|
l.logger.Error("could not get album completeness in batch",
|
||||||
|
"albums", len(keys), "error", err)
|
||||||
|
|
||||||
|
return nil, fmt.Errorf("could not get album completeness: %w", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, row := range rows {
|
||||||
|
known := row.Known != 0 && row.Expected > 0
|
||||||
|
|
||||||
|
out[row.AlbumID] = AlbumCompleteness{
|
||||||
|
Owned: int(row.Owned),
|
||||||
|
Expected: int(row.Expected),
|
||||||
|
Known: known,
|
||||||
|
Complete: known && row.Owned >= row.Expected,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return out, nil
|
||||||
|
}
|
||||||
|
|
||||||
// GetAlbumTracks returns one album's tracks in disc/track order.
|
// GetAlbumTracks returns one album's tracks in disc/track order.
|
||||||
func (l *Library) GetAlbumTracks(albumID, libraryID int64) ([]Track, error) {
|
func (l *Library) GetAlbumTracks(albumID, libraryID int64) ([]Track, error) {
|
||||||
rows, err := l.db.ReadQueries.GetTracksByAlbum(
|
rows, err := l.db.ReadQueries.GetTracksByAlbum(
|
||||||
|
|||||||
@@ -0,0 +1,38 @@
|
|||||||
|
//go:build linux
|
||||||
|
|
||||||
|
package library
|
||||||
|
|
||||||
|
import (
|
||||||
|
"os"
|
||||||
|
|
||||||
|
"golang.org/x/sys/unix"
|
||||||
|
)
|
||||||
|
|
||||||
|
// hintReadahead asks the kernel to start fetching the head of a file
|
||||||
|
// that is about to be read.
|
||||||
|
//
|
||||||
|
// `POSIX_FADV_WILLNEED` returns immediately and queues the read, which
|
||||||
|
// is the whole point: on a spinning disk the first access to a file
|
||||||
|
// costs a seek of several milliseconds, and that latency can only be
|
||||||
|
// hidden by having the next seek already in flight while the current
|
||||||
|
// file is being parsed. A drive with command queueing can then service
|
||||||
|
// the queued reads in head order rather than in the order they were
|
||||||
|
// asked for.
|
||||||
|
//
|
||||||
|
// Errors are dropped on purpose. This is a hint: a file that has since
|
||||||
|
// been deleted, a filesystem that does not implement fadvise, or a
|
||||||
|
// permission the walk saw and this open does not, all mean "no
|
||||||
|
// prefetch", never "fail the scan". The read that follows is what
|
||||||
|
// reports a genuine problem.
|
||||||
|
func hintReadahead(path string, bytes int64) {
|
||||||
|
f, err := os.Open(path)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
defer func() { _ = f.Close() }()
|
||||||
|
|
||||||
|
_ = unix.Fadvise(
|
||||||
|
int(f.Fd()), 0, bytes, unix.FADV_WILLNEED,
|
||||||
|
)
|
||||||
|
}
|
||||||
@@ -0,0 +1,13 @@
|
|||||||
|
//go:build !linux
|
||||||
|
|
||||||
|
package library
|
||||||
|
|
||||||
|
// hintReadahead is a no-op off Linux.
|
||||||
|
//
|
||||||
|
// macOS has `F_RDADVISE` and Windows has `FILE_FLAG_SEQUENTIAL_SCAN`,
|
||||||
|
// and neither is wired up here for the reason the scan concurrency
|
||||||
|
// heuristic is not either: this package cannot tell a spinning disk
|
||||||
|
// from an SSD on those platforms (see system.ProfileForPath), so it
|
||||||
|
// would be prefetching without knowing whether prefetching is what the
|
||||||
|
// device wants.
|
||||||
|
func hintReadahead(_ string, _ int64) {}
|
||||||
@@ -0,0 +1,122 @@
|
|||||||
|
package library
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"yellowjacket/backend/system"
|
||||||
|
)
|
||||||
|
|
||||||
|
// How many workers a scan gets is decided by two facts about the
|
||||||
|
// device, and the second one is new: a spinning disk that can queue
|
||||||
|
// commands wants several reads in flight, and one that cannot wants
|
||||||
|
// almost none. Before this it was a flat 2 for anything rotational,
|
||||||
|
// which is a pre-NCQ assumption — a modern SATA disk reports a queue
|
||||||
|
// depth of 32 and was being given a quarter of what it can use.
|
||||||
|
func TestWorkersForProfile(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
const cpus = 16
|
||||||
|
|
||||||
|
ssd := system.DiskProfile{Device: "sda", QueueDepth: 32}
|
||||||
|
hddQueued := system.DiskProfile{
|
||||||
|
Device: "sdb", Rotational: true, QueueDepth: 32,
|
||||||
|
}
|
||||||
|
hddSerial := system.DiskProfile{
|
||||||
|
Device: "sdc", Rotational: true, QueueDepth: 1,
|
||||||
|
}
|
||||||
|
// Neither NVMe nor a device-mapper volume publishes queue_depth.
|
||||||
|
// An unknown depth must not be read as "cannot queue", or every
|
||||||
|
// such device would be scanned as if it were a 2003 drive.
|
||||||
|
unknown := system.DiskProfile{Device: "dm-0", Rotational: true}
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
mode ScanConcurrency
|
||||||
|
profile system.DiskProfile
|
||||||
|
want int
|
||||||
|
}{
|
||||||
|
{"ssd auto", ScanConcurrencyAuto, ssd, cpus},
|
||||||
|
{"queueing hdd auto", ScanConcurrencyAuto, hddQueued, hddWorkerCountQueued},
|
||||||
|
{"serial hdd auto", ScanConcurrencyAuto, hddSerial, hddWorkerCountSerial},
|
||||||
|
{"unknown depth queues", ScanConcurrencyAuto, unknown, hddWorkerCountQueued},
|
||||||
|
|
||||||
|
// The mode overrules detection about the *disk*, never about
|
||||||
|
// its queue: forcing hdd on a queueing drive still uses it.
|
||||||
|
{"forced hdd on an ssd", ScanConcurrencyHDD, ssd, hddWorkerCountQueued},
|
||||||
|
{"forced ssd on an hdd", ScanConcurrencySSD, hddQueued, cpus},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
if got := workersForProfile(tt.mode, tt.profile, cpus); got != tt.want {
|
||||||
|
t.Errorf(
|
||||||
|
"workersForProfile(%q, %+v) = %d, want %d",
|
||||||
|
tt.mode, tt.profile, got, tt.want,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A machine with fewer cores than the policy asks for gets its cores.
|
||||||
|
func TestWorkersNeverExceedTheCPUCount(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
hdd := system.DiskProfile{Rotational: true, QueueDepth: 32}
|
||||||
|
|
||||||
|
if got := workersForProfile(ScanConcurrencyAuto, hdd, 1); got != 1 {
|
||||||
|
t.Errorf("single-core hdd = %d workers, want 1", got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The prefetch stage must forward every item and nothing else: it is a
|
||||||
|
// pass-through with a side effect, and a scan that drops a file because
|
||||||
|
// of a *hint* would be a spectacular way to lose part of a library.
|
||||||
|
func TestReadaheadForwardsEveryFile(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
in := make(chan scanWork, 4)
|
||||||
|
for _, p := range []string{"/a", "/b", "/c", "/d"} {
|
||||||
|
in <- scanWork{absolutePath: p}
|
||||||
|
}
|
||||||
|
|
||||||
|
close(in)
|
||||||
|
|
||||||
|
var got []string
|
||||||
|
for w := range readaheadWork(
|
||||||
|
context.Background(),
|
||||||
|
in,
|
||||||
|
system.DiskProfile{Rotational: true, QueueDepth: 32},
|
||||||
|
) {
|
||||||
|
got = append(got, w.absolutePath)
|
||||||
|
}
|
||||||
|
|
||||||
|
want := []string{"/a", "/b", "/c", "/d"}
|
||||||
|
if len(got) != len(want) {
|
||||||
|
t.Fatalf("forwarded %v, want %v", got, want)
|
||||||
|
}
|
||||||
|
|
||||||
|
for i := range want {
|
||||||
|
if got[i] != want[i] {
|
||||||
|
t.Errorf("item %d = %q, want %q", i, got[i], want[i])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// On an SSD the stage is not inserted at all — the channel comes back
|
||||||
|
// unchanged, so a scan there pays nothing for a feature it cannot use.
|
||||||
|
func TestReadaheadIsSkippedOnSolidState(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
in := make(chan scanWork)
|
||||||
|
out := readaheadWork(
|
||||||
|
context.Background(), in, system.DiskProfile{QueueDepth: 32},
|
||||||
|
)
|
||||||
|
|
||||||
|
if out != (<-chan scanWork)(in) {
|
||||||
|
t.Error("an ssd must get the original channel, unwrapped")
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -279,17 +279,19 @@ func (h *MPRISHandler) enqueue(fn func()) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// UpdateMetadata pushes track metadata to D-Bus.
|
// metadataMap builds the org.mpris.MediaPlayer2.Player Metadata value
|
||||||
func (h *MPRISHandler) UpdateMetadata(meta Metadata) {
|
// for one track.
|
||||||
h.mu.Lock()
|
//
|
||||||
h.trackID++
|
// It is separated from UpdateMetadata, which needs a live D-Bus
|
||||||
tid := h.trackID
|
// connection, so the map's contents can be asserted on: this file is
|
||||||
h.mu.Unlock()
|
// behind a build tag and everything in it that touches h is reachable
|
||||||
|
// only from a session bus, which is the same reason the Android
|
||||||
m := map[string]interface{}{
|
// contract lives in an untagged androidpayload.go.
|
||||||
|
func metadataMap(meta Metadata, trackID uint64) map[string]any {
|
||||||
|
m := map[string]any{
|
||||||
"mpris:trackid": dbus.ObjectPath(
|
"mpris:trackid": dbus.ObjectPath(
|
||||||
fmt.Sprintf(
|
fmt.Sprintf(
|
||||||
"/org/yellowjacket/Track/%d", tid,
|
"/org/yellowjacket/Track/%d", trackID,
|
||||||
),
|
),
|
||||||
),
|
),
|
||||||
}
|
}
|
||||||
@@ -306,16 +308,45 @@ func (h *MPRISHandler) UpdateMetadata(meta Metadata) {
|
|||||||
m["xesam:album"] = meta.Album
|
m["xesam:album"] = meta.Album
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Always present, even with nothing to point at.
|
||||||
|
//
|
||||||
|
// Every other key here can be omitted safely because a client
|
||||||
|
// reading the map sees a track with no title or no album and
|
||||||
|
// renders it that way. Art is different: KDE's applet (and
|
||||||
|
// others) treat an *absent* mpris:artUrl as "no news about the
|
||||||
|
// art" and keep drawing whatever the last track had, so playing
|
||||||
|
// something with no cover left the previous album's sleeve on
|
||||||
|
// screen — which reads as the wrong track playing rather than as
|
||||||
|
// missing artwork.
|
||||||
|
//
|
||||||
|
// An empty string is the honest answer and is what the spec's
|
||||||
|
// "URI" type degrades to; a client that cannot load it falls back
|
||||||
|
// to its own placeholder, which is the behaviour wanted.
|
||||||
|
artURL := ""
|
||||||
if meta.ArtFilePath != "" {
|
if meta.ArtFilePath != "" {
|
||||||
m["mpris:artUrl"] = "file://" + meta.ArtFilePath
|
artURL = "file://" + meta.ArtFilePath
|
||||||
}
|
}
|
||||||
|
|
||||||
|
m["mpris:artUrl"] = artURL
|
||||||
|
|
||||||
if meta.DurationSec > 0 {
|
if meta.DurationSec > 0 {
|
||||||
m["mpris:length"] = int64(
|
m["mpris:length"] = int64(
|
||||||
meta.DurationSec,
|
meta.DurationSec,
|
||||||
) * usPerSec
|
) * usPerSec
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return m
|
||||||
|
}
|
||||||
|
|
||||||
|
// UpdateMetadata pushes track metadata to D-Bus.
|
||||||
|
func (h *MPRISHandler) UpdateMetadata(meta Metadata) {
|
||||||
|
h.mu.Lock()
|
||||||
|
h.trackID++
|
||||||
|
tid := h.trackID
|
||||||
|
h.mu.Unlock()
|
||||||
|
|
||||||
|
m := metadataMap(meta, tid)
|
||||||
|
|
||||||
h.enqueue(func() {
|
h.enqueue(func() {
|
||||||
h.props.SetMust(playerIf, "Metadata", m)
|
h.props.SetMust(playerIf, "Metadata", m)
|
||||||
})
|
})
|
||||||
|
|||||||
@@ -0,0 +1,86 @@
|
|||||||
|
//go:build linux && !android
|
||||||
|
|
||||||
|
package mediacontrols
|
||||||
|
|
||||||
|
import "testing"
|
||||||
|
|
||||||
|
// The one key that must be present even when it is empty.
|
||||||
|
//
|
||||||
|
// Everything else in the map may be omitted, because a client reading
|
||||||
|
// it renders a track with no title as a track with no title. Art is
|
||||||
|
// different: KDE's applet treats an *absent* mpris:artUrl as no news
|
||||||
|
// about the art and keeps drawing the last one it saw, so a track with
|
||||||
|
// no cover wore the previous album's sleeve — which reads as the wrong
|
||||||
|
// track playing rather than as missing artwork.
|
||||||
|
func TestMetadataMapAlwaysCarriesArtURL(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
meta Metadata
|
||||||
|
want string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
name: "no art at all",
|
||||||
|
meta: Metadata{Title: "Blue in Green"},
|
||||||
|
want: "",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "art on disk",
|
||||||
|
meta: Metadata{
|
||||||
|
Title: "Blue in Green",
|
||||||
|
ArtFilePath: "/covers/kind-of-blue_lg.jpg",
|
||||||
|
},
|
||||||
|
want: "file:///covers/kind-of-blue_lg.jpg",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
m := metadataMap(tt.meta, 1)
|
||||||
|
|
||||||
|
got, ok := m["mpris:artUrl"]
|
||||||
|
if !ok {
|
||||||
|
t.Fatal("mpris:artUrl is absent; it must always be sent")
|
||||||
|
}
|
||||||
|
|
||||||
|
if got != tt.want {
|
||||||
|
t.Errorf("mpris:artUrl = %v, want %q", got, tt.want)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The trackid has to change between tracks or a client is entitled to
|
||||||
|
// treat the metadata as describing the same track it already has.
|
||||||
|
func TestMetadataMapTrackIDVaries(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
first := metadataMap(Metadata{Title: "A"}, 1)["mpris:trackid"]
|
||||||
|
second := metadataMap(Metadata{Title: "B"}, 2)["mpris:trackid"]
|
||||||
|
|
||||||
|
if first == second {
|
||||||
|
t.Errorf("trackid did not change: %v", first)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// The optional keys stay optional — this is what makes artUrl's
|
||||||
|
// always-present treatment a deliberate exception rather than drift.
|
||||||
|
func TestMetadataMapOmitsEmptyOptionalFields(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
m := metadataMap(Metadata{}, 1)
|
||||||
|
|
||||||
|
for _, key := range []string{
|
||||||
|
"xesam:title",
|
||||||
|
"xesam:artist",
|
||||||
|
"xesam:album",
|
||||||
|
"mpris:length",
|
||||||
|
} {
|
||||||
|
if _, ok := m[key]; ok {
|
||||||
|
t.Errorf("%s is present for an empty Metadata", key)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -81,6 +81,7 @@ func (q *Queue) emitTracksModified(
|
|||||||
Index: index,
|
Index: index,
|
||||||
Positions: positions,
|
Positions: positions,
|
||||||
CurrentIndex: q.currentIndex,
|
CurrentIndex: q.currentIndex,
|
||||||
|
Source: q.source,
|
||||||
},
|
},
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -219,6 +219,56 @@ func TestEmit_AddTrackSendsDeltaNotSnapshot(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// The append clears the source, and the delta is the only event those
|
||||||
|
// paths emit — so if it does not carry the source, the frontend keeps
|
||||||
|
// the label it was last given and goes on offering a link back to an
|
||||||
|
// album the queue no longer holds until something forces a full state.
|
||||||
|
func TestEmit_AppendDeltaCarriesClearedSource(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
q, db, rec := setupRecordedQueue(t)
|
||||||
|
paths := seedAudioFiles(t, db, 4)
|
||||||
|
|
||||||
|
q.SetQueue(
|
||||||
|
paths[:3], 0, false,
|
||||||
|
Source{Type: "album", ID: 1, Label: "Abbey Road"},
|
||||||
|
)
|
||||||
|
|
||||||
|
if _, ok := rec.Wait(events.QueueChanged, waitFor); !ok {
|
||||||
|
t.Fatalf("no QueueChanged after SetQueue; got %v", rec.Names())
|
||||||
|
}
|
||||||
|
|
||||||
|
rec.Reset()
|
||||||
|
q.AddTrack(paths[3])
|
||||||
|
|
||||||
|
if got := modifiedOf(t, rec).Source; got != (Source{}) {
|
||||||
|
t.Errorf("delta source = %+v, want zero value", got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// And a delta that did not clear it still reports the source it has,
|
||||||
|
// or the frontend would drop a perfectly good label on every removal.
|
||||||
|
func TestEmit_NonAppendDeltaCarriesSource(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
q, db, rec := setupRecordedQueue(t)
|
||||||
|
paths := seedAudioFiles(t, db, 4)
|
||||||
|
|
||||||
|
album := Source{Type: "album", ID: 1, Label: "Abbey Road"}
|
||||||
|
q.SetQueue(paths, 0, false, album)
|
||||||
|
|
||||||
|
if _, ok := rec.Wait(events.QueueChanged, waitFor); !ok {
|
||||||
|
t.Fatalf("no QueueChanged after SetQueue; got %v", rec.Names())
|
||||||
|
}
|
||||||
|
|
||||||
|
rec.Reset()
|
||||||
|
q.RemoveTrack(3)
|
||||||
|
|
||||||
|
if got := modifiedOf(t, rec).Source; got != album {
|
||||||
|
t.Errorf("delta source = %+v, want %+v", got, album)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
func TestEmit_RemoveTracksReportsPositions(t *testing.T) {
|
func TestEmit_RemoveTracksReportsPositions(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
|
|||||||
@@ -156,12 +156,21 @@ type PlaybackFailure struct {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// TracksModified is the payload for the QueueTracksModified event.
|
// TracksModified is the payload for the QueueTracksModified event.
|
||||||
|
//
|
||||||
|
// Source is carried because an append is exactly what can *invalidate*
|
||||||
|
// it: a queue built from one album stops being that album the moment a
|
||||||
|
// track from somewhere else is added to it. The delta is the only event
|
||||||
|
// those paths emit, so without this the frontend would keep the label
|
||||||
|
// it was last given and go on saying "Playing from" an album that is no
|
||||||
|
// longer what is queued — an event carrying what its consumer needs, so
|
||||||
|
// nothing has to invalidate anything.
|
||||||
type TracksModified struct {
|
type TracksModified struct {
|
||||||
Action string `json:"action"`
|
Action string `json:"action"`
|
||||||
Tracks []Track `json:"tracks,omitempty"`
|
Tracks []Track `json:"tracks,omitempty"`
|
||||||
Index int `json:"index"`
|
Index int `json:"index"`
|
||||||
Positions []int `json:"positions,omitempty"`
|
Positions []int `json:"positions,omitempty"`
|
||||||
CurrentIndex int `json:"currentIndex"`
|
CurrentIndex int `json:"currentIndex"`
|
||||||
|
Source Source `json:"source"`
|
||||||
}
|
}
|
||||||
|
|
||||||
// Queue manages an ordered list of tracks for playback.
|
// Queue manages an ordered list of tracks for playback.
|
||||||
@@ -455,6 +464,8 @@ func (q *Queue) AddTrack(filePath string) {
|
|||||||
q.generateShuffleOrder()
|
q.generateShuffleOrder()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
q.dropSource()
|
||||||
|
|
||||||
q.persistAddTrack(track)
|
q.persistAddTrack(track)
|
||||||
q.persistState()
|
q.persistState()
|
||||||
q.emitTracksModified(
|
q.emitTracksModified(
|
||||||
@@ -505,6 +516,8 @@ func (q *Queue) AddTracks(filePaths []string) {
|
|||||||
q.generateShuffleOrder()
|
q.generateShuffleOrder()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
q.dropSource()
|
||||||
|
|
||||||
q.persistAddTracks(newTracks)
|
q.persistAddTracks(newTracks)
|
||||||
q.persistState()
|
q.persistState()
|
||||||
q.emitTracksModified(
|
q.emitTracksModified(
|
||||||
@@ -563,6 +576,8 @@ func (q *Queue) InsertNextTracks(filePaths []string) {
|
|||||||
q.generateShuffleOrder()
|
q.generateShuffleOrder()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
q.dropSource()
|
||||||
|
|
||||||
q.persistInsertTracks(newTracks, insertPos)
|
q.persistInsertTracks(newTracks, insertPos)
|
||||||
q.persistState()
|
q.persistState()
|
||||||
q.emitTracksModified(
|
q.emitTracksModified(
|
||||||
@@ -613,6 +628,8 @@ func (q *Queue) InsertNext(filePath string) {
|
|||||||
q.generateShuffleOrder()
|
q.generateShuffleOrder()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
q.dropSource()
|
||||||
|
|
||||||
q.persistInsertTracks([]Track{track}, insertPos)
|
q.persistInsertTracks([]Track{track}, insertPos)
|
||||||
q.persistState()
|
q.persistState()
|
||||||
q.emitTracksModified(
|
q.emitTracksModified(
|
||||||
@@ -680,6 +697,8 @@ func (q *Queue) InsertTracksAt(filePaths []string, index int) {
|
|||||||
q.generateShuffleOrder()
|
q.generateShuffleOrder()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
q.dropSource()
|
||||||
|
|
||||||
q.persistInsertTracks(newTracks, index)
|
q.persistInsertTracks(newTracks, index)
|
||||||
q.persistState()
|
q.persistState()
|
||||||
q.emitTracksModified(
|
q.emitTracksModified(
|
||||||
@@ -1537,6 +1556,31 @@ func (q *Queue) reindexPositions() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// dropSource forgets which collection the queue was built from.
|
||||||
|
//
|
||||||
|
// A Source is a claim that everything queued came from one album,
|
||||||
|
// playlist, genre or artist, and the frontend renders it as a
|
||||||
|
// "Playing from X" link back to that page. Adding or inserting a track
|
||||||
|
// makes the claim false — the queue is now that album *plus* something
|
||||||
|
// else — so every path that does so calls this.
|
||||||
|
//
|
||||||
|
// It was set by SetQueue and cleared in exactly one place, Clear, so a
|
||||||
|
// label survived every append. It is persisted too (source_type /
|
||||||
|
// source_id / source_label on the queue state row), which is what made
|
||||||
|
// a wrong label outlive the session that earned it: an album queued on
|
||||||
|
// Monday, added to on Tuesday, still offered a link back to that album
|
||||||
|
// on Friday.
|
||||||
|
//
|
||||||
|
// Removing, reordering and shuffling deliberately do not call this. A
|
||||||
|
// queue with a track taken out of it, or played in another order, is
|
||||||
|
// still that album — the link still goes somewhere true. Only the
|
||||||
|
// arrival of a track from elsewhere makes it a lie.
|
||||||
|
//
|
||||||
|
// The caller must hold q.mu.
|
||||||
|
func (q *Queue) dropSource() {
|
||||||
|
q.source = Source{}
|
||||||
|
}
|
||||||
|
|
||||||
// commitMutation persists the current queue state after a mutation.
|
// commitMutation persists the current queue state after a mutation.
|
||||||
// When reindex is true, track positions are renumbered first.
|
// When reindex is true, track positions are renumbered first.
|
||||||
// The caller must hold q.mu.
|
// The caller must hold q.mu.
|
||||||
|
|||||||
@@ -126,6 +126,117 @@ func TestClear_ResetsSource(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// A queue built from one album stops being that album the moment a
|
||||||
|
// track from somewhere else joins it, so every path that adds one
|
||||||
|
// drops the source. Before this, SetQueue was the only writer and
|
||||||
|
// Clear the only clearer, so "Playing from Abbey Road" outlived every
|
||||||
|
// append — and, being persisted, every restart too.
|
||||||
|
func TestAppendPathsDropSource(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
album := Source{Type: "album", ID: 1, Label: "Abbey Road"}
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
append func(q *Queue, paths []string)
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
name: "AddTrack",
|
||||||
|
append: func(q *Queue, paths []string) {
|
||||||
|
q.AddTrack(paths[5])
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "AddTracks",
|
||||||
|
append: func(q *Queue, paths []string) {
|
||||||
|
q.AddTracks(paths[5:7])
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "InsertNext",
|
||||||
|
append: func(q *Queue, paths []string) {
|
||||||
|
q.InsertNext(paths[5])
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "InsertNextTracks",
|
||||||
|
append: func(q *Queue, paths []string) {
|
||||||
|
q.InsertNextTracks(paths[5:7])
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "InsertTracksAt",
|
||||||
|
append: func(q *Queue, paths []string) {
|
||||||
|
q.InsertTracksAt(paths[5:7], 1)
|
||||||
|
},
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
q, db := setupTestQueue(t)
|
||||||
|
paths := seedAudioFiles(t, db, 8)
|
||||||
|
|
||||||
|
q.SetQueue(paths[:5], 0, false, album)
|
||||||
|
|
||||||
|
if got := q.GetState().Source; got != album {
|
||||||
|
t.Fatalf("source before append: got %+v, want %+v", got, album)
|
||||||
|
}
|
||||||
|
|
||||||
|
tt.append(q, paths)
|
||||||
|
|
||||||
|
if got := q.GetState().Source; got != (Source{}) {
|
||||||
|
t.Errorf(
|
||||||
|
"source after %s: got %+v, want zero value",
|
||||||
|
tt.name, got,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Removing and reordering deliberately do not drop it: a queue with a
|
||||||
|
// track taken out of it is still that album, and the link still goes
|
||||||
|
// somewhere true.
|
||||||
|
func TestRemoveAndMoveKeepSource(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
album := Source{Type: "album", ID: 1, Label: "Abbey Road"}
|
||||||
|
|
||||||
|
t.Run("RemoveTrack", func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
q, db := setupTestQueue(t)
|
||||||
|
paths := seedAudioFiles(t, db, 5)
|
||||||
|
|
||||||
|
q.SetQueue(paths, 0, false, album)
|
||||||
|
q.RemoveTrack(3)
|
||||||
|
|
||||||
|
if got := q.GetState().Source; got != album {
|
||||||
|
t.Errorf("source after RemoveTrack: got %+v, want %+v", got, album)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
|
||||||
|
t.Run("MoveQueueTracks", func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
q, db := setupTestQueue(t)
|
||||||
|
paths := seedAudioFiles(t, db, 5)
|
||||||
|
|
||||||
|
q.SetQueue(paths, 0, false, album)
|
||||||
|
q.MoveQueueTracks([]int{0}, 3)
|
||||||
|
|
||||||
|
if got := q.GetState().Source; got != album {
|
||||||
|
t.Errorf(
|
||||||
|
"source after MoveQueueTracks: got %+v, want %+v",
|
||||||
|
got, album,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
func TestSetQueue_WithStartIndex(t *testing.T) {
|
func TestSetQueue_WithStartIndex(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
|
|||||||
@@ -28,6 +28,7 @@ var (
|
|||||||
errUnsupportedOp = errors.New("unsupported operator")
|
errUnsupportedOp = errors.New("unsupported operator")
|
||||||
errInvalidSortField = errors.New("invalid sort field: not in allowed field list")
|
errInvalidSortField = errors.New("invalid sort field: not in allowed field list")
|
||||||
errNotNumeric = errors.New("value must be numeric")
|
errNotNumeric = errors.New("value must be numeric")
|
||||||
|
errInvalidMatch = errors.New("match must be \"all\" or \"any\"")
|
||||||
)
|
)
|
||||||
|
|
||||||
// Rule represents a single filter condition for a smart playlist.
|
// Rule represents a single filter condition for a smart playlist.
|
||||||
@@ -37,13 +38,45 @@ type Rule struct {
|
|||||||
Value string `json:"value"`
|
Value string `json:"value"`
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// MatchType decides how a rule set's conditions combine.
|
||||||
|
//
|
||||||
|
// The rules used to be joined with " AND " and nothing else, so a
|
||||||
|
// playlist could only ever narrow: "jazz released after 1960" was
|
||||||
|
// expressible and "jazz or blues" was not, which is most of what
|
||||||
|
// anyone reaches for a second rule to say.
|
||||||
|
type MatchType string
|
||||||
|
|
||||||
|
const (
|
||||||
|
// MatchAll requires every rule to hold — the historical behaviour,
|
||||||
|
// and what an empty match means so that every rule set written
|
||||||
|
// before this existed keeps the meaning it was saved with.
|
||||||
|
MatchAll MatchType = "all"
|
||||||
|
// MatchAny requires at least one rule to hold.
|
||||||
|
MatchAny MatchType = "any"
|
||||||
|
)
|
||||||
|
|
||||||
|
// joiner returns the SQL keyword that combines two conditions.
|
||||||
|
// An unrecognised value cannot reach here — ParseRuleSet rejects one
|
||||||
|
// — so the default is about the empty string, which is every rule set
|
||||||
|
// saved before this field existed.
|
||||||
|
func (m MatchType) joiner() string {
|
||||||
|
if m == MatchAny {
|
||||||
|
return " OR "
|
||||||
|
}
|
||||||
|
|
||||||
|
return " AND "
|
||||||
|
}
|
||||||
|
|
||||||
// RuleSet holds the complete filter configuration for a smart
|
// RuleSet holds the complete filter configuration for a smart
|
||||||
// playlist, including optional sort and limit.
|
// playlist, including optional sort and limit.
|
||||||
type RuleSet struct {
|
type RuleSet struct {
|
||||||
Rules []Rule `json:"rules"`
|
Rules []Rule `json:"rules"`
|
||||||
Limit int `json:"limit,omitempty"`
|
// Match is "all" or "any"; empty means "all". It is omitempty so
|
||||||
SortField string `json:"sort_field,omitempty"`
|
// an untouched playlist's stored JSON does not change shape.
|
||||||
SortDir string `json:"sort_dir,omitempty"`
|
Match MatchType `json:"match,omitempty"`
|
||||||
|
Limit int `json:"limit,omitempty"`
|
||||||
|
SortField string `json:"sort_field,omitempty"`
|
||||||
|
SortDir string `json:"sort_dir,omitempty"`
|
||||||
}
|
}
|
||||||
|
|
||||||
// fieldMap maps user-facing rule field names to track_metadata column
|
// fieldMap maps user-facing rule field names to track_metadata column
|
||||||
@@ -116,7 +149,12 @@ const genreDelimiter = "||"
|
|||||||
// slice of rules. It is a pure function — no database access needed.
|
// slice of rules. It is a pure function — no database access needed.
|
||||||
// Returns the clause (without the leading "WHERE"), the parameter
|
// Returns the clause (without the leading "WHERE"), the parameter
|
||||||
// args, and any validation error.
|
// args, and any validation error.
|
||||||
func BuildWhereClause(rules []Rule) (string, []any, error) {
|
//
|
||||||
|
// match decides how the conditions combine; an empty match is MatchAll,
|
||||||
|
// which is what every rule set saved before the field existed means.
|
||||||
|
func BuildWhereClause(
|
||||||
|
rules []Rule, match MatchType,
|
||||||
|
) (string, []any, error) {
|
||||||
if len(rules) == 0 {
|
if len(rules) == 0 {
|
||||||
return "", nil, nil
|
return "", nil, nil
|
||||||
}
|
}
|
||||||
@@ -179,7 +217,28 @@ func BuildWhereClause(rules []Rule) (string, []any, error) {
|
|||||||
args = append(args, condArgs...)
|
args = append(args, condArgs...)
|
||||||
}
|
}
|
||||||
|
|
||||||
return strings.Join(conditions, " AND "), args, nil
|
// Under OR, each condition is parenthesised; under AND it is not.
|
||||||
|
//
|
||||||
|
// The asymmetry is deliberate rather than an omission. AND is the
|
||||||
|
// tighter operator in SQL, so an OR-join has to protect any
|
||||||
|
// condition that contains a top-level AND of its own or the halves
|
||||||
|
// come apart: `days_since_played less_than` is
|
||||||
|
// `last_played IS NOT NULL AND <expr> < ?`, which read without
|
||||||
|
// brackets under an OR-join happens to still parse correctly and
|
||||||
|
// would stop doing so the moment a condition grows a top-level OR.
|
||||||
|
// Bracketing under AND would be a no-op semantically and would
|
||||||
|
// rewrite the clause every existing test pins, so the brackets go
|
||||||
|
// exactly where they change something.
|
||||||
|
if match == MatchAny {
|
||||||
|
bracketed := make([]string, len(conditions))
|
||||||
|
for i, cond := range conditions {
|
||||||
|
bracketed[i] = "(" + cond + ")"
|
||||||
|
}
|
||||||
|
|
||||||
|
conditions = bracketed
|
||||||
|
}
|
||||||
|
|
||||||
|
return strings.Join(conditions, match.joiner()), args, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// validateOperator checks that the operator is valid for the field
|
// validateOperator checks that the operator is valid for the field
|
||||||
@@ -599,7 +658,7 @@ func Evaluate(
|
|||||||
start := time.Now()
|
start := time.Now()
|
||||||
logger := db.Logger()
|
logger := db.Logger()
|
||||||
|
|
||||||
where, args, err := BuildWhereClause(ruleSet.Rules)
|
where, args, err := BuildWhereClause(ruleSet.Rules, ruleSet.Match)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return nil, fmt.Errorf(
|
return nil, fmt.Errorf(
|
||||||
"smart playlist rule error: %w", err,
|
"smart playlist rule error: %w", err,
|
||||||
@@ -1036,6 +1095,16 @@ func ParseRuleSet(jsonStr string) (RuleSet, error) {
|
|||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// A match nobody recognises would otherwise fall through to AND,
|
||||||
|
// which is a playlist quietly returning the wrong tracks rather
|
||||||
|
// than refusing to be saved. This is the only place a rule set
|
||||||
|
// enters the backend, so it is the only place that has to ask.
|
||||||
|
if rs.Match != "" && rs.Match != MatchAll && rs.Match != MatchAny {
|
||||||
|
return RuleSet{}, fmt.Errorf(
|
||||||
|
"%w: %q", errInvalidMatch, rs.Match,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
return rs, nil
|
return rs, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -1,6 +1,7 @@
|
|||||||
package smartplaylist
|
package smartplaylist
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"errors"
|
||||||
"strings"
|
"strings"
|
||||||
"testing"
|
"testing"
|
||||||
|
|
||||||
@@ -170,7 +171,7 @@ func TestBuildWhereClause_TextIs(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "artist", Operator: "is", Value: "Queen"},
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -189,7 +190,7 @@ func TestBuildWhereClause_TextIsNot(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "artist", Operator: "is_not", Value: "Queen"},
|
{Field: "artist", Operator: "is_not", Value: "Queen"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -209,7 +210,7 @@ func TestBuildWhereClause_TextContains(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "title", Operator: "contains", Value: "Black"},
|
{Field: "title", Operator: "contains", Value: "Black"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -231,7 +232,7 @@ func TestBuildWhereClause_TextDoesNotContain(t *testing.T) {
|
|||||||
Field: "title", Operator: "does_not_contain",
|
Field: "title", Operator: "does_not_contain",
|
||||||
Value: "Black",
|
Value: "Black",
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -251,7 +252,7 @@ func TestBuildWhereClause_TextStartsWith(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "title", Operator: "starts_with", Value: "Back"},
|
{Field: "title", Operator: "starts_with", Value: "Back"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -270,7 +271,7 @@ func TestBuildWhereClause_TextEndsWith(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "title", Operator: "ends_with", Value: "Black"},
|
{Field: "title", Operator: "ends_with", Value: "Black"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -292,7 +293,7 @@ func TestBuildWhereClause_TextIsAnyOf(t *testing.T) {
|
|||||||
Field: "artist", Operator: "is_any_of",
|
Field: "artist", Operator: "is_any_of",
|
||||||
Value: `["Queen","AC/DC"]`,
|
Value: `["Queen","AC/DC"]`,
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -312,7 +313,7 @@ func TestBuildWhereClause_NumericIs(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "year", Operator: "is", Value: "1980"},
|
{Field: "year", Operator: "is", Value: "1980"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -331,7 +332,7 @@ func TestBuildWhereClause_NumericIsNot(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "year", Operator: "is_not", Value: "1980"},
|
{Field: "year", Operator: "is_not", Value: "1980"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -350,7 +351,7 @@ func TestBuildWhereClause_NumericGreaterThan(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "year", Operator: "greater_than", Value: "2000"},
|
{Field: "year", Operator: "greater_than", Value: "2000"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -369,7 +370,7 @@ func TestBuildWhereClause_NumericLessThan(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "year", Operator: "less_than", Value: "1980"},
|
{Field: "year", Operator: "less_than", Value: "1980"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -391,7 +392,7 @@ func TestBuildWhereClause_NumericBetween(t *testing.T) {
|
|||||||
Field: "year", Operator: "between",
|
Field: "year", Operator: "between",
|
||||||
Value: "1975,1985",
|
Value: "1975,1985",
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -414,7 +415,7 @@ func TestBuildWhereClause_NumericBetweenJSON(t *testing.T) {
|
|||||||
Field: "year", Operator: "between",
|
Field: "year", Operator: "between",
|
||||||
Value: `["1975","1985"]`,
|
Value: `["1975","1985"]`,
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -434,7 +435,7 @@ func TestBuildWhereClause_GenreIsProducesSubquery(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "genre", Operator: "is", Value: "Rock"},
|
{Field: "genre", Operator: "is", Value: "Rock"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -466,7 +467,7 @@ func TestBuildWhereClause_GenreIsNotProducesSubquery(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "genre", Operator: "is_not", Value: "Rock"},
|
{Field: "genre", Operator: "is_not", Value: "Rock"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -495,7 +496,7 @@ func TestBuildWhereClause_GenreIsAnyOfProducesSubquery(t *testing.T) {
|
|||||||
Field: "genre", Operator: "is_any_of",
|
Field: "genre", Operator: "is_any_of",
|
||||||
Value: `["Rock","Pop"]`,
|
Value: `["Rock","Pop"]`,
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -524,7 +525,7 @@ func TestBuildWhereClause_GenreContainsUsesSubquery(t *testing.T) {
|
|||||||
|
|
||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "genre", Operator: "contains", Value: "Rock"},
|
{Field: "genre", Operator: "contains", Value: "Rock"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -557,7 +558,7 @@ func TestBuildWhereClause_MultipleRulesAND(t *testing.T) {
|
|||||||
clause, args, err := BuildWhereClause([]Rule{
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
{Field: "artist", Operator: "is", Value: "Queen"},
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
{Field: "year", Operator: "greater_than", Value: "1975"},
|
{Field: "year", Operator: "greater_than", Value: "1975"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -572,6 +573,110 @@ func TestBuildWhereClause_MultipleRulesAND(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestBuildWhereClause_MultipleRulesOR(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
clause, args, err := BuildWhereClause([]Rule{
|
||||||
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
|
{Field: "year", Operator: "greater_than", Value: "1975"},
|
||||||
|
}, MatchAny)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("unexpected error: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
want := "(artist_name = ? COLLATE NOCASE) OR (year > ?)"
|
||||||
|
if clause != want {
|
||||||
|
t.Errorf("clause = %q, want %q", clause, want)
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(args) != 2 || args[0] != "Queen" || args[1] != int64(1975) {
|
||||||
|
t.Errorf("args = %v, want [Queen 1975]", args)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// An empty match is what every rule set saved before the field existed
|
||||||
|
// carries, and it has to keep meaning AND — a playlist silently
|
||||||
|
// widening to OR on upgrade is the whole risk of adding this field.
|
||||||
|
func TestBuildWhereClause_EmptyMatchIsAll(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
rules := []Rule{
|
||||||
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
|
{Field: "year", Operator: "greater_than", Value: "1975"},
|
||||||
|
}
|
||||||
|
|
||||||
|
empty, _, err := BuildWhereClause(rules, "")
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("unexpected error: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
all, _, err := BuildWhereClause(rules, MatchAll)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("unexpected error: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if empty != all {
|
||||||
|
t.Errorf("empty match = %q, want the same as MatchAll %q",
|
||||||
|
empty, all)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A condition carrying its own top-level AND is what makes the
|
||||||
|
// bracketing under OR load-bearing: `days_since_played less_than`
|
||||||
|
// is two predicates, and both belong to the same rule.
|
||||||
|
func TestBuildWhereClause_ORBracketsCompoundCondition(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
clause, _, err := BuildWhereClause([]Rule{
|
||||||
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
|
{
|
||||||
|
Field: "days_since_played",
|
||||||
|
Operator: "less_than",
|
||||||
|
Value: "30",
|
||||||
|
},
|
||||||
|
}, MatchAny)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("unexpected error: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if !strings.Contains(clause, "(last_played IS NOT NULL AND") {
|
||||||
|
t.Errorf(
|
||||||
|
"compound condition is not bracketed under OR: %q",
|
||||||
|
clause,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestParseRuleSet_RejectsUnknownMatch(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
_, err := ParseRuleSet(`{"rules":[],"match":"either"}`)
|
||||||
|
if err == nil {
|
||||||
|
t.Fatal("expected an error for an unknown match type")
|
||||||
|
}
|
||||||
|
|
||||||
|
if !errors.Is(err, errInvalidMatch) {
|
||||||
|
t.Errorf("err = %v, want errInvalidMatch", err)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestParseRuleSet_AcceptsAnyAndAll(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
for _, want := range []MatchType{MatchAll, MatchAny} {
|
||||||
|
rs, err := ParseRuleSet(
|
||||||
|
`{"rules":[],"match":"` + string(want) + `"}`,
|
||||||
|
)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("match %q: unexpected error: %v", want, err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if rs.Match != want {
|
||||||
|
t.Errorf("match = %q, want %q", rs.Match, want)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
func TestBuildWhereClause_SameFieldMultipleTimes(t *testing.T) {
|
func TestBuildWhereClause_SameFieldMultipleTimes(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
@@ -581,7 +686,7 @@ func TestBuildWhereClause_SameFieldMultipleTimes(t *testing.T) {
|
|||||||
Field: "genre", Operator: "does_not_contain",
|
Field: "genre", Operator: "does_not_contain",
|
||||||
Value: "Punk",
|
Value: "Punk",
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -609,7 +714,7 @@ func TestBuildWhereClause_SameFieldMultipleTimes(t *testing.T) {
|
|||||||
func TestBuildWhereClause_EmptyRules(t *testing.T) {
|
func TestBuildWhereClause_EmptyRules(t *testing.T) {
|
||||||
t.Parallel()
|
t.Parallel()
|
||||||
|
|
||||||
clause, args, err := BuildWhereClause(nil)
|
clause, args, err := BuildWhereClause(nil, MatchAll)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("unexpected error: %v", err)
|
t.Fatalf("unexpected error: %v", err)
|
||||||
}
|
}
|
||||||
@@ -631,7 +736,7 @@ func TestBuildWhereClause_InvalidField(t *testing.T) {
|
|||||||
Field: "nonexistent", Operator: "is",
|
Field: "nonexistent", Operator: "is",
|
||||||
Value: "anything",
|
Value: "anything",
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err == nil {
|
if err == nil {
|
||||||
t.Fatal("expected error for invalid field, got nil")
|
t.Fatal("expected error for invalid field, got nil")
|
||||||
}
|
}
|
||||||
@@ -654,7 +759,7 @@ func TestBuildWhereClause_InvalidOperatorForNumeric(t *testing.T) {
|
|||||||
|
|
||||||
_, _, err := BuildWhereClause([]Rule{
|
_, _, err := BuildWhereClause([]Rule{
|
||||||
{Field: "year", Operator: "contains", Value: "1980"},
|
{Field: "year", Operator: "contains", Value: "1980"},
|
||||||
})
|
}, MatchAll)
|
||||||
if err == nil {
|
if err == nil {
|
||||||
t.Fatal(
|
t.Fatal(
|
||||||
"expected error for text operator on numeric field",
|
"expected error for text operator on numeric field",
|
||||||
@@ -676,7 +781,7 @@ func TestBuildWhereClause_InvalidOperatorForText(t *testing.T) {
|
|||||||
Field: "artist", Operator: "greater_than",
|
Field: "artist", Operator: "greater_than",
|
||||||
Value: "Queen",
|
Value: "Queen",
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err == nil {
|
if err == nil {
|
||||||
t.Fatal(
|
t.Fatal(
|
||||||
"expected error for numeric operator on text field",
|
"expected error for numeric operator on text field",
|
||||||
@@ -723,6 +828,80 @@ func TestEvaluate_TextIs(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Two rules that share no track at all: under AND this is empty, and
|
||||||
|
// under OR it is the union. Before Match existed only the first was
|
||||||
|
// expressible, so a playlist could only ever narrow — "jazz or blues"
|
||||||
|
// had no way to be said.
|
||||||
|
func TestEvaluate_MatchAnyUnionsWhereMatchAllIntersects(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
db := database.NewTestDB(t)
|
||||||
|
seedSmartPlaylistData(t, db)
|
||||||
|
|
||||||
|
// Queen has two tracks; Beyoncé has one; no track is by both.
|
||||||
|
rules := []Rule{
|
||||||
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
|
{Field: "artist", Operator: "is", Value: "Beyoncé"},
|
||||||
|
}
|
||||||
|
|
||||||
|
all, err := Evaluate(db, RuleSet{Rules: rules, Match: MatchAll})
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("Evaluate(all): %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(all) != 0 {
|
||||||
|
t.Errorf("match=all returned %d tracks, want 0", len(all))
|
||||||
|
}
|
||||||
|
|
||||||
|
either, err := Evaluate(db, RuleSet{Rules: rules, Match: MatchAny})
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("Evaluate(any): %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(either) != 3 {
|
||||||
|
t.Fatalf("match=any returned %d tracks, want 3", len(either))
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tr := range either {
|
||||||
|
if tr.ArtistName != "Queen" && tr.ArtistName != "Beyoncé" {
|
||||||
|
t.Errorf(
|
||||||
|
"track %q has artist %q, want Queen or Beyoncé",
|
||||||
|
tr.TrackName, tr.ArtistName,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// An empty match is what every playlist saved before the field existed
|
||||||
|
// carries, and it has to keep meaning AND all the way through Evaluate
|
||||||
|
// — a stored playlist silently widening on upgrade is the only real
|
||||||
|
// risk in adding this.
|
||||||
|
func TestEvaluate_EmptyMatchStillIntersects(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
db := database.NewTestDB(t)
|
||||||
|
seedSmartPlaylistData(t, db)
|
||||||
|
|
||||||
|
tracks, err := Evaluate(db, RuleSet{
|
||||||
|
Rules: []Rule{
|
||||||
|
{Field: "artist", Operator: "is", Value: "Queen"},
|
||||||
|
{Field: "year", Operator: "greater_than", Value: "1979"},
|
||||||
|
},
|
||||||
|
})
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("Evaluate: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Only "Another One Bites the Dust" (Queen, 1980) satisfies both.
|
||||||
|
if len(tracks) != 1 {
|
||||||
|
t.Fatalf("got %d tracks, want 1", len(tracks))
|
||||||
|
}
|
||||||
|
|
||||||
|
if want := "Another One Bites the Dust"; tracks[0].TrackName != want {
|
||||||
|
t.Errorf("got %q, want %q", tracks[0].TrackName, want)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// TestEvaluate_ArtworkEnrichment verifies the presentation-only
|
// TestEvaluate_ArtworkEnrichment verifies the presentation-only
|
||||||
// cover-art and MusicBrainz-ID fields are attached to matched tracks
|
// cover-art and MusicBrainz-ID fields are attached to matched tracks
|
||||||
// by the batched fetchArtwork pass (they are no longer part of the
|
// by the batched fetchArtwork pass (they are no longer part of the
|
||||||
@@ -1340,7 +1519,7 @@ func TestSQLInjection_FieldName(t *testing.T) {
|
|||||||
Field: "title; DROP TABLE playlists",
|
Field: "title; DROP TABLE playlists",
|
||||||
Operator: "is", Value: "x",
|
Operator: "is", Value: "x",
|
||||||
},
|
},
|
||||||
})
|
}, MatchAll)
|
||||||
if err == nil {
|
if err == nil {
|
||||||
t.Fatal(
|
t.Fatal(
|
||||||
"expected error for injected field name, got nil",
|
"expected error for injected field name, got nil",
|
||||||
|
|||||||
@@ -16,32 +16,107 @@ var errNoBlockDevice = errors.New(
|
|||||||
"no matching block device found",
|
"no matching block device found",
|
||||||
)
|
)
|
||||||
|
|
||||||
// IsRotationalDisk reports whether the block device backing the
|
// DiskProfile is what the scanner needs to know about the device a
|
||||||
// given path is a rotational (spinning) disk. Detection uses the
|
// library sits on. Both fields are about the same question — how many
|
||||||
// Linux sysfs interface at /sys/block/<dev>/queue/rotational.
|
// reads should be in flight at once — and they answer different halves
|
||||||
// Returns false on any error (assumes SSD).
|
// of it, so they travel together rather than as two probes.
|
||||||
func IsRotationalDisk(path string) bool {
|
type DiskProfile struct {
|
||||||
dev, err := deviceForPath(path)
|
// Device is the whole-disk kernel name ("sdb"), or "" when the
|
||||||
if err != nil {
|
// path could not be resolved to one.
|
||||||
return false
|
Device string
|
||||||
}
|
|
||||||
|
|
||||||
rotational, err := os.ReadFile(
|
// Rotational is /sys/block/<dev>/queue/rotational: true for a
|
||||||
filepath.Join(
|
// spinning disk, where a seek costs milliseconds.
|
||||||
"/sys/block", dev, "queue", "rotational",
|
Rotational bool
|
||||||
),
|
|
||||||
)
|
|
||||||
if err != nil {
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
return strings.TrimSpace(string(rotational)) == "1"
|
// QueueDepth is /sys/block/<dev>/device/queue_depth — how many
|
||||||
|
// commands the drive will accept and reorder at once. This is
|
||||||
|
// NCQ: a SATA disk with it enabled reports 31 or 32, and one
|
||||||
|
// without reports 1. Zero means the file was not there to read,
|
||||||
|
// which is the case for anything that is not a SCSI/SATA device
|
||||||
|
// (NVMe, MMC, device-mapper, loop, a VM's virtio disk).
|
||||||
|
//
|
||||||
|
// It is the difference between concurrency helping and hurting.
|
||||||
|
// With queueing, several outstanding reads let the drive service
|
||||||
|
// them in the order its head passes over them, which is most of
|
||||||
|
// why a parallel scan is faster at all. Without it, every extra
|
||||||
|
// worker is one more seek competing for one head, and the scan
|
||||||
|
// gets slower the harder it is pushed.
|
||||||
|
QueueDepth int
|
||||||
}
|
}
|
||||||
|
|
||||||
// deviceForPath resolves a filesystem path to its underlying block
|
// Queues reports whether the drive can reorder outstanding commands.
|
||||||
// device name (e.g. "sda") by matching the device major:minor
|
//
|
||||||
// from stat(2) against /sys/block/ entries.
|
// An unknown depth (0) counts as queueing: everything that does not
|
||||||
func deviceForPath(path string) (string, error) {
|
// publish this file is a device where concurrency is fine — NVMe has
|
||||||
|
// its own queues, virtio and device-mapper are not the physical layer
|
||||||
|
// at all. The only case worth being careful about is the one that
|
||||||
|
// says so explicitly.
|
||||||
|
func (p DiskProfile) Queues() bool {
|
||||||
|
return p.QueueDepth != 1
|
||||||
|
}
|
||||||
|
|
||||||
|
// IsRotationalDisk reports whether the block device backing the
|
||||||
|
// given path is a rotational (spinning) disk. Returns false on any
|
||||||
|
// error (assumes SSD).
|
||||||
|
func IsRotationalDisk(path string) bool {
|
||||||
|
return ProfileForPath(path).Rotational
|
||||||
|
}
|
||||||
|
|
||||||
|
// ProfileForPath describes the device backing a filesystem path. A
|
||||||
|
// path that cannot be resolved yields the zero profile, which reads as
|
||||||
|
// "not rotational, queueing" — the permissive answer, since assuming a
|
||||||
|
// spinning disk on an SSD would halve a scan for nothing.
|
||||||
|
func ProfileForPath(path string) DiskProfile {
|
||||||
|
dev, err := diskForPath(path)
|
||||||
|
if err != nil {
|
||||||
|
return DiskProfile{}
|
||||||
|
}
|
||||||
|
|
||||||
|
return DiskProfile{
|
||||||
|
Device: dev,
|
||||||
|
Rotational: sysfsInt(dev, "queue", "rotational") == 1,
|
||||||
|
QueueDepth: sysfsInt(dev, "device", "queue_depth"),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// sysfsInt reads one small integer out of /sys/block/<dev>/<parts...>,
|
||||||
|
// returning 0 when it is absent or unparseable. Every attribute here
|
||||||
|
// is optional: sysfs layout varies by driver, and a missing file is
|
||||||
|
// "this device does not say", never an error worth propagating.
|
||||||
|
func sysfsInt(dev string, parts ...string) int {
|
||||||
|
p := filepath.Join(
|
||||||
|
append([]string{"/sys/block", dev}, parts...)...,
|
||||||
|
)
|
||||||
|
|
||||||
|
data, err := os.ReadFile(p) //nolint:gosec // sysfs, name from the kernel
|
||||||
|
if err != nil {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
|
||||||
|
n, err := strconv.Atoi(strings.TrimSpace(string(data)))
|
||||||
|
if err != nil {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
|
||||||
|
return n
|
||||||
|
}
|
||||||
|
|
||||||
|
// diskForPath resolves a filesystem path to the *whole disk* backing
|
||||||
|
// it — "sdb" for a file on "sdb3".
|
||||||
|
//
|
||||||
|
// It goes through /sys/dev/block/<major>:<minor>, which the kernel
|
||||||
|
// maintains as a symlink to the device's own sysfs directory, and then
|
||||||
|
// walks up to the parent when that directory turns out to be a
|
||||||
|
// partition. The previous implementation scanned /sys/block comparing
|
||||||
|
// dev numbers and, failing an exact match, took the first entry whose
|
||||||
|
// *major* agreed — and every SATA disk shares major 8. So a library on
|
||||||
|
// /dev/sdb3 resolved to whatever /sys/block listed first, which is
|
||||||
|
// alphabetical, which is sda. On the machine this was found on that
|
||||||
|
// meant a 6 TB spinning disk was read as the SSD next to it and scanned
|
||||||
|
// with one worker per core. Matching on major alone cannot be right
|
||||||
|
// whenever a machine has two disks, which is the case this exists for.
|
||||||
|
func diskForPath(path string) (string, error) {
|
||||||
var st syscall.Stat_t
|
var st syscall.Stat_t
|
||||||
if err := syscall.Stat(path, &st); err != nil {
|
if err := syscall.Stat(path, &st); err != nil {
|
||||||
return "", fmt.Errorf(
|
return "", fmt.Errorf(
|
||||||
@@ -49,48 +124,50 @@ func deviceForPath(path string) (string, error) {
|
|||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Extract major and minor device numbers.
|
// Linux packs dev_t as 12 bits of major and 20 of minor, split
|
||||||
major := (st.Dev >> 8) & 0xff
|
// across the word. Masking the low byte of each — which is what
|
||||||
minor := st.Dev & 0xff
|
// this used to do — is right only for the first 256 of either.
|
||||||
|
major := unixMajor(uint64(st.Dev))
|
||||||
|
minor := unixMinor(uint64(st.Dev))
|
||||||
|
|
||||||
// Scan /sys/block/ for a matching device.
|
link := filepath.Join(
|
||||||
entries, err := os.ReadDir("/sys/block")
|
"/sys/dev/block",
|
||||||
|
strconv.FormatUint(major, 10)+":"+
|
||||||
|
strconv.FormatUint(minor, 10),
|
||||||
|
)
|
||||||
|
|
||||||
|
target, err := filepath.EvalSymlinks(link)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return "", fmt.Errorf(
|
return "", fmt.Errorf(
|
||||||
"could not read /sys/block: %w", err,
|
"%w: %s (%w)", errNoBlockDevice, link, err,
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
majorStr := strconv.FormatUint(major, 10)
|
// A partition's directory sits inside its disk's, and only the
|
||||||
devStr := majorStr + ":" +
|
// disk carries `queue`. Climb at most one level: sysfs nests a
|
||||||
strconv.FormatUint(minor, 10)
|
// partition exactly one deep under its disk.
|
||||||
|
name := filepath.Base(target)
|
||||||
|
|
||||||
for _, entry := range entries {
|
if _, err := os.Stat(filepath.Join(target, "queue")); err != nil {
|
||||||
devFile := filepath.Join(
|
name = filepath.Base(filepath.Dir(target))
|
||||||
"/sys/block", entry.Name(), "dev",
|
|
||||||
)
|
|
||||||
|
|
||||||
data, err := os.ReadFile(devFile)
|
|
||||||
if err != nil {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
content := strings.TrimSpace(string(data))
|
|
||||||
|
|
||||||
if content == devStr {
|
|
||||||
return entry.Name(), nil
|
|
||||||
}
|
|
||||||
|
|
||||||
// The filesystem might be on a partition (e.g. sda1)
|
|
||||||
// whose parent block device is sda. Check if the
|
|
||||||
// major number matches.
|
|
||||||
parts := strings.SplitN(content, ":", 2)
|
|
||||||
if len(parts) == 2 && parts[0] == majorStr {
|
|
||||||
return entry.Name(), nil
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
return "", fmt.Errorf(
|
if name == "" || name == "." || name == string(filepath.Separator) {
|
||||||
"%w for %s", errNoBlockDevice, devStr,
|
return "", fmt.Errorf(
|
||||||
)
|
"%w for %d:%d", errNoBlockDevice, major, minor,
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
return name, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// unixMajor and unixMinor decode a Linux dev_t. Spelled out rather
|
||||||
|
// than taken from golang.org/x/sys/unix so this file stays readable
|
||||||
|
// beside the encoding it is undoing.
|
||||||
|
func unixMajor(dev uint64) uint64 {
|
||||||
|
return (dev>>8)&0xfff | (dev >> 32 & ^uint64(0xfff))
|
||||||
|
}
|
||||||
|
|
||||||
|
func unixMinor(dev uint64) uint64 {
|
||||||
|
return dev&0xff | (dev >> 12 & ^uint64(0xff))
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -2,9 +2,34 @@
|
|||||||
|
|
||||||
package system
|
package system
|
||||||
|
|
||||||
|
// DiskProfile is what the scanner needs to know about the device a
|
||||||
|
// library sits on. See the Linux implementation for what each field
|
||||||
|
// means; off Linux nothing fills them, because neither macOS nor
|
||||||
|
// Windows publishes an equivalent of sysfs's `rotational` and
|
||||||
|
// `queue_depth` without going through platform APIs this package
|
||||||
|
// deliberately does not link.
|
||||||
|
type DiskProfile struct {
|
||||||
|
Device string
|
||||||
|
Rotational bool
|
||||||
|
QueueDepth int
|
||||||
|
}
|
||||||
|
|
||||||
|
// Queues reports whether the drive can reorder outstanding commands.
|
||||||
|
// Always true here: an unknown depth is the permissive answer, and
|
||||||
|
// assuming otherwise would halve every scan on every Mac.
|
||||||
|
func (p DiskProfile) Queues() bool {
|
||||||
|
return p.QueueDepth != 1
|
||||||
|
}
|
||||||
|
|
||||||
// IsRotationalDisk reports whether the block device backing the
|
// IsRotationalDisk reports whether the block device backing the
|
||||||
// given path is a rotational (spinning) disk. On non-Linux
|
// given path is a rotational (spinning) disk. On non-Linux
|
||||||
// platforms this always returns false (assumes SSD).
|
// platforms this always returns false (assumes SSD).
|
||||||
func IsRotationalDisk(_ string) bool {
|
func IsRotationalDisk(_ string) bool {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// ProfileForPath describes the device backing a filesystem path. Off
|
||||||
|
// Linux that is the zero profile, which reads as "an SSD that queues".
|
||||||
|
func ProfileForPath(_ string) DiskProfile {
|
||||||
|
return DiskProfile{}
|
||||||
|
}
|
||||||
|
|||||||
@@ -0,0 +1,56 @@
|
|||||||
|
// Package tagtotals derives the totals a tag's "5/12" form declares.
|
||||||
|
//
|
||||||
|
// It exists because the two writers that know a release's full
|
||||||
|
// tracklist -- the autotag apply pass and the download importer --
|
||||||
|
// must not import each other or the tag writer, and because getting
|
||||||
|
// the denominator wrong is invisible: a total that is too large marks
|
||||||
|
// a complete album incomplete forever, and nothing fails.
|
||||||
|
package tagtotals
|
||||||
|
|
||||||
|
// Position is one track's place in a release. A zero Disc means the
|
||||||
|
// release did not say, which is disc 1.
|
||||||
|
type Position struct {
|
||||||
|
Disc int
|
||||||
|
Track int
|
||||||
|
}
|
||||||
|
|
||||||
|
// For returns the totals to write on a file sitting on disc `disc`:
|
||||||
|
// how many tracks that disc has, and how many discs the release has.
|
||||||
|
//
|
||||||
|
// The track total is **per disc** and not the release's track count,
|
||||||
|
// because that is what the tag form means and what
|
||||||
|
// GetAlbumCompleteness sums -- summing a release total once per disc
|
||||||
|
// would multiply a two-disc album's expectation by two.
|
||||||
|
//
|
||||||
|
// Tracks are counted by distinct position rather than by row: a
|
||||||
|
// tracklist that lists a position twice is a defect in the source, and
|
||||||
|
// counting it twice would put an album permanently out of reach of its
|
||||||
|
// own total.
|
||||||
|
func For(all []Position, disc int) (tracks, discs int) {
|
||||||
|
disc = normaliseDisc(disc)
|
||||||
|
|
||||||
|
seenTracks := make(map[int]struct{}, len(all))
|
||||||
|
seenDiscs := make(map[int]struct{}, 1)
|
||||||
|
|
||||||
|
for _, p := range all {
|
||||||
|
d := normaliseDisc(p.Disc)
|
||||||
|
seenDiscs[d] = struct{}{}
|
||||||
|
|
||||||
|
if d != disc || p.Track <= 0 {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
|
||||||
|
seenTracks[p.Track] = struct{}{}
|
||||||
|
}
|
||||||
|
|
||||||
|
return len(seenTracks), len(seenDiscs)
|
||||||
|
}
|
||||||
|
|
||||||
|
// normaliseDisc treats an undeclared disc as disc 1.
|
||||||
|
func normaliseDisc(d int) int {
|
||||||
|
if d <= 0 {
|
||||||
|
return 1
|
||||||
|
}
|
||||||
|
|
||||||
|
return d
|
||||||
|
}
|
||||||
@@ -0,0 +1,92 @@
|
|||||||
|
package tagtotals_test
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"yellowjacket/backend/tagtotals"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestFor(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
singleDisc := []tagtotals.Position{
|
||||||
|
{Disc: 0, Track: 1}, {Disc: 0, Track: 2}, {Disc: 0, Track: 3},
|
||||||
|
}
|
||||||
|
|
||||||
|
twoDiscs := []tagtotals.Position{
|
||||||
|
{Disc: 1, Track: 1},
|
||||||
|
{Disc: 1, Track: 2},
|
||||||
|
{Disc: 2, Track: 1},
|
||||||
|
{Disc: 2, Track: 2},
|
||||||
|
{Disc: 2, Track: 3},
|
||||||
|
}
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
all []tagtotals.Position
|
||||||
|
disc int
|
||||||
|
wantTracks int
|
||||||
|
wantDiscs int
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
name: "a single-disc release totals its own tracks",
|
||||||
|
all: singleDisc, disc: 0, wantTracks: 3, wantDiscs: 1,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// An undeclared disc is disc 1, on both sides of the
|
||||||
|
// question -- a file tagged "disc 1" and a tracklist that
|
||||||
|
// declares no disc describe the same disc.
|
||||||
|
name: "an undeclared disc is disc 1",
|
||||||
|
all: singleDisc, disc: 1, wantTracks: 3, wantDiscs: 1,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// The whole point: 5 here would be the release's track
|
||||||
|
// count, which summed once per disc claims a ten-track
|
||||||
|
// expectation for a five-track album.
|
||||||
|
name: "a multi-disc release totals the file's own disc",
|
||||||
|
all: twoDiscs, disc: 2, wantTracks: 3, wantDiscs: 2,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "the other disc gets its own total",
|
||||||
|
all: twoDiscs, disc: 1, wantTracks: 2, wantDiscs: 2,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// A disc the tracklist does not mention cannot be totalled,
|
||||||
|
// and 0 is how the caller is told to write nothing.
|
||||||
|
name: "a disc with no tracks totals nothing",
|
||||||
|
all: twoDiscs, disc: 3, wantTracks: 0, wantDiscs: 2,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "an empty tracklist totals nothing",
|
||||||
|
all: nil, disc: 1, wantTracks: 0, wantDiscs: 0,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
// A source that lists a position twice would otherwise put
|
||||||
|
// the album permanently one track short of its own total.
|
||||||
|
name: "a repeated position counts once",
|
||||||
|
all: []tagtotals.Position{
|
||||||
|
{Disc: 1, Track: 1}, {Disc: 1, Track: 1}, {Disc: 1, Track: 2},
|
||||||
|
},
|
||||||
|
disc: 1, wantTracks: 2, wantDiscs: 1,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "a track with no position is not counted",
|
||||||
|
all: []tagtotals.Position{
|
||||||
|
{Disc: 1, Track: 0}, {Disc: 1, Track: 1},
|
||||||
|
},
|
||||||
|
disc: 1, wantTracks: 1, wantDiscs: 1,
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tc := range tests {
|
||||||
|
t.Run(tc.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
tracks, discs := tagtotals.For(tc.all, tc.disc)
|
||||||
|
if tracks != tc.wantTracks || discs != tc.wantDiscs {
|
||||||
|
t.Errorf("For(%v, %d) = (%d, %d), want (%d, %d)",
|
||||||
|
tc.all, tc.disc, tracks, discs, tc.wantTracks, tc.wantDiscs)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -183,6 +183,15 @@ func syncDatabase(
|
|||||||
discNum = toNullInt64(v)
|
discNum = toNullInt64(v)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// The completeness evidence. Without this the row keeps whatever
|
||||||
|
// the last scan read while the file on disk now declares a total,
|
||||||
|
// so the album stays "unknown" until a full rescan -- which is the
|
||||||
|
// state the report describes.
|
||||||
|
totalTracks := old.TotalTracks
|
||||||
|
if v, ok := asInt(params.changes[FieldTotalTracks]); ok {
|
||||||
|
totalTracks = toNullInt64(v)
|
||||||
|
}
|
||||||
|
|
||||||
composer := old.Composer
|
composer := old.Composer
|
||||||
if v, ok := params.changes[FieldComposer].(string); ok {
|
if v, ok := params.changes[FieldComposer].(string); ok {
|
||||||
composer = v
|
composer = v
|
||||||
@@ -207,7 +216,7 @@ func syncDatabase(
|
|||||||
AlbumID: albumID,
|
AlbumID: albumID,
|
||||||
TrackNumber: trackNum,
|
TrackNumber: trackNum,
|
||||||
DiscNumber: discNum,
|
DiscNumber: discNum,
|
||||||
TotalTracks: old.TotalTracks,
|
TotalTracks: totalTracks,
|
||||||
Year: year,
|
Year: year,
|
||||||
Composer: composer,
|
Composer: composer,
|
||||||
Comment: old.Comment,
|
Comment: old.Comment,
|
||||||
|
|||||||
@@ -101,6 +101,11 @@ func applyFlacTextChanges(cmt *flacvorbis.MetaDataBlockVorbisComment, changes Ta
|
|||||||
{FieldYear, flacvorbis.FIELD_DATE, true},
|
{FieldYear, flacvorbis.FIELD_DATE, true},
|
||||||
{FieldTrackNumber, flacvorbis.FIELD_TRACKNUMBER, true},
|
{FieldTrackNumber, flacvorbis.FIELD_TRACKNUMBER, true},
|
||||||
{FieldDiscNumber, "DISCNUMBER", true},
|
{FieldDiscNumber, "DISCNUMBER", true},
|
||||||
|
// TRACKTOTAL/DISCTOTAL and no other spelling: dhowden/tag's
|
||||||
|
// Vorbis reader looks at exactly these two keys, so TOTALTRACKS
|
||||||
|
// or a "1/12" inside TRACKNUMBER reads back as no total at all.
|
||||||
|
{FieldTotalTracks, "TRACKTOTAL", true},
|
||||||
|
{FieldTotalDiscs, "DISCTOTAL", true},
|
||||||
{FieldComposer, "COMPOSER", false},
|
{FieldComposer, "COMPOSER", false},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
+63
-11
@@ -6,6 +6,7 @@ import (
|
|||||||
"log/slog"
|
"log/slog"
|
||||||
"os"
|
"os"
|
||||||
"strconv"
|
"strconv"
|
||||||
|
"strings"
|
||||||
|
|
||||||
id3v2 "github.com/bogem/id3v2/v2"
|
id3v2 "github.com/bogem/id3v2/v2"
|
||||||
|
|
||||||
@@ -66,17 +67,10 @@ func applyTextChanges(tag *id3v2.Tag, changes TagChanges) {
|
|||||||
tag.SetYear(strconv.Itoa(v))
|
tag.SetYear(strconv.Itoa(v))
|
||||||
}
|
}
|
||||||
|
|
||||||
if v, ok := asInt(changes[FieldTrackNumber]); ok {
|
applyPositionFrame(tag, "Track number/Position in set", changes,
|
||||||
trckID := tag.CommonID("Track number/Position in set")
|
FieldTrackNumber, FieldTotalTracks)
|
||||||
tag.DeleteFrames(trckID)
|
applyPositionFrame(tag, "Part of a set", changes,
|
||||||
tag.AddTextFrame(trckID, id3v2.EncodingUTF8, strconv.Itoa(v))
|
FieldDiscNumber, FieldTotalDiscs)
|
||||||
}
|
|
||||||
|
|
||||||
if v, ok := asInt(changes[FieldDiscNumber]); ok {
|
|
||||||
tposID := tag.CommonID("Part of a set")
|
|
||||||
tag.DeleteFrames(tposID)
|
|
||||||
tag.AddTextFrame(tposID, id3v2.EncodingUTF8, strconv.Itoa(v))
|
|
||||||
}
|
|
||||||
|
|
||||||
if v, ok := changes[FieldComposer].(string); ok {
|
if v, ok := changes[FieldComposer].(string); ok {
|
||||||
tag.DeleteFrames("TCOM")
|
tag.DeleteFrames("TCOM")
|
||||||
@@ -90,6 +84,64 @@ func applyTextChanges(tag *id3v2.Tag, changes TagChanges) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// applyPositionFrame writes an ID3v2 position frame (TRCK or TPOS) in
|
||||||
|
// the "n/N" form the readers parse.
|
||||||
|
//
|
||||||
|
// The number and the total are separate diff entries and either may be
|
||||||
|
// absent, so the frame's *existing* value is the base: writing a total
|
||||||
|
// alone must not discard the number that is already there, and writing
|
||||||
|
// a number alone must not discard a total the file already declared.
|
||||||
|
// A total with no number at all is not written, since "/12" says
|
||||||
|
// nothing a reader can use.
|
||||||
|
func applyPositionFrame(
|
||||||
|
tag *id3v2.Tag, description string, changes TagChanges, numKey, totalKey string,
|
||||||
|
) {
|
||||||
|
_, hasNum := changes[numKey]
|
||||||
|
_, hasTotal := changes[totalKey]
|
||||||
|
|
||||||
|
if !hasNum && !hasTotal {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
frameID := tag.CommonID(description)
|
||||||
|
|
||||||
|
num, total := parseXofN(
|
||||||
|
strings.TrimRight(tag.GetTextFrame(frameID).Text, "\x00 \t\n\r"),
|
||||||
|
)
|
||||||
|
|
||||||
|
if v, ok := asInt(changes[numKey]); ok {
|
||||||
|
num = v
|
||||||
|
}
|
||||||
|
|
||||||
|
if v, ok := asInt(changes[totalKey]); ok {
|
||||||
|
total = v
|
||||||
|
}
|
||||||
|
|
||||||
|
if num <= 0 {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
value := strconv.Itoa(num)
|
||||||
|
if total > 0 {
|
||||||
|
value += "/" + strconv.Itoa(total)
|
||||||
|
}
|
||||||
|
|
||||||
|
tag.DeleteFrames(frameID)
|
||||||
|
tag.AddTextFrame(frameID, id3v2.EncodingUTF8, value)
|
||||||
|
}
|
||||||
|
|
||||||
|
// parseXofN splits an ID3v2 "n/N" position value. A bare "n" yields a
|
||||||
|
// zero total, and anything unparseable yields zeros — the same reading
|
||||||
|
// dhowden/tag gives the frame.
|
||||||
|
func parseXofN(s string) (int, int) {
|
||||||
|
numText, totalText, _ := strings.Cut(s, "/")
|
||||||
|
|
||||||
|
num, _ := strconv.Atoi(strings.TrimSpace(numText))
|
||||||
|
total, _ := strconv.Atoi(strings.TrimSpace(totalText))
|
||||||
|
|
||||||
|
return num, total
|
||||||
|
}
|
||||||
|
|
||||||
// applyCoverArtChanges handles the FieldCoverArt entry in the diff map.
|
// applyCoverArtChanges handles the FieldCoverArt entry in the diff map.
|
||||||
//
|
//
|
||||||
// - []byte with len > 0: embed the given image as front cover.
|
// - []byte with len > 0: embed the given image as front cover.
|
||||||
|
|||||||
@@ -166,6 +166,8 @@ var oggFieldMappings = []struct { //nolint:gochecknoglobals // field mapping tab
|
|||||||
{FieldYear, "DATE", true},
|
{FieldYear, "DATE", true},
|
||||||
{FieldTrackNumber, "TRACKNUMBER", true},
|
{FieldTrackNumber, "TRACKNUMBER", true},
|
||||||
{FieldDiscNumber, "DISCNUMBER", true},
|
{FieldDiscNumber, "DISCNUMBER", true},
|
||||||
|
{FieldTotalTracks, "TRACKTOTAL", true},
|
||||||
|
{FieldTotalDiscs, "DISCTOTAL", true},
|
||||||
{FieldComposer, "COMPOSER", false},
|
{FieldComposer, "COMPOSER", false},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -333,3 +333,31 @@ func TestWriteTrackTags_DBSync(t *testing.T) {
|
|||||||
t.Error("expected FTS5 result for 'New Title'")
|
t.Error("expected FTS5 result for 'New Title'")
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// The row is what the album page reads, and it is only refreshed by a
|
||||||
|
// scan. Leaving total_tracks at whatever the last scan saw means an
|
||||||
|
// album autotagged just now stays "unknown" -- a plain tick on an album
|
||||||
|
// the user holds two tracks of -- until a full rescan happens to run.
|
||||||
|
func TestWriteTrackTags_PersistsTheTotal(t *testing.T) {
|
||||||
|
db := database.NewTestDB(t)
|
||||||
|
dir := t.TempDir()
|
||||||
|
trackID := seedTestTrack(t, db, createPipelineTestMP3(t, dir))
|
||||||
|
|
||||||
|
tw := NewTagWriter(testLogger(), db, &mockPlayer{}, &mockPipelineLocker{})
|
||||||
|
|
||||||
|
if err := tw.WriteTrackTags(trackID, TagChanges{
|
||||||
|
FieldTrackNumber: 2,
|
||||||
|
FieldTotalTracks: 10,
|
||||||
|
}); err != nil {
|
||||||
|
t.Fatalf("WriteTrackTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
af, err := db.Queries.GetAudioFile(context.Background(), trackID)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("get audio file: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if !af.TotalTracks.Valid || af.TotalTracks.Int64 != 10 {
|
||||||
|
t.Errorf("total_tracks: got %v, want 10", af.TotalTracks)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -26,6 +26,15 @@ const (
|
|||||||
FieldDiscNumber = "disc_number"
|
FieldDiscNumber = "disc_number"
|
||||||
FieldComposer = "composer"
|
FieldComposer = "composer"
|
||||||
FieldCoverArt = "cover_art" // []byte for set, nil for clear
|
FieldCoverArt = "cover_art" // []byte for set, nil for clear
|
||||||
|
|
||||||
|
// FieldTotalTracks is how many tracks are on *this file's disc*, not
|
||||||
|
// in the whole release. That is what the "5/12" form declares and
|
||||||
|
// what GetAlbumCompleteness sums per disc; a release total written
|
||||||
|
// here would multiply the expectation by the number of discs.
|
||||||
|
FieldTotalTracks = "total_tracks"
|
||||||
|
|
||||||
|
// FieldTotalDiscs is how many discs the release has.
|
||||||
|
FieldTotalDiscs = "total_discs"
|
||||||
)
|
)
|
||||||
|
|
||||||
// AudioFormat represents a supported audio file format.
|
// AudioFormat represents a supported audio file format.
|
||||||
|
|||||||
@@ -0,0 +1,199 @@
|
|||||||
|
package tagwriter
|
||||||
|
|
||||||
|
import (
|
||||||
|
"path/filepath"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"yellowjacket/backend/metadata"
|
||||||
|
)
|
||||||
|
|
||||||
|
// The totals are the evidence GetAlbumCompleteness reads, and every way
|
||||||
|
// of getting them wrong is silent: a tag written under a name the
|
||||||
|
// reader does not look at reads back as no total at all, which is
|
||||||
|
// indistinguishable from never having written one. So these assert the
|
||||||
|
// round trip through the *reader the scan uses*, not the bytes.
|
||||||
|
//
|
||||||
|
// WAV is the exception and it is not this change's: dhowden/tag has no
|
||||||
|
// RIFF reader at all, so metadata.ExtractTags cannot see a WAV's ID3
|
||||||
|
// chunk -- which is why every other test here reads that chunk itself.
|
||||||
|
func TestWriteTotals_RoundTripsInEveryFormat(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
changes := TagChanges{
|
||||||
|
FieldTitle: "Some Song",
|
||||||
|
FieldTrackNumber: 2,
|
||||||
|
FieldTotalTracks: 10,
|
||||||
|
FieldDiscNumber: 1,
|
||||||
|
FieldTotalDiscs: 2,
|
||||||
|
}
|
||||||
|
|
||||||
|
viaScanner := func(t *testing.T, path string) *metadata.TrackMetadata {
|
||||||
|
t.Helper()
|
||||||
|
|
||||||
|
meta, err := metadata.ExtractTags(path)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("ExtractTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return meta
|
||||||
|
}
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
write func(t *testing.T, dir string) string
|
||||||
|
read func(t *testing.T, path string) *metadata.TrackMetadata
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
name: "mp3",
|
||||||
|
read: viaScanner,
|
||||||
|
write: func(t *testing.T, dir string) string {
|
||||||
|
t.Helper()
|
||||||
|
|
||||||
|
path := createTestMP3(t, dir, "totals.mp3", nil)
|
||||||
|
if err := writeMp3Tags(testLogger(), path, changes); err != nil {
|
||||||
|
t.Fatalf("writeMp3Tags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return path
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "flac",
|
||||||
|
read: viaScanner,
|
||||||
|
write: func(t *testing.T, dir string) string {
|
||||||
|
t.Helper()
|
||||||
|
|
||||||
|
path := filepath.Join(dir, "totals.flac")
|
||||||
|
makeMinimalFLAC(t, path)
|
||||||
|
|
||||||
|
if err := writeFlacTags(testLogger(), path, changes); err != nil {
|
||||||
|
t.Fatalf("writeFlacTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return path
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "ogg",
|
||||||
|
read: viaScanner,
|
||||||
|
write: func(t *testing.T, dir string) string {
|
||||||
|
t.Helper()
|
||||||
|
|
||||||
|
path := filepath.Join(dir, "totals.ogg")
|
||||||
|
createTestOGG(t, path)
|
||||||
|
|
||||||
|
if err := writeOggTags(testLogger(), path, changes); err != nil {
|
||||||
|
t.Fatalf("writeOggTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return path
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "wav",
|
||||||
|
read: readWavID3Tags,
|
||||||
|
write: func(t *testing.T, dir string) string {
|
||||||
|
t.Helper()
|
||||||
|
|
||||||
|
path := createTestWAV(t, dir, "totals.wav", nil)
|
||||||
|
|
||||||
|
if err := writeWavTags(testLogger(), path, changes); err != nil {
|
||||||
|
t.Fatalf("writeWavTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return path
|
||||||
|
},
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tc := range tests {
|
||||||
|
t.Run(tc.name, func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
meta := tc.read(t, tc.write(t, t.TempDir()))
|
||||||
|
|
||||||
|
assertIntField(t, "TrackNumber", meta.TrackNumber, 2)
|
||||||
|
assertIntField(t, "TotalTracks", meta.TotalTracks, 10)
|
||||||
|
assertIntField(t, "DiscNumber", meta.DiscNumber, 1)
|
||||||
|
assertIntField(t, "TotalDiscs", meta.TotalDiscs, 2)
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// A number and a total are separate diff entries, so writing one must
|
||||||
|
// not discard the other. For ID3v2 they share a single "n/N" frame,
|
||||||
|
// which is the only place this can go wrong -- and it goes wrong by
|
||||||
|
// silently zeroing a total the file already declared.
|
||||||
|
func TestWriteMp3Totals_PartialUpdateKeepsTheOtherHalf(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
t.Run("writing the number keeps the total", func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dir := t.TempDir()
|
||||||
|
path := createTestMP3(t, dir, "seeded.mp3", TagChanges{
|
||||||
|
FieldTrackNumber: 2,
|
||||||
|
FieldTotalTracks: 10,
|
||||||
|
})
|
||||||
|
|
||||||
|
if err := writeMp3Tags(testLogger(), path, TagChanges{
|
||||||
|
FieldTrackNumber: 4,
|
||||||
|
}); err != nil {
|
||||||
|
t.Fatalf("writeMp3Tags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
meta, err := metadata.ExtractTags(path)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("ExtractTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
assertIntField(t, "TrackNumber", meta.TrackNumber, 4)
|
||||||
|
assertIntField(t, "TotalTracks", meta.TotalTracks, 10)
|
||||||
|
})
|
||||||
|
|
||||||
|
t.Run("writing the total keeps the number", func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dir := t.TempDir()
|
||||||
|
path := createTestMP3(t, dir, "seeded.mp3", TagChanges{
|
||||||
|
FieldTrackNumber: 7,
|
||||||
|
})
|
||||||
|
|
||||||
|
if err := writeMp3Tags(testLogger(), path, TagChanges{
|
||||||
|
FieldTotalTracks: 12,
|
||||||
|
}); err != nil {
|
||||||
|
t.Fatalf("writeMp3Tags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
meta, err := metadata.ExtractTags(path)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("ExtractTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
assertIntField(t, "TrackNumber", meta.TrackNumber, 7)
|
||||||
|
assertIntField(t, "TotalTracks", meta.TotalTracks, 12)
|
||||||
|
})
|
||||||
|
|
||||||
|
// "/12" says nothing a reader can use, and dhowden/tag reads it as
|
||||||
|
// track 0 -- which the scan would store as a real track number.
|
||||||
|
t.Run("a total with no number writes nothing", func(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
dir := t.TempDir()
|
||||||
|
path := createTestMP3(t, dir, "bare.mp3", nil)
|
||||||
|
|
||||||
|
if err := writeMp3Tags(testLogger(), path, TagChanges{
|
||||||
|
FieldTotalTracks: 12,
|
||||||
|
}); err != nil {
|
||||||
|
t.Fatalf("writeMp3Tags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
meta, err := metadata.ExtractTags(path)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("ExtractTags: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
assertIntField(t, "TrackNumber", meta.TrackNumber, 0)
|
||||||
|
assertIntField(t, "TotalTracks", meta.TotalTracks, 0)
|
||||||
|
})
|
||||||
|
}
|
||||||
@@ -522,19 +522,20 @@ func readWavID3Tags(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// Track number (TRCK).
|
// Track number and total (TRCK), disc number and total (TPOS).
|
||||||
|
// Both carry the "n/N" form, so they are read the way a reader
|
||||||
|
// reads them rather than with Atoi -- which sees "2/10" as 0.
|
||||||
trckID := parsed.CommonID("Track number/Position in set")
|
trckID := parsed.CommonID("Track number/Position in set")
|
||||||
if frames := parsed.GetFrames(trckID); len(frames) > 0 {
|
if frames := parsed.GetFrames(trckID); len(frames) > 0 {
|
||||||
if tf, ok := frames[0].(id3v2.TextFrame); ok {
|
if tf, ok := frames[0].(id3v2.TextFrame); ok {
|
||||||
meta.TrackNumber = atoiSafe(tf.Text)
|
meta.TrackNumber, meta.TotalTracks = parseXofN(tf.Text)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// Disc number (TPOS).
|
|
||||||
tposID := parsed.CommonID("Part of a set")
|
tposID := parsed.CommonID("Part of a set")
|
||||||
if frames := parsed.GetFrames(tposID); len(frames) > 0 {
|
if frames := parsed.GetFrames(tposID); len(frames) > 0 {
|
||||||
if tf, ok := frames[0].(id3v2.TextFrame); ok {
|
if tf, ok := frames[0].(id3v2.TextFrame); ok {
|
||||||
meta.DiscNumber = atoiSafe(tf.Text)
|
meta.DiscNumber, meta.TotalDiscs = parseXofN(tf.Text)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
+16
-6
@@ -7,12 +7,22 @@ which is what lets Obtainium poll a plain URL with no token. It also
|
|||||||
attaches the same file to the Gitea release, which is what a person
|
attaches the same file to the Gitea release, which is what a person
|
||||||
looking at the release page downloads.
|
looking at the release page downloads.
|
||||||
|
|
||||||
**Tags are not pushed by hand any more.** `.gitea/workflows/release.yml`
|
**Tags are not pushed by hand any more, but releasing is a decision.**
|
||||||
reads the Conventional Commits on every merge to `main`, decides the
|
`.gitea/workflows/release.yml` reads the Conventional Commits since the
|
||||||
version, and pushes the tag this workflow is keyed on — so releasing the
|
last tag, decides the version, and pushes the tag this workflow is keyed
|
||||||
APK means merging a `fix:` or `feat:` commit, not running `git tag`. The
|
on — so releasing the APK means **running that workflow**, not running
|
||||||
`workflow_dispatch` path below remains, for rebuilding a tag that already
|
`git tag`. It has no push trigger: merging a `fix:` or `feat:` used to
|
||||||
exists.
|
be enough and produced a version per merged PR (issue #115). Run it with
|
||||||
|
`dry_run` first to see what the accumulated commits would ship. The
|
||||||
|
`workflow_dispatch` path below is a different thing and remains, for
|
||||||
|
rebuilding a tag that already exists.
|
||||||
|
|
||||||
|
**A prerelease tag is skipped here**, cleanly. This workflow triggers on
|
||||||
|
`v*`, which matches `v0.4.0-beta.1`, and it is the one where that would
|
||||||
|
hurt most: the APK goes to the credential-free generic registry that
|
||||||
|
Obtainium polls, and the `versionCode` maths below splits on dots — it
|
||||||
|
would read `1` out of `0-beta` and produce a wrong number rather than a
|
||||||
|
failed build.
|
||||||
|
|
||||||
## The 1.x installs cannot be upgraded to 0.0.x
|
## The 1.x installs cannot be upgraded to 0.0.x
|
||||||
|
|
||||||
|
|||||||
@@ -1,194 +0,0 @@
|
|||||||
# Config Improvement Suggestions
|
|
||||||
|
|
||||||
Remaining suggestions for improving the configuration system in YellowJacket.
|
|
||||||
|
|
||||||
## 2. Thread Safety Concerns
|
|
||||||
|
|
||||||
The current `Config` struct lacks synchronization:
|
|
||||||
- `Load()` and `Save()` can race with concurrent reads
|
|
||||||
- `handleConfigUpdate()` in library mutates `l.conf.DirectoryPath` without locks
|
|
||||||
|
|
||||||
**Suggestion:** Add a `sync.RWMutex` to protect config access, especially if config is read during scans.
|
|
||||||
|
|
||||||
```go
|
|
||||||
type Config struct {
|
|
||||||
mu sync.RWMutex
|
|
||||||
ctx context.Context
|
|
||||||
logger *slog.Logger
|
|
||||||
// ...
|
|
||||||
}
|
|
||||||
|
|
||||||
func (c *Config) Load() error {
|
|
||||||
c.mu.Lock()
|
|
||||||
defer c.mu.Unlock()
|
|
||||||
// ...
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
## 3. Nil Safety in Validation
|
|
||||||
|
|
||||||
In `config.go`, validation only runs if `c.Library != nil`, but `handleConfigPost` dereferences `postedConfig.Library` without checking for nil:
|
|
||||||
|
|
||||||
```go
|
|
||||||
if postedConfig.Library != nil {
|
|
||||||
c.Library = postedConfig.Library
|
|
||||||
// ...
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
**Status:** Partially addressed in the event refactor, but consider adding explicit nil checks in `Validate()` as well.
|
|
||||||
|
|
||||||
## 4. Inconsistent Error Handling on HTTP Responses
|
|
||||||
|
|
||||||
In `httphandler.go:28-31`, `WriteHeader` is called *after* rendering the error template, which won't work as expected (headers must be set before writing body):
|
|
||||||
|
|
||||||
```go
|
|
||||||
c.formSubmitError(err.Error()).Render(r.Context(), w)
|
|
||||||
w.WriteHeader(http.StatusInternalServerError) // Too late!
|
|
||||||
```
|
|
||||||
|
|
||||||
**Fix:** Set the status code before rendering:
|
|
||||||
|
|
||||||
```go
|
|
||||||
w.WriteHeader(http.StatusInternalServerError)
|
|
||||||
c.formSubmitError(err.Error()).Render(r.Context(), w)
|
|
||||||
```
|
|
||||||
|
|
||||||
## 5. Make `scanWorkerCount` Configurable
|
|
||||||
|
|
||||||
There's a TODO at `library.go:289`:
|
|
||||||
```go
|
|
||||||
// TODO: make configurable via Config.
|
|
||||||
var scanWorkerCount = goruntime.NumCPU()
|
|
||||||
```
|
|
||||||
|
|
||||||
**Suggestion:** Add this to `library.Config`:
|
|
||||||
|
|
||||||
```go
|
|
||||||
type Config struct {
|
|
||||||
DirectoryPath Directory `form:"Directory" schema:"directory,required"`
|
|
||||||
ScanWorkers int `form:"ScanWorkers" schema:"scan_workers"`
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
Then in `NewLibrary()` or `Scan()`:
|
|
||||||
|
|
||||||
```go
|
|
||||||
workers := l.conf.ScanWorkers
|
|
||||||
if workers <= 0 {
|
|
||||||
workers = goruntime.NumCPU()
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
## 6. Consider Config Defaults
|
|
||||||
|
|
||||||
Currently if no config exists, an empty one is saved. Consider providing sensible defaults (e.g., common music directories like `~/Music`).
|
|
||||||
|
|
||||||
```go
|
|
||||||
func (c *Config) setDefaults() {
|
|
||||||
if c.Library == nil {
|
|
||||||
c.Library = &library.Config{}
|
|
||||||
}
|
|
||||||
if c.Library.DirectoryPath == "" {
|
|
||||||
// Try common music directories
|
|
||||||
home, _ := os.UserHomeDir()
|
|
||||||
musicDir := filepath.Join(home, "Music")
|
|
||||||
if info, err := os.Stat(musicDir); err == nil && info.IsDir() {
|
|
||||||
c.Library.DirectoryPath = library.Directory(musicDir)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
## 7. Config Reload/Watch Capability
|
|
||||||
|
|
||||||
The config is only loaded at startup. Consider adding:
|
|
||||||
- File watcher for external config changes (using `fsnotify`)
|
|
||||||
- Explicit reload method callable from UI
|
|
||||||
|
|
||||||
```go
|
|
||||||
func (c *Config) Watch() error {
|
|
||||||
watcher, err := fsnotify.NewWatcher()
|
|
||||||
if err != nil {
|
|
||||||
return err
|
|
||||||
}
|
|
||||||
|
|
||||||
go func() {
|
|
||||||
for event := range watcher.Events {
|
|
||||||
if event.Op&fsnotify.Write == fsnotify.Write {
|
|
||||||
c.Load()
|
|
||||||
// Emit event for listeners
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}()
|
|
||||||
|
|
||||||
return watcher.Add(c.filePath)
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
## 8. Validation Should Return Structured Errors
|
|
||||||
|
|
||||||
Currently validation returns combined errors. Consider returning a structured validation result that the UI can map to specific fields for better user feedback.
|
|
||||||
|
|
||||||
```go
|
|
||||||
type ValidationError struct {
|
|
||||||
Field string
|
|
||||||
Message string
|
|
||||||
}
|
|
||||||
|
|
||||||
type ValidationResult struct {
|
|
||||||
Valid bool
|
|
||||||
Errors []ValidationError
|
|
||||||
}
|
|
||||||
|
|
||||||
func (c *Config) ValidateStructured() ValidationResult {
|
|
||||||
var result ValidationResult
|
|
||||||
result.Valid = true
|
|
||||||
|
|
||||||
if c.Library != nil {
|
|
||||||
if err := c.Library.Validate(); err != nil {
|
|
||||||
result.Valid = false
|
|
||||||
result.Errors = append(result.Errors, ValidationError{
|
|
||||||
Field: "Library.DirectoryPath",
|
|
||||||
Message: err.Error(),
|
|
||||||
})
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return result
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
## 9. Use Standard Library for Config Paths
|
|
||||||
|
|
||||||
The path construction in `system/userdata.go` doesn't respect `$XDG_CONFIG_HOME` on Linux or use the standard Go `os.UserConfigDir()`.
|
|
||||||
|
|
||||||
**Current implementation:**
|
|
||||||
```go
|
|
||||||
case "linux":
|
|
||||||
return fmt.Sprintf("/home/%s/%s/yellowjacket", username, unixSubdirs[dt]), nil
|
|
||||||
```
|
|
||||||
|
|
||||||
**Suggested improvement:**
|
|
||||||
```go
|
|
||||||
func GetUserConfigDirPath() (string, error) {
|
|
||||||
baseDir, err := os.UserConfigDir() // Respects XDG_CONFIG_HOME
|
|
||||||
if err != nil {
|
|
||||||
return "", fmt.Errorf("could not get user config directory: %w", err)
|
|
||||||
}
|
|
||||||
|
|
||||||
path := filepath.Join(baseDir, "yellowjacket")
|
|
||||||
|
|
||||||
if err := os.MkdirAll(path, 0o755); err != nil {
|
|
||||||
return "", fmt.Errorf("could not create config directory: %w", err)
|
|
||||||
}
|
|
||||||
|
|
||||||
return path, nil
|
|
||||||
}
|
|
||||||
```
|
|
||||||
|
|
||||||
This approach:
|
|
||||||
- Respects `$XDG_CONFIG_HOME` on Linux
|
|
||||||
- Uses proper macOS paths (`~/Library/Application Support`)
|
|
||||||
- Uses `%AppData%` on Windows
|
|
||||||
- Is more portable and follows platform conventions
|
|
||||||
@@ -1,53 +0,0 @@
|
|||||||
# Development Overview
|
|
||||||
|
|
||||||
YellowJacket is a moderately complex application. This document gives an overview of how development of it works.
|
|
||||||
|
|
||||||
## Logical Breakdown
|
|
||||||
|
|
||||||
YellowJacket can be thought about in a heirarchy of logical modules and components. The borders of these logical sections are mostly represented in the code and directory structure as well.
|
|
||||||
|
|
||||||
- Frontend
|
|
||||||
- UI Components (see [Lit](###lit-web-components))
|
|
||||||
- Backend
|
|
||||||
- App
|
|
||||||
- Asset Handler
|
|
||||||
- Logging
|
|
||||||
- System
|
|
||||||
- Player
|
|
||||||
- Library
|
|
||||||
- Config
|
|
||||||
- Database
|
|
||||||
- Queries (see [sqlc](###sqlc))
|
|
||||||
|
|
||||||
## Dependencies
|
|
||||||
|
|
||||||
YellowJacket uses many tools and libraries to provide its functionality.
|
|
||||||
This section lists each of these dependencies and explains how they are used.
|
|
||||||
|
|
||||||
### [Wails](https://wails.io)
|
|
||||||
|
|
||||||
Used to create desktop apps with Go and web technologies.
|
|
||||||
|
|
||||||
### [SQLite](https://github.com/mattn/go-sqlite3?tab=readme-ov-file#go-sqlite3)
|
|
||||||
|
|
||||||
Used for local database.
|
|
||||||
|
|
||||||
### [sqlc](https://sqlc.dev/)
|
|
||||||
|
|
||||||
Used to generate Go code from SQL.
|
|
||||||
|
|
||||||
### [Templ](https://templ.guide/)
|
|
||||||
|
|
||||||
Used to generate HTML templates with Go code.
|
|
||||||
|
|
||||||
### [Beep](https://github.com/gopxl/beep?tab=readme-ov-file#beep)
|
|
||||||
|
|
||||||
Used for audio playback.
|
|
||||||
|
|
||||||
### [Lit Web Components](https://lit.dev/)
|
|
||||||
|
|
||||||
Used for dynamic/reactive frontend components.
|
|
||||||
|
|
||||||
### [HTMX](https://htmx.org/)
|
|
||||||
|
|
||||||
Used for requesting HTML fragments from the backend and rendering them on the frontend.
|
|
||||||
-1648
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,66 @@
|
|||||||
|
import { test, expect } from '../support/fixtures.js';
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The queue button says whether the queue is open.
|
||||||
|
*
|
||||||
|
* It used to look identical in both states, so the only way to tell
|
||||||
|
* what pressing it would do was to look at the other side of the window
|
||||||
|
* and infer it — and for anyone not looking at all there was nothing to
|
||||||
|
* infer from: no `aria-expanded`, no `aria-controls`, no pressed state.
|
||||||
|
*
|
||||||
|
* The state is reflected *from the panel*, not kept beside the click,
|
||||||
|
* because the button is not the only thing that opens the queue —
|
||||||
|
* `now-playing-view` sets the same attribute, since it hides the bar
|
||||||
|
* this button lives in. A flag maintained by the click handler would be
|
||||||
|
* right until something else opened the panel and then quietly wrong,
|
||||||
|
* which is the second test here.
|
||||||
|
*/
|
||||||
|
test.describe('the queue toggle', () => {
|
||||||
|
test('reports open and closed, and names what it controls', async ({
|
||||||
|
app,
|
||||||
|
}) => {
|
||||||
|
const toggle = app.locator('#queue-button');
|
||||||
|
|
||||||
|
await expect(toggle).toHaveAttribute('aria-controls', 'queue-panel');
|
||||||
|
await expect(toggle).toHaveAttribute('aria-expanded', 'false');
|
||||||
|
|
||||||
|
await toggle.click();
|
||||||
|
await expect(toggle).toHaveAttribute('aria-expanded', 'true');
|
||||||
|
|
||||||
|
// The state is not only in the accessibility tree: a control that
|
||||||
|
// announces a state it does not draw is half a fix.
|
||||||
|
//
|
||||||
|
// Background rather than colour, because the pointer is still on
|
||||||
|
// the button after the click and `:hover` paints it the same accent
|
||||||
|
// the open state does -- so a colour comparison here passes on the
|
||||||
|
// broken build and proves nothing.
|
||||||
|
const [open, closed] = await toggle.evaluate((el) => {
|
||||||
|
const now = getComputedStyle(el).backgroundColor;
|
||||||
|
|
||||||
|
el.setAttribute('aria-expanded', 'false');
|
||||||
|
const shut = getComputedStyle(el).backgroundColor;
|
||||||
|
|
||||||
|
el.setAttribute('aria-expanded', 'true');
|
||||||
|
|
||||||
|
return [now, shut];
|
||||||
|
});
|
||||||
|
|
||||||
|
expect(open).not.toBe(closed);
|
||||||
|
|
||||||
|
await toggle.click();
|
||||||
|
await expect(toggle).toHaveAttribute('aria-expanded', 'false');
|
||||||
|
});
|
||||||
|
|
||||||
|
test('follows the panel when something else opens it', async ({ app }) => {
|
||||||
|
const toggle = app.locator('#queue-button');
|
||||||
|
|
||||||
|
await expect(toggle).toHaveAttribute('aria-expanded', 'false');
|
||||||
|
|
||||||
|
// Exactly what `now-playing-view`'s queue button does.
|
||||||
|
await app.evaluate(() =>
|
||||||
|
document.getElementById('queue-panel')?.setAttribute('open', ''),
|
||||||
|
);
|
||||||
|
|
||||||
|
await expect(toggle).toHaveAttribute('aria-expanded', 'true');
|
||||||
|
});
|
||||||
|
});
|
||||||
@@ -7,7 +7,7 @@ import { test, expect, callBinding } from '../support/fixtures.js';
|
|||||||
* and produced two: every one of the eight call sites was a two-way
|
* and produced two: every one of the eight call sites was a two-way
|
||||||
* ternary, so an album already on the request list showed a plus and
|
* ternary, so an album already on the request list showed a plus and
|
||||||
* said "is not in your library" — on the same page, forty pixels from a
|
* said "is not in your library" — on the same page, forty pixels from a
|
||||||
* filled button reading "Wanted".
|
* filled button reading "Requested".
|
||||||
*
|
*
|
||||||
* This spec exists at this tier rather than only in the component one
|
* This spec exists at this tier rather than only in the component one
|
||||||
* because of what it drags in with it: reaching the requested state is
|
* because of what it drags in with it: reaching the requested state is
|
||||||
@@ -181,7 +181,7 @@ test.describe('the requested badge', () => {
|
|||||||
const ds = document.querySelector('explore-album-details')
|
const ds = document.querySelector('explore-album-details')
|
||||||
?.shadowRoot;
|
?.shadowRoot;
|
||||||
const btn = [...(ds?.querySelectorAll('wa-button') ?? [])].find(
|
const btn = [...(ds?.querySelectorAll('wa-button') ?? [])].find(
|
||||||
(b) => /Wanted/.test(b.textContent ?? ''),
|
(b) => /Requested/.test(b.textContent ?? ''),
|
||||||
);
|
);
|
||||||
|
|
||||||
return btn?.querySelector('wa-icon')?.getAttribute('name') ?? '';
|
return btn?.querySelector('wa-icon')?.getAttribute('name') ?? '';
|
||||||
|
|||||||
@@ -3,28 +3,52 @@
|
|||||||
|
|
||||||
/**
|
/**
|
||||||
* AutoDownloadPrefs gates and scores what AutoPickable may choose
|
* AutoDownloadPrefs gates and scores what AutoPickable may choose
|
||||||
* without asking. Zero values are permissive: no size window and no
|
* without asking. Zero values are permissive: no bitrate window, no
|
||||||
* format restriction.
|
* size ceiling and no format restriction.
|
||||||
|
*
|
||||||
|
* **The window is a rate, not a size.** It used to be three numbers in
|
||||||
|
* megabytes, which cannot mean anything on their own: 300 MB is a
|
||||||
|
* generous FLAC single and a suspiciously small boxset, and the user
|
||||||
|
* setting the number has no idea which release the pipeline will
|
||||||
|
* eventually apply it to. A bitrate is the same statement normalised
|
||||||
|
* by how long the music is, so one number holds across a 9-minute EP
|
||||||
|
* and a 3-hour opera — and it is the unit the thing being described is
|
||||||
|
* actually measured in. The runtime is known for every request
|
||||||
|
* auto-pick can act on (`Download.Expected` carries per-track lengths,
|
||||||
|
* and an anchored request is the only kind that reaches here), so this
|
||||||
|
* costs no extra lookup.
|
||||||
*/
|
*/
|
||||||
export interface AutoDownloadPrefs {
|
export interface AutoDownloadPrefs {
|
||||||
/**
|
/**
|
||||||
* MinSizeMB and MaxSizeMB bound what auto-pick will grab. Zero
|
* MinKbps and MaxKbps bound the average bitrate auto-pick will
|
||||||
* means no bound on that side. A candidate outside the window is
|
* grab. Zero means no bound on that side. A candidate outside the
|
||||||
* filtered out of auto-pick entirely, not merely scored down — a
|
* window is filtered out of auto-pick entirely, not merely scored
|
||||||
* tiny "sampler" torrent or a boxset ten times the expected size is
|
* down — a 96 kbps rip of the right album is not a worse copy the
|
||||||
* usually the wrong thing entirely, not a worse copy of the right
|
* user might accept, it is one they said not to take unattended.
|
||||||
* thing.
|
*
|
||||||
|
* For reference: 320 is the top of MP3, ~500–1000 is FLAC depending
|
||||||
|
* on the material, and anything under ~128 is a transcode.
|
||||||
*/
|
*/
|
||||||
"minSizeMb": number;
|
"minKbps": number;
|
||||||
"maxSizeMb": number;
|
"maxKbps": number;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* PreferredSizeMB nudges the score toward a target size within the
|
* PreferredKbps nudges the score toward a target rate within the
|
||||||
* min/max window (a lossless rip and a heavily-padded lossless rip
|
* window, and breaks the tie when several candidates are equally
|
||||||
* can both pass the window). Zero disables the nudge; sizeFit then
|
* good matches. Zero disables the nudge; bitrateFit then returns a
|
||||||
* returns a neutral value that does not affect ranking.
|
* neutral value that does not affect ranking.
|
||||||
*/
|
*/
|
||||||
"preferredSizeMb": number;
|
"preferredKbps": number;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* MaxSizeMB is a hard ceiling on the whole candidate, and it is
|
||||||
|
* deliberately still a size. It answers a different question from
|
||||||
|
* the window above — not "is this the quality I want" but "is this
|
||||||
|
* going to fill the disk" — and it has to hold even for a candidate
|
||||||
|
* whose bitrate cannot be worked out, which is exactly the shape a
|
||||||
|
* mislabelled boxset arrives in. Zero means no ceiling.
|
||||||
|
*/
|
||||||
|
"maxSizeMb": number;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* AllowedFormats restricts auto-pick to candidates whose audio
|
* AllowedFormats restricts auto-pick to candidates whose audio
|
||||||
@@ -487,9 +511,13 @@ export interface QualityScore {
|
|||||||
"priority": number;
|
"priority": number;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* closeness to the preferred download size
|
* BitrateFit is closeness to the preferred *rate*, which is what
|
||||||
|
* the auto-download window is expressed in. It replaced a
|
||||||
|
* `SizeFit` measured in megabytes: a size means nothing without
|
||||||
|
* knowing how long the music is, so the same number described a
|
||||||
|
* generous single and a suspiciously small boxset.
|
||||||
*/
|
*/
|
||||||
"sizeFit": number;
|
"bitrateFit": number;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Mixed marks a candidate whose files are not all the same format,
|
* Mixed marks a candidate whose files are not all the same format,
|
||||||
|
|||||||
@@ -431,8 +431,17 @@ export interface TopResult {
|
|||||||
|
|
||||||
/**
|
/**
|
||||||
* Library status — populated from index cross-reference columns.
|
* Library status — populated from index cross-reference columns.
|
||||||
|
*
|
||||||
|
* LocalID is the one the cards read. It is the local row behind
|
||||||
|
* this entity — an album, a file, an artist — and it is set and
|
||||||
|
* cleared by a test against `audio_files`, so it means "there is
|
||||||
|
* something of mine here". InLibrary is written by the same pass
|
||||||
|
* but is a one-way ratchet the prune can only clear alongside a
|
||||||
|
* local id, so it is the weaker of the two and stays for scoring
|
||||||
|
* (`fwInLibrary`), which is where an approximate answer is fine.
|
||||||
*/
|
*/
|
||||||
"inLibrary": boolean;
|
"inLibrary": boolean;
|
||||||
|
"localId"?: number;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
|||||||
@@ -98,6 +98,26 @@ export function GetAlbumsByArtist(artist: string, libraryID: number): $Cancellab
|
|||||||
return $Call.ByID(1456840721, artist, libraryID);
|
return $Call.ByID(1456840721, artist, libraryID);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* GetAlbumsCompleteness answers the same question for a screenful of
|
||||||
|
* albums in one query, keyed by album id.
|
||||||
|
*
|
||||||
|
* A card grid asks this about every card that has a local album behind
|
||||||
|
* it, and one query per card is how a grid of fifty albums becomes
|
||||||
|
* fifty round trips. The answer matters there for the reason it
|
||||||
|
* matters on the album page: an album held 9 tracks of 12 has to show
|
||||||
|
* the count, and a bare tick saying "in your library" is the complaint
|
||||||
|
* this whole rule came from.
|
||||||
|
*
|
||||||
|
* An album with no row in the result is one with no files, and it is
|
||||||
|
* absent rather than zeroed — "I have none of this" and "I have no
|
||||||
|
* idea" are the same third state `Known` exists to keep apart, and a
|
||||||
|
* caller reading a missing key gets nothing rather than a confident 0.
|
||||||
|
*/
|
||||||
|
export function GetAlbumsCompleteness(albumIDs: number[] | null): $CancellablePromise<{ [_ in `${number}`]?: $models.AlbumCompleteness } | null> {
|
||||||
|
return $Call.ByID(531636827, albumIDs);
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* GetAllLibrariesWithTrackCounts lists the libraries and their sizes.
|
* GetAllLibrariesWithTrackCounts lists the libraries and their sizes.
|
||||||
*/
|
*/
|
||||||
|
|||||||
@@ -207,6 +207,17 @@ body div.sidebar {
|
|||||||
color: var(--yj-accent, #ffd43b);
|
color: var(--yj-accent, #ffd43b);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* An open queue is a state this button can be in, and it used to
|
||||||
|
look exactly like the closed one -- so the only way to tell what
|
||||||
|
pressing it would do was to look at the other side of the window
|
||||||
|
and infer it. `aria-expanded` is the same fact for anyone not
|
||||||
|
looking at all, and it points at the panel it controls. */
|
||||||
|
#queue-button[aria-expanded='true'] {
|
||||||
|
color: var(--yj-accent, #ffd43b);
|
||||||
|
background: var(--yj-bg-overlay, #404040);
|
||||||
|
border-radius: 4px;
|
||||||
|
}
|
||||||
|
|
||||||
#queue-button.drag-over {
|
#queue-button.drag-over {
|
||||||
color: var(--yj-accent, #ffd43b);
|
color: var(--yj-accent, #ffd43b);
|
||||||
outline: 2px dashed var(--yj-accent, #ffd43b);
|
outline: 2px dashed var(--yj-accent, #ffd43b);
|
||||||
|
|||||||
+6
-2
@@ -37,8 +37,12 @@
|
|||||||
<footer class="bottom-bar">
|
<footer class="bottom-bar">
|
||||||
<now-playing></now-playing>
|
<now-playing></now-playing>
|
||||||
<audio-player></audio-player>
|
<audio-player></audio-player>
|
||||||
<button aria-label="Toggle queue" id="queue-button">
|
<button aria-label="Toggle queue" aria-controls="queue-panel" aria-expanded="false"
|
||||||
<wa-icon name="list"></wa-icon>
|
id="queue-button">
|
||||||
|
<!-- ICON_QUEUE in src/utils/icon-language.ts, written out
|
||||||
|
because this file has no module scope. It was `list`,
|
||||||
|
which is the Playlists destination's icon. -->
|
||||||
|
<wa-icon name="bars-staggered"></wa-icon>
|
||||||
</button>
|
</button>
|
||||||
</footer>
|
</footer>
|
||||||
<!-- The phone's primary navigation, hidden above 600px by
|
<!-- The phone's primary navigation, hidden above 600px by
|
||||||
|
|||||||
@@ -521,6 +521,28 @@ if (queueButton && queuePanel) {
|
|||||||
}
|
}
|
||||||
});
|
});
|
||||||
|
|
||||||
|
// The button says whether the panel is open, and it learns that
|
||||||
|
// from the panel rather than from its own click handler.
|
||||||
|
//
|
||||||
|
// It is not the only thing that opens the queue -- `now-playing-view`
|
||||||
|
// sets the same attribute, because it hides the bar this button
|
||||||
|
// lives in -- so a state kept beside the click would be right until
|
||||||
|
// something else opened the panel and then quietly wrong. The panel's
|
||||||
|
// `open` attribute is the one fact; this reflects it.
|
||||||
|
const reflectQueueState = () => {
|
||||||
|
queueButton.setAttribute(
|
||||||
|
'aria-expanded',
|
||||||
|
String(queuePanel.hasAttribute('open')),
|
||||||
|
);
|
||||||
|
};
|
||||||
|
|
||||||
|
new MutationObserver(reflectQueueState).observe(queuePanel, {
|
||||||
|
attributes: true,
|
||||||
|
attributeFilter: ['open'],
|
||||||
|
});
|
||||||
|
|
||||||
|
reflectQueueState();
|
||||||
|
|
||||||
// ---------------------------------------------------------------
|
// ---------------------------------------------------------------
|
||||||
// Queue button as drop target (when queue panel is closed)
|
// Queue button as drop target (when queue panel is closed)
|
||||||
// ---------------------------------------------------------------
|
// ---------------------------------------------------------------
|
||||||
|
|||||||
@@ -0,0 +1 @@
|
|||||||
|
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 576 512"><!--! Font Awesome Free 7.3.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc. --><path fill="currentColor" d="M288.1-32c9 0 17.3 5.1 21.4 13.1L383 125.3 542.9 150.7c8.9 1.4 16.3 7.7 19.1 16.3s.5 18-5.8 24.4L441.7 305.9 467 465.8c1.4 8.9-2.3 17.9-9.6 23.2s-17 6.1-25 2L288.1 417.6 143.8 491c-8 4.1-17.7 3.3-25-2s-11-14.2-9.6-23.2L134.4 305.9 20 191.4c-6.4-6.4-8.6-15.8-5.8-24.4s10.1-14.9 19.1-16.3l159.9-25.4 73.6-144.2c4.1-8 12.4-13.1 21.4-13.1zm0 76.8L230.3 158c-3.5 6.8-10 11.6-17.6 12.8l-125.5 20 89.8 89.9c5.4 5.4 7.9 13.1 6.7 20.7l-19.8 125.5 113.3-57.6c6.8-3.5 14.9-3.5 21.8 0l113.3 57.6-19.8-125.5c-1.2-7.6 1.3-15.3 6.7-20.7l89.8-89.9-125.5-20c-7.6-1.2-14.1-6-17.6-12.8L288.1 44.8z"/></svg>
|
||||||
|
After Width: | Height: | Size: 889 B |
@@ -0,0 +1 @@
|
|||||||
|
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><!--! Font Awesome Free 7.3.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License) Copyright 2026 Fonticons, Inc. --><path fill="currentColor" d="M0 96C0 78.3 14.3 64 32 64l384 0c17.7 0 32 14.3 32 32s-14.3 32-32 32L32 128C14.3 128 0 113.7 0 96zM64 256c0-17.7 14.3-32 32-32l384 0c17.7 0 32 14.3 32 32s-14.3 32-32 32L96 288c-17.7 0-32-14.3-32-32zM448 416c0 17.7-14.3 32-32 32L32 448c-17.7 0-32-14.3-32-32s14.3-32 32-32l384 0c17.7 0 32 14.3 32 32z"/></svg>
|
||||||
|
After Width: | Height: | Size: 609 B |
@@ -10,6 +10,7 @@ import type {
|
|||||||
VisibilityChangedEvent,
|
VisibilityChangedEvent,
|
||||||
} from '@lit-labs/virtualizer';
|
} from '@lit-labs/virtualizer';
|
||||||
import { grid } from '@lit-labs/virtualizer/layouts/grid.js';
|
import { grid } from '@lit-labs/virtualizer/layouts/grid.js';
|
||||||
|
import { gridSpacingFor } from '@utils/grid-spacing';
|
||||||
import {
|
import {
|
||||||
GetAlbumsByArtist,
|
GetAlbumsByArtist,
|
||||||
GetFilePathsByAlbums,
|
GetFilePathsByAlbums,
|
||||||
@@ -36,6 +37,10 @@ import type WaPopup from '@awesome.me/webawesome/dist/components/popup/popup.js'
|
|||||||
import '@awesome.me/webawesome/dist/components/dropdown-item/dropdown-item.js';
|
import '@awesome.me/webawesome/dist/components/dropdown-item/dropdown-item.js';
|
||||||
import '@components/playlist-picker/playlist-picker.js';
|
import '@components/playlist-picker/playlist-picker.js';
|
||||||
import { dict, list } from '@utils/binding';
|
import { dict, list } from '@utils/binding';
|
||||||
|
import {
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
ICON_QUEUE,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
/** Pixels to change card width per scroll tick. */
|
/** Pixels to change card width per scroll tick. */
|
||||||
const ZOOM_STEP = 16;
|
const ZOOM_STEP = 16;
|
||||||
@@ -147,8 +152,6 @@ export class ArtistsView
|
|||||||
|
|
||||||
// ----- Grid spacing constants -----
|
// ----- Grid spacing constants -----
|
||||||
|
|
||||||
private static readonly GRID_GAP = 8;
|
|
||||||
private static readonly GRID_PADDING = 8;
|
|
||||||
private static readonly CARD_PADDING = 5;
|
private static readonly CARD_PADDING = 5;
|
||||||
|
|
||||||
private get imageSize(): number {
|
private get imageSize(): number {
|
||||||
@@ -177,20 +180,41 @@ export class ArtistsView
|
|||||||
private createGridLayout() {
|
private createGridLayout() {
|
||||||
const w = this.cardSize ?? CARD_SIZE_DEFAULT;
|
const w = this.cardSize ?? CARD_SIZE_DEFAULT;
|
||||||
const h = w + this.cardTextHeight;
|
const h = w + this.cardTextHeight;
|
||||||
const gap = ArtistsView.GRID_GAP;
|
|
||||||
const pad = ArtistsView.GRID_PADDING;
|
// One number for the gap, the row gap and the padding: whatever
|
||||||
|
// a row could not spend on another card, shared out equally, so
|
||||||
|
// the outside is never wider than the inside. See
|
||||||
|
// `utils/grid-spacing.ts`.
|
||||||
|
const spacing = this.spacingFor(this.containerWidth);
|
||||||
|
|
||||||
|
this.lastLayoutSpacing = spacing;
|
||||||
|
|
||||||
return grid({
|
return grid({
|
||||||
itemSize: {
|
itemSize: {
|
||||||
width: `${w}px`,
|
width: `${w}px`,
|
||||||
height: `${h}px`,
|
height: `${h}px`,
|
||||||
},
|
},
|
||||||
gap: `${gap}px`,
|
gap: `${spacing}px`,
|
||||||
padding: `${pad}px`,
|
padding: `${spacing}px`,
|
||||||
justify: 'center',
|
justify: 'start',
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/** The width the grid lays itself out in. */
|
||||||
|
private get containerWidth(): number {
|
||||||
|
return (
|
||||||
|
this.renderRoot?.querySelector<HTMLElement>(
|
||||||
|
'.grid-scroll-container',
|
||||||
|
)?.clientWidth ||
|
||||||
|
this.clientWidth ||
|
||||||
|
0
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
|
private spacingFor(width: number): number {
|
||||||
|
return gridSpacingFor(width, this.cardSize);
|
||||||
|
}
|
||||||
|
|
||||||
/** Sort direction for the artist grid.
|
/** Sort direction for the artist grid.
|
||||||
*
|
*
|
||||||
* There is only one key to sort by: `library.Artist` carries a
|
* There is only one key to sort by: `library.Artist` carries a
|
||||||
@@ -478,6 +502,8 @@ export class ArtistsView
|
|||||||
override disconnectedCallback() {
|
override disconnectedCallback() {
|
||||||
super.disconnectedCallback();
|
super.disconnectedCallback();
|
||||||
this.detachWheelListener();
|
this.detachWheelListener();
|
||||||
|
this.gridResizeObserver?.disconnect();
|
||||||
|
this.gridResizeObserver = null;
|
||||||
}
|
}
|
||||||
|
|
||||||
/** The wheel listener and the scroll debounce belong to the grid
|
/** The wheel listener and the scroll debounce belong to the grid
|
||||||
@@ -730,10 +756,34 @@ export class ArtistsView
|
|||||||
* ================================================================ */
|
* ================================================================ */
|
||||||
|
|
||||||
private lastLayoutWidth = 0;
|
private lastLayoutWidth = 0;
|
||||||
|
private lastLayoutSpacing = 0;
|
||||||
|
|
||||||
|
/** Watches the scroller so a window resize rebuilds the layout:
|
||||||
|
* the spacing is derived from its width, and nothing else asks
|
||||||
|
* this view to update when only that changes. */
|
||||||
|
private gridResizeObserver: ResizeObserver | null = null;
|
||||||
|
|
||||||
|
private observeGridWidth() {
|
||||||
|
const container =
|
||||||
|
this.renderRoot?.querySelector<HTMLElement>(
|
||||||
|
'.grid-scroll-container',
|
||||||
|
);
|
||||||
|
|
||||||
|
if (!container || this.gridResizeObserver) return;
|
||||||
|
|
||||||
|
this.gridResizeObserver = new ResizeObserver(() =>
|
||||||
|
this.requestUpdate(),
|
||||||
|
);
|
||||||
|
this.gridResizeObserver.observe(container);
|
||||||
|
}
|
||||||
|
|
||||||
private updateGridLayout() {
|
private updateGridLayout() {
|
||||||
|
this.observeGridWidth();
|
||||||
|
|
||||||
if (
|
if (
|
||||||
this.cardSize === this.lastLayoutWidth
|
this.cardSize === this.lastLayoutWidth &&
|
||||||
|
this.lastLayoutSpacing ===
|
||||||
|
this.spacingFor(this.containerWidth)
|
||||||
) {
|
) {
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
@@ -1325,7 +1375,7 @@ export class ArtistsView
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_QUEUE}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
@@ -1361,7 +1411,7 @@ export class ArtistsView
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_PLAYLIST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Playlist
|
Add to Playlist
|
||||||
<span
|
<span
|
||||||
|
|||||||
@@ -68,6 +68,29 @@ export class SeekBar extends LitElement {
|
|||||||
align-items: center;
|
align-items: center;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* The clocks must not resize as they count.
|
||||||
|
|
||||||
|
Two things move them, and they need different answers. Digits in
|
||||||
|
a proportional font are different widths, so 1:11 is narrower
|
||||||
|
than 4:08 and the bar breathed once a second -- that is what
|
||||||
|
tabular figures fix. The character *count* changes too, at the
|
||||||
|
hundredth minute and whenever the right-hand clock is toggled to
|
||||||
|
remaining and grows a minus sign, and a figure width cannot fix
|
||||||
|
that -- so each clock also reserves the widest string this track
|
||||||
|
can put in it. The budget is per track rather than a constant
|
||||||
|
because reserving six characters on every track would push the
|
||||||
|
slider in by a character at each end for nothing. */
|
||||||
|
#seek-bar-container small,
|
||||||
|
.time-toggle {
|
||||||
|
font-variant-numeric: tabular-nums;
|
||||||
|
flex: 0 0 auto;
|
||||||
|
min-width: calc(var(--yj-clock-chars, 5) * 1ch);
|
||||||
|
}
|
||||||
|
|
||||||
|
#seek-bar-container small {
|
||||||
|
text-align: left;
|
||||||
|
}
|
||||||
|
|
||||||
.time-toggle {
|
.time-toggle {
|
||||||
background: none;
|
background: none;
|
||||||
border: none;
|
border: none;
|
||||||
@@ -76,6 +99,9 @@ export class SeekBar extends LitElement {
|
|||||||
font: inherit;
|
font: inherit;
|
||||||
font-size: var(--wa-font-size-s, 0.875rem);
|
font-size: var(--wa-font-size-s, 0.875rem);
|
||||||
cursor: pointer;
|
cursor: pointer;
|
||||||
|
/* One more for the minus sign the remaining form carries. */
|
||||||
|
min-width: calc((var(--yj-clock-chars, 5) + 1) * 1ch);
|
||||||
|
text-align: right;
|
||||||
}
|
}
|
||||||
|
|
||||||
.time-toggle:hover,
|
.time-toggle:hover,
|
||||||
@@ -219,8 +245,19 @@ export class SeekBar extends LitElement {
|
|||||||
: formatSeconds(this.trackLength);
|
: formatSeconds(this.trackLength);
|
||||||
const rightTime = this.hasTrack ? rightLabel : '--:--';
|
const rightTime = this.hasTrack ? rightLabel : '--:--';
|
||||||
|
|
||||||
|
// The widest string either clock can hold for *this* track. The
|
||||||
|
// duration is the longest elapsed value there can be, so its length
|
||||||
|
// is the budget; `--:--` is five, which is also the floor.
|
||||||
|
const clockChars = Math.max(
|
||||||
|
5,
|
||||||
|
this.hasTrack ? formatSeconds(this.trackLength).length : 0,
|
||||||
|
);
|
||||||
|
|
||||||
return html`
|
return html`
|
||||||
<div id="seek-bar-container">
|
<div
|
||||||
|
id="seek-bar-container"
|
||||||
|
style="--yj-clock-chars: ${clockChars}"
|
||||||
|
>
|
||||||
<small data-testid="elapsed-time">${elapsedTime}</small>
|
<small data-testid="elapsed-time">${elapsedTime}</small>
|
||||||
<wa-slider
|
<wa-slider
|
||||||
label="Seek"
|
label="Seek"
|
||||||
|
|||||||
@@ -6,6 +6,7 @@ import type WaDrawer from '@awesome.me/webawesome/dist/components/drawer/drawer.
|
|||||||
import { designTokens } from '../../styles/tokens.css';
|
import { designTokens } from '../../styles/tokens.css';
|
||||||
import '../sidebar/app-sidebar.js';
|
import '../sidebar/app-sidebar.js';
|
||||||
import { nameDialog } from '@utils/name-dialog';
|
import { nameDialog } from '@utils/name-dialog';
|
||||||
|
import { ICON_PLAYLIST } from '@utils/icon-language';
|
||||||
|
|
||||||
type View = 'home' | 'albums' | 'tracks' | 'playlists';
|
type View = 'home' | 'albums' | 'tracks' | 'playlists';
|
||||||
|
|
||||||
@@ -138,7 +139,7 @@ export class BottomNav extends LitElement {
|
|||||||
{ id: 'home', label: 'Home', icon: 'house' },
|
{ id: 'home', label: 'Home', icon: 'house' },
|
||||||
{ id: 'albums', label: 'Albums', icon: 'compact-disc' },
|
{ id: 'albums', label: 'Albums', icon: 'compact-disc' },
|
||||||
{ id: 'tracks', label: 'Tracks', icon: 'music' },
|
{ id: 'tracks', label: 'Tracks', icon: 'music' },
|
||||||
{ id: 'playlists', label: 'Playlists', icon: 'list' },
|
{ id: 'playlists', label: 'Playlists', icon: ICON_PLAYLIST },
|
||||||
];
|
];
|
||||||
|
|
||||||
override connectedCallback() {
|
override connectedCallback() {
|
||||||
|
|||||||
@@ -86,9 +86,10 @@ export class DownloadClients extends LitElement {
|
|||||||
/** Working copy of the auto-download guardrails. */
|
/** Working copy of the auto-download guardrails. */
|
||||||
@state()
|
@state()
|
||||||
private prefs: download.AutoDownloadPrefs = {
|
private prefs: download.AutoDownloadPrefs = {
|
||||||
minSizeMb: 0,
|
minKbps: 0,
|
||||||
|
maxKbps: 0,
|
||||||
|
preferredKbps: 0,
|
||||||
maxSizeMb: 0,
|
maxSizeMb: 0,
|
||||||
preferredSizeMb: 0,
|
|
||||||
allowedFormats: [],
|
allowedFormats: [],
|
||||||
} as download.AutoDownloadPrefs;
|
} as download.AutoDownloadPrefs;
|
||||||
|
|
||||||
@@ -284,25 +285,72 @@ export class DownloadClients extends LitElement {
|
|||||||
: nothing}
|
: nothing}
|
||||||
|
|
||||||
<div class="form">
|
<div class="form">
|
||||||
|
<!-- Bitrate, not megabytes. A size means nothing
|
||||||
|
on its own: 300 MB is a generous single and a
|
||||||
|
suspiciously small boxset, and whoever fills
|
||||||
|
this in has no idea which release it will be
|
||||||
|
applied to. A rate is the same statement
|
||||||
|
divided by how long the music is, so one number
|
||||||
|
holds across an EP and an opera. -->
|
||||||
<div class="field-row">
|
<div class="field-row">
|
||||||
<wa-input
|
<wa-input
|
||||||
label="Minimum size (MB)"
|
label="Minimum bitrate (kbps)"
|
||||||
type="number"
|
type="number"
|
||||||
min="0"
|
min="0"
|
||||||
placeholder="No minimum"
|
placeholder="No minimum"
|
||||||
.value=${this.prefs.minSizeMb ? String(this.prefs.minSizeMb) : ''}
|
.value=${this.prefs.minKbps ? String(this.prefs.minKbps) : ''}
|
||||||
@input=${(e: Event) => {
|
@input=${(e: Event) => {
|
||||||
this.prefs = {
|
this.prefs = {
|
||||||
...this.prefs,
|
...this.prefs,
|
||||||
minSizeMb: Number((e.target as HTMLInputElement).value) || 0,
|
minKbps: Number((e.target as HTMLInputElement).value) || 0,
|
||||||
};
|
};
|
||||||
}}
|
}}
|
||||||
></wa-input>
|
></wa-input>
|
||||||
<wa-input
|
<wa-input
|
||||||
label="Maximum size (MB)"
|
label="Maximum bitrate (kbps)"
|
||||||
type="number"
|
type="number"
|
||||||
min="0"
|
min="0"
|
||||||
placeholder="No maximum"
|
placeholder="No maximum"
|
||||||
|
.value=${this.prefs.maxKbps ? String(this.prefs.maxKbps) : ''}
|
||||||
|
@input=${(e: Event) => {
|
||||||
|
this.prefs = {
|
||||||
|
...this.prefs,
|
||||||
|
maxKbps: Number((e.target as HTMLInputElement).value) || 0,
|
||||||
|
};
|
||||||
|
}}
|
||||||
|
></wa-input>
|
||||||
|
<wa-input
|
||||||
|
label="Preferred bitrate (kbps)"
|
||||||
|
type="number"
|
||||||
|
min="0"
|
||||||
|
placeholder="No preference"
|
||||||
|
.value=${this.prefs.preferredKbps
|
||||||
|
? String(this.prefs.preferredKbps)
|
||||||
|
: ''}
|
||||||
|
@input=${(e: Event) => {
|
||||||
|
this.prefs = {
|
||||||
|
...this.prefs,
|
||||||
|
preferredKbps:
|
||||||
|
Number((e.target as HTMLInputElement).value) || 0,
|
||||||
|
};
|
||||||
|
}}
|
||||||
|
></wa-input>
|
||||||
|
</div>
|
||||||
|
|
||||||
|
<div class="requires">
|
||||||
|
320 is the top of MP3; a FLAC rip is usually
|
||||||
|
500–1000 depending on the music. Preferred
|
||||||
|
decides between copies that are otherwise equally
|
||||||
|
good — it never rules one out, which is what the
|
||||||
|
minimum and maximum are for.
|
||||||
|
</div>
|
||||||
|
|
||||||
|
<div class="field-row">
|
||||||
|
<wa-input
|
||||||
|
label="Never grab more than (MB)"
|
||||||
|
type="number"
|
||||||
|
min="0"
|
||||||
|
placeholder="No limit"
|
||||||
.value=${this.prefs.maxSizeMb ? String(this.prefs.maxSizeMb) : ''}
|
.value=${this.prefs.maxSizeMb ? String(this.prefs.maxSizeMb) : ''}
|
||||||
@input=${(e: Event) => {
|
@input=${(e: Event) => {
|
||||||
this.prefs = {
|
this.prefs = {
|
||||||
@@ -311,22 +359,14 @@ export class DownloadClients extends LitElement {
|
|||||||
};
|
};
|
||||||
}}
|
}}
|
||||||
></wa-input>
|
></wa-input>
|
||||||
<wa-input
|
</div>
|
||||||
label="Preferred size (MB)"
|
|
||||||
type="number"
|
<div class="requires">
|
||||||
min="0"
|
A ceiling on the download itself, in case a
|
||||||
placeholder="No preference"
|
mislabelled boxset gets through. Still a size
|
||||||
.value=${this.prefs.preferredSizeMb
|
because it is a question about disk space, and
|
||||||
? String(this.prefs.preferredSizeMb)
|
because it has to apply to a candidate whose
|
||||||
: ''}
|
bitrate cannot be worked out at all.
|
||||||
@input=${(e: Event) => {
|
|
||||||
this.prefs = {
|
|
||||||
...this.prefs,
|
|
||||||
preferredSizeMb:
|
|
||||||
Number((e.target as HTMLInputElement).value) || 0,
|
|
||||||
};
|
|
||||||
}}
|
|
||||||
></wa-input>
|
|
||||||
</div>
|
</div>
|
||||||
|
|
||||||
<div>
|
<div>
|
||||||
|
|||||||
@@ -111,13 +111,32 @@ const gridStyles = css`
|
|||||||
scale: 0.95;
|
scale: 0.95;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* Title and year on one line, and only the title truncates.
|
||||||
|
|
||||||
|
The year used to be part of the same run of text, so it was the
|
||||||
|
first thing an ellipsis ate: a card wide enough for a long album
|
||||||
|
name never showed its year, and browsing by year showed years
|
||||||
|
only for the albums with short names -- the sort said one thing
|
||||||
|
and the cards showed another.
|
||||||
|
|
||||||
|
A flex row rather than a second line, because the card's height
|
||||||
|
is what the virtualizer measures rows by. */
|
||||||
.album-name {
|
.album-name {
|
||||||
font-size: var(--album-name-font, 14px);
|
font-size: var(--album-name-font, 14px);
|
||||||
font-weight: 400;
|
font-weight: 400;
|
||||||
color: var(--yj-text-primary, #fff);
|
color: var(--yj-text-primary, #fff);
|
||||||
|
display: flex;
|
||||||
|
justify-content: center;
|
||||||
|
align-items: baseline;
|
||||||
|
gap: 0.35em;
|
||||||
|
min-width: 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
.album-title {
|
||||||
white-space: nowrap;
|
white-space: nowrap;
|
||||||
overflow: hidden;
|
overflow: hidden;
|
||||||
text-overflow: ellipsis;
|
text-overflow: ellipsis;
|
||||||
|
min-width: 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
.artist-name {
|
.artist-name {
|
||||||
@@ -131,6 +150,8 @@ const gridStyles = css`
|
|||||||
|
|
||||||
.album-year {
|
.album-year {
|
||||||
color: var(--yj-text-tertiary, #888);
|
color: var(--yj-text-tertiary, #888);
|
||||||
|
flex: 0 0 auto;
|
||||||
|
white-space: nowrap;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ========================================
|
/* ========================================
|
||||||
|
|||||||
@@ -19,6 +19,7 @@ import { LibraryController } from '@store/controllers/library-controller';
|
|||||||
import { SearchController } from '@store/controllers/search-controller';
|
import { SearchController } from '@store/controllers/search-controller';
|
||||||
import { ViewLifecycleMixin } from '@utils/view-lifecycle';
|
import { ViewLifecycleMixin } from '@utils/view-lifecycle';
|
||||||
import { RovingGridController } from '@utils/roving-grid';
|
import { RovingGridController } from '@utils/roving-grid';
|
||||||
|
import { gridColumnsFor, gridSpacingFor } from '@utils/grid-spacing';
|
||||||
import { queueStore } from '@store/queue-store';
|
import { queueStore } from '@store/queue-store';
|
||||||
import type { QueueSource } from '@store/queue-store';
|
import type { QueueSource } from '@store/queue-store';
|
||||||
import '@awesome.me/webawesome/dist/components/popup/popup.js';
|
import '@awesome.me/webawesome/dist/components/popup/popup.js';
|
||||||
@@ -75,6 +76,10 @@ import type {
|
|||||||
SortDirection,
|
SortDirection,
|
||||||
} from './cover-grid-types.js';
|
} from './cover-grid-types.js';
|
||||||
import { list } from '@utils/binding';
|
import { list } from '@utils/binding';
|
||||||
|
import {
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
ICON_QUEUE,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
@customElement('cover-grid')
|
@customElement('cover-grid')
|
||||||
export class CoverGrid
|
export class CoverGrid
|
||||||
@@ -97,19 +102,36 @@ export class CoverGrid
|
|||||||
private lastAlbumsRef: library.Album[] | null =
|
private lastAlbumsRef: library.Album[] | null =
|
||||||
null;
|
null;
|
||||||
|
|
||||||
// Fixed grid spacing constants.
|
|
||||||
private static readonly GRID_GAP = 8;
|
|
||||||
private static readonly GRID_PADDING = 8;
|
|
||||||
private static readonly CARD_PADDING = 5;
|
private static readonly CARD_PADDING = 5;
|
||||||
|
|
||||||
private ctxMenu = new ContextMenuController(this);
|
private ctxMenu = new ContextMenuController(this);
|
||||||
private favCtrl = new FavoritesController(this);
|
private favCtrl = new FavoritesController(this);
|
||||||
private selMgr = new AlbumSelectionManager();
|
private selMgr = new AlbumSelectionManager();
|
||||||
private scrollMgr = new ScrollManager(this, {
|
private scrollMgr = new ScrollManager(this, {
|
||||||
GRID_GAP: CoverGrid.GRID_GAP,
|
columnsFor: (width: number) => this.columnsFor(width),
|
||||||
GRID_PADDING: CoverGrid.GRID_PADDING,
|
spacingFor: (width: number) => this.spacingFor(width),
|
||||||
});
|
});
|
||||||
|
|
||||||
|
/**
|
||||||
|
* How many cards fit across `width`, by the same arithmetic the
|
||||||
|
* virtualizer's `space-evenly` grid uses — no gap and no padding
|
||||||
|
* are reserved, because both come out of what is left over.
|
||||||
|
*
|
||||||
|
* The scroll manager restores a position by rebuilding the grid's
|
||||||
|
* geometry, so this and `spacingFor` must agree with the layout
|
||||||
|
* rather than approximate it; they were two constants that no
|
||||||
|
* longer describe anything once the spacing became elastic.
|
||||||
|
*/
|
||||||
|
columnsFor(width: number): number {
|
||||||
|
return gridColumnsFor(width, this.cardWidth);
|
||||||
|
}
|
||||||
|
|
||||||
|
/** The spacing that width produces: between columns, between rows,
|
||||||
|
* and around the outside, all the same number. */
|
||||||
|
spacingFor(width: number): number {
|
||||||
|
return gridSpacingFor(width, this.cardWidth);
|
||||||
|
}
|
||||||
|
|
||||||
private lastSelectedAlbumIndex: number | null = null;
|
private lastSelectedAlbumIndex: number | null = null;
|
||||||
private lastSelectedTrackIndex: number | null = null;
|
private lastSelectedTrackIndex: number | null = null;
|
||||||
|
|
||||||
@@ -148,10 +170,30 @@ export class CoverGrid
|
|||||||
}
|
}
|
||||||
|
|
||||||
// Virtualizer grid layout instance — recreated when
|
// Virtualizer grid layout instance — recreated when
|
||||||
// the card size changes.
|
// the card size or the container width changes.
|
||||||
private gridLayout = this.createGridLayout();
|
private gridLayout = this.createGridLayout();
|
||||||
private gridLayoutWidth = 0;
|
private gridLayoutWidth = 0;
|
||||||
|
|
||||||
|
/** The spacing the current layouts were built with. */
|
||||||
|
private gridLayoutSpacing = 0;
|
||||||
|
|
||||||
|
/** Watches the scroll container so a window resize rebuilds the
|
||||||
|
* layout: the spacing is derived from its width, and nothing else
|
||||||
|
* asks this component to update when only that changes. */
|
||||||
|
private gridResizeObserver: ResizeObserver | null =
|
||||||
|
null;
|
||||||
|
|
||||||
|
private observeGridWidth(): void {
|
||||||
|
const container = this.scrollContainer;
|
||||||
|
|
||||||
|
if (!container || this.gridResizeObserver) return;
|
||||||
|
|
||||||
|
this.gridResizeObserver = new ResizeObserver(
|
||||||
|
() => this.requestUpdate(),
|
||||||
|
);
|
||||||
|
this.gridResizeObserver.observe(container);
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Secondary layout for the "after" virtualizer in
|
* Secondary layout for the "after" virtualizer in
|
||||||
* split mode. Uses zero top padding so there is no
|
* split mode. Uses zero top padding so there is no
|
||||||
@@ -169,22 +211,49 @@ export class CoverGrid
|
|||||||
}
|
}
|
||||||
|
|
||||||
const h = w + this.cardTextHeight;
|
const h = w + this.cardTextHeight;
|
||||||
const gap = CoverGrid.GRID_GAP;
|
|
||||||
const pad = CoverGrid.GRID_PADDING;
|
// The spacing is whatever the row could not spend on another
|
||||||
|
// card, shared out equally — so it is the same number between
|
||||||
|
// two cards, between two rows, and down each outside edge.
|
||||||
|
// See `utils/grid-spacing.ts` for why it is computed rather
|
||||||
|
// than handed to the virtualizer as `space-evenly`.
|
||||||
|
const spacing = this.spacingFor(
|
||||||
|
this.containerWidth,
|
||||||
|
);
|
||||||
|
|
||||||
|
if (!noTopPad) {
|
||||||
|
this.gridLayoutSpacing = spacing;
|
||||||
|
}
|
||||||
|
|
||||||
return grid({
|
return grid({
|
||||||
itemSize: {
|
itemSize: {
|
||||||
width: `${w}px`,
|
width: `${w}px`,
|
||||||
height: `${h}px`,
|
height: `${h}px`,
|
||||||
},
|
},
|
||||||
gap: `${gap}px`,
|
gap: `${spacing}px`,
|
||||||
padding: noTopPad
|
padding: noTopPad
|
||||||
? `0 ${pad}px ${pad}px`
|
? `0 ${spacing}px ${spacing}px`
|
||||||
: `${pad}px`,
|
: `${spacing}px`,
|
||||||
justify: 'center',
|
justify: 'start',
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The width the grid lays itself out in.
|
||||||
|
*
|
||||||
|
* Read from the scroll container when there is one; before the
|
||||||
|
* first render there is not, and the fallback only has to be
|
||||||
|
* plausible — the layout is rebuilt from the real width as soon as
|
||||||
|
* one exists.
|
||||||
|
*/
|
||||||
|
private get containerWidth(): number {
|
||||||
|
return (
|
||||||
|
this.scrollContainer?.clientWidth ||
|
||||||
|
this.clientWidth ||
|
||||||
|
0
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
private dragImageEl: HTMLElement | null = null;
|
private dragImageEl: HTMLElement | null = null;
|
||||||
|
|
||||||
// -- Memoisation caches for filtered albums --
|
// -- Memoisation caches for filtered albums --
|
||||||
@@ -466,6 +535,9 @@ export class CoverGrid
|
|||||||
);
|
);
|
||||||
this.wheelListenerAttached = false;
|
this.wheelListenerAttached = false;
|
||||||
|
|
||||||
|
this.gridResizeObserver?.disconnect();
|
||||||
|
this.gridResizeObserver = null;
|
||||||
|
|
||||||
this.scrollMgr.teardown();
|
this.scrollMgr.teardown();
|
||||||
this.scrollMgr.revealContainer(
|
this.scrollMgr.revealContainer(
|
||||||
this.scrollContainer,
|
this.scrollContainer,
|
||||||
@@ -603,10 +675,18 @@ export class CoverGrid
|
|||||||
this.wheelListenerAttached = true;
|
this.wheelListenerAttached = true;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Recreate the virtualizer grid layout when
|
this.observeGridWidth();
|
||||||
// the card size changes.
|
|
||||||
|
// Recreate the virtualizer grid layout when the card size
|
||||||
|
// changes — or when the spacing the container width produces
|
||||||
|
// does, since that is now a derived number rather than a
|
||||||
|
// constant. Keyed on the spacing rather than on the width, or
|
||||||
|
// every pixel of a drag rebuilds a layout that would come out
|
||||||
|
// the same.
|
||||||
const cardSizeChanged =
|
const cardSizeChanged =
|
||||||
this.gridLayoutWidth !== this.cardWidth;
|
this.gridLayoutWidth !== this.cardWidth ||
|
||||||
|
this.gridLayoutSpacing !==
|
||||||
|
this.spacingFor(this.containerWidth);
|
||||||
|
|
||||||
if (cardSizeChanged) {
|
if (cardSizeChanged) {
|
||||||
this.gridLayout = this.createGridLayout();
|
this.gridLayout = this.createGridLayout();
|
||||||
@@ -1404,12 +1484,16 @@ export class CoverGrid
|
|||||||
source: 'cover-grid',
|
source: 'cover-grid',
|
||||||
});
|
});
|
||||||
|
|
||||||
// Single album: show cover art thumbnail.
|
// Single album: show its cover, badged with how many tracks are
|
||||||
// Multiple albums: show track-count badge.
|
// on the way -- an album is 1 track or 30 and the thumbnail is
|
||||||
|
// the same picture either way, so the number the drop is about
|
||||||
|
// was the one thing this drag did not say.
|
||||||
|
// Multiple albums: show the track-count badge alone.
|
||||||
if (isSingleAlbum && hit.album.CoverArtPath) {
|
if (isSingleAlbum && hit.album.CoverArtPath) {
|
||||||
this.dragImageEl =
|
this.dragImageEl =
|
||||||
createAlbumArtDragImage(
|
createAlbumArtDragImage(
|
||||||
this.getCoverUrl(hit.album),
|
this.getCoverUrl(hit.album),
|
||||||
|
filePaths.length,
|
||||||
);
|
);
|
||||||
} else {
|
} else {
|
||||||
this.dragImageEl = createDragImage(
|
this.dragImageEl = createDragImage(
|
||||||
@@ -1822,10 +1906,10 @@ export class CoverGrid
|
|||||||
class="album-name"
|
class="album-name"
|
||||||
title="${album.Name}"
|
title="${album.Name}"
|
||||||
>
|
>
|
||||||
${album.Name}${album.Year
|
<span class="album-title">${album.Name}</span
|
||||||
? html`
|
>${album.Year
|
||||||
<span class="album-year">
|
? html`<span class="album-year"
|
||||||
(${album.Year})</span
|
>(${album.Year})</span
|
||||||
>`
|
>`
|
||||||
: nothing}
|
: nothing}
|
||||||
</div>
|
</div>
|
||||||
@@ -2043,7 +2127,7 @@ export class CoverGrid
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_QUEUE}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
@@ -2076,7 +2160,7 @@ export class CoverGrid
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_PLAYLIST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Playlist
|
Add to Playlist
|
||||||
<span
|
<span
|
||||||
|
|||||||
@@ -6,12 +6,21 @@ import type { LibraryController } from '@store/controllers/library-controller';
|
|||||||
import type { GridEntry } from './cover-grid-types.js';
|
import type { GridEntry } from './cover-grid-types.js';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Grid spacing constants shared between the scroll
|
* Grid geometry, asked of the host rather than written down.
|
||||||
* manager and the host component.
|
*
|
||||||
|
* These were two constants, `GRID_GAP` and `GRID_PADDING`, which stopped
|
||||||
|
* describing anything the moment the grid's spacing became elastic: the
|
||||||
|
* gap, the padding and the column count are all derived from the
|
||||||
|
* container width now, and a scroll position rebuilt from a stale 8px
|
||||||
|
* lands in the wrong row.
|
||||||
*/
|
*/
|
||||||
export interface GridConstants {
|
export interface GridConstants {
|
||||||
readonly GRID_GAP: number;
|
/** Columns that fit across `width`. */
|
||||||
readonly GRID_PADDING: number;
|
columnsFor(width: number): number;
|
||||||
|
|
||||||
|
/** The spacing `width` produces — between columns, between rows,
|
||||||
|
* and around the outside, all the same number. */
|
||||||
|
spacingFor(width: number): number;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@@ -275,8 +284,8 @@ export class ScrollManager {
|
|||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
const pad = this.gc.GRID_PADDING;
|
const pad = gap;
|
||||||
const rowStep =
|
const rowStep =
|
||||||
this.host.cardHeight + gap;
|
this.host.cardHeight + gap;
|
||||||
|
|
||||||
@@ -293,7 +302,7 @@ export class ScrollManager {
|
|||||||
() => {
|
() => {
|
||||||
const rowStep =
|
const rowStep =
|
||||||
this.host.cardHeight +
|
this.host.cardHeight +
|
||||||
this.gc.GRID_GAP;
|
this.spacing(container);
|
||||||
|
|
||||||
if (this.pendingFocus === null) {
|
if (this.pendingFocus === null) {
|
||||||
this.isResizing = true;
|
this.isResizing = true;
|
||||||
@@ -351,7 +360,7 @@ export class ScrollManager {
|
|||||||
container: HTMLElement,
|
container: HTMLElement,
|
||||||
rowStep: number,
|
rowStep: number,
|
||||||
): void {
|
): void {
|
||||||
const pad = this.gc.GRID_PADDING;
|
const pad = this.spacing(container);
|
||||||
const cols = this.currentColumnCount;
|
const cols = this.currentColumnCount;
|
||||||
const filtered =
|
const filtered =
|
||||||
this.host.cachedFilteredAlbums;
|
this.host.cachedFilteredAlbums;
|
||||||
@@ -410,17 +419,15 @@ export class ScrollManager {
|
|||||||
): number {
|
): number {
|
||||||
if (!container) return 1;
|
if (!container) return 1;
|
||||||
|
|
||||||
const gap = this.gc.GRID_GAP;
|
return this.gc.columnsFor(
|
||||||
const pad = this.gc.GRID_PADDING;
|
container.clientWidth,
|
||||||
const availableWidth =
|
);
|
||||||
container.clientWidth - pad * 2;
|
}
|
||||||
|
|
||||||
return Math.max(
|
/** The grid's current spacing, which is also its padding. */
|
||||||
1,
|
private spacing(container?: HTMLElement): number {
|
||||||
Math.floor(
|
return this.gc.spacingFor(
|
||||||
(availableWidth + gap) /
|
container?.clientWidth ?? 800,
|
||||||
(this.host.cardWidth + gap),
|
|
||||||
),
|
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -439,7 +446,7 @@ export class ScrollManager {
|
|||||||
container?: HTMLElement,
|
container?: HTMLElement,
|
||||||
): number {
|
): number {
|
||||||
const cols = this.getColumnCount(container);
|
const cols = this.getColumnCount(container);
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
|
|
||||||
return (
|
return (
|
||||||
cols * this.host.cardWidth +
|
cols * this.host.cardWidth +
|
||||||
@@ -460,7 +467,7 @@ export class ScrollManager {
|
|||||||
|
|
||||||
const cols = this.getColumnCount(container);
|
const cols = this.getColumnCount(container);
|
||||||
const colIndex = idx % cols;
|
const colIndex = idx % cols;
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
|
|
||||||
return (
|
return (
|
||||||
colIndex *
|
colIndex *
|
||||||
@@ -597,8 +604,8 @@ export class ScrollManager {
|
|||||||
|
|
||||||
if (!this.host.splitMode) return raw;
|
if (!this.host.splitMode) return raw;
|
||||||
|
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
const pad = this.gc.GRID_PADDING;
|
const pad = gap;
|
||||||
const columns =
|
const columns =
|
||||||
this.getColumnCount(container);
|
this.getColumnCount(container);
|
||||||
const rowStep = this.host.cardHeight + gap;
|
const rowStep = this.host.cardHeight + gap;
|
||||||
@@ -678,8 +685,8 @@ export class ScrollManager {
|
|||||||
|
|
||||||
if (expandedIndex < 0) return;
|
if (expandedIndex < 0) return;
|
||||||
|
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
const pad = this.gc.GRID_PADDING;
|
const pad = gap;
|
||||||
const columns =
|
const columns =
|
||||||
this.getColumnCount(container);
|
this.getColumnCount(container);
|
||||||
const rowStep = this.host.cardHeight + gap;
|
const rowStep = this.host.cardHeight + gap;
|
||||||
@@ -772,8 +779,8 @@ export class ScrollManager {
|
|||||||
|
|
||||||
if (idx < 0) return;
|
if (idx < 0) return;
|
||||||
|
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
const pad = this.gc.GRID_PADDING;
|
const pad = gap;
|
||||||
const cols =
|
const cols =
|
||||||
this.getColumnCount(container);
|
this.getColumnCount(container);
|
||||||
const rowStep = this.host.cardHeight + gap;
|
const rowStep = this.host.cardHeight + gap;
|
||||||
@@ -854,9 +861,8 @@ export class ScrollManager {
|
|||||||
this.getExpandedAlbumIndex();
|
this.getExpandedAlbumIndex();
|
||||||
|
|
||||||
if (idx >= 0) {
|
if (idx >= 0) {
|
||||||
const gap = this.gc.GRID_GAP;
|
const gap = this.spacing(container);
|
||||||
const pad =
|
const pad = gap;
|
||||||
this.gc.GRID_PADDING;
|
|
||||||
const cols =
|
const cols =
|
||||||
this.getColumnCount(
|
this.getColumnCount(
|
||||||
container,
|
container,
|
||||||
|
|||||||
@@ -400,7 +400,7 @@ export class DownloadsView extends ViewLifecycleMixin(LitElement) {
|
|||||||
private renderEmptyRequests() {
|
private renderEmptyRequests() {
|
||||||
return html`
|
return html`
|
||||||
<div class="empty">
|
<div class="empty">
|
||||||
Nothing requested yet. Use “Want this” on an album or artist
|
Nothing requested yet. Use “Request this” on an album or artist
|
||||||
to add it here.
|
to add it here.
|
||||||
</div>
|
</div>
|
||||||
`;
|
`;
|
||||||
@@ -512,7 +512,9 @@ export class DownloadsView extends ViewLifecycleMixin(LitElement) {
|
|||||||
${request.artist ? `${request.artist} — ` : ''}${request.title ||
|
${request.artist ? `${request.artist} — ` : ''}${request.title ||
|
||||||
request.mbid}
|
request.mbid}
|
||||||
</div>
|
</div>
|
||||||
<div class="detail">${requestDetail(request, this.nowMs)}</div>
|
<div class="detail">
|
||||||
|
${requestDetail(request, this.nowMs, this.canDownload)}
|
||||||
|
</div>
|
||||||
</div>
|
</div>
|
||||||
<div class="actions">
|
<div class="actions">
|
||||||
${request.state === 'satisfied'
|
${request.state === 'satisfied'
|
||||||
@@ -706,10 +708,20 @@ export class DownloadsView extends ViewLifecycleMixin(LitElement) {
|
|||||||
* looked for rather than as an error, because that is what it is — the
|
* looked for rather than as an error, because that is what it is — the
|
||||||
* retry is already scheduled and there is nothing for the user to do.
|
* retry is already scheduled and there is nothing for the user to do.
|
||||||
*/
|
*/
|
||||||
function requestDetail(request: Request, nowMs: number): string {
|
function requestDetail(
|
||||||
|
request: Request,
|
||||||
|
nowMs: number,
|
||||||
|
canDownload: boolean,
|
||||||
|
): string {
|
||||||
if (request.state === 'satisfied') return 'In your library';
|
if (request.state === 'satisfied') return 'In your library';
|
||||||
if (request.state === 'paused') return 'Paused — not being looked for';
|
if (request.state === 'paused') return 'Paused — not being looked for';
|
||||||
|
|
||||||
|
// With no client there is no search and no retry clock — the
|
||||||
|
// backend stopped scheduling one — so a row must not imply either.
|
||||||
|
// "Queued" and "next check in 6 hours" are both promises nothing is
|
||||||
|
// in a position to keep.
|
||||||
|
if (!canDownload) return 'On your list — no download client to search with';
|
||||||
|
|
||||||
if (request.attempts === 0) return 'Queued — not searched for yet';
|
if (request.attempts === 0) return 'Queued — not searched for yet';
|
||||||
|
|
||||||
const tries = `Searched ${request.attempts} time${request.attempts === 1 ? '' : 's'}`;
|
const tries = `Searched ${request.attempts} time${request.attempts === 1 ? '' : 's'}`;
|
||||||
|
|||||||
@@ -2,6 +2,8 @@ import { LitElement, html, css, nothing } from 'lit';
|
|||||||
import { customElement, property, state, query } from 'lit/decorators.js';
|
import { customElement, property, state, query } from 'lit/decorators.js';
|
||||||
import { classMap } from 'lit/directives/class-map.js';
|
import { classMap } from 'lit/directives/class-map.js';
|
||||||
import { designTokens } from '../../styles/tokens.css';
|
import { designTokens } from '../../styles/tokens.css';
|
||||||
|
import { srOnly } from '../../styles/sr-only.css';
|
||||||
|
import { unownedLabel, unownedStyles } from '@utils/ownership';
|
||||||
import {
|
import {
|
||||||
LookupReleaseGroup,
|
LookupReleaseGroup,
|
||||||
BrowseReleases,
|
BrowseReleases,
|
||||||
@@ -51,6 +53,12 @@ import { dictByName } from '@utils/binding';
|
|||||||
import type { TrackDetails } from '@components/track-details/track-details.js';
|
import type { TrackDetails } from '@components/track-details/track-details.js';
|
||||||
import { showTrackDetailsForPath } from '@utils/track-details-opener.js';
|
import { showTrackDetailsForPath } from '@utils/track-details-opener.js';
|
||||||
import '@components/playlist-picker/playlist-picker.js';
|
import '@components/playlist-picker/playlist-picker.js';
|
||||||
|
import {
|
||||||
|
ICON_CAN_REQUEST,
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
ICON_QUEUE,
|
||||||
|
ICON_REQUESTED,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* The region the album header's own failures are rendered in.
|
* The region the album header's own failures are rendered in.
|
||||||
@@ -192,6 +200,25 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
@state() private selectedVersionKey: string = '';
|
@state() private selectedVersionKey: string = '';
|
||||||
@state() private coverArtURL = '';
|
@state() private coverArtURL = '';
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Whether to draw the whole release rather than only the files on
|
||||||
|
* disk — `null` while nobody has said, which is the automatic rule
|
||||||
|
* (`buildLibraryEntry`: show the release once the tags say the album
|
||||||
|
* is incomplete).
|
||||||
|
*
|
||||||
|
* It is a *tri-state* on purpose. The automatic rule is right when
|
||||||
|
* it fires and the switch has to be able to agree with it, or the
|
||||||
|
* control would start out contradicting the page it is sitting on;
|
||||||
|
* a plain boolean would need its default recomputed every time the
|
||||||
|
* completeness answer changed underneath it.
|
||||||
|
*
|
||||||
|
* The rule alone was not enough, which is the report: it depends on
|
||||||
|
* the files declaring a per-disc total, so a library whose tags
|
||||||
|
* never said sat permanently on "only my tracks" with no way to ask
|
||||||
|
* for the rest — and no way to tell that there was a rest.
|
||||||
|
*/
|
||||||
|
@state() private showFullTracklist: boolean | null = null;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* The local album's own tracks — the authoritative answer to "what
|
* The local album's own tracks — the authoritative answer to "what
|
||||||
* is actually on disk," independent of `this.releases`, which
|
* is actually on disk," independent of `this.releases`, which
|
||||||
@@ -289,6 +316,8 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
designTokens,
|
designTokens,
|
||||||
exploreLinkStyles,
|
exploreLinkStyles,
|
||||||
contextMenuStyles,
|
contextMenuStyles,
|
||||||
|
srOnly,
|
||||||
|
unownedStyles,
|
||||||
css`
|
css`
|
||||||
:host {
|
:host {
|
||||||
display: flex;
|
display: flex;
|
||||||
@@ -557,6 +586,19 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/* ── Tracklist ── */
|
/* ── Tracklist ── */
|
||||||
|
.tracklist-scope {
|
||||||
|
display: flex;
|
||||||
|
align-items: center;
|
||||||
|
flex-wrap: wrap;
|
||||||
|
gap: 6px 12px;
|
||||||
|
margin-bottom: 8px;
|
||||||
|
}
|
||||||
|
|
||||||
|
.tracklist-scope-hint {
|
||||||
|
font-size: var(--yj-text-xs);
|
||||||
|
color: var(--yj-text-tertiary, #888);
|
||||||
|
}
|
||||||
|
|
||||||
.tracklist {
|
.tracklist {
|
||||||
display: flex;
|
display: flex;
|
||||||
flex-direction: column;
|
flex-direction: column;
|
||||||
@@ -647,49 +689,30 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
white-space: nowrap;
|
white-space: nowrap;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* A track the library does not have, on the pattern a
|
/* The dimming itself is unownedStyles, from
|
||||||
* streaming service uses for something it cannot play: the
|
* utils/ownership.ts, imported above. It was written here
|
||||||
* row stays, dimmed, so the album reads as the album rather
|
* first — this tracklist is where the treatment came from —
|
||||||
* than as the subset that happens to be here.
|
* and moved out when seven other surfaces had to draw the
|
||||||
*
|
* same thing, because two of them would otherwise have
|
||||||
* The dimming is a colour, so it cannot be the only signal
|
* ended up drawing it slightly differently. (No backticks or
|
||||||
* — the row also carries aria-disabled, which is what
|
* apostrophes-as-quotes here: this is inside a tagged
|
||||||
* reaches anyone not seeing it. Secondary rather than
|
* template literal.) */
|
||||||
* tertiary because the row's hover background is
|
|
||||||
* bgOverlay, which tertiary does not clear. */
|
|
||||||
.track-row.unowned .track-title {
|
|
||||||
color: var(--yj-text-secondary, #b3b3b3);
|
|
||||||
font-weight: 400;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* The request control is only offered where there is
|
/* The request control is offered on every row that has
|
||||||
* something to request, and only when the row is being
|
* something to request, and is not revealed on hover.
|
||||||
* attended to — a column of plus signs down a mostly-owned
|
|
||||||
* album is the clutter the green ticks were.
|
|
||||||
*
|
*
|
||||||
* Hidden with opacity, never display:none or visibility,
|
* It used to be transparent until the row was hovered or
|
||||||
* so it keeps its place in the layout (rows do not reflow
|
* focused, on the reasoning that a column of plus signs
|
||||||
* as the pointer moves) and stays in the tab order and the
|
* down a mostly-owned album is clutter. That reasoning was
|
||||||
* accessibility tree. focus-within is what makes it
|
* inherited from the green ticks it replaced and does not
|
||||||
* reachable without a mouse: tabbing to the button reveals
|
* survive the rule those were removed for: a tick marked
|
||||||
* it, and the row's own focus reveals it before you get
|
* the *common* case, while this marks the rows that are
|
||||||
* there. */
|
* **not** here. A mark on the exception is the information
|
||||||
|
* on this page — and one that appears only under the
|
||||||
|
* pointer cannot be seen, counted, or reached by anyone
|
||||||
|
* driving this with a finger. */
|
||||||
.track-row .track-request {
|
.track-row .track-request {
|
||||||
flex-shrink: 0;
|
flex-shrink: 0;
|
||||||
opacity: 0;
|
|
||||||
transition: opacity 0.12s ease;
|
|
||||||
}
|
|
||||||
|
|
||||||
.track-row:hover .track-request,
|
|
||||||
.track-row:focus-within .track-request,
|
|
||||||
.track-row .track-request:focus-visible {
|
|
||||||
opacity: 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
@media (prefers-reduced-motion: reduce) {
|
|
||||||
.track-row .track-request {
|
|
||||||
transition: none;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
`,
|
`,
|
||||||
];
|
];
|
||||||
@@ -720,14 +743,28 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
|
|
||||||
// The download button only appears once a client is connected,
|
// The download button only appears once a client is connected,
|
||||||
// so this tracks the provider list rather than assuming.
|
// so this tracks the provider list rather than assuming.
|
||||||
|
//
|
||||||
|
// The `requestUpdate` is what makes the *tracklist's* badges
|
||||||
|
// move. Both assignments below are reactive fields, so Lit
|
||||||
|
// repaints when either changes — but a track request changes
|
||||||
|
// neither: `canDownload` is about providers and `isRequested`
|
||||||
|
// is about this album's own release group. Each row's badge
|
||||||
|
// reads `libraryStatusFor(false, track.mbid)` at render time,
|
||||||
|
// which is a dependency on the store that Lit cannot see, so
|
||||||
|
// clicking one filed the request and left the plus exactly
|
||||||
|
// where it was. The other three hosts rendering these badges
|
||||||
|
// (`explore-artist-details`, `explore-view`, `top-results-row`)
|
||||||
|
// have always asked for the repaint here; this one did not.
|
||||||
this.downloadUnsub = downloadStore.subscribe(() => {
|
this.downloadUnsub = downloadStore.subscribe(() => {
|
||||||
this.canDownload = downloadStore.available;
|
this.canDownload = downloadStore.available;
|
||||||
this.syncRequested();
|
this.syncRequested();
|
||||||
|
this.requestUpdate();
|
||||||
});
|
});
|
||||||
|
|
||||||
void downloadStore.init().then(() => {
|
void downloadStore.init().then(() => {
|
||||||
this.canDownload = downloadStore.available;
|
this.canDownload = downloadStore.available;
|
||||||
this.syncRequested();
|
this.syncRequested();
|
||||||
|
this.requestUpdate();
|
||||||
});
|
});
|
||||||
|
|
||||||
void this.resolveTargetLibraryId();
|
void this.resolveTargetLibraryId();
|
||||||
@@ -911,6 +948,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
this.releases = [];
|
this.releases = [];
|
||||||
this.versionEntries = [];
|
this.versionEntries = [];
|
||||||
this.selectedVersionKey = '';
|
this.selectedVersionKey = '';
|
||||||
|
this.showFullTracklist = null;
|
||||||
this.localTracks = [];
|
this.localTracks = [];
|
||||||
this.filePaths = new Map();
|
this.filePaths = new Map();
|
||||||
this.askedFor = new Set();
|
this.askedFor = new Set();
|
||||||
@@ -1814,17 +1852,23 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
// Guarded on `known` rather than on "fewer tracks than the
|
// Guarded on `known` rather than on "fewer tracks than the
|
||||||
// cluster", which would swap in a catalog tracklist for
|
// cluster", which would swap in a catalog tracklist for
|
||||||
// every album whose tags simply never declared a total.
|
// every album whose tags simply never declared a total.
|
||||||
|
//
|
||||||
|
// And guarded on the *user's* answer first, because the
|
||||||
|
// automatic rule can only fire where the tags declared a
|
||||||
|
// total: an album that says nothing is not an album that is
|
||||||
|
// complete, and it used to be shown as one.
|
||||||
const answer = this.completenessAnswer();
|
const answer = this.completenessAnswer();
|
||||||
const incomplete = answer?.known && !answer.complete;
|
|
||||||
|
|
||||||
if (incomplete) {
|
if (this.showFullTracklist ?? (answer?.known && !answer.complete)) {
|
||||||
const fullRelease = this.findLibraryCluster(clusters);
|
const fullRelease = this.fullReleaseCluster(clusters);
|
||||||
|
|
||||||
if (fullRelease) {
|
if (fullRelease) {
|
||||||
return {
|
return {
|
||||||
key: 'synthetic:library',
|
key: 'synthetic:library',
|
||||||
label: 'Your Library',
|
label: 'Your Library',
|
||||||
sublabel: `${answer?.owned ?? 0} of ${answer?.expected ?? 0} tracks · ${this.clusterLabel(fullRelease)}`,
|
sublabel: answer?.known
|
||||||
|
? `${answer.owned} of ${answer.expected} tracks · ${this.clusterLabel(fullRelease)}`
|
||||||
|
: `${this.clusterLabel(fullRelease)} · full tracklist`,
|
||||||
group: 'aggregate',
|
group: 'aggregate',
|
||||||
syntheticKind: 'library',
|
syntheticKind: 'library',
|
||||||
tracks: fullRelease.representative.tracks ?? [],
|
tracks: fullRelease.representative.tracks ?? [],
|
||||||
@@ -1858,6 +1902,25 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The release to draw when the whole album is wanted rather than
|
||||||
|
* the files on disk.
|
||||||
|
*
|
||||||
|
* `findLibraryCluster` is the right answer where it has one — the
|
||||||
|
* release the user's tracks overlap most — but it is a guess over
|
||||||
|
* the `inLibrary` flags and returns nothing at all when none of
|
||||||
|
* them are set, which is every untagged library. Falling back to
|
||||||
|
* the highest-scoring cluster is what makes the switch work there;
|
||||||
|
* that is the same release the page would call "Standard", and the
|
||||||
|
* sublabel names it either way rather than leaving the user to
|
||||||
|
* wonder whose tracklist they are reading.
|
||||||
|
*/
|
||||||
|
private fullReleaseCluster(
|
||||||
|
clusters: ReleaseCluster[],
|
||||||
|
): ReleaseCluster | undefined {
|
||||||
|
return this.findLibraryCluster(clusters) ?? clusters[0];
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Fallback only: used when there's no local album to anchor on
|
* Fallback only: used when there's no local album to anchor on
|
||||||
* (see `buildLibraryEntry`). Finds the cluster with the highest
|
* (see `buildLibraryEntry`). Finds the cluster with the highest
|
||||||
@@ -2235,6 +2298,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
@catalog-retry=${this.retryCatalog}
|
@catalog-retry=${this.retryCatalog}
|
||||||
></catalog-scope-notice>
|
></catalog-scope-notice>
|
||||||
${this.renderVersionSelector()}
|
${this.renderVersionSelector()}
|
||||||
|
${this.renderTracklistScope()}
|
||||||
${this.renderTracklist()}
|
${this.renderTracklist()}
|
||||||
</div>
|
</div>
|
||||||
<track-details></track-details>
|
<track-details></track-details>
|
||||||
@@ -2375,7 +2439,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
data-testid="album-queue"
|
data-testid="album-queue"
|
||||||
@click=${() => this.queueOwned()}
|
@click=${() => this.queueOwned()}
|
||||||
>
|
>
|
||||||
<wa-icon slot="start" name="list"></wa-icon>
|
<wa-icon slot="start" name=${ICON_QUEUE}></wa-icon>
|
||||||
Add to queue
|
Add to queue
|
||||||
</wa-button>
|
</wa-button>
|
||||||
${partial
|
${partial
|
||||||
@@ -2678,9 +2742,9 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
of the same Free glyph carry the toggle instead. -->
|
of the same Free glyph carry the toggle instead. -->
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="start"
|
slot="start"
|
||||||
name=${this.isRequested ? 'solid/bookmark' : 'regular/bookmark'}
|
name=${this.isRequested ? ICON_REQUESTED : ICON_CAN_REQUEST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
${this.isRequested ? 'Wanted' : 'Want this'}
|
${this.isRequested ? 'Requested' : 'Request this'}
|
||||||
</wa-button>
|
</wa-button>
|
||||||
`;
|
`;
|
||||||
}
|
}
|
||||||
@@ -3033,11 +3097,101 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
|
|
||||||
/* ── Tracklist ── */
|
/* ── Tracklist ── */
|
||||||
|
|
||||||
|
/**
|
||||||
|
* "Show the whole album" — the switch between the files on disk and
|
||||||
|
* the release they are part of.
|
||||||
|
*
|
||||||
|
* The page could already draw the full release with the missing
|
||||||
|
* rows dimmed, and did so automatically once the tags said the
|
||||||
|
* album was incomplete. What it could not do was be *asked*: where
|
||||||
|
* the files declare no per-disc total and the catalog has none
|
||||||
|
* either, the rule never fires, so a partly-owned album showed only
|
||||||
|
* the tracks the user had and nothing said the rest existed.
|
||||||
|
*
|
||||||
|
* Three things about when it appears, all of them the same rule —
|
||||||
|
* a control that cannot change what is on screen is worse than no
|
||||||
|
* control, which is what the version dropdown's own guard is for:
|
||||||
|
*
|
||||||
|
* - Only against the synthetic "Your Library" entry. Every other
|
||||||
|
* entry *is* a catalog tracklist already.
|
||||||
|
* - Only when a catalog release exists to switch to.
|
||||||
|
* - Only when the two differ. A complete album's release has the
|
||||||
|
* same rows as its files, so the switch would redraw the same
|
||||||
|
* list and read as broken.
|
||||||
|
*/
|
||||||
|
private renderTracklistScope() {
|
||||||
|
const current = this.currentVersion();
|
||||||
|
|
||||||
|
if (current?.syntheticKind !== 'library') return nothing;
|
||||||
|
if (this.localTracks.length === 0) return nothing;
|
||||||
|
|
||||||
|
const full = this.fullReleaseCluster(this.clustersOf(this.versionEntries));
|
||||||
|
const fullCount = full?.representative.tracks?.length ?? 0;
|
||||||
|
|
||||||
|
if (fullCount === 0 || fullCount <= this.localTracks.length) {
|
||||||
|
return nothing;
|
||||||
|
}
|
||||||
|
|
||||||
|
const showing = current.tracks.length > this.localTracks.length;
|
||||||
|
|
||||||
|
return html`
|
||||||
|
<div class="tracklist-scope">
|
||||||
|
<wa-switch
|
||||||
|
size="small"
|
||||||
|
?checked=${showing}
|
||||||
|
@change=${this.handleTracklistScopeChange}
|
||||||
|
>
|
||||||
|
Show the whole album
|
||||||
|
</wa-switch>
|
||||||
|
<span class="tracklist-scope-hint">
|
||||||
|
${showing
|
||||||
|
? `${this.localTracks.length} of ${fullCount} tracks are in your library`
|
||||||
|
: `${fullCount - this.localTracks.length} more tracks are on this release`}
|
||||||
|
</span>
|
||||||
|
</div>
|
||||||
|
`;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The clusters behind the current entries.
|
||||||
|
*
|
||||||
|
* `buildClusters` computes them and keeps only the entries, so this
|
||||||
|
* recovers them rather than storing the array twice — two copies of
|
||||||
|
* a list rebuilt on four different events is how they come to
|
||||||
|
* disagree.
|
||||||
|
*/
|
||||||
|
private clustersOf(entries: VersionEntry[]): ReleaseCluster[] {
|
||||||
|
return entries
|
||||||
|
.filter((e) => e.group === 'cluster')
|
||||||
|
.map((e) => e.cluster)
|
||||||
|
.filter((c): c is ReleaseCluster => !!c);
|
||||||
|
}
|
||||||
|
|
||||||
|
private handleTracklistScopeChange = (e: Event) => {
|
||||||
|
this.showFullTracklist = (e.target as HTMLInputElement).checked;
|
||||||
|
|
||||||
|
// The entries are derived, so the switch rebuilds them rather
|
||||||
|
// than patching the one it changed. `buildClusters` re-defaults
|
||||||
|
// the selection, which lands back on "Your Library" — the only
|
||||||
|
// entry this control is ever shown against.
|
||||||
|
this.buildClusters();
|
||||||
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The heading is there and is not drawn.
|
||||||
|
*
|
||||||
|
* A list of numbered titles with durations under an album's cover
|
||||||
|
* does not need a word above it saying what it is — it was the
|
||||||
|
* only thing on this page labelling something already obvious. But
|
||||||
|
* the section is a landmark and the page's heading structure runs
|
||||||
|
* through it, so what goes is the *ink*, not the element: a reader
|
||||||
|
* jumping by heading still finds the tracklist.
|
||||||
|
*/
|
||||||
private renderTracklist() {
|
private renderTracklist() {
|
||||||
if (this.loadingReleases) {
|
if (this.loadingReleases) {
|
||||||
return html`
|
return html`
|
||||||
<section>
|
<section>
|
||||||
<h3 class="section-header">Tracklist</h3>
|
<h3 class="sr-only">Tracklist</h3>
|
||||||
<div class="section-loading">Loading tracks\u2026</div>
|
<div class="section-loading">Loading tracks\u2026</div>
|
||||||
</section>
|
</section>
|
||||||
`;
|
`;
|
||||||
@@ -3050,7 +3204,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
if (!current) {
|
if (!current) {
|
||||||
return html`
|
return html`
|
||||||
<section>
|
<section>
|
||||||
<h3 class="section-header">Tracklist</h3>
|
<h3 class="sr-only">Tracklist</h3>
|
||||||
<div class="section-error">
|
<div class="section-error">
|
||||||
<wa-icon name="triangle-exclamation"></wa-icon>
|
<wa-icon name="triangle-exclamation"></wa-icon>
|
||||||
No release data available.
|
No release data available.
|
||||||
@@ -3063,7 +3217,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
if (tracks.length === 0) {
|
if (tracks.length === 0) {
|
||||||
return html`
|
return html`
|
||||||
<section>
|
<section>
|
||||||
<h3 class="section-header">Tracklist</h3>
|
<h3 class="sr-only">Tracklist</h3>
|
||||||
<div
|
<div
|
||||||
style="color: var(--yj-text-tertiary, #888); font-size: var(--yj-text-md)"
|
style="color: var(--yj-text-tertiary, #888); font-size: var(--yj-text-md)"
|
||||||
>
|
>
|
||||||
@@ -3079,7 +3233,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
|
|
||||||
return html`
|
return html`
|
||||||
<section>
|
<section>
|
||||||
<h3 class="section-header">Tracklist</h3>
|
<h3 class="sr-only">Tracklist</h3>
|
||||||
<div class="tracklist">
|
<div class="tracklist">
|
||||||
${discNumbers.map((discNum) => {
|
${discNumbers.map((discNum) => {
|
||||||
const discTracks = discMap.get(discNum) ?? [];
|
const discTracks = discMap.get(discNum) ?? [];
|
||||||
@@ -3115,7 +3269,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
aria-disabled=${owned ? 'false' : 'true'}
|
aria-disabled=${owned ? 'false' : 'true'}
|
||||||
aria-label=${owned
|
aria-label=${owned
|
||||||
? `Play “${track.title}”`
|
? `Play “${track.title}”`
|
||||||
: `${track.title} — not in your library`}
|
: unownedLabel(track.title, 'track')}
|
||||||
@dblclick=${() => this.onTrackRowDblClick(track)}
|
@dblclick=${() => this.onTrackRowDblClick(track)}
|
||||||
@contextmenu=${(e: MouseEvent) => this.onTrackContextMenu(e, track)}
|
@contextmenu=${(e: MouseEvent) => this.onTrackContextMenu(e, track)}
|
||||||
@keydown=${(e: KeyboardEvent) => this.onTrackRowKeydown(e, track)}
|
@keydown=${(e: KeyboardEvent) => this.onTrackRowKeydown(e, track)}
|
||||||
@@ -3186,7 +3340,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
@click=${() => this.onContextMenuAction('add-to-queue')}
|
@click=${() => this.onContextMenuAction('add-to-queue')}
|
||||||
@mouseenter=${() => this.ctxMenu.closePlaylistSubmenu()}
|
@mouseenter=${() => this.ctxMenu.closePlaylistSubmenu()}
|
||||||
>
|
>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_QUEUE}></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
<wa-dropdown-item
|
<wa-dropdown-item
|
||||||
@@ -3205,7 +3359,7 @@ export class ExploreAlbumDetails extends LitElement implements ContextMenuHost {
|
|||||||
this.openPlaylistSubmenu();
|
this.openPlaylistSubmenu();
|
||||||
}}
|
}}
|
||||||
>
|
>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_PLAYLIST}></wa-icon>
|
||||||
Add to Playlist
|
Add to Playlist
|
||||||
<span class="submenu-arrow">▶</span>
|
<span class="submenu-arrow">▶</span>
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
|
|||||||
@@ -39,7 +39,17 @@ import { EventsOn } from '@runtime/runtime';
|
|||||||
import { Events } from '../../events';
|
import { Events } from '../../events';
|
||||||
import '@awesome.me/webawesome/dist/components/icon/icon.js';
|
import '@awesome.me/webawesome/dist/components/icon/icon.js';
|
||||||
import '../library-status-indicator/library-status-indicator.js';
|
import '../library-status-indicator/library-status-indicator.js';
|
||||||
import { libraryStatusFor, toggleRequest } from '@utils/library-status';
|
import {
|
||||||
|
albumBadgeFor,
|
||||||
|
libraryStatusFor,
|
||||||
|
toggleRequest,
|
||||||
|
} from '@utils/library-status';
|
||||||
|
import {
|
||||||
|
isOwned,
|
||||||
|
ownershipLabel,
|
||||||
|
unownedStyles,
|
||||||
|
} from '@utils/ownership';
|
||||||
|
import { completenessStore } from '@store/completeness-store';
|
||||||
import '../catalog-scope-notice/catalog-scope-notice.js';
|
import '../catalog-scope-notice/catalog-scope-notice.js';
|
||||||
import type { CatalogScope } from '../catalog-scope-notice/catalog-scope-notice.js';
|
import type { CatalogScope } from '../catalog-scope-notice/catalog-scope-notice.js';
|
||||||
import { queueStore } from '../../store/queue-store';
|
import { queueStore } from '../../store/queue-store';
|
||||||
@@ -59,6 +69,12 @@ import { dict, dictByName } from '@utils/binding';
|
|||||||
import type { TrackDetails } from '@components/track-details/track-details.js';
|
import type { TrackDetails } from '@components/track-details/track-details.js';
|
||||||
import { showTrackDetailsForPath } from '@utils/track-details-opener.js';
|
import { showTrackDetailsForPath } from '@utils/track-details-opener.js';
|
||||||
import '@components/playlist-picker/playlist-picker.js';
|
import '@components/playlist-picker/playlist-picker.js';
|
||||||
|
import {
|
||||||
|
ICON_CAN_REQUEST,
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
ICON_QUEUE,
|
||||||
|
ICON_REQUESTED,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
/* ── Constants ── */
|
/* ── Constants ── */
|
||||||
|
|
||||||
@@ -172,7 +188,6 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
@state() private discoRowSize = 5;
|
@state() private discoRowSize = 5;
|
||||||
private discoObserver?: ResizeObserver;
|
private discoObserver?: ResizeObserver;
|
||||||
@state() private similarExpanded = false;
|
@state() private similarExpanded = false;
|
||||||
private libraryMBIDs = new Set<string>();
|
|
||||||
|
|
||||||
/* ── Release prefetch ── */
|
/* ── Release prefetch ── */
|
||||||
|
|
||||||
@@ -251,6 +266,7 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
designTokens,
|
designTokens,
|
||||||
exploreLinkStyles,
|
exploreLinkStyles,
|
||||||
contextMenuStyles,
|
contextMenuStyles,
|
||||||
|
unownedStyles,
|
||||||
css`
|
css`
|
||||||
:host {
|
:host {
|
||||||
display: flex;
|
display: flex;
|
||||||
@@ -989,6 +1005,9 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
/** Unsubscribe handle for the requests list. */
|
/** Unsubscribe handle for the requests list. */
|
||||||
private unsubRequests: (() => void) | null = null;
|
private unsubRequests: (() => void) | null = null;
|
||||||
|
|
||||||
|
/** Unsubscribes the "how much of this album is here" repaint. */
|
||||||
|
private unsubCompleteness: (() => void) | null = null;
|
||||||
|
|
||||||
override connectedCallback() {
|
override connectedCallback() {
|
||||||
super.connectedCallback();
|
super.connectedCallback();
|
||||||
if (this.artistMBID || this.localArtistId) {
|
if (this.artistMBID || this.localArtistId) {
|
||||||
@@ -1001,6 +1020,12 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
this.unsubRequests = downloadStore.subscribe(() => this.requestUpdate());
|
this.unsubRequests = downloadStore.subscribe(() => this.requestUpdate());
|
||||||
void downloadStore.init().then(() => this.requestUpdate());
|
void downloadStore.init().then(() => this.requestUpdate());
|
||||||
|
|
||||||
|
// The count behind a partly-held album lands a frame after the
|
||||||
|
// cards do, since the store batches a screenful into one query.
|
||||||
|
this.unsubCompleteness = completenessStore.subscribe(() =>
|
||||||
|
this.requestUpdate(),
|
||||||
|
);
|
||||||
|
|
||||||
// A background discography fetch (top tracks / top releases for an
|
// A background discography fetch (top tracks / top releases for an
|
||||||
// artist that wasn't indexed yet) finished — re-fetch those two
|
// artist that wasn't indexed yet) finished — re-fetch those two
|
||||||
// sections, once per artist, so they fill in without the initial
|
// sections, once per artist, so they fill in without the initial
|
||||||
@@ -1039,6 +1064,8 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
super.disconnectedCallback();
|
super.disconnectedCallback();
|
||||||
this.unsubRequests?.();
|
this.unsubRequests?.();
|
||||||
this.unsubRequests = null;
|
this.unsubRequests = null;
|
||||||
|
this.unsubCompleteness?.();
|
||||||
|
this.unsubCompleteness = null;
|
||||||
this.unsubDiscogReady?.();
|
this.unsubDiscogReady?.();
|
||||||
this.unsubSimilarReady?.();
|
this.unsubSimilarReady?.();
|
||||||
if (this.discogFallbackTimer) clearTimeout(this.discogFallbackTimer);
|
if (this.discogFallbackTimer) clearTimeout(this.discogFallbackTimer);
|
||||||
@@ -1567,10 +1594,6 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
this.catalogPending = false;
|
this.catalogPending = false;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Populate libraryMBIDs from the inLibrary flag (already
|
|
||||||
// set by the backend via local_release_group_id cross-ref).
|
|
||||||
this.checkLibrary();
|
|
||||||
|
|
||||||
// Batch-resolve cover art for discography (lower priority — loaded after top sections).
|
// Batch-resolve cover art for discography (lower priority — loaded after top sections).
|
||||||
void this.batchResolveThumbnails(
|
void this.batchResolveThumbnails(
|
||||||
rgs?.map((r) => ({ mbid: r.mbid, albumName: r.title, artistName: r.artistCredit }))
|
rgs?.map((r) => ({ mbid: r.mbid, albumName: r.title, artistName: r.artistCredit }))
|
||||||
@@ -1897,23 +1920,6 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private checkLibrary() {
|
|
||||||
// Backend now populates `inLibrary` directly on each MBReleaseGroup
|
|
||||||
// via the local_release_group_id cross-reference column. Just read it.
|
|
||||||
let updated = false;
|
|
||||||
|
|
||||||
for (const rg of this.releaseGroups) {
|
|
||||||
if (rg.mbid && rg.inLibrary && !this.libraryMBIDs.has(rg.mbid)) {
|
|
||||||
this.libraryMBIDs.add(rg.mbid);
|
|
||||||
updated = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (updated) {
|
|
||||||
this.requestUpdate();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* ── Playback ── */
|
/* ── Playback ── */
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@@ -2009,11 +2015,14 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
|
|
||||||
/**
|
/**
|
||||||
* File path for one top track, resolved by recording MBID — the
|
* File path for one top track, resolved by recording MBID — the
|
||||||
* same key `inLibrary`/`localId` were set from. Works whether or
|
* same key `localId` was set from. Works whether or not the
|
||||||
* not the containing release itself matched a local album.
|
* containing release itself matched a local album.
|
||||||
|
*
|
||||||
|
* Gated on the same answer the row is drawn from, or a row drawn
|
||||||
|
* dimmed and `aria-disabled` would still try to play and fail.
|
||||||
*/
|
*/
|
||||||
private async trackFilePath(track: LBTopRecording): Promise<string | null> {
|
private async trackFilePath(track: LBTopRecording): Promise<string | null> {
|
||||||
if (!(track.inLibrary || track.localId) || !track.recordingMbid) return null;
|
if (!isOwned(track) || !track.recordingMbid) return null;
|
||||||
|
|
||||||
const libraryID = libraryStore.getSelectedLibraryId() ?? 0;
|
const libraryID = libraryStore.getSelectedLibraryId() ?? 0;
|
||||||
const byMBID = await dictByName(
|
const byMBID = await dictByName(
|
||||||
@@ -2057,7 +2066,7 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
}
|
}
|
||||||
|
|
||||||
private isTrackOwned(track: LBTopRecording): boolean {
|
private isTrackOwned(track: LBTopRecording): boolean {
|
||||||
return Boolean(track.inLibrary || track.localId);
|
return isOwned(track);
|
||||||
}
|
}
|
||||||
|
|
||||||
private onTrackRowDblClick(track: LBTopRecording): void {
|
private onTrackRowDblClick(track: LBTopRecording): void {
|
||||||
@@ -2100,7 +2109,7 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
mbid: rg.releaseGroupMbid || '',
|
mbid: rg.releaseGroupMbid || '',
|
||||||
localId: rg.localId ?? 0,
|
localId: rg.localId ?? 0,
|
||||||
title: rg.title,
|
title: rg.title,
|
||||||
owned: Boolean(rg.inLibrary || rg.localId),
|
owned: isOwned(rg),
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -2120,10 +2129,12 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
mbid: isLocal ? '' : rg.mbid || '',
|
mbid: isLocal ? '' : rg.mbid || '',
|
||||||
localId: Number.isFinite(localId) ? localId : 0,
|
localId: Number.isFinite(localId) ? localId : 0,
|
||||||
title: rg.title,
|
title: rg.title,
|
||||||
owned:
|
// The same answer the menu gates Play on, which is the
|
||||||
this.libraryMBIDs.has(rg.mbid) ||
|
// point: this used to be `inLibrary` too, so a card could
|
||||||
Boolean(rg.inLibrary) ||
|
// report itself owned, be offered no Play (that item is
|
||||||
localId > 0,
|
// gated on the local id) and be offered no request either
|
||||||
|
// (that one is gated on *not* owned).
|
||||||
|
owned: localId > 0,
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -2674,7 +2685,7 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
@click=${() => this.onContextMenuAction('add-to-queue')}
|
@click=${() => this.onContextMenuAction('add-to-queue')}
|
||||||
@mouseenter=${() => this.ctxMenu.closePlaylistSubmenu()}
|
@mouseenter=${() => this.ctxMenu.closePlaylistSubmenu()}
|
||||||
>
|
>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_QUEUE}></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
<wa-dropdown-item
|
<wa-dropdown-item
|
||||||
@@ -2693,7 +2704,7 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
void this.openPlaylistSubmenu(true);
|
void this.openPlaylistSubmenu(true);
|
||||||
}}
|
}}
|
||||||
>
|
>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_PLAYLIST}></wa-icon>
|
||||||
Add to Playlist
|
Add to Playlist
|
||||||
<span class="submenu-arrow">▶</span>
|
<span class="submenu-arrow">▶</span>
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
@@ -2737,7 +2748,7 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
Play
|
Play
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
<wa-dropdown-item @click=${() => void this.onReleaseAction('add-to-queue')}>
|
<wa-dropdown-item @click=${() => void this.onReleaseAction('add-to-queue')}>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_QUEUE}></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
<wa-dropdown-item @click=${() => void this.onReleaseAction('play-next')}>
|
<wa-dropdown-item @click=${() => void this.onReleaseAction('play-next')}>
|
||||||
@@ -2751,9 +2762,9 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
<wa-dropdown-item @click=${() => void this.onReleaseRequestToggle()}>
|
<wa-dropdown-item @click=${() => void this.onReleaseRequestToggle()}>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name=${requested ? 'xmark' : 'bookmark'}
|
name=${requested ? ICON_REQUESTED : ICON_CAN_REQUEST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
${requested ? 'Cancel Request' : 'Want This'}
|
${requested ? 'Cancel Request' : 'Request This'}
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
`
|
`
|
||||||
: nothing}
|
: nothing}
|
||||||
@@ -2789,9 +2800,15 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
appearance=${request ? 'filled' : 'outlined'}
|
appearance=${request ? 'filled' : 'outlined'}
|
||||||
@click=${() => void this.toggleFollow(request?.id)}
|
@click=${() => void this.toggleFollow(request?.id)}
|
||||||
>
|
>
|
||||||
|
<!-- This was bookmark-check, which is not in
|
||||||
|
names.txt and so has rendered the missing-icon
|
||||||
|
fallback — a circled question mark — on every
|
||||||
|
followed artist since it was written. A
|
||||||
|
backtick around that name would end this
|
||||||
|
template literal, which is why there is none. -->
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="start"
|
slot="start"
|
||||||
name=${request ? 'bookmark-check' : 'bookmark'}
|
name=${request ? ICON_REQUESTED : ICON_CAN_REQUEST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
${request ? 'Following' : 'Follow for new releases'}
|
${request ? 'Following' : 'Follow for new releases'}
|
||||||
</wa-button>
|
</wa-button>
|
||||||
@@ -2932,15 +2949,20 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
<div class="top-section-col top-section-col-tracks">
|
<div class="top-section-col top-section-col-tracks">
|
||||||
<h3 class="section-header">Top Tracks</h3>
|
<h3 class="section-header">Top Tracks</h3>
|
||||||
<div class="track-list">
|
<div class="track-list">
|
||||||
${tracks.map(
|
${tracks.map((t, i) => {
|
||||||
(t, i) => html`
|
const owned = this.isTrackOwned(t);
|
||||||
|
|
||||||
|
return html`
|
||||||
<div
|
<div
|
||||||
class=${classMap({ 'track-item': true, owned: this.isTrackOwned(t) })}
|
class=${classMap({
|
||||||
|
'track-item': true,
|
||||||
|
owned,
|
||||||
|
unowned: !owned,
|
||||||
|
})}
|
||||||
tabindex="0"
|
tabindex="0"
|
||||||
role="button"
|
role="button"
|
||||||
aria-label=${this.isTrackOwned(t)
|
aria-disabled=${owned ? 'false' : 'true'}
|
||||||
? `Play “${t.trackName}”`
|
aria-label=${ownershipLabel(owned, 'Play', t.trackName, 'track')}
|
||||||
: `${t.trackName} — not in your library`}
|
|
||||||
@dblclick=${() => this.onTrackRowDblClick(t)}
|
@dblclick=${() => this.onTrackRowDblClick(t)}
|
||||||
@contextmenu=${(e: MouseEvent) => this.onTrackContextMenu(e, t)}
|
@contextmenu=${(e: MouseEvent) => this.onTrackContextMenu(e, t)}
|
||||||
@keydown=${(e: KeyboardEvent) => this.onTrackRowKeydown(e, t)}
|
@keydown=${(e: KeyboardEvent) => this.onTrackRowKeydown(e, t)}
|
||||||
@@ -2965,16 +2987,18 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
<span class="track-listens">
|
<span class="track-listens">
|
||||||
${formatListenCount(t.totalListenCount)} plays
|
${formatListenCount(t.totalListenCount)} plays
|
||||||
</span>
|
</span>
|
||||||
<library-status-indicator
|
${owned
|
||||||
status=${libraryStatusFor(Boolean(t.inLibrary || t.localId), t.recordingMbid)}
|
? nothing
|
||||||
entity-type="track"
|
: html`<library-status-indicator
|
||||||
label=${t.trackName}
|
status=${libraryStatusFor(false, t.recordingMbid)}
|
||||||
request-mbid=${t.recordingMbid}
|
entity-type="track"
|
||||||
request-artist=${t.artistName ?? ''}
|
label=${t.trackName}
|
||||||
></library-status-indicator>
|
request-mbid=${t.recordingMbid}
|
||||||
|
request-artist=${t.artistName ?? ''}
|
||||||
|
></library-status-indicator>`}
|
||||||
</div>
|
</div>
|
||||||
`,
|
`;
|
||||||
)}
|
})}
|
||||||
</div>
|
</div>
|
||||||
${canExpandTracks
|
${canExpandTracks
|
||||||
? html`
|
? html`
|
||||||
@@ -3045,10 +3069,16 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
private renderTopReleaseCard(rg: LBTopReleaseGroup) {
|
private renderTopReleaseCard(rg: LBTopReleaseGroup) {
|
||||||
const artURL = this.thumbnailURLs.get(rg.releaseGroupMbid) || '';
|
const artURL = this.thumbnailURLs.get(rg.releaseGroupMbid) || '';
|
||||||
const target = this.topReleaseTarget(rg);
|
const target = this.topReleaseTarget(rg);
|
||||||
|
const owned = target.owned;
|
||||||
|
const badge = albumBadgeFor(
|
||||||
|
{ localId: target.localId },
|
||||||
|
rg.releaseGroupMbid,
|
||||||
|
);
|
||||||
|
|
||||||
return html`
|
return html`
|
||||||
<div
|
<div
|
||||||
class="top-release-card"
|
class=${classMap({ 'top-release-card': true, unowned: !owned })}
|
||||||
|
aria-label=${ownershipLabel(owned, 'Album', rg.title, 'album')}
|
||||||
@click=${() => this.navigateToTopRelease(rg)}
|
@click=${() => this.navigateToTopRelease(rg)}
|
||||||
role="button"
|
role="button"
|
||||||
tabindex="0"
|
tabindex="0"
|
||||||
@@ -3080,14 +3110,18 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
<div class="top-release-meta-text">
|
<div class="top-release-meta-text">
|
||||||
${rg.date ? html`<span>${extractYear(rg.date)}</span>` : nothing}
|
${rg.date ? html`<span>${extractYear(rg.date)}</span>` : nothing}
|
||||||
</div>
|
</div>
|
||||||
<library-status-indicator
|
${badge.status === 'in-library'
|
||||||
status=${libraryStatusFor(Boolean(rg.inLibrary || rg.localId), rg.releaseGroupMbid)}
|
? nothing
|
||||||
entity-type="album"
|
: html`<library-status-indicator
|
||||||
label=${rg.title}
|
status=${badge.status}
|
||||||
request-mbid=${rg.releaseGroupMbid}
|
owned=${badge.owned}
|
||||||
request-artist=${this.artist?.name ?? ''}
|
expected=${badge.expected}
|
||||||
size="18"
|
entity-type="album"
|
||||||
></library-status-indicator>
|
label=${rg.title}
|
||||||
|
request-mbid=${rg.releaseGroupMbid}
|
||||||
|
request-artist=${this.artist?.name ?? ''}
|
||||||
|
size="18"
|
||||||
|
></library-status-indicator>`}
|
||||||
</div>
|
</div>
|
||||||
</div>
|
</div>
|
||||||
</div>
|
</div>
|
||||||
@@ -3177,14 +3211,15 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
private renderAlbumCard(rg: MBReleaseGroup) {
|
private renderAlbumCard(rg: MBReleaseGroup) {
|
||||||
const artURL = this.thumbnailURLs.get(rg.mbid) || '';
|
const artURL = this.thumbnailURLs.get(rg.mbid) || '';
|
||||||
const year = extractYear(rg.firstReleaseDate);
|
const year = extractYear(rg.firstReleaseDate);
|
||||||
const inLibrary = this.libraryMBIDs.has(rg.mbid) || Boolean(rg.inLibrary);
|
|
||||||
const status = libraryStatusFor(inLibrary, rg.mbid);
|
|
||||||
|
|
||||||
const target = this.albumTarget(rg);
|
const target = this.albumTarget(rg);
|
||||||
|
const owned = target.owned;
|
||||||
|
const badge = albumBadgeFor({ localId: target.localId }, target.mbid);
|
||||||
|
|
||||||
return html`
|
return html`
|
||||||
<div
|
<div
|
||||||
class="album-card"
|
class=${classMap({ 'album-card': true, unowned: !owned })}
|
||||||
|
aria-label=${ownershipLabel(owned, 'Album', rg.title, 'album')}
|
||||||
@click=${() => this.navigateToAlbum(rg)}
|
@click=${() => this.navigateToAlbum(rg)}
|
||||||
role="button"
|
role="button"
|
||||||
tabindex="0"
|
tabindex="0"
|
||||||
@@ -3213,13 +3248,17 @@ export class ExploreArtistDetails extends LitElement implements ContextMenuHost
|
|||||||
<div class="album-meta-text">
|
<div class="album-meta-text">
|
||||||
${year ? html`<span>${year}</span>` : nothing}
|
${year ? html`<span>${year}</span>` : nothing}
|
||||||
</div>
|
</div>
|
||||||
<library-status-indicator
|
${badge.status === 'in-library'
|
||||||
status=${status}
|
? nothing
|
||||||
entity-type="album"
|
: html`<library-status-indicator
|
||||||
label=${rg.title}
|
status=${badge.status}
|
||||||
request-mbid=${rg.mbid}
|
owned=${badge.owned}
|
||||||
request-artist=${this.artist?.name ?? ''}
|
expected=${badge.expected}
|
||||||
></library-status-indicator>
|
entity-type="album"
|
||||||
|
label=${rg.title}
|
||||||
|
request-mbid=${rg.mbid}
|
||||||
|
request-artist=${this.artist?.name ?? ''}
|
||||||
|
></library-status-indicator>`}
|
||||||
</div>
|
</div>
|
||||||
</div>
|
</div>
|
||||||
`;
|
`;
|
||||||
|
|||||||
@@ -1,5 +1,11 @@
|
|||||||
import { avatarBackground } from '@utils/avatar-color';
|
import { avatarBackground } from '@utils/avatar-color';
|
||||||
import { libraryStatusFor } from '@utils/library-status';
|
import { albumBadgeFor, libraryStatusFor } from '@utils/library-status';
|
||||||
|
import {
|
||||||
|
isOwned,
|
||||||
|
ownershipLabel,
|
||||||
|
unownedStyles,
|
||||||
|
} from '@utils/ownership';
|
||||||
|
import { completenessStore } from '@store/completeness-store';
|
||||||
import { downloadStore } from '@store/download-store';
|
import { downloadStore } from '@store/download-store';
|
||||||
import { LitElement, html, css, nothing } from 'lit';
|
import { LitElement, html, css, nothing } from 'lit';
|
||||||
import { customElement, state, query as litQuery } from 'lit/decorators.js';
|
import { customElement, state, query as litQuery } from 'lit/decorators.js';
|
||||||
@@ -36,6 +42,7 @@ import '@awesome.me/webawesome/dist/components/popup/popup.js';
|
|||||||
import type WaPopup from '@awesome.me/webawesome/dist/components/popup/popup.js';
|
import type WaPopup from '@awesome.me/webawesome/dist/components/popup/popup.js';
|
||||||
import '@awesome.me/webawesome/dist/components/dropdown-item/dropdown-item.js';
|
import '@awesome.me/webawesome/dist/components/dropdown-item/dropdown-item.js';
|
||||||
import { dict, dictByName } from '@utils/binding';
|
import { dict, dictByName } from '@utils/binding';
|
||||||
|
import { ICON_QUEUE } from '@utils/icon-language';
|
||||||
|
|
||||||
/** The region explore's own action failures (play/queue) are rendered in. */
|
/** The region explore's own action failures (play/queue) are rendered in. */
|
||||||
export const ExploreRegion = 'explore';
|
export const ExploreRegion = 'explore';
|
||||||
@@ -170,7 +177,6 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
private searchDebounceTimer?: ReturnType<typeof setTimeout>;
|
private searchDebounceTimer?: ReturnType<typeof setTimeout>;
|
||||||
private thumbnailCache = new LRUMap<string, string>(THUMBNAIL_CACHE_LIMIT);
|
private thumbnailCache = new LRUMap<string, string>(THUMBNAIL_CACHE_LIMIT);
|
||||||
private artistImageCache = new LRUMap<string, string>(ARTIST_IMAGE_CACHE_LIMIT);
|
private artistImageCache = new LRUMap<string, string>(ARTIST_IMAGE_CACHE_LIMIT);
|
||||||
private libraryMBIDs = new Set<string>();
|
|
||||||
|
|
||||||
constructor() {
|
constructor() {
|
||||||
super();
|
super();
|
||||||
@@ -225,6 +231,7 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
srOnly,
|
srOnly,
|
||||||
exploreLinkStyles,
|
exploreLinkStyles,
|
||||||
contextMenuStyles,
|
contextMenuStyles,
|
||||||
|
unownedStyles,
|
||||||
css`
|
css`
|
||||||
:host {
|
:host {
|
||||||
display: block;
|
display: block;
|
||||||
@@ -811,6 +818,13 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
// Explore should not pay for it.
|
// Explore should not pay for it.
|
||||||
this.whileActive(downloadStore.subscribe(() => this.requestUpdate()));
|
this.whileActive(downloadStore.subscribe(() => this.requestUpdate()));
|
||||||
void downloadStore.init().then(() => this.requestUpdate());
|
void downloadStore.init().then(() => this.requestUpdate());
|
||||||
|
|
||||||
|
// How much of an owned album is here arrives a frame after the
|
||||||
|
// cards do — the store coalesces a screenful into one query —
|
||||||
|
// so a card that turns out to be 9 of 12 repaints when the
|
||||||
|
// answer lands rather than showing a plain tick until something
|
||||||
|
// else happens to re-render the grid.
|
||||||
|
this.whileActive(completenessStore.subscribe(() => this.requestUpdate()));
|
||||||
}
|
}
|
||||||
|
|
||||||
/** A debounced search that lands after the user has left the page is
|
/** A debounced search that lands after the user has left the page is
|
||||||
@@ -1082,7 +1096,6 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
this.results?.artists ?? [],
|
this.results?.artists ?? [],
|
||||||
this.results?.releaseGroups ?? [],
|
this.results?.releaseGroups ?? [],
|
||||||
);
|
);
|
||||||
this.checkLibrary();
|
|
||||||
} catch (err) {
|
} catch (err) {
|
||||||
if (version !== this.searchVersion) return;
|
if (version !== this.searchVersion) return;
|
||||||
|
|
||||||
@@ -1228,8 +1241,11 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
void this.playAlbum(rg, false);
|
void this.playAlbum(rg, false);
|
||||||
}
|
}
|
||||||
|
|
||||||
private onRecordingRowDblClick(r: { mbid: string; inLibrary: boolean; localId?: number }): void {
|
// The same answer the row is drawn from. It used to accept
|
||||||
if (!r.inLibrary && !r.localId) return;
|
// `inLibrary` as well, so a row drawn dimmed and `aria-disabled`
|
||||||
|
// would still try to play and fail with a notification.
|
||||||
|
private onRecordingRowDblClick(r: { mbid: string; localId?: number }): void {
|
||||||
|
if (!isOwned(r)) return;
|
||||||
|
|
||||||
void this.playRecording(r.mbid);
|
void this.playRecording(r.mbid);
|
||||||
}
|
}
|
||||||
@@ -1342,7 +1358,7 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
Play
|
Play
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
<wa-dropdown-item @click=${() => this.onContextMenuAction('add-to-queue')}>
|
<wa-dropdown-item @click=${() => this.onContextMenuAction('add-to-queue')}>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_QUEUE}></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
<wa-dropdown-item @click=${() => this.onContextMenuAction('play-next')}>
|
<wa-dropdown-item @click=${() => this.onContextMenuAction('play-next')}>
|
||||||
@@ -1509,9 +1525,24 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
if (url) {
|
if (url) {
|
||||||
this.thumbnailCache.set(req.mbid, url);
|
this.thumbnailCache.set(req.mbid, url);
|
||||||
this.requestUpdate();
|
this.requestUpdate();
|
||||||
|
|
||||||
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// An empty answer is not necessarily "there
|
||||||
|
// is no art" — a slow Internet Archive node
|
||||||
|
// is answered by a timeout, which looks
|
||||||
|
// exactly the same from here. Drop the
|
||||||
|
// in-flight marker so the next time this
|
||||||
|
// release group is on screen it is asked
|
||||||
|
// again; the backend records a genuine 404
|
||||||
|
// on disk and answers that one instantly,
|
||||||
|
// so a real miss costs nothing to re-ask.
|
||||||
|
this.thumbnailCache.delete(req.mbid);
|
||||||
})
|
})
|
||||||
.catch(() => {});
|
.catch(() => {
|
||||||
|
this.thumbnailCache.delete(req.mbid);
|
||||||
|
});
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
.catch(() => {
|
.catch(() => {
|
||||||
@@ -1649,42 +1680,6 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
|
||||||
* Check which result MBIDs exist in the local library.
|
|
||||||
*/
|
|
||||||
private checkLibrary() {
|
|
||||||
if (!this.results) return;
|
|
||||||
|
|
||||||
// Backend now populates `inLibrary` directly on each MB result
|
|
||||||
// via the local_*_id cross-reference columns. Just read those.
|
|
||||||
let updated = false;
|
|
||||||
|
|
||||||
for (const a of this.results.artists ?? []) {
|
|
||||||
if (a.mbid && a.inLibrary && !this.libraryMBIDs.has(a.mbid)) {
|
|
||||||
this.libraryMBIDs.add(a.mbid);
|
|
||||||
updated = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for (const rg of this.results.releaseGroups ?? []) {
|
|
||||||
if (rg.mbid && rg.inLibrary && !this.libraryMBIDs.has(rg.mbid)) {
|
|
||||||
this.libraryMBIDs.add(rg.mbid);
|
|
||||||
updated = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for (const r of this.results.recordings ?? []) {
|
|
||||||
if (r.mbid && r.inLibrary && !this.libraryMBIDs.has(r.mbid)) {
|
|
||||||
this.libraryMBIDs.add(r.mbid);
|
|
||||||
updated = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (updated) {
|
|
||||||
this.requestUpdate();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* ── Navigation ── */
|
/* ── Navigation ── */
|
||||||
|
|
||||||
private navigateToArtist(artist: MBArtist) {
|
private navigateToArtist(artist: MBArtist) {
|
||||||
@@ -2091,12 +2086,16 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
: nothing}
|
: nothing}
|
||||||
<div class="horizontal-row">
|
<div class="horizontal-row">
|
||||||
${artists.map((a) => {
|
${artists.map((a) => {
|
||||||
|
const owned = isOwned(a);
|
||||||
|
const name = a.englishName || a.name;
|
||||||
|
|
||||||
return html`
|
return html`
|
||||||
<div
|
<div
|
||||||
class="artist-card"
|
class=${classMap({ 'artist-card': true, unowned: !owned })}
|
||||||
@click=${() => this.navigateToArtist(a)}
|
@click=${() => this.navigateToArtist(a)}
|
||||||
role="button"
|
role="button"
|
||||||
tabindex="0"
|
tabindex="0"
|
||||||
|
aria-label=${ownershipLabel(owned, 'Artist', name, 'artist')}
|
||||||
@keydown=${(e: KeyboardEvent) => {
|
@keydown=${(e: KeyboardEvent) => {
|
||||||
if (e.key === 'Enter' || e.key === ' ') {
|
if (e.key === 'Enter' || e.key === ' ') {
|
||||||
e.preventDefault();
|
e.preventDefault();
|
||||||
@@ -2155,11 +2154,17 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
const artURL = this.thumbnailCache.get(rg.mbid) || '';
|
const artURL = this.thumbnailCache.get(rg.mbid) || '';
|
||||||
const year = extractYear(rg.firstReleaseDate);
|
const year = extractYear(rg.firstReleaseDate);
|
||||||
|
|
||||||
const owned = Boolean(rg.localId);
|
const owned = isOwned(rg);
|
||||||
|
const badge = albumBadgeFor(rg, rg.mbid);
|
||||||
|
|
||||||
return html`
|
return html`
|
||||||
<div
|
<div
|
||||||
class=${classMap({ 'album-card': true, owned })}
|
class=${classMap({
|
||||||
|
'album-card': true,
|
||||||
|
owned,
|
||||||
|
unowned: !owned,
|
||||||
|
})}
|
||||||
|
aria-label=${ownershipLabel(owned, 'Album', rg.title, 'album')}
|
||||||
@click=${() => this.navigateToAlbum(rg)}
|
@click=${() => this.navigateToAlbum(rg)}
|
||||||
@dblclick=${() => this.onAlbumCardDblClick(rg)}
|
@dblclick=${() => this.onAlbumCardDblClick(rg)}
|
||||||
@contextmenu=${(e: MouseEvent) =>
|
@contextmenu=${(e: MouseEvent) =>
|
||||||
@@ -2212,13 +2217,17 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
: nothing}
|
: nothing}
|
||||||
${year ? html`<span>${year}</span>` : nothing}
|
${year ? html`<span>${year}</span>` : nothing}
|
||||||
</div>
|
</div>
|
||||||
<library-status-indicator
|
${badge.status === 'in-library'
|
||||||
status=${libraryStatusFor(this.libraryMBIDs.has(rg.mbid) || Boolean(rg.inLibrary), rg.mbid)}
|
? nothing
|
||||||
entity-type="album"
|
: html`<library-status-indicator
|
||||||
label=${rg.title}
|
status=${badge.status}
|
||||||
request-mbid=${rg.mbid}
|
owned=${badge.owned}
|
||||||
request-artist=${rg.artistCredit ?? ''}
|
expected=${badge.expected}
|
||||||
></library-status-indicator>
|
entity-type="album"
|
||||||
|
label=${rg.title}
|
||||||
|
request-mbid=${rg.mbid}
|
||||||
|
request-artist=${rg.artistCredit ?? ''}
|
||||||
|
></library-status-indicator>`}
|
||||||
</div>
|
</div>
|
||||||
</div>
|
</div>
|
||||||
`;
|
`;
|
||||||
@@ -2233,12 +2242,20 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
<section>
|
<section>
|
||||||
<h3 class="section-header">Tracks</h3>
|
<h3 class="section-header">Tracks</h3>
|
||||||
<div class="track-list">
|
<div class="track-list">
|
||||||
${recordings.map(
|
${recordings.map((r) => {
|
||||||
(r) => html`
|
const owned = isOwned(r);
|
||||||
|
|
||||||
|
return html`
|
||||||
<div
|
<div
|
||||||
class=${classMap({ 'track-item': true, owned: Boolean(r.inLibrary || r.localId) })}
|
class=${classMap({
|
||||||
|
'track-item': true,
|
||||||
|
owned,
|
||||||
|
unowned: !owned,
|
||||||
|
})}
|
||||||
role="button"
|
role="button"
|
||||||
tabindex="0"
|
tabindex="0"
|
||||||
|
aria-disabled=${owned ? 'false' : 'true'}
|
||||||
|
aria-label=${ownershipLabel(owned, 'Play', r.title, 'track')}
|
||||||
@dblclick=${() => this.onRecordingRowDblClick(r)}
|
@dblclick=${() => this.onRecordingRowDblClick(r)}
|
||||||
@contextmenu=${(e: MouseEvent) =>
|
@contextmenu=${(e: MouseEvent) =>
|
||||||
this.onExploreContextMenu(e, {
|
this.onExploreContextMenu(e, {
|
||||||
@@ -2275,16 +2292,18 @@ export class ExploreView extends ViewLifecycleMixin(LitElement) implements Conte
|
|||||||
? html`<span class="track-duration">${formatDuration(r.length)}</span>`
|
? html`<span class="track-duration">${formatDuration(r.length)}</span>`
|
||||||
: nothing}
|
: nothing}
|
||||||
</div>
|
</div>
|
||||||
<library-status-indicator
|
${owned
|
||||||
status=${libraryStatusFor(this.libraryMBIDs.has(r.mbid) || Boolean(r.inLibrary), r.mbid)}
|
? nothing
|
||||||
entity-type="track"
|
: html`<library-status-indicator
|
||||||
label=${r.title}
|
status=${libraryStatusFor(false, r.mbid)}
|
||||||
request-mbid=${r.mbid}
|
entity-type="track"
|
||||||
request-artist=${r.artistCredit ?? ''}
|
label=${r.title}
|
||||||
></library-status-indicator>
|
request-mbid=${r.mbid}
|
||||||
|
request-artist=${r.artistCredit ?? ''}
|
||||||
|
></library-status-indicator>`}
|
||||||
</div>
|
</div>
|
||||||
`,
|
`;
|
||||||
)}
|
})}
|
||||||
</div>
|
</div>
|
||||||
</section>
|
</section>
|
||||||
`;
|
`;
|
||||||
|
|||||||
@@ -10,6 +10,7 @@ import type {
|
|||||||
VisibilityChangedEvent,
|
VisibilityChangedEvent,
|
||||||
} from '@lit-labs/virtualizer';
|
} from '@lit-labs/virtualizer';
|
||||||
import { grid } from '@lit-labs/virtualizer/layouts/grid.js';
|
import { grid } from '@lit-labs/virtualizer/layouts/grid.js';
|
||||||
|
import { gridSpacingFor } from '@utils/grid-spacing';
|
||||||
import {
|
import {
|
||||||
GetFilePathsByGenres,
|
GetFilePathsByGenres,
|
||||||
} from '@go/library/library.js';
|
} from '@go/library/library.js';
|
||||||
@@ -34,6 +35,10 @@ import type WaPopup from '@awesome.me/webawesome/dist/components/popup/popup.js'
|
|||||||
import '@awesome.me/webawesome/dist/components/dropdown-item/dropdown-item.js';
|
import '@awesome.me/webawesome/dist/components/dropdown-item/dropdown-item.js';
|
||||||
import '@components/playlist-picker/playlist-picker.js';
|
import '@components/playlist-picker/playlist-picker.js';
|
||||||
import { dictByName } from '@utils/binding';
|
import { dictByName } from '@utils/binding';
|
||||||
|
import {
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
ICON_QUEUE,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
/** Pixels to change card width per scroll tick. */
|
/** Pixels to change card width per scroll tick. */
|
||||||
const ZOOM_STEP = 16;
|
const ZOOM_STEP = 16;
|
||||||
@@ -155,8 +160,6 @@ export class GenresView
|
|||||||
|
|
||||||
// ----- Grid spacing constants -----
|
// ----- Grid spacing constants -----
|
||||||
|
|
||||||
private static readonly GRID_GAP = 8;
|
|
||||||
private static readonly GRID_PADDING = 8;
|
|
||||||
private static readonly CARD_PADDING = 5;
|
private static readonly CARD_PADDING = 5;
|
||||||
|
|
||||||
private get imageSize(): number {
|
private get imageSize(): number {
|
||||||
@@ -185,20 +188,41 @@ export class GenresView
|
|||||||
private createGridLayout() {
|
private createGridLayout() {
|
||||||
const w = this.cardSize ?? CARD_SIZE_DEFAULT;
|
const w = this.cardSize ?? CARD_SIZE_DEFAULT;
|
||||||
const h = w + this.cardTextHeight;
|
const h = w + this.cardTextHeight;
|
||||||
const gap = GenresView.GRID_GAP;
|
|
||||||
const pad = GenresView.GRID_PADDING;
|
// One number for the gap, the row gap and the padding: whatever
|
||||||
|
// a row could not spend on another card, shared out equally, so
|
||||||
|
// the outside is never wider than the inside. See
|
||||||
|
// `utils/grid-spacing.ts`.
|
||||||
|
const spacing = this.spacingFor(this.containerWidth);
|
||||||
|
|
||||||
|
this.lastLayoutSpacing = spacing;
|
||||||
|
|
||||||
return grid({
|
return grid({
|
||||||
itemSize: {
|
itemSize: {
|
||||||
width: `${w}px`,
|
width: `${w}px`,
|
||||||
height: `${h}px`,
|
height: `${h}px`,
|
||||||
},
|
},
|
||||||
gap: `${gap}px`,
|
gap: `${spacing}px`,
|
||||||
padding: `${pad}px`,
|
padding: `${spacing}px`,
|
||||||
justify: 'center',
|
justify: 'start',
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/** The width the grid lays itself out in. */
|
||||||
|
private get containerWidth(): number {
|
||||||
|
return (
|
||||||
|
this.renderRoot?.querySelector<HTMLElement>(
|
||||||
|
'.grid-scroll-container',
|
||||||
|
)?.clientWidth ||
|
||||||
|
this.clientWidth ||
|
||||||
|
0
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
|
private spacingFor(width: number): number {
|
||||||
|
return gridSpacingFor(width, this.cardSize);
|
||||||
|
}
|
||||||
|
|
||||||
/** Sort key and direction for the genre grid (H-19: it had none). */
|
/** Sort key and direction for the genre grid (H-19: it had none). */
|
||||||
@state()
|
@state()
|
||||||
private sortField: 'name' | 'tracks' = 'name';
|
private sortField: 'name' | 'tracks' = 'name';
|
||||||
@@ -483,6 +507,8 @@ export class GenresView
|
|||||||
override disconnectedCallback() {
|
override disconnectedCallback() {
|
||||||
super.disconnectedCallback();
|
super.disconnectedCallback();
|
||||||
this.detachWheelListener();
|
this.detachWheelListener();
|
||||||
|
this.gridResizeObserver?.disconnect();
|
||||||
|
this.gridResizeObserver = null;
|
||||||
}
|
}
|
||||||
|
|
||||||
/** See artists-view: off-screen the grid cannot be scrolled, and
|
/** See artists-view: off-screen the grid cannot be scrolled, and
|
||||||
@@ -737,10 +763,34 @@ export class GenresView
|
|||||||
* ================================================================ */
|
* ================================================================ */
|
||||||
|
|
||||||
private lastLayoutWidth = 0;
|
private lastLayoutWidth = 0;
|
||||||
|
private lastLayoutSpacing = 0;
|
||||||
|
|
||||||
|
/** Watches the scroller so a window resize rebuilds the layout:
|
||||||
|
* the spacing is derived from its width, and nothing else asks
|
||||||
|
* this view to update when only that changes. */
|
||||||
|
private gridResizeObserver: ResizeObserver | null = null;
|
||||||
|
|
||||||
|
private observeGridWidth() {
|
||||||
|
const container =
|
||||||
|
this.renderRoot?.querySelector<HTMLElement>(
|
||||||
|
'.grid-scroll-container',
|
||||||
|
);
|
||||||
|
|
||||||
|
if (!container || this.gridResizeObserver) return;
|
||||||
|
|
||||||
|
this.gridResizeObserver = new ResizeObserver(() =>
|
||||||
|
this.requestUpdate(),
|
||||||
|
);
|
||||||
|
this.gridResizeObserver.observe(container);
|
||||||
|
}
|
||||||
|
|
||||||
private updateGridLayout() {
|
private updateGridLayout() {
|
||||||
|
this.observeGridWidth();
|
||||||
|
|
||||||
if (
|
if (
|
||||||
this.cardSize === this.lastLayoutWidth
|
this.cardSize === this.lastLayoutWidth &&
|
||||||
|
this.lastLayoutSpacing ===
|
||||||
|
this.spacingFor(this.containerWidth)
|
||||||
) {
|
) {
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
@@ -1165,7 +1215,7 @@ export class GenresView
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_QUEUE}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
@@ -1211,7 +1261,7 @@ export class GenresView
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_PLAYLIST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Playlist
|
Add to Playlist
|
||||||
<span
|
<span
|
||||||
|
|||||||
@@ -4,6 +4,11 @@ import '@awesome.me/webawesome/dist/components/icon/icon.js';
|
|||||||
import { toggleRequest } from '@utils/library-status';
|
import { toggleRequest } from '@utils/library-status';
|
||||||
import { notificationStore } from '@store/notification-store';
|
import { notificationStore } from '@store/notification-store';
|
||||||
import { describeError } from '@utils/describe-error';
|
import { describeError } from '@utils/describe-error';
|
||||||
|
import {
|
||||||
|
ICON_CAN_REQUEST,
|
||||||
|
ICON_IN_LIBRARY,
|
||||||
|
ICON_REQUESTED,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Library status for an entity (artist, album, or track).
|
* Library status for an entity (artist, album, or track).
|
||||||
@@ -48,7 +53,7 @@ export type LibraryStatus =
|
|||||||
*
|
*
|
||||||
* Colours and glyphs:
|
* Colours and glyphs:
|
||||||
* - in-library → green circle, check mark
|
* - in-library → green circle, check mark
|
||||||
* - queued → amber circle, hourglass
|
* - queued → amber circle, bookmark ("on your list")
|
||||||
* - not-in-library → grey circle, plus sign
|
* - not-in-library → grey circle, plus sign
|
||||||
*
|
*
|
||||||
* Usage:
|
* Usage:
|
||||||
@@ -241,14 +246,32 @@ export class LibraryStatusIndicator extends LitElement {
|
|||||||
}
|
}
|
||||||
`;
|
`;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* The glyph for each state.
|
||||||
|
*
|
||||||
|
* `queued` is a **bookmark**, not the hourglass it used to be. An
|
||||||
|
* hourglass says "wait, this is under way", which overstates what a
|
||||||
|
* request is: nothing may be downloading, nothing may ever be found,
|
||||||
|
* and the user can leave one sitting on the list indefinitely. A
|
||||||
|
* bookmark says the honest thing — it is on your list.
|
||||||
|
*
|
||||||
|
* The *other* state is the outline of that same bookmark, not a
|
||||||
|
* plus. Two states of one toggle have to read as each other's
|
||||||
|
* opposite, and a plus and a bookmark do not — this badge showed a
|
||||||
|
* plus on the same page as a "Request this" button already using
|
||||||
|
* the outline/solid pair, forty pixels away. That is the fault
|
||||||
|
* `utils/library-status.ts` was written for, one layer down: it
|
||||||
|
* made the two agree on what wanting *means* and left them
|
||||||
|
* disagreeing on what it looks like.
|
||||||
|
*/
|
||||||
private iconName(): string {
|
private iconName(): string {
|
||||||
switch (this.status) {
|
switch (this.status) {
|
||||||
case 'in-library':
|
case 'in-library':
|
||||||
return 'check';
|
return ICON_IN_LIBRARY;
|
||||||
case 'queued':
|
case 'queued':
|
||||||
return 'hourglass-half';
|
return ICON_REQUESTED;
|
||||||
default:
|
default:
|
||||||
return 'plus';
|
return ICON_CAN_REQUEST;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -274,9 +297,23 @@ export class LibraryStatusIndicator extends LitElement {
|
|||||||
// row to one and nothing to the other, and "Add … to library"
|
// row to one and nothing to the other, and "Add … to library"
|
||||||
// was the old button's promise written into the copy.
|
// was the old button's promise written into the copy.
|
||||||
if (this.actionable) {
|
if (this.actionable) {
|
||||||
return this.status === 'queued'
|
if (this.status === 'queued') {
|
||||||
? `Cancel the request for ${kind}${name}`
|
return `Cancel the request for ${kind}${name}`;
|
||||||
: `Want ${kind}${name}`;
|
}
|
||||||
|
|
||||||
|
// A partly-held album is actionable *and* has a count, and
|
||||||
|
// the count does not survive being named after the action
|
||||||
|
// alone. The `partial` case below says why it matters — a
|
||||||
|
// ring says "some" to a sighted user and nothing to anyone
|
||||||
|
// else — and that argument does not stop applying because
|
||||||
|
// the badge became clickable. This branch used to say only
|
||||||
|
// "Request album X", so the one state the ring exists for
|
||||||
|
// was the one state whose name did not mention it.
|
||||||
|
if (this.status === 'partial') {
|
||||||
|
return `Request the rest of ${kind}${name} — ${this.owned} of ${this.expected} tracks are in your library`;
|
||||||
|
}
|
||||||
|
|
||||||
|
return `Request ${kind}${name}`;
|
||||||
}
|
}
|
||||||
|
|
||||||
switch (this.status) {
|
switch (this.status) {
|
||||||
@@ -354,25 +391,6 @@ export class LibraryStatusIndicator extends LitElement {
|
|||||||
}
|
}
|
||||||
|
|
||||||
const title = this.tooltip();
|
const title = this.tooltip();
|
||||||
const icon = this.iconName()
|
|
||||||
? html`<wa-icon name=${this.iconName()} aria-hidden="true"></wa-icon>`
|
|
||||||
: nothing;
|
|
||||||
|
|
||||||
if (this.actionable) {
|
|
||||||
return html`
|
|
||||||
<button
|
|
||||||
class="badge"
|
|
||||||
type="button"
|
|
||||||
title=${title}
|
|
||||||
aria-label=${title}
|
|
||||||
?disabled=${this.busy}
|
|
||||||
@click=${this.onActivate}
|
|
||||||
@keydown=${this.onKeydown}
|
|
||||||
>
|
|
||||||
${icon}
|
|
||||||
</button>
|
|
||||||
`;
|
|
||||||
}
|
|
||||||
|
|
||||||
// The ring stands in for the icon wherever the icon would go —
|
// The ring stands in for the icon wherever the icon would go —
|
||||||
// including inside the button, because a partly-held album is
|
// including inside the button, because a partly-held album is
|
||||||
|
|||||||
@@ -14,6 +14,7 @@ import { creditStore } from '@store/credit-store';
|
|||||||
import { FavoritesController } from '@store/controllers/favorites-controller';
|
import { FavoritesController } from '@store/controllers/favorites-controller';
|
||||||
import { designTokens } from '../../styles/tokens.css';
|
import { designTokens } from '../../styles/tokens.css';
|
||||||
import { srOnly } from '../../styles/sr-only.css';
|
import { srOnly } from '../../styles/sr-only.css';
|
||||||
|
import { ICON_QUEUE } from '@utils/icon-language';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* What is playing, at the size a phone has room for (plan 016 B2,
|
* What is playing, at the size a phone has room for (plan 016 B2,
|
||||||
@@ -307,7 +308,7 @@ export class NowPlayingView extends LitElement {
|
|||||||
: `Add ${track.title} to ${this.favCtrl.playlistName}`}
|
: `Add ${track.title} to ${this.favCtrl.playlistName}`}
|
||||||
@click=${this.toggleFavorite}
|
@click=${this.toggleFavorite}
|
||||||
>
|
>
|
||||||
<wa-icon name=${this.favCtrl.iconName}></wa-icon>
|
<wa-icon name=${this.favCtrl.iconFor(favorited)}></wa-icon>
|
||||||
</button>
|
</button>
|
||||||
</div>
|
</div>
|
||||||
|
|
||||||
@@ -339,7 +340,7 @@ export class NowPlayingView extends LitElement {
|
|||||||
aria-label="Show the queue"
|
aria-label="Show the queue"
|
||||||
@click=${this.openQueue}
|
@click=${this.openQueue}
|
||||||
>
|
>
|
||||||
<wa-icon name="list"></wa-icon>
|
<wa-icon name=${ICON_QUEUE}></wa-icon>
|
||||||
</button>
|
</button>
|
||||||
</header>
|
</header>
|
||||||
`;
|
`;
|
||||||
|
|||||||
@@ -527,7 +527,7 @@ export class NowPlaying extends LitElement {
|
|||||||
)}
|
)}
|
||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
name=${this.favCtrl.iconName}
|
name=${this.favCtrl.iconFor(isFav)}
|
||||||
variant=${favVariant}
|
variant=${favVariant}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
</button>
|
</button>
|
||||||
|
|||||||
@@ -70,6 +70,10 @@ import {
|
|||||||
} from '@utils/explore-link';
|
} from '@utils/explore-link';
|
||||||
import { designTokens } from '../../styles/tokens.css';
|
import { designTokens } from '../../styles/tokens.css';
|
||||||
import { list } from '@utils/binding';
|
import { list } from '@utils/binding';
|
||||||
|
import {
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
ICON_QUEUE,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
/** One playlist row: the track and its position in the *playlist*,
|
/** One playlist row: the track and its position in the *playlist*,
|
||||||
* which is not its position in the filtered view. */
|
* which is not its position in the filtered view. */
|
||||||
@@ -1358,7 +1362,7 @@ export class PlaylistDetails
|
|||||||
</button>
|
</button>
|
||||||
<div class="playlist-avatar">
|
<div class="playlist-avatar">
|
||||||
<wa-icon
|
<wa-icon
|
||||||
name="list"
|
name=${ICON_PLAYLIST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
</div>
|
</div>
|
||||||
<div class="playlist-info">
|
<div class="playlist-info">
|
||||||
@@ -1665,7 +1669,7 @@ export class PlaylistDetails
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_QUEUE}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Queue
|
Add to Queue
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
@@ -1720,7 +1724,7 @@ export class PlaylistDetails
|
|||||||
>
|
>
|
||||||
<wa-icon
|
<wa-icon
|
||||||
slot="icon"
|
slot="icon"
|
||||||
name="plus"
|
name=${ICON_PLAYLIST}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
Add to Playlist
|
Add to Playlist
|
||||||
<span
|
<span
|
||||||
|
|||||||
@@ -18,6 +18,7 @@ import { notificationStore } from '@store/notification-store';
|
|||||||
import { describeError } from '@utils/describe-error';
|
import { describeError } from '@utils/describe-error';
|
||||||
import type { DuplicateTracksDialog } from '@components/duplicate-tracks-dialog/duplicate-tracks-dialog.js';
|
import type { DuplicateTracksDialog } from '@components/duplicate-tracks-dialog/duplicate-tracks-dialog.js';
|
||||||
import { list } from '@utils/binding';
|
import { list } from '@utils/binding';
|
||||||
|
import { ICON_NEW } from '@utils/icon-language';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* A reusable playlist picker that displays existing playlists
|
* A reusable playlist picker that displays existing playlists
|
||||||
@@ -307,7 +308,7 @@ export class PlaylistPicker extends LitElement {
|
|||||||
`
|
`
|
||||||
: nothing}
|
: nothing}
|
||||||
<wa-dropdown-item @click=${this.handleShowCreate}>
|
<wa-dropdown-item @click=${this.handleShowCreate}>
|
||||||
<wa-icon slot="icon" name="plus"></wa-icon>
|
<wa-icon slot="icon" name=${ICON_NEW}></wa-icon>
|
||||||
New Playlist
|
New Playlist
|
||||||
</wa-dropdown-item>
|
</wa-dropdown-item>
|
||||||
</div>
|
</div>
|
||||||
|
|||||||
@@ -37,6 +37,10 @@ import { ViewLifecycleMixin } from '@utils/view-lifecycle';
|
|||||||
import { FavoritesController } from '@store/controllers/favorites-controller';
|
import { FavoritesController } from '@store/controllers/favorites-controller';
|
||||||
import '@components/duplicate-tracks-dialog/duplicate-tracks-dialog.js';
|
import '@components/duplicate-tracks-dialog/duplicate-tracks-dialog.js';
|
||||||
import type { DuplicateTracksDialog } from '@components/duplicate-tracks-dialog/duplicate-tracks-dialog.js';
|
import type { DuplicateTracksDialog } from '@components/duplicate-tracks-dialog/duplicate-tracks-dialog.js';
|
||||||
|
import {
|
||||||
|
ICON_NEW,
|
||||||
|
ICON_PLAYLIST,
|
||||||
|
} from '@utils/icon-language';
|
||||||
|
|
||||||
const SCROLL_DEBOUNCE_MS = 100;
|
const SCROLL_DEBOUNCE_MS = 100;
|
||||||
|
|
||||||
@@ -1496,7 +1500,7 @@ export class PlaylistView extends ViewLifecycleMixin(LitElement) {
|
|||||||
@dragleave=${this.onNewButtonDragLeave}
|
@dragleave=${this.onNewButtonDragLeave}
|
||||||
@drop=${this.onNewButtonDrop}
|
@drop=${this.onNewButtonDrop}
|
||||||
>
|
>
|
||||||
<wa-icon name="plus"></wa-icon>
|
<wa-icon name=${ICON_NEW}></wa-icon>
|
||||||
New Playlist
|
New Playlist
|
||||||
</button>
|
</button>
|
||||||
<button
|
<button
|
||||||
@@ -1641,10 +1645,10 @@ export class PlaylistView extends ViewLifecycleMixin(LitElement) {
|
|||||||
>
|
>
|
||||||
<div class="drop-zone-icon">
|
<div class="drop-zone-icon">
|
||||||
<wa-icon
|
<wa-icon
|
||||||
name="plus"
|
name=${ICON_NEW}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
</div>
|
</div>
|
||||||
<wa-icon name="list"></wa-icon>
|
<wa-icon name=${ICON_PLAYLIST}></wa-icon>
|
||||||
<p>No playlists yet</p>
|
<p>No playlists yet</p>
|
||||||
<p style="font-size: 12px;">
|
<p style="font-size: 12px;">
|
||||||
Create a playlist or drop
|
Create a playlist or drop
|
||||||
@@ -1666,7 +1670,7 @@ export class PlaylistView extends ViewLifecycleMixin(LitElement) {
|
|||||||
>
|
>
|
||||||
<div class="drop-zone-icon">
|
<div class="drop-zone-icon">
|
||||||
<wa-icon
|
<wa-icon
|
||||||
name="plus"
|
name=${ICON_NEW}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
</div>
|
</div>
|
||||||
<p>
|
<p>
|
||||||
@@ -1701,7 +1705,7 @@ export class PlaylistView extends ViewLifecycleMixin(LitElement) {
|
|||||||
>
|
>
|
||||||
<div class="drop-zone-icon">
|
<div class="drop-zone-icon">
|
||||||
<wa-icon
|
<wa-icon
|
||||||
name="plus"
|
name=${ICON_NEW}
|
||||||
></wa-icon>
|
></wa-icon>
|
||||||
</div>
|
</div>
|
||||||
</li>
|
</li>
|
||||||
@@ -1756,7 +1760,7 @@ export class PlaylistView extends ViewLifecycleMixin(LitElement) {
|
|||||||
${entry.summary.ID === this.favCtrl.playlistId
|
${entry.summary.ID === this.favCtrl.playlistId
|
||||||
? html`<wa-icon
|
? html`<wa-icon
|
||||||
class="playlist-icon"
|
class="playlist-icon"
|
||||||
name=${this.favCtrl.iconName}
|
name=${this.favCtrl.iconFor(true)}
|
||||||
></wa-icon>`
|
></wa-icon>`
|
||||||
: entry.summary.IsSmart
|
: entry.summary.IsSmart
|
||||||
? html`<wa-icon
|
? html`<wa-icon
|
||||||
|
|||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user