ierarhii.cpp

#include<iostream>
using namespace std;
typedef struct termen{
    int value;
    termen * next, * prev;
    };
typedef struct stermen{
    int value;
    stermen *next;
    };
class List{
public:
    int length = 0;
    };
class Simple: public List{
public:
    stermen *start, *current, *finalist;
};
class Double: public List{
public:
    termen *start, *current, *finalist;
};
class SLIFO: public Simple{
public:
    int getprev()
    {
        current = start;
        while(current->next != finalist)
        {
            current = current->next;
        }
    }
    int push(int newvalue)
    {
        if(length == 0)
        {
            stermen *morty = new stermen;
            morty->value = newvalue;
            start = current = finalist = morty;
            finalist->next = NULL;
            length++;
            return 0;
        }
        stermen *morty = new stermen;
        morty->value = newvalue;
        finalist->next = morty;
        finalist = finalist->next;
        finalist->next = NULL;
        length++;
    }
    int pop()
    {
        if(length == 0)
        {
            return 0;
        }
        if(length == 1)
        {
            delete start;
            length--;
            return 0;
        }
        getprev();
        delete finalist;
        finalist = current;
        length--;
    }
    int showlist()
    {
        if(length == 0)
        {
            return 0;
        }
        current = start;
        for(int i = 1; i <= length; i++)
        {
            cout<<current->value<<" ";
            current = current->next;
        }
        cout<<endl;
    }
};
class SFIFO: public Simple{
public:
    int push(int newvalue)
    {
        if(length == 0)
        {
            stermen *morty = new stermen;
            morty->value = newvalue;
            start = finalist = morty;
            length++;
            return 0;
        }
        stermen *morty = new stermen;
        morty->value = newvalue;
        current = start;
        start = morty;
        morty->next = current;
        length++;
    }
    int pop()
    {
       if(length == 0)
       {
           return 0;
       }
       if(length == 1)
       {
           delete start;
           length--;
           return 0;
       }
       current = start->next;
       delete start;
       start = current;
       length--;
    }
    int showlist()
    {
        if(length == 0)
        {
            return 0;
        }
        current = start;
        for(int i = 1; i <= length; i++)
        {
            cout<<current->value<<" ";
            current = current->next;
        }
        cout<<endl;
    }
};
class DLIFO: public Double{
public :
    int push(int thisvalue) {
        if(length == 0)
        {
            termen * morty = new termen;
            morty->value = thisvalue;
            start = morty;
            start->prev = NULL;
            start->next = NULL;
            finalist = start;
            length++;
            return 0;
        }
        termen * morty = new termen;
        morty->value = thisvalue;
        finalist->next = morty;
        finalist->next->prev = finalist;
        finalist = finalist->next;
        finalist->next = NULL;
        length++;
        return 0;
    }
    int showlist(bool direction)
    {
        if(length == 0)
        {
            return 0;
        }
        if(direction)
        {
            current = start;
            while(current != finalist->next)
            {
                cout<<current->value<<" ";
                current = current->next;
            }
            cout<<endl;
            return 0;
        }
        current = finalist;
        while(current != start->prev)
        {
            cout<<current->value<<" ";
            current = current->prev;
        }
        cout<<endl;
    }
    int pop()
    {
        if(length == 0)
        {
            return 0;
        }
        else if(length == 1)
        {
            start->next = NULL;
            start->value = NULL;
            length --;
            return 0;
        }
        finalist->value = NULL;
        finalist = finalist->prev;
        finalist->next = NULL;
        length--;
    }
};
class DFIFO: public Double{
public :
    int push(int thisvalue)
    {
        if(length == 0)
        {
            termen * morty = new termen;
            morty->value = thisvalue;
            finalist = morty;
            finalist->next = NULL;
            finalist->prev = NULL;
            start = current = finalist;
            length++;
            return 0;
        }
        termen * morty = new termen;
        morty->value = thisvalue;
        start->prev = morty;
        start->prev->next = start;
        start = start->prev;
        start->prev = NULL;
        length++;
    }
    int pop()
    {
        if(length == 0)
        {
            return 0;
        }
        else if(length == 1)
        {
            delete start;
            length--;
            return 0;
        }
        start = start->next;
        //start->prev->next = NULL;
        delete start;
        length--;
    }
    int showlist(bool direction)
    {
        if(length == 0)
        {
            return 0;
        }
        if(direction)
        {
            current = start;
            while(current != finalist->next)
            {
                cout<<current->value<<" ";
                current = current->next;
            }
            cout<<endl;
            return 0;
        }
        current = finalist;
        while(current != start->prev)
        {
            cout<<current->value<<" ";
            current = current->prev;
        }
        cout<<endl;
    }
};
int main()
{
    DLIFO mylist;
    for(int i = 1; i <= 10; i++)
    {
        mylist.push(i);
    }
    mylist.showlist(1);
    for(int i = 1; i <= 15; i++)
    {
        mylist.pop();
        mylist.showlist(1);
    }
}