//
//  main.cpp
//  4-előadás
//
//  Created by Majer Imre on 2015. 03. 02..
//  Copyright (c) 2015. Majer Imre. All rights reserved.
//

/*
szemely *sz;
new-delet operátorok
int *i = new int;
szemely *sz = new szemely("Pisti");
delete i;
delete sz;
*/

/*
int * i = new int[100];
i[5]=8;
delete[] i;
*/

/*
#include<string.h>


class szemely {
    char *cim;
public:
    szemely(char *cimpar) {
        cim=new char[strlen(cimpar)+1];
        strcpy(cim, cimpar);
    }
    ~szemely() {
        delete[] cim;
    }
    szemely(const szemely& szp) {
        cim= new char[strlen(szp.cim)+1];
        strcpy(cim, szp.cim);
    }
};

int main() {
    szemely sz1("Magyar T 2");
    szemely sz2(sz1);
}
*/

/*
 A a();
 A b(a);
 A a2= A();
 A a3;
 a3=a;
 */

//FIFO - First in First out

#include<iostream>

class intfifo {
    int elementnum;
    int * pdata;
public:
    intfifo() {
        elementnum=0; pdata= NULL;
    }
    intfifo(const intfifo& theother) {
        if (theother.elementnum!=0){
            pdata=new int[theother.elementnum];}
        else
        {
            pdata=NULL;
            elementnum =theother.elementnum;}
        for(int i=0; i<elementnum; i++) {
            pdata[i]=theother.pdata[i];
        }
    };
    ~intfifo() {
        if(pdata!=0)
            delete[] pdata;
    }
    bool isempty() { return !elementnum;}
    bool get( int& element);
    bool put( int element);
    const intfifo& operator=(const intfifo& theother);
    intfifo(const intfifo& the other){
        {
            pdata=0;
            *this = theother;
        }
    };
};


bool intfifo::get(int& element) {
    if(isempty()) {
        return false; }
       element=pdata[0];
       if(elementnum==1){
           delete[] pdata; pdata=NULL;}
       else{
           int *tmp =new int[elementnum-1];
           for (int i=0;i<elementnum-1; i++)
           {
               tmp[i]=pdata[i+1];
           }
           delete[] pdata;
           pdata =tmp;
       }
       elementnum--;
       return true;
}

bool intfifo::put(int element) {
    if(elementnum==INT_MAX) {return false;}
    if(elementnum==0) {
       pdata =new int[1];
        pdata[0]= element;
        elementnum--;}
    else {
        int *tmp=new int[elementnum+1];
        for(int i=0; i<elementnum; i++) {
            tmp[i]=pdata[i];
        }
        tmp[elementnum]= element;
        delete[] pdata;
        pdata=tmp;
    }
    elementnum++;
    return true;
}

const intfifo& intfifo::operator=(const intfifo& theother) {
    if(this==&theother) {
        return *this;
    }
    delete[] pdata;
    if(theother.elementnum==0){
        pdata=0;
        elementnum=0;
    }
    else {
        elementnum=theother.elementnum;
        pdata= new int[elementnum];
        for(int i=0;i<elementnum;i++)
        {
            pdata[i]=theother.pdata[i];
        }
    }
    return *this;
}

int main() {
    intfifo f1;
    f1.put(5);
    f1.put(6);
    int i;
    f1.get(i);
    intfifo f2=f1;
    intfifo f3;
    f3=f1;
}