322b061632
From now on, struct Song will be used by the database only, and DetachedSong will be used by everybody else. DetachedSong is easier to use, but Song has lower overhead.
103 lines
2.8 KiB
C++
103 lines
2.8 KiB
C++
/*
|
|
* Copyright (C) 2003-2013 The Music Player Daemon Project
|
|
* http://www.musicpd.org
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along
|
|
* with this program; if not, write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
|
|
#include "config.h"
|
|
#include "QueuePrint.hxx"
|
|
#include "Queue.hxx"
|
|
#include "SongFilter.hxx"
|
|
#include "SongPrint.hxx"
|
|
#include "Client.hxx"
|
|
|
|
/**
|
|
* Send detailed information about a range of songs in the queue to a
|
|
* client.
|
|
*
|
|
* @param client the client which has requested information
|
|
* @param start the index of the first song (including)
|
|
* @param end the index of the last song (excluding)
|
|
*/
|
|
static void
|
|
queue_print_song_info(Client &client, const queue &queue,
|
|
unsigned position)
|
|
{
|
|
song_print_info(client, queue.Get(position));
|
|
client_printf(client, "Pos: %u\nId: %u\n",
|
|
position, queue.PositionToId(position));
|
|
|
|
uint8_t priority = queue.GetPriorityAtPosition(position);
|
|
if (priority != 0)
|
|
client_printf(client, "Prio: %u\n", priority);
|
|
}
|
|
|
|
void
|
|
queue_print_info(Client &client, const queue &queue,
|
|
unsigned start, unsigned end)
|
|
{
|
|
assert(start <= end);
|
|
assert(end <= queue.GetLength());
|
|
|
|
for (unsigned i = start; i < end; ++i)
|
|
queue_print_song_info(client, queue, i);
|
|
}
|
|
|
|
void
|
|
queue_print_uris(Client &client, const queue &queue,
|
|
unsigned start, unsigned end)
|
|
{
|
|
assert(start <= end);
|
|
assert(end <= queue.GetLength());
|
|
|
|
for (unsigned i = start; i < end; ++i) {
|
|
client_printf(client, "%i:", i);
|
|
song_print_uri(client, queue.Get(i));
|
|
}
|
|
}
|
|
|
|
void
|
|
queue_print_changes_info(Client &client, const queue &queue,
|
|
uint32_t version)
|
|
{
|
|
for (unsigned i = 0; i < queue.GetLength(); i++) {
|
|
if (queue.IsNewerAtPosition(i, version))
|
|
queue_print_song_info(client, queue, i);
|
|
}
|
|
}
|
|
|
|
void
|
|
queue_print_changes_position(Client &client, const queue &queue,
|
|
uint32_t version)
|
|
{
|
|
for (unsigned i = 0; i < queue.GetLength(); i++)
|
|
if (queue.IsNewerAtPosition(i, version))
|
|
client_printf(client, "cpos: %i\nId: %i\n",
|
|
i, queue.PositionToId(i));
|
|
}
|
|
|
|
void
|
|
queue_find(Client &client, const queue &queue,
|
|
const SongFilter &filter)
|
|
{
|
|
for (unsigned i = 0; i < queue.GetLength(); i++) {
|
|
const DetachedSong &song = queue.Get(i);
|
|
|
|
if (filter.Match(song))
|
|
queue_print_song_info(client, queue, i);
|
|
}
|
|
}
|