double spBPQueueMaxValue(SPBPQueue source){
assert(source);
if (spBPQueueIsEmpty(source)){
return -1;
}
return spListElementGetValue(spListGetLast(source->list));
}
SPListElement spBPQueuePeekLast(SPBPQueue source){
assert(source);
if(spBPQueueIsEmpty(source)){
return NULL;
}
SPListElement ret = spListGetLast(source->list);
if (!ret){ return NULL;}
return spListElementCopy(ret);
}
SP_BPQUEUE_MSG spBPQueueEnqueue(SPBPQueue source, SPListElement element){
// variables declaration//
int i;
SPList source_list = source->list;
SPListElement elem_to_comp;
int list_size = spListGetSize(source_list);
// check for bad arguments or allocation problems//
if (!source || !element || !source_list){
return SP_BPQUEUE_INVALID_ARGUMENT;
}
// insertion process//
if (spBPQueueIsEmpty(source)){
spListInsertFirst(source_list, element);
return SP_BPQUEUE_SUCCESS;
}
else{
elem_to_comp = spListGetFirst(source_list);
/*starts from the bottom and loop for next source list element up until
you find the one which is bigger than the inserted one and insert the element
before that one. you will stop after you ran out of elements to look for */
for(i=0; i<list_size; i++){
if (spListElementGetValue(element) <= spListElementGetValue(elem_to_comp)){// element is smaller than next elem, insert before current
if (spBPQueueIsFull(source)){
if (spListInsertBeforeCurrent(source_list, element) == SP_LIST_OUT_OF_MEMORY){
return SP_BPQUEUE_OUT_OF_MEMORY;
}
spListGetLast(source_list);
spListRemoveCurrent(source_list);
return SP_BPQUEUE_SUCCESS;
}
else{
if (spListInsertBeforeCurrent(source_list, element) == SP_LIST_OUT_OF_MEMORY){
return SP_BPQUEUE_OUT_OF_MEMORY;
}
return SP_BPQUEUE_SUCCESS;
}
}else{
elem_to_comp = spListGetNext(source_list);
}
}
}
if (!spBPQueueIsFull(source)){//queue isn't full but this item is the biggest
if (spListInsertLast(source_list, element)== SP_LIST_OUT_OF_MEMORY){
return SP_BPQUEUE_OUT_OF_MEMORY;
}
return SP_BPQUEUE_SUCCESS;
}
return SP_BPQUEUE_SUCCESS; // the element is larger than all others
}
static bool testListGetLast() {
SPList list = spListCreate();
ASSERT_TRUE(spListGetLast(list) == NULL);
SPListElement e1 = spListElementCreate(1, 1.0);
SPListElement e2 = spListElementCreate(2, 2.0);
SPListElement e3 = spListElementCreate(3, 3.0);
SPListElement e4 = spListElementCreate(4, 4.0);
SPList list2 = quickList(4, e1, e2, e3, e4);
SPListElement last = spListGetLast(list2);
ASSERT_TRUE(spListElementCompare(e4, last) == 0);
ASSERT_TRUE(
spListElementCompare(last, spListGetLast(list2)) == 0
&& spListGetLast(list2) == last);
spListDestroy(list);
spListDestroy(list2);
spListElementDestroy(e1);
spListElementDestroy(e2);
spListElementDestroy(e3);
spListElementDestroy(e4);
return true;
}
SP_BPQUEUE_MSG spBPQueueEnqueue(SPBPQueue source, SPListElement element) {
if (source == NULL || element == NULL) {
return SP_BPQUEUE_INVALID_ARGUMENT;
}
bool wasFull = spBPQueueIsFull(source);
SPList list = source->innerList;
bool wasInserted = false;
// Advance iterator to the proper element's place
SP_LIST_FOREACH(SPListElement, currentElement, list) {
if (spListElementCompare(element, currentElement) < 0) {
// Modifying while iterating - bad practice but is more efficient here.
SP_LIST_MSG returnMSG = spListInsertBeforeCurrent(list, element);
switch (returnMSG) {
case SP_LIST_OUT_OF_MEMORY:
return SP_BPQUEUE_OUT_OF_MEMORY;
default:
break;
}
wasInserted = true;
break;
}
}
if (wasInserted) {
// Remove the last element if needed
if (wasFull) {
spListGetLast(list);
spListRemoveCurrent(list);
}
return SP_BPQUEUE_SUCCESS;
} else {
if (spBPQueueIsFull(source)) {
return SP_BPQUEUE_FULL;
} else {
// The item is largest than everything, insert last
SP_LIST_MSG returnMSG = spListInsertLast(list, element);
switch (returnMSG) {
case SP_LIST_OUT_OF_MEMORY:
return SP_BPQUEUE_OUT_OF_MEMORY;
default:
return SP_BPQUEUE_SUCCESS;
}
}
}
}
SPListElement spBPQueueLastElement(SPBPQueue source) {
if (source == NULL || spBPQueueIsEmpty(source)) {
return NULL;
}
return spListGetLast(source->innerList);
}
