00f7a24d54
atWhere() lastAtWhere() contains(v) filter(), map(), reduce(), forEach() indexed and reverse variants fix PIDeque reverse for fix insert with move of complex type potential segfault
45 lines
1.4 KiB
C++
45 lines
1.4 KiB
C++
/*! \file pistack.h
|
|
* \brief Stack container
|
|
*
|
|
* This file declare PIStack
|
|
*/
|
|
/*
|
|
PIP - Platform Independent Primitives
|
|
Stack container
|
|
Ivan Pelipenko peri4ko@yandex.ru
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef PISTACK_H
|
|
#define PISTACK_H
|
|
|
|
#include "pivector.h"
|
|
#include "pideque.h"
|
|
|
|
template<typename T>
|
|
class PIStack: public PIVector<T> {
|
|
public:
|
|
PIStack() {}
|
|
PIVector<T> & push(const T & v) {PIVector<T>::push_back(v); return *this;}
|
|
PIVector<T> & push(T && v) {PIVector<T>::push_back(std::move(v)); return *this;}
|
|
T pop() {return PIVector<T>::take_back();}
|
|
T & top() {return PIVector<T>::back();}
|
|
const T & top() const {return PIVector<T>::back();}
|
|
PIVector<T> toVector() {return PIVector<T>(*this);}
|
|
PIVector<T> toDeque() {return PIDeque<T>(PIVector<T>::data(), PIVector<T>::size());}
|
|
};
|
|
|
|
#endif // PISTACK_H
|