Skip to content

Commit 05bfa61

Browse files
authored
Document new behaviour as of AP 3.8 (#395)
1 parent cea3f28 commit 05bfa61

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

_i18n/en/documentation/queue/smart-shuffle.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,4 +7,4 @@ Just like other sorting criteria, smart shuffle can be sorted in ascending or de
77

88
Let's say you have 15 episodes in your queue: 1 from each of podcasts A, B and C, 2 from podcast D and 10 from podcast E. Smart shuffle first takes the podcast with the most episodes (E) and spreads out its episodes in the queue: EE_EE_E_E_EE_EE. It then takes the podcast with the second-most episodes (D) and spreads out those in the available slots: EE_EEDE_EDEE_EE. This continues until we end up with a queue that looks like this: EEBEEDECEDEEAEE.
99

10-
Publication dates play a role both _within_ podcasts (in our example, episodes from podcast E are sorted accordingly) and _between_ podcasts (the episode from podcast B gets an earlier spot than the one from podcast A because the former is more recent).
10+
Publication dates play a role both _within_ podcasts (in our example, episodes from podcast E are sorted accordingly) and _between_ podcasts (the episode from podcast B gets an earlier spot than the one from podcast A because the former is older).

0 commit comments

Comments
 (0)