/*
* (c) 2004 by Kalle Wallin <kaw@linux.se>
* (c) 2008 Max Kellermann <max@duempel.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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "filelist.h"
#include "libmpdclient.h"
#include <string.h>
#include <assert.h>
struct filelist *
filelist_new(const char *path)
{
struct filelist *filelist = g_malloc(sizeof(*filelist));
filelist->path = g_strdup(path);
filelist->updated = FALSE;
filelist->entries = g_ptr_array_new();
return filelist;
}
void
filelist_free(struct filelist *filelist)
{
guint i;
for (i = 0; i < filelist_length(filelist); ++i) {
struct filelist_entry *entry = filelist_get(filelist, i);
if (entry->entity)
mpd_freeInfoEntity(entry->entity);
g_slice_free(struct filelist_entry, entry);
}
g_ptr_array_free(filelist->entries, TRUE);
g_free(filelist->path);
g_free(filelist);
}
struct filelist_entry *
filelist_append(struct filelist *filelist, struct mpd_InfoEntity *entity)
{
struct filelist_entry *entry = g_slice_new(struct filelist_entry);
entry->flags = 0;
entry->entity = entity;
g_ptr_array_add(filelist->entries, entry);
return entry;
}
struct filelist_entry *
filelist_prepend(struct filelist *filelist, struct mpd_InfoEntity *entity)
{
struct filelist_entry *entry = filelist_append(filelist, entity);
/* this is very slow, but we should optimize screen_artist.c
later so that this function can be removed, so I'm not in
the mood to implement something better here */
if (!filelist_is_empty(filelist)) {
guint i;
for (i = filelist_length(filelist) - 1; i > 0; --i)
g_ptr_array_index(filelist->entries, i) =
filelist_get(filelist, i - 1);
g_ptr_array_index(filelist->entries, 0) = entry;
}
return entry;
}
void
filelist_move(struct filelist *filelist, struct filelist *from)
{
guint i;
for (i = 0; i < filelist_length(from); ++i)
g_ptr_array_add(filelist->entries,
g_ptr_array_index(from->entries, i));
g_ptr_array_set_size(from->entries, 0);
}
static gint
filelist_compare_indirect(gconstpointer ap, gconstpointer bp, gpointer data)
{
GCompareFunc compare_func = data;
gconstpointer a = *(const gconstpointer*)ap;
gconstpointer b = *(const gconstpointer*)bp;
return compare_func(a, b);
}
void
filelist_sort(struct filelist *filelist, GCompareFunc compare_func)
{
g_ptr_array_sort_with_data(filelist->entries,
filelist_compare_indirect,
compare_func);
}
struct filelist_entry *
filelist_find_song(struct filelist *fl, const struct mpd_song *song)
{
guint i;
assert(song != NULL);
for (i = 0; i < filelist_length(fl); ++i) {
struct filelist_entry *entry = filelist_get(fl, i);
mpd_InfoEntity *entity = entry->entity;
if (entity && entity->type == MPD_INFO_ENTITY_TYPE_SONG) {
struct mpd_song *song2 = entity->info.song;
if (strcmp(song->file, song2->file) == 0)
return entry;
}
}
return NULL;
}