bluelib/core/queue.c

#include <blue/core/queue.h>

struct b_queue_iterator_p {
	size_t i;
	b_queue_entry *entry;
	b_queue *_q;
};

size_t b_queue_length(const struct b_queue *q)
{
	size_t i = 0;
	struct b_queue_entry *x = q->q_first;
	while (x) {
		i++;
		x = x->qe_next;
	}

	return i;
}

void b_queue_insert_before(
	struct b_queue *q, struct b_queue_entry *entry, struct b_queue_entry *before)
{
	struct b_queue_entry *x = before->qe_prev;
	if (x) {
		x->qe_next = entry;
	} else {
		q->q_first = entry;
	}

	entry->qe_prev = x;

	before->qe_prev = entry;
	entry->qe_next = before;
}

void b_queue_insert_after(
	struct b_queue *q, struct b_queue_entry *entry, struct b_queue_entry *after)
{
	struct b_queue_entry *x = after->qe_next;
	if (x) {
		x->qe_prev = entry;
	} else {
		q->q_last = entry;
	}

	entry->qe_next = x;

	after->qe_next = entry;
	entry->qe_prev = after;
}

void b_queue_push_front(struct b_queue *q, struct b_queue_entry *entry)
{
	if (q->q_first) {
		q->q_first->qe_prev = entry;
	}

	entry->qe_next = q->q_first;
	entry->qe_prev = NULL;

	q->q_first = entry;

	if (!q->q_last) {
		q->q_last = entry;
	}
}

void b_queue_push_back(struct b_queue *q, struct b_queue_entry *entry)
{
	if (q->q_last) {
		q->q_last->qe_next = entry;
	}

	entry->qe_prev = q->q_last;
	entry->qe_next = NULL;

	q->q_last = entry;

	if (!q->q_first) {
		q->q_first = entry;
	}
}

struct b_queue_entry *b_queue_pop_front(struct b_queue *q)
{
	struct b_queue_entry *x = q->q_first;
	if (x) {
		b_queue_delete(q, x);
	}

	return x;
}

struct b_queue_entry *b_queue_pop_back(struct b_queue *q)
{
	struct b_queue_entry *x = q->q_last;
	if (x) {
		b_queue_delete(q, x);
	}

	return x;
}

void b_queue_move(b_queue *q, b_queue_entry *dest, b_queue_entry *src)
{
	if (src->qe_next) {
		src->qe_next->qe_prev = dest;
	}

	if (src->qe_prev) {
		src->qe_prev->qe_next = dest;
	}

	if (q->q_first == src) {
		q->q_first = dest;
	}

	if (q->q_last == src) {
		q->q_last = dest;
	}

	memmove(dest, src, sizeof *src);
}

void b_queue_delete(struct b_queue *q, struct b_queue_entry *entry)
{
	if (!entry) {
		return;
	}

	if (entry == q->q_first) {
		q->q_first = q->q_first->qe_next;
	}

	if (entry == q->q_last) {
		q->q_last = q->q_last->qe_prev;
	}

	if (entry->qe_next) {
		entry->qe_next->qe_prev = entry->qe_prev;
	}

	if (entry->qe_prev) {
		entry->qe_prev->qe_next = entry->qe_next;
	}

	entry->qe_next = entry->qe_prev = NULL;
}

void b_queue_delete_all(struct b_queue *q)
{
	struct b_queue_entry *x = q->q_first;
	while (x) {
		struct b_queue_entry *next = x->qe_next;
		x->qe_next = x->qe_prev = NULL;
		x = next;
	}

	q->q_first = q->q_last = NULL;
}

b_iterator *b_queue_begin(struct b_queue *q)
{
	b_queue_iterator *it_obj = b_object_create(B_TYPE_QUEUE_ITERATOR);
	struct b_queue_iterator_p *it
		= b_object_get_private(it_obj, B_TYPE_QUEUE_ITERATOR);

	it->_q = (struct b_queue *)q;
	it->entry = q->q_first;
	it->i = 0;

	if (!it->entry) {
		b_iterator_set_status(it_obj, B_ERR_NO_DATA);
	}

	return it_obj;
}

static enum b_status iterator_move_next(const b_iterator *obj)
{
	struct b_queue_iterator_p *it
		= b_object_get_private(obj, B_TYPE_QUEUE_ITERATOR);

	if (!it->entry) {
		return B_ERR_NO_DATA;
	}

	it->entry = it->entry->qe_next;
	it->i++;

	return (it->entry != NULL) ? B_SUCCESS : B_ERR_NO_DATA;
}

static enum b_status iterator_erase(b_iterator *obj)
{
	struct b_queue_iterator_p *it
		= b_object_get_private(obj, B_TYPE_QUEUE_ITERATOR);

	if (!it->entry) {
		return B_ERR_OUT_OF_BOUNDS;
	}

	struct b_queue_entry *next = it->entry->qe_next;
	b_queue_delete(it->_q, it->entry);
	it->entry = next;

	return B_SUCCESS;
}

static b_iterator_value iterator_get_value(b_iterator *obj)
{
	struct b_queue_iterator_p *it
		= b_object_get_private(obj, B_TYPE_QUEUE_ITERATOR);

	return B_ITERATOR_VALUE_PTR(it->entry);
}

static const b_iterator_value iterator_get_cvalue(const b_iterator *obj)
{
	struct b_queue_iterator_p *it
		= b_object_get_private(obj, B_TYPE_QUEUE_ITERATOR);

	return B_ITERATOR_VALUE_CPTR(it->entry);
}

B_TYPE_CLASS_DEFINITION_BEGIN(b_queue_iterator)
	B_TYPE_CLASS_INTERFACE_BEGIN(b_object, B_TYPE_OBJECT)
		B_INTERFACE_ENTRY(to_string) = NULL;
	B_TYPE_CLASS_INTERFACE_END(b_object, B_TYPE_OBJECT)

	B_TYPE_CLASS_INTERFACE_BEGIN(b_iterator, B_TYPE_ITERATOR)
		B_INTERFACE_ENTRY(it_move_next) = iterator_move_next;
		B_INTERFACE_ENTRY(it_erase) = iterator_erase;
		B_INTERFACE_ENTRY(it_get_value) = iterator_get_value;
		B_INTERFACE_ENTRY(it_get_cvalue) = iterator_get_cvalue;
	B_TYPE_CLASS_INTERFACE_END(b_iterator, B_TYPE_ITERATOR)
B_TYPE_CLASS_DEFINITION_END(b_queue_iterator)

B_TYPE_DEFINITION_BEGIN(b_queue_iterator)
	B_TYPE_ID(0x560dc263, 0xff98, 0x4812, 0x9b29, 0xa1218bd70881);
	B_TYPE_EXTENDS(B_TYPE_ITERATOR);
	B_TYPE_CLASS(b_queue_iterator_class);
	B_TYPE_INSTANCE_PRIVATE(struct b_queue_iterator_p);
B_TYPE_DEFINITION_END(b_queue_iterator)