intsetlist.cpp

#include "intset.hpp"

void IntSetList::list_insert(int elements)
{
    for (struct node *iter = root_node; iter; iter = iter->next_id)
    {
        struct node *next_node = iter->next_id;
        // find position of node
        if (!next_node || elements < next_node->key_val)
        {
            struct node *new_node = new struct node;
            new_node->key_val = elements;
            iter->next_id = new_node;
            new_node->next_id = next_node;
            return;
        }
        // if elements in list.
        else if (next_node->key_val == elements)
        {
            this->set_size--;
            return;
        }
    }
}

IntSetList::IntSetList(unsigned int max_elements, int max_val) : IntSet(max_elements, max_val)
{
    root_node = new struct node;
    root_node->key_val = -1;
    root_node->next_id = NULL;
}

void IntSetList::deleteAllNodes()
{
    struct node *tmpNode = root_node;

    while (tmpNode)
    {
        struct node *next = tmpNode->next_id;
        delete tmpNode;
        tmpNode = next;
    }
    set_size = 0;
    root_node = NULL;
}

IntSetList::~IntSetList()
{
    deleteAllNodes();
}

void IntSetList::insert(int element)
{
    if (element > this->max_val || set_size >= this->max_elements) {
        return;
    }
    
    list_insert(element);
    this->set_size++;
}

void const IntSetList::report(int *v)
{
    int m = 0;
    for (struct node *iter = root_node->next_id; iter; iter = iter->next_id)
        v[m++] = iter->key_val;
}