Collaboration diagram for cll:

[legend]

Public Member Functions
void	display ()

void	insert_front (int new_data)

void	insert_tail (int new_data)

int	get_size ()

bool	find_item (int item_to_find)

int	operator* ()

void	operator++ ()

Protected Attributes
node *	head

int	total

Detailed Description

Definition at line 17 of file cll.h.

Constructor & Destructor Documentation

◆ cll()

cll::cll ( )

Definition at line 8 of file cll.cpp.

         {
    head = NULL;
    total = 0;
}

◆ ~cll()

cll::~cll ( )

Definition at line 13 of file cll.cpp.

13 { /* Desstructure, no need to fill */

14}

Member Function Documentation

◆ display()

void cll::display ( )

Definition at line 17 of file cll.cpp.

                  {
    if (head == NULL)
        cout << "List is empty !" << endl;
    else {
        cout << "CLL list: ";
        node *current = head;
        for (int i = 0; i < total; i++) {
            cout << current->data << " -> ";
            current = current->next;
        }
        cout << head->data << endl;
        cout << "Total element: " << total << endl;
    }
}

◆ find_item()

bool cll::find_item ( int item_to_find )

Definition at line 78 of file cll.cpp.

                                    {
    if (head == NULL) {
        cout << "List is empty !" << endl;
        return false;
    } else {
        node *current = head;
        while (current->next != head) {
            if (current->data == item_to_find)
                return true;
            current = current->next;
        }
        return false;
    }
}

◆ get_size()

int cll::get_size ( )

Definition at line 74 of file cll.cpp.

74{ return total; }

◆ insert_front()

void cll::insert_front ( int new_data )

Definition at line 33 of file cll.cpp.

                                   {
    node *newNode;
    newNode = new node;
    newNode->data = new_data;
    newNode->next = NULL;
    if (head == NULL) {
        head = newNode;
        head->next = head;
    } else {
        node *current = head;
        while (current->next != head) {
            current = current->next;
        }
        newNode->next = head;
        current->next = newNode;
        head = newNode;
    }
    total++;
}

◆ insert_tail()

void cll::insert_tail ( int new_data )

Definition at line 54 of file cll.cpp.

                                  {
    node *newNode;
    newNode = new node;
    newNode->data = new_data;
    newNode->next = NULL;
    if (head == NULL) {
        head = newNode;
        head->next = head;
    } else {
        node *current = head;
        while (current->next != head) {
            current = current->next;
        }
        current->next = newNode;
        newNode->next = head;
    }
    total++;
}

◆ operator*()

int cll::operator* ( )

Definition at line 94 of file cll.cpp.

94{ return head->data; }

◆ operator++()

void cll::operator++ ( )

Definition at line 98 of file cll.cpp.

                     {
    if (head == NULL) {
        cout << "List is empty !" << endl;
    } else {
        node *current = head;
        while (current->next != head) {
            current = current->next;
        }
        current->next = head->next;
        head = head->next;
    }
    total--;
}

Member Data Documentation

◆ head

node* cll::head

protected

Definition at line 40 of file cll.h.

◆ total

int cll::total