AI-Chess/stack.cpp at master · Kadiryanik/AI-Chess · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*
 * Data Structures - Simple stack implementation
 *
 * Copyright (C) Kadir Yanık - <kdrynkk@gmail.com>, 2020
 */
#include "stack.h"

#include <QDebug>

/*---------------------------------------------------------------------------*/
template <class T>
Stack<T>::Stack(int size)
{
    this->stack = new T[size];
    if(this->stack == NULL){
        qDebug() << "Stack allocation failed!";
        exit(-1);
    }

    this->stackSize = size;
    this->stackOffset = 0;
}

/*---------------------------------------------------------------------------*/
template <class T>
Stack<T>::~Stack()
{
    if(this->stack != NULL){
        delete [] this->stack;
    }
}

/*---------------------------------------------------------------------------*/
template <class T> bool
Stack<T>::push(T val)
{
    if(!isFull()){
        stack[++(this->stackOffset)] = val;
        return true;
    }

    qDebug() << "Stack full!";
    return false;
}

/*---------------------------------------------------------------------------*/
template <class T> bool
Stack<T>::pop(T *ret)
{
    if(!isEmpty() && ret != NULL){
        (*ret) = stack[this->stackOffset--];
        return true;
    }

    return false;
}

/*---------------------------------------------------------------------------*/
template <class T> bool
Stack<T>::peek(T *ret)
{
    if(!isEmpty() && ret != NULL){
        (*ret) = stack[this->stackOffset];
        return true;
    }

    return false;
}

/*---------------------------------------------------------------------------*/
template <class T> bool
Stack<T>::isEmpty()
{
    if(this->stackOffset == 0){
        return true;
    }

    return false;
}

/*---------------------------------------------------------------------------*/
template <class T> bool
Stack<T>::isFull()
{
    if(this->stackOffset < this->stackSize){
        return false;
    }

    qDebug() << "Stack full!";
    return true;
}

/*---------------------------------------------------------------------------*/
template <class T> void
Stack<T>::clear()
{
    this->stackOffset = 0;
}