162 lines
4.1 KiB
C++
162 lines
4.1 KiB
C++
/*
|
|
* Copyright 2013 (c) Anna Schumaker.
|
|
*/
|
|
#include <core/deck.h>
|
|
#include <core/filter.h>
|
|
#include <core/library.h>
|
|
#include <core/tags/tags.h>
|
|
#include "test.h"
|
|
|
|
static Queue *Q_NULL = NULL;
|
|
static Track *TRACK_NULL = NULL;
|
|
|
|
static void test_init()
|
|
{
|
|
unsigned int val;
|
|
file f;
|
|
std::list<TempQueue>::iterator it;
|
|
|
|
test_equal(deck :: next(), TRACK_NULL);
|
|
|
|
test_cp_data_dir();
|
|
filter_init();
|
|
tags :: init();
|
|
library :: init();
|
|
deck :: init();
|
|
|
|
test_equal(library :: get_queue()->has_flag(Q_RANDOM), true);
|
|
test_equal(deck :: get_queues().size(), (size_t)2);
|
|
|
|
it = deck :: get_queues().begin();
|
|
test_equal(it->size(), (unsigned)4);
|
|
for (unsigned int i = 0; i < 4; i++)
|
|
test_equal((*it)[i]->index(), i);
|
|
|
|
it++;
|
|
test_equal(it->size(), (unsigned)5);
|
|
for (unsigned int i = 0; i < 5; i++)
|
|
test_equal((*it)[i]->index(), i + 4);
|
|
|
|
/*
|
|
* Test that we saved the deck in the new format
|
|
*/
|
|
file_init(&f, "deck", 0);
|
|
file_open(&f, OPEN_READ);
|
|
test_equal(file_version(&f), (unsigned)1);
|
|
file_readf(&f, "%u", &val);
|
|
test_equal(val, (unsigned)2);
|
|
|
|
for (unsigned int i = 0; i < 2; i++) {
|
|
file_readf(&f, "%u", &val); /* queues[i].flags */
|
|
test_equal(val, (unsigned)1);
|
|
|
|
file_readf(&f, "%u", &val); /* queues[i].size */
|
|
test_equal(val, 4 + i);
|
|
|
|
for (unsigned int j = 0; j < 4 + i; j++) {
|
|
file_readf(&f, "%u", &val);
|
|
test_equal(val, (4 * i) + j);
|
|
}
|
|
}
|
|
|
|
file_close(&f);
|
|
}
|
|
|
|
static class TestNotifier : public QNotifier {
|
|
public:
|
|
TestNotifier() : QNotifier() {}
|
|
void on_track_added(unsigned int i) {}
|
|
void on_track_removed(unsigned int i) {}
|
|
void on_track_updated(unsigned int i) {}
|
|
} test_notifier;
|
|
|
|
static void test_create_mv_destroy()
|
|
{
|
|
Queue *q1, *q2;
|
|
|
|
q1 = deck :: create(true);
|
|
q1->set_notifier(&test_notifier);
|
|
test_not_equal(q1, Q_NULL);
|
|
test_equal(q1->has_flag(Q_ENABLED), true);
|
|
test_equal(q1->has_flag(Q_RANDOM), true);
|
|
test_equal(deck :: index(q1), (unsigned)2);
|
|
test_equal(deck :: get(2), q1);
|
|
|
|
q2 = deck :: create(false);
|
|
q2->set_notifier(&test_notifier);
|
|
test_not_equal(q2, Q_NULL);
|
|
test_equal(q2->has_flag(Q_ENABLED), true);
|
|
test_equal(q2->has_flag(Q_RANDOM), false);
|
|
test_equal(deck :: index(q2), (unsigned)3);
|
|
test_equal(deck :: get(3), q2);
|
|
|
|
deck :: move(q1, 3);
|
|
test_equal(deck :: index(q1), (unsigned)3);
|
|
deck :: move(q1, 3);
|
|
test_equal(deck :: index(q1), (unsigned)3);
|
|
deck :: move(q1, 2);
|
|
test_equal(deck :: index(q1), (unsigned)2);
|
|
|
|
deck :: destroy(q1);
|
|
test_equal(deck :: index(q1), (unsigned)3);
|
|
test_equal(deck :: index(q2), (unsigned)2);
|
|
|
|
deck :: destroy(q2);
|
|
test_equal(deck :: index(q2), (unsigned)2);
|
|
|
|
test_equal(deck :: get(3), Q_NULL);
|
|
}
|
|
|
|
static void test_next_prev()
|
|
{
|
|
std::list<TempQueue>::iterator it = deck :: get_queues().begin();
|
|
Queue *q = deck :: get_queue();
|
|
Queue *q0 = &(*it++);
|
|
Queue *q1 = &(*it++);
|
|
|
|
q0->unset_flag(Q_RANDOM);
|
|
for (unsigned int i = 0; i < 4; i++)
|
|
q0->add(tags :: get_track(i));
|
|
|
|
test_not_equal(q, Q_NULL);
|
|
test_equal(q->size(), (unsigned)0);
|
|
test_equal(deck :: prev(), TRACK_NULL);
|
|
|
|
for (unsigned int i = 0; i < 2; i++) {
|
|
test_equal(deck :: next()->index(), (unsigned)0);
|
|
test_equal(deck :: next()->index(), (unsigned)1);
|
|
test_equal(deck :: next()->index(), (unsigned)2);
|
|
test_equal(deck :: next()->index(), (unsigned)3);
|
|
test_equal(q->size(), (unsigned)4);
|
|
}
|
|
|
|
for (unsigned int i = 0; i < 2; i++) {
|
|
if (i == 1)
|
|
test_equal(deck :: prev()->index(), (unsigned)3);
|
|
test_equal(deck :: prev()->index(), (unsigned)2);
|
|
test_equal(deck :: prev()->index(), (unsigned)1);
|
|
test_equal(deck :: prev()->index(), (unsigned)0);
|
|
}
|
|
|
|
test_equal(deck :: get_queues().size(), (size_t)1);
|
|
test_equal(deck :: index(q1), (unsigned)0);
|
|
|
|
q1->unset_flag(Q_ENABLED);
|
|
library :: get_queue()->unset_flag(Q_RANDOM);
|
|
|
|
test_equal(q1->size(), (unsigned)5);
|
|
deck :: next();
|
|
test_equal(q1->size(), (unsigned)5);
|
|
|
|
q1->set_flag(Q_ENABLED);
|
|
for (unsigned int i = 0; i < 5; i++)
|
|
deck :: next();
|
|
test_equal(deck :: get_queues().size(), (size_t)0);
|
|
}
|
|
|
|
DECLARE_UNIT_TESTS(
|
|
UNIT_TEST("Deck Init", test_init),
|
|
UNIT_TEST("Deck Create, Move, and Destroy", test_create_mv_destroy),
|
|
UNIT_TEST("Deck Next and Prev", test_next_prev),
|
|
);
|