Mercurial > hg > Game > Cerium
view example/task_queue/testQueueInfo.cc @ 1786:ba6ffc679a8f draft
minor fix
author | Masataka Kohagura <e085726@ie.u-ryukyu.ac.jp> |
---|---|
date | Sat, 30 Nov 2013 21:06:44 +0900 |
parents | efee36d2f84c |
children |
line wrap: on
line source
#include <stdio.h> #include <stdlib.h> #include <string.h> #include "QueueInfo.h" #include "TaskList.h" #include "Func.h" static QueueInfo<TaskList> *queuePool = new QueueInfo<TaskList>() ; void queueInfoTest(int count) { QueueInfo<TaskList> *q = new QueueInfo<TaskList>(queuePool) ; QueueInfo<TaskList> *r = new QueueInfo<TaskList>(queuePool) ; int i = 0; for (i = 0; i < count; i++) { q->addLast(q->create()); } i = 0; for(TaskListPtr t= q->getFirst(); t ;t = q->getNext(t) ) { t->length = i++; } i = 0; for(TaskListPtr t= q->getFirst(); t ;t = q->getNext(t) ) { printf(" No. %d %d\n", i++, t->length); } printf("First %d\n", q->getFirst()->length); printf("Last %d\n", q->getLast()->length); TaskListPtr t = q->poll(); printf("Polled %d\n", t->length); q->free_(t); printf("Length %d = %d - 1\n", q->length(), count); q->moveToFirst(q->get(count-2)); i = 0; for(TaskListPtr t= q->getFirst(); t ;t = q->getNext(t) ) { printf(" No. %d %d\n", i++, t->length); } while(!q->empty()){ r->addFirst(q->poll()); } i = 0; for(TaskListPtr t= r->getFirst(); t ;t = r->getNext(t) ) { printf(" No. %d %d\n", i++, t->length); } } /* end */