Queue: move HASH_MULT and Item into the Queue class
This commit is contained in:
parent
d81a9029db
commit
ce57b8b6df
@ -28,13 +28,22 @@
|
||||
#include <assert.h>
|
||||
#include <stdint.h>
|
||||
|
||||
enum {
|
||||
/**
|
||||
* A queue of songs. This is the backend of the playlist: it contains
|
||||
* an ordered list of songs.
|
||||
*
|
||||
* Songs can be addressed in three possible ways:
|
||||
*
|
||||
* - the position in the queue
|
||||
* - the unique id (which stays the same, regardless of moves)
|
||||
* - the order number (which only differs from "position" in random mode)
|
||||
*/
|
||||
struct queue {
|
||||
/**
|
||||
* reserve max_length * QUEUE_HASH_MULT elements in the id
|
||||
* number space
|
||||
*/
|
||||
QUEUE_HASH_MULT = 4,
|
||||
};
|
||||
static constexpr unsigned QUEUE_HASH_MULT = 4;
|
||||
|
||||
/**
|
||||
* One element of the queue: basically a song plus some queue specific
|
||||
@ -57,17 +66,6 @@ struct queue_item {
|
||||
uint8_t priority;
|
||||
};
|
||||
|
||||
/**
|
||||
* A queue of songs. This is the backend of the playlist: it contains
|
||||
* an ordered list of songs.
|
||||
*
|
||||
* Songs can be addressed in three possible ways:
|
||||
*
|
||||
* - the position in the queue
|
||||
* - the unique id (which stays the same, regardless of moves)
|
||||
* - the order number (which only differs from "position" in random mode)
|
||||
*/
|
||||
struct queue {
|
||||
/** configured maximum length of the queue */
|
||||
unsigned max_length;
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user