66c53a27fc
This allow compile check event for CONNECT and use EVENT as CONNECT target, also raise event now is simple execute EVENT function.
540 lines
26 KiB
C++
540 lines
26 KiB
C++
/*
|
|
PIP - Platform Independent Primitives
|
|
Generic containers, based on STL
|
|
Copyright (C) 2013 Ivan Pelipenko peri4ko@gmail.com
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU 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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef PICONTAINERS_H
|
|
#define PICONTAINERS_H
|
|
|
|
#include "piincludes.h"
|
|
|
|
#ifdef CC_GCC
|
|
|
|
template<typename Type>
|
|
class _PIForeachC {
|
|
public:
|
|
_PIForeachC(const Type & t, bool i = false): _t(t), _inv(i) {if (_inv) _rit = _t.rbegin(); else _it = _t.begin(); _break = false;}
|
|
typename Type::value_type _var;
|
|
typename Type::const_iterator _it;
|
|
typename Type::const_reverse_iterator _rit;
|
|
const Type & _t;
|
|
bool _break, _inv;
|
|
inline bool isEnd() {if (_inv) return _rit == _t.rend(); else return _it == _t.end();}
|
|
inline void operator ++() {if (_inv) _rit++; else _it++; _break = false;}
|
|
};
|
|
|
|
template<typename Type>
|
|
class _PIForeach {
|
|
public:
|
|
_PIForeach(Type & t, bool i = false): _t(t), _inv(i) {if (_inv) _rit = _t.rbegin(); else _it = _t.begin(); _break = false;}
|
|
typename Type::value_type _var;
|
|
typename Type::iterator _it;
|
|
typename Type::reverse_iterator _rit;
|
|
Type & _t;
|
|
bool _break, _inv;
|
|
inline bool isEnd() {if (_inv) return _rit == _t.rend(); else return _it == _t.end();}
|
|
inline void operator ++() {if (_inv) _rit++; else _it++; _break = false;}
|
|
};
|
|
|
|
#define piForeach(i,c) for(_PIForeach<typeof(c)> _for(c); !_for.isEnd(); ++_for) \
|
|
for(i = *_for._it; !_for._break; _for._break = true)
|
|
#define piForeachR(i,c) for(_PIForeach<typeof(c)> _for(c, true); !_for.isEnd(); ++_for) \
|
|
for(i = *_for._rit; !_for._break; _for._break = true)
|
|
#define piForeachA(i,c) for(_PIForeach<typeof(c)> _for(c); !_for.isEnd(); ++_for) \
|
|
for(typeof(_for._var) & i(*_for._it); !_for._break; _for._break = true)
|
|
#define piForeachAR(i,c) for(_PIForeach<typeof(c)> _for(c, true); !_for.isEnd(); ++_for) \
|
|
for(typeof(_for._var) & i(*_for._rit); !_for._break; _for._break = true)
|
|
#define piForeachC(i,c) for(_PIForeachC<typeof(c)> _for(c); !_for.isEnd(); ++_for) \
|
|
for(const i = *_for._it; !_for._break; _for._break = true)
|
|
#define piForeachCR(i,c) for(_PIForeachC<typeof(c)> _for(c, true); !_for.isEnd(); ++_for) \
|
|
for(const i = *_for._rit; !_for._break; _for._break = true)
|
|
#define piForeachCA(i,c) for(_PIForeachC<typeof(c)> _for(c); !_for.isEnd(); ++_for) \
|
|
for(const typeof(_for._var) & i(*_for._it); !_for._break; _for._break = true)
|
|
#define piForeachCAR(i,c) for(_PIForeachC<typeof(c)> _for(c, true); !_for.isEnd(); ++_for) \
|
|
for(const typeof(_for._var) & i(*_for._rit); !_for._break; _for._break = true)
|
|
|
|
#define piForeachRA piForeachAR
|
|
#define piForeachAC piForeachCA
|
|
#define piForeachCRA piForeachCAR
|
|
#define piForeachARC piForeachCAR
|
|
#define piForeachACR piForeachCAR
|
|
#define piForeachRCA piForeachCAR
|
|
#define piForeachRAC piForeachCAR
|
|
|
|
#else
|
|
|
|
struct _PIForeachBase {mutable bool _break;};
|
|
|
|
template<typename Type>
|
|
class _PIForeach: public _PIForeachBase {
|
|
public:
|
|
_PIForeach(Type & t, bool i = false): _t(t), _inv(i) {if (_inv) _rit = _t.rbegin(); else _it = _t.begin(); _break = false;}
|
|
mutable typename Type::value_type _var;
|
|
mutable typename Type::iterator _it;
|
|
mutable typename Type::reverse_iterator _rit;
|
|
Type & _t;
|
|
bool _inv;
|
|
bool isEnd() {if (_inv) return _rit == _t.rend(); else return _it == _t.end();}
|
|
void operator ++() {if (_inv) _rit++; else _it++; _break = false;}
|
|
};
|
|
|
|
template<typename Type>
|
|
class _PIForeachC: public _PIForeachBase {
|
|
public:
|
|
_PIForeachC(const Type & t, bool i = false): _t(t), _inv(i) {if (_inv) _rit = _t.rbegin(); else _it = _t.begin(); _break = false;}
|
|
mutable typename Type::value_type _var;
|
|
mutable typename Type::const_iterator _it;
|
|
mutable typename Type::const_reverse_iterator _rit;
|
|
const Type & _t;
|
|
bool _inv;
|
|
bool isEnd() {if (_inv) return _rit == _t.rend(); else return _it == _t.end();}
|
|
void operator ++() {if (_inv) _rit++; else _it++; _break = false;}
|
|
};
|
|
|
|
template <typename T> inline _PIForeach<T> _PIForeachNew(T & t, bool i = false) {return _PIForeach<T>(t, i);}
|
|
template <typename T> inline _PIForeach<T> * _PIForeachCast(_PIForeachBase & c, T & ) {return static_cast<_PIForeach<T> * >(&c);}
|
|
|
|
template <typename T> inline _PIForeachC<T> _PIForeachNewC(const T & t, bool i = false) {return _PIForeachC<T>(t, i);}
|
|
template <typename T> inline _PIForeachC<T> * _PIForeachCastC(_PIForeachBase & c, const T & ) {return static_cast<_PIForeachC<T> * >(&c);}
|
|
|
|
#define piForeach(i,c) for(_PIForeachBase & _for = _PIForeachNew(c); !_PIForeachCast(_for, c)->isEnd(); ++(*_PIForeachCast(_for, c))) \
|
|
for(i = *(_PIForeachCast(_for, c)->_it); !_for._break; _for._break = true)
|
|
#define piForeachR(i,c) for(_PIForeachBase & _for = _PIForeachNew(c, true); !_PIForeachCast(_for, c)->isEnd(); ++(*_PIForeachCast(_for, c))) \
|
|
for(i = *(_PIForeachCast(_for, c)->_rit); !_for._break; _for._break = true)
|
|
#define piForeachC(i,c) for(_PIForeachBase & _for = _PIForeachNewC(c); !_PIForeachCastC(_for, c)->isEnd(); ++(*_PIForeachCastC(_for, c))) \
|
|
for(const i = *(_PIForeachCastC(_for, c)->_it); !_for._break; _for._break = true)
|
|
#define piForeachCR(i,c) for(_PIForeachBase & _for = _PIForeachNewC(c, false); !_PIForeachCastC(_for, c)->isEnd(); ++(*_PIForeachCastC(_for, c))) \
|
|
for(const i = *(_PIForeachCastC(_for, c)->_rit); !_for._break; _for._break = true)
|
|
|
|
#endif
|
|
|
|
#define piForeachRC piForeachCR
|
|
|
|
#define piForTimes(c) for(int _i##c = 0; _i##c < c; ++_i##c)
|
|
|
|
template<typename Enum>
|
|
class PIFlags {
|
|
public:
|
|
PIFlags(): flags(0) {;}
|
|
PIFlags(Enum e): flags(e) {;}
|
|
PIFlags(const PIFlags & f): flags(f.flags) {;}
|
|
PIFlags(const int i): flags(i) {;}
|
|
PIFlags & setFlag(const PIFlags & f, bool on = true) {if (on) flags |= f.flags; else flags &= ~f.flags; return *this;}
|
|
PIFlags & setFlag(const Enum & e, bool on = true) {if (on) flags |= e; else flags &= ~e; return *this;}
|
|
PIFlags & setFlag(const int & i, bool on = true) {if (on) flags |= i; else flags &= ~i; return *this;}
|
|
void operator =(const PIFlags & f) {flags = f.flags;}
|
|
void operator =(const Enum & e) {flags = e;}
|
|
void operator =(const int & i) {flags = i;}
|
|
void operator |=(const PIFlags & f) {flags |= f.flags;}
|
|
void operator |=(const Enum & e) {flags |= e;}
|
|
void operator |=(const int i) {flags |= i;}
|
|
void operator &=(const PIFlags & f) {flags &= f.flags;}
|
|
void operator &=(const Enum & e) {flags &= e;}
|
|
void operator &=(const int i) {flags &= i;}
|
|
void operator ^=(const PIFlags & f) {flags ^= f.flags;}
|
|
void operator ^=(const Enum & e) {flags ^= e;}
|
|
void operator ^=(const int i) {flags ^= i;}
|
|
PIFlags operator |(PIFlags f) const {PIFlags tf(flags | f.flags); return tf;}
|
|
PIFlags operator |(Enum e) const {PIFlags tf(flags | e); return tf;}
|
|
PIFlags operator |(int i) const {PIFlags tf(flags | i); return tf;}
|
|
PIFlags operator &(PIFlags f) const {PIFlags tf(flags & f.flags); return tf;}
|
|
PIFlags operator &(Enum e) const {PIFlags tf(flags & e); return tf;}
|
|
PIFlags operator &(int i) const {PIFlags tf(flags & i); return tf;}
|
|
PIFlags operator ^(PIFlags f) const {PIFlags tf(flags ^ f.flags); return tf;}
|
|
PIFlags operator ^(Enum e) const {PIFlags tf(flags ^ e); return tf;}
|
|
PIFlags operator ^(int i) const {PIFlags tf(flags ^ i); return tf;}
|
|
bool operator [](Enum e) const {return (flags & e) == e;}
|
|
operator int() const {return flags;}
|
|
private:
|
|
int flags;
|
|
};
|
|
/*
|
|
template <typename T>
|
|
class PIVector {
|
|
public:
|
|
PIVector(uint size = 0, const T & f = T()): data_(0), size_(0), rsize_(0) {resize(size, f);}
|
|
PIVector(T * d, uint size): data_(0), size_(0), rsize_(0) {alloc(size); for (uint i = 0; i < size; ++i) data_[i] = d[i];}
|
|
~PIVector() {dealloc();}
|
|
|
|
typedef T value_type;
|
|
|
|
class iterator {
|
|
friend class PIVector<T>;
|
|
private:
|
|
iterator(PIVector<T> * v, int p): parent(v), pos(p) {}
|
|
PIVector<T> * parent;
|
|
int pos;
|
|
public:
|
|
iterator(): parent(0) {}
|
|
T & operator *() {return (*parent)[pos];}
|
|
const T & operator *() const {return (*parent)[pos];}
|
|
void operator ++() {++pos;}
|
|
void operator ++(int) {++pos;}
|
|
void operator --() {--pos;}
|
|
void operator --(int) {--pos;}
|
|
bool operator ==(const iterator & it) const {return (pos == it.pos);}
|
|
bool operator !=(const iterator & it) const {return (pos != it.pos);}
|
|
};
|
|
|
|
class const_iterator {
|
|
friend class PIVector<T>;
|
|
private:
|
|
const_iterator(const PIVector<T> * v, int p): parent(v), pos(p) {}
|
|
const PIVector<T> * parent;
|
|
int pos;
|
|
public:
|
|
const_iterator(): parent(0) {}
|
|
//T & operator *() {return (*parent)[pos];}
|
|
const T & operator *() const {return (*parent)[pos];}
|
|
void operator ++() {++pos;}
|
|
void operator ++(int) {++pos;}
|
|
void operator --() {--pos;}
|
|
void operator --(int) {--pos;}
|
|
bool operator ==(const const_iterator & it) const {return (pos == it.pos);}
|
|
bool operator !=(const const_iterator & it) const {return (pos != it.pos);}
|
|
};
|
|
|
|
class reverse_iterator {
|
|
friend class PIVector<T>;
|
|
private:
|
|
reverse_iterator(PIVector<T> * v, int p): parent(v), pos(p) {}
|
|
PIVector<T> * parent;
|
|
int pos;
|
|
public:
|
|
reverse_iterator(): parent(0) {}
|
|
T & operator *() {return (*parent)[pos];}
|
|
const T & operator *() const {return (*parent)[pos];}
|
|
void operator ++() {--pos;}
|
|
void operator ++(int) {--pos;}
|
|
void operator --() {++pos;}
|
|
void operator --(int) {++pos;}
|
|
bool operator ==(const reverse_iterator & it) const {return (pos == it.pos);}
|
|
bool operator !=(const reverse_iterator & it) const {return (pos != it.pos);}
|
|
};
|
|
|
|
class const_reverse_iterator {
|
|
friend class PIVector<T>;
|
|
private:
|
|
const_reverse_iterator(const PIVector<T> * v, int p): parent(v), pos(p) {}
|
|
const PIVector<T> * parent;
|
|
int pos;
|
|
public:
|
|
const_reverse_iterator(): parent(0) {}
|
|
//T & operator *() {return (*parent)[pos];}
|
|
const T & operator *() const {return (*parent)[pos];}
|
|
void operator ++() {--pos;}
|
|
void operator ++(int) {--pos;}
|
|
void operator --() {++pos;}
|
|
void operator --(int) {++pos;}
|
|
bool operator ==(const const_reverse_iterator & it) const {return (pos == it.pos);}
|
|
bool operator !=(const const_reverse_iterator & it) const {return (pos != it.pos);}
|
|
};
|
|
|
|
iterator begin() {return iterator(this, 0);}
|
|
iterator end() {return iterator(this, size_);}
|
|
const_iterator begin() const {return const_iterator(this, 0);}
|
|
const_iterator end() const {return const_iterator(this, size_);}
|
|
reverse_iterator rbegin() {return reverse_iterator(this, size_ - 1);}
|
|
reverse_iterator rend() {return reverse_iterator(this, -1);}
|
|
const_reverse_iterator rbegin() const {return const_reverse_iterator(this, size_ - 1);}
|
|
const_reverse_iterator rend() const {return const_reverse_iterator(this, -1);}
|
|
|
|
uint size() const {return size_;}
|
|
int size_s() const {return size_;}
|
|
int length() const {return size_;}
|
|
bool isEmpty() const {return (size_ == 0);}
|
|
|
|
T & operator [](int index) {return data_[index];}
|
|
T & at(uint index) {return data_[index];}
|
|
const T & operator [](int index) const {return data_[index];}
|
|
const T & at(uint index) const {return data_[index];}
|
|
T & back() {return data_[size_ - 1];}
|
|
const T & back() const {return data_[size_ - 1];}
|
|
T & front() {return data_[0];}
|
|
const T & front() const {return data_[0];}
|
|
|
|
bool operator ==(const PIVector<T> & t) const {if (size_ != t.size_) return false; for (uint i = 0; i < size_; ++i) if (t[i] != data_[i]) return false; return true;}
|
|
bool operator !=(const PIVector<T> & t) const {if (size_ != t.size_) return true; for (uint i = 0; i < size_; ++i) if (t[i] != data_[i]) return true; return false;}
|
|
bool contain(const T & v) const {for (uint i = 0; i < size_; ++i) if (v == data_[i]) return true; return false;}
|
|
|
|
T * data(int index = 0) {return &(data_[index]);}
|
|
const T * data(int index = 0) const {return &(data_[index]);}
|
|
PIVector<T> & clear() {resize(0); return *this;}
|
|
PIVector<T> & fill(const T & f = T()) {
|
|
if (sizeof(T) == 1) memset(data_, f, size_);
|
|
else for (uint i = 0; i < size_; ++i) memcpy(&(data_[i]), &f, sizeof(T));
|
|
return *this;
|
|
}
|
|
PIVector<T> & assign(const T & f = T()) {return fill(f);}
|
|
PIVector<T> & resize(uint new_size, const T & f = T()) {
|
|
if (new_size < size_) {
|
|
size_ = new_size;
|
|
return *this;
|
|
}
|
|
if (new_size > size_) {
|
|
os = size_;
|
|
alloc(new_size);
|
|
uint ds = size_ - os;
|
|
//if (sizeof(T) == 1) memset(&(data_[os]), f, ds);
|
|
for (uint i = 0; i < ds; ++i) data_[os + i] = f;
|
|
return *this;
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
PIVector<T> & insert(int index, const T & v = T()) {
|
|
push_back(v);
|
|
if (index >= int(size_ - 1)) return *this;
|
|
os = size_ - index;
|
|
T * pd = new T[os * sizeof(T)];
|
|
memcpy(pd, &(data_[index]), os * sizeof(T));
|
|
memcpy(&(data_[index + 1]), pd, os * sizeof(T));
|
|
delete[] pd;
|
|
data_[index] = v;
|
|
return *this;
|
|
}
|
|
|
|
PIVector<T> & remove(int index, int count = 1) {
|
|
if (index + count >= int(size_)) {
|
|
resize(index);
|
|
return *this;
|
|
}
|
|
os = size_ - index - count;
|
|
T * pd = new T[os * sizeof(T)];
|
|
memcpy(pd, &(data_[index + count]), os * sizeof(T));
|
|
memcpy(&(data_[index]), pd, os * sizeof(T));
|
|
delete[] pd;
|
|
resize(size_ - count);
|
|
return *this;
|
|
}
|
|
|
|
typedef int (*CompareFunc)(const T * , const T * );
|
|
static int compare_func(const T * t0, const T * t1) {return (*t0) == (*t1) ? 0 : ((*t0) < (*t1) ? -1 : 1);}
|
|
PIVector<T> & sort(CompareFunc compare = compare_func) {qsort(data_, size_, sizeof(T), (int(*)(const void * , const void * ))compare); return *this;}
|
|
|
|
PIVector<T> & removeOne(const T & v) {for (uint i = 0; i < size_; ++i) if (data_[i] == v) {remove(i); return *this;} return *this;}
|
|
PIVector<T> & removeAll(const T & v) {for (uint i = 0; i < size_; ++i) if (data_[i] == v) {remove(i); --i;} return *this;}
|
|
|
|
PIVector<T> & push_back(const T & v) {alloc(size_ + 1); data_[size_ - 1] = v; return *this;}
|
|
PIVector<T> & append(const T & v) {return push_back(v);}
|
|
PIVector<T> & operator <<(const T & v) {return push_back(v);}
|
|
|
|
PIVector<T> & push_front(const T & v) {insert(0, v); return *this;}
|
|
PIVector<T> & prepend(const T & v) {return push_front(v);}
|
|
//PIVector<T> & operator <<(const T & v) {return push_back(v);}
|
|
|
|
PIVector<T> & pop_back() {if (size_ == 0) return *this; resize(size_ - 1); return *this;}
|
|
PIVector<T> & pop_front() {if (size_ == 0) return *this; remove(0); return *this;}
|
|
|
|
private:
|
|
uint asize(uint s) {if (s == 0) return 0; if (rsize_ + rsize_ >= s && rsize_ < s) return rsize_ + rsize_; uint t = 0, s_ = s - 1; while (s_ >> t) ++t; return (1 << t);}
|
|
void dealloc() {if (data_ != 0) delete[] data_; data_ = 0;}
|
|
void alloc(uint new_size) {
|
|
if (new_size <= rsize_) {
|
|
size_ = new_size;
|
|
return;
|
|
}
|
|
os = size_;
|
|
size_ = new_size;
|
|
uint as = asize(new_size);
|
|
if (as == rsize_) return;
|
|
T * pd = 0;
|
|
if (os > 0) {
|
|
pd = new T[os * sizeof(T)];
|
|
memcpy(pd, data_, os * sizeof(T));
|
|
}
|
|
rsize_ = as;
|
|
dealloc();
|
|
data_ = new T[rsize_ * sizeof(T)];
|
|
if (os > 0) {
|
|
memcpy(data_, pd, size_ * sizeof(T));
|
|
delete[] pd;
|
|
}
|
|
}
|
|
|
|
T * data_;
|
|
uint size_, rsize_, os;
|
|
};
|
|
*/
|
|
template<typename Type, typename Allocator = std::allocator<Type> >
|
|
class PIVector: public vector<Type, Allocator> {
|
|
typedef PIVector<Type, Allocator> _CVector;
|
|
typedef vector<Type, Allocator> _stlc;
|
|
public:
|
|
PIVector() {piMonitor.containers++;}
|
|
PIVector(const Type & value) {piMonitor.containers++; _stlc::push_back(value);}
|
|
PIVector(const Type & v0, const Type & v1) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1);}
|
|
PIVector(const Type & v0, const Type & v1, const Type & v2) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1); _stlc::push_back(v2);}
|
|
PIVector(const Type & v0, const Type & v1, const Type & v2, const Type & v3) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1); _stlc::push_back(v2); _stlc::push_back(v3);}
|
|
PIVector(uint size, const Type & value = Type()) {piMonitor.containers++; _stlc::resize(size, value);}
|
|
~PIVector() {piMonitor.containers--;}
|
|
const Type & at(uint index) const {return (*this)[index];}
|
|
Type & at(uint index) {return (*this)[index];}
|
|
const Type * data(uint index = 0) const {return &(*this)[index];}
|
|
Type * data(uint index = 0) {return &(*this)[index];}
|
|
int size_s() const {return static_cast<int>(_stlc::size());}
|
|
bool isEmpty() const {return _stlc::empty();}
|
|
typedef int (*CompareFunc)(const Type * , const Type * );
|
|
static int compare_func(const Type * t0, const Type * t1) {return (*t0) == (*t1) ? 0 : ((*t0) < (*t1) ? -1 : 1);}
|
|
_CVector & sort(CompareFunc compare = compare_func) {qsort(&at(0), _stlc::size(), sizeof(Type), (int(*)(const void * , const void * ))compare); return *this;}
|
|
_CVector & fill(const Type & t) {_stlc::assign(_stlc::size(), t); return *this;}
|
|
_CVector & pop_front() {_stlc::erase(_stlc::begin()); return *this;}
|
|
_CVector & push_front(const Type & t) {_stlc::insert(_stlc::begin(), t); return *this;}
|
|
Type take_front() {Type t(_stlc::front()); pop_front(); return t;}
|
|
Type take_back() {Type t(_stlc::back()); _stlc::pop_back(); return t;}
|
|
_CVector & remove(uint num) {_stlc::erase(_stlc::begin() + num); return *this;}
|
|
_CVector & remove(uint num, uint count) {_stlc::erase(_stlc::begin() + num, _stlc::begin() + num + count); return *this;}
|
|
//_CVector & remove(const Type & t) {for (typename _stlc::iterator i = _stlc::begin(); i != _stlc::end(); ++i) if (t == *i) {_stlc::erase(i); --i;} return *this;}
|
|
_CVector & removeOne(const Type & v) {for (typename _stlc::iterator i = _stlc::begin(); i != _stlc::end(); ++i) if (v == *i) {_stlc::erase(i); return *this;} return *this;}
|
|
_CVector & removeAll(const Type & v) {for (typename _stlc::iterator i = _stlc::begin(); i != _stlc::end(); ++i) if (v == *i) {_stlc::erase(i); --i;} return *this;}
|
|
_CVector & insert(uint pos, const Type & t) {_stlc::insert(_stlc::begin() + pos, t); return *this;}
|
|
_CVector & insert(uint pos, const _CVector & t) {_stlc::insert(_stlc::begin() + pos, t.begin(), t.end()); return *this;}
|
|
_CVector & operator <<(const Type & t) {_stlc::push_back(t); return *this;}
|
|
_CVector & operator <<(const _CVector & t) {for (typename _stlc::const_iterator i = t.begin(); i != t.end(); i++) _stlc::push_back(*i); return *this;}
|
|
bool operator ==(const _CVector & t) {for (uint i = 0; i < _stlc::size(); ++i) if (t[i] != at(i)) return false; return true;}
|
|
bool operator !=(const _CVector & t) {for (uint i = 0; i < _stlc::size(); ++i) if (t[i] != at(i)) return true; return false;}
|
|
bool contain(const Type & v) const {for (uint i = 0; i < _stlc::size(); ++i) if (v == at(i)) return true; return false;}
|
|
};
|
|
|
|
template<typename Type>
|
|
inline std::ostream & operator <<(std::ostream & s, const PIVector<Type> & v) {s << "{"; for (uint i = 0; i < v.size(); ++i) {s << v[i]; if (i < v.size() - 1) s << ", ";} s << "}"; return s;}
|
|
|
|
template<typename Type, typename Allocator = std::allocator<Type> >
|
|
class PIList: public list<Type, Allocator> {
|
|
typedef PIList<Type, Allocator> _CList;
|
|
typedef list<Type, Allocator> _stlc;
|
|
public:
|
|
PIList() {piMonitor.containers++;}
|
|
PIList(const Type & value) {piMonitor.containers++; _stlc::resize(1, value);}
|
|
PIList(const Type & v0, const Type & v1) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1);}
|
|
PIList(const Type & v0, const Type & v1, const Type & v2) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1); _stlc::push_back(v2);}
|
|
PIList(const Type & v0, const Type & v1, const Type & v2, const Type & v3) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1); _stlc::push_back(v2); _stlc::push_back(v3);}
|
|
PIList(uint size, const Type & value = Type()) {piMonitor.containers++; _stlc::resize(size, value);}
|
|
~PIList() {piMonitor.containers--;}
|
|
Type & operator [](uint index) {return (*this)[index];}
|
|
Type & operator [](uint index) const {return (*this)[index];}
|
|
const Type * data(uint index = 0) const {return &(*this)[index];}
|
|
Type * data(uint index = 0) {return &(*this)[index];}
|
|
int size_s() const {return static_cast<int>(_stlc::size());}
|
|
bool isEmpty() const {return _stlc::empty();}
|
|
_CList & fill(const Type & t) {_stlc::assign(_stlc::size(), t); return *this;}
|
|
_CList & remove(uint num) {_stlc::erase(_stlc::begin() + num); return *this;}
|
|
_CList & remove(uint num, uint count) {_stlc::erase(_stlc::begin() + num, _stlc::begin() + num + count); return *this;}
|
|
_CList & insert(uint pos, const Type & t) {_stlc::insert(_stlc::begin() + pos, t); return *this;}
|
|
_CList & operator <<(const Type & t) {_stlc::push_back(t); return *this;}
|
|
PIVector<Type> toVector() {PIVector<Type> v; for (typename _stlc::const_iterator i = _stlc::begin(); i != _stlc::end(); ++i) v << *i; return v;}
|
|
};
|
|
|
|
template<typename Type, typename Compare = std::less<Type>, typename Allocator = std::allocator<Type> >
|
|
class PISet: public set<Type, Compare, Allocator> {
|
|
typedef PISet<Type, Compare, Allocator> _CSet;
|
|
typedef set<Type, Compare, Allocator> _stlc;
|
|
public:
|
|
PISet() {piMonitor.containers++;}
|
|
PISet(const Type & value) {piMonitor.containers++; _stlc::resize(1, value);}
|
|
PISet(const Type & v0, const Type & v1) {piMonitor.containers++; _stlc::insert(v0); _stlc::insert(v1);}
|
|
PISet(const Type & v0, const Type & v1, const Type & v2) {piMonitor.containers++; _stlc::insert(v0); _stlc::insert(v1); _stlc::insert(v2);}
|
|
PISet(const Type & v0, const Type & v1, const Type & v2, const Type & v3) {piMonitor.containers++; _stlc::insert(v0); _stlc::insert(v1); _stlc::insert(v2); _stlc::insert(v3);}
|
|
~PISet() {piMonitor.containers--;}
|
|
int size_s() const {return static_cast<int>(_stlc::size());}
|
|
bool isEmpty() const {return _stlc::empty();}
|
|
_CSet & remove(uint num) {_stlc::erase(_stlc::begin() + num); return *this;}
|
|
_CSet & remove(uint num, uint count) {_stlc::erase(_stlc::begin() + num, _stlc::begin() + num + count); return *this;}
|
|
_CSet & operator <<(const Type & t) {_stlc::insert(t); return *this;}
|
|
bool operator [](const Type & t) {return _stlc::find(t);}
|
|
PIVector<Type> toVector() {PIVector<Type> v; for (typename _stlc::const_iterator i = _stlc::begin(); i != _stlc::end(); ++i) v << *i; return v;}
|
|
};
|
|
|
|
template<typename Type>
|
|
class PIStack: public PIVector<Type> {
|
|
typedef PIStack<Type> _CStack;
|
|
public:
|
|
PIStack() {;}
|
|
PIStack(const Type & value) {_CStack::resize(1, value);}
|
|
PIStack(const Type & v0, const Type & v1) {_CStack::push_back(v0); _CStack::push_back(v1);}
|
|
PIStack(const Type & v0, const Type & v1, const Type & v2) {_CStack::push_back(v0); _CStack::push_back(v1); _CStack::push_back(v2);}
|
|
PIStack(const Type & v0, const Type & v1, const Type & v2, const Type & v3) {_CStack::push_back(v0); _CStack::push_back(v1); _CStack::push_back(v2); _CStack::push_back(v3);}
|
|
_CStack & push(const Type & v) {_CStack::push_back(v); return *this;}
|
|
Type pop() {Type t = Type(); if (_CStack::size() == 0) return t; t = _CStack::back(); _CStack::pop_back(); return t;}
|
|
Type & top() {return _CStack::back();}
|
|
const Type & top() const {return _CStack::back();}
|
|
PIVector<Type> toVector() {PIVector<Type> v; for (typename _CStack::const_iterator i = _CStack::begin(); i != _CStack::end(); ++i) v << *i; return v;}
|
|
};
|
|
|
|
template<typename Type, typename Allocator = std::allocator<Type> >
|
|
class PIDeque: public deque<Type, Allocator> {
|
|
typedef PIDeque<Type, Allocator> _CDeque;
|
|
typedef deque<Type, Allocator> _stlc;
|
|
public:
|
|
PIDeque() {piMonitor.containers++;}
|
|
PIDeque(const Type & value) {piMonitor.containers++; _stlc::resize(1, value);}
|
|
PIDeque(const Type & v0, const Type & v1) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1);}
|
|
PIDeque(const Type & v0, const Type & v1, const Type & v2) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1); _stlc::push_back(v2);}
|
|
PIDeque(const Type & v0, const Type & v1, const Type & v2, const Type & v3) {piMonitor.containers++; _stlc::push_back(v0); _stlc::push_back(v1); _stlc::push_back(v2); _stlc::push_back(v3);}
|
|
~PIDeque() {piMonitor.containers--;}
|
|
int size_s() const {return static_cast<int>(_stlc::size());}
|
|
bool isEmpty() const {return _stlc::empty();}
|
|
_CDeque & operator <<(const Type & t) {_CDeque::push_back(t); return *this;}
|
|
PIVector<Type> toVector() {PIVector<Type> v; for (typename _stlc::const_iterator i = _stlc::begin(); i != _stlc::end(); ++i) v << *i; return v;}
|
|
};
|
|
|
|
template<typename Type>
|
|
class PIQueue: public PIDeque<Type> {
|
|
typedef PIQueue<Type> _CQueue;
|
|
public:
|
|
PIQueue() {;}
|
|
PIQueue(const Type & value) {_CQueue::resize(1, value);}
|
|
PIQueue(const Type & v0, const Type & v1) {_CQueue::push_front(v0); _CQueue::push_front(v1);}
|
|
PIQueue(const Type & v0, const Type & v1, const Type & v2) {_CQueue::push_front(v0); _CQueue::push_front(v1); _CQueue::push_front(v2);}
|
|
PIQueue(const Type & v0, const Type & v1, const Type & v2, const Type & v3) {_CQueue::push_front(v0); _CQueue::push_front(v1); _CQueue::push_front(v2); _CQueue::push_front(v3);}
|
|
_CQueue & enqueue(const Type & v) {_CQueue::push_front(v); return *this;}
|
|
Type dequeue() {Type t = Type(); if (_CQueue::size() == 0) return t; t = _CQueue::back(); _CQueue::pop_back(); return t;}
|
|
Type & head() {return _CQueue::back();}
|
|
const Type & head() const {return _CQueue::back();}
|
|
PIVector<Type> toVector() {PIVector<Type> v; for (typename _CQueue::const_iterator i = _CQueue::begin(); i != _CQueue::end(); ++i) v << *i; return v;}
|
|
};
|
|
|
|
|
|
template<typename Type0, typename Type1>
|
|
class PIPair {
|
|
public:
|
|
PIPair() {first = Type0(); second = Type1();}
|
|
PIPair(const Type0 & value0, const Type1 & value1) {first = value0; second = value1;}
|
|
Type0 first;
|
|
Type1 second;
|
|
};
|
|
template<typename Type0, typename Type1>
|
|
inline bool operator <(const PIPair<Type0, Type1> & value0, const PIPair<Type0, Type1> & value1) {return value0.first < value1.first;}
|
|
|
|
|
|
template<typename Key, typename Type>
|
|
class PIMap: public map<Key, Type> {
|
|
typedef PIMap<Key, Type> _CMap;
|
|
typedef map<Key, Type> _stlc;
|
|
typedef std::pair<Key, Type> _stlpair;
|
|
public:
|
|
PIMap() {;}
|
|
PIMap(const Key & key_, const Type & value_) {insert(key_, value_);}
|
|
_CMap & insert(const Key & key_, const Type & value_) {_stlc::insert(std::pair<Key, Type>(key_, value_)); return *this;}
|
|
_CMap & insert(PIPair<Key, Type> entry_) {_stlc::insert(std::pair<Key, Type>(entry_.first, entry_.second)); return *this;}
|
|
Key key(Type value_) const {for (typename _stlc::const_iterator i = _stlc::begin(); i != _stlc::end(); i++) if (i->second == value_) return i->first; return Key();}
|
|
Type & value(Key key_) {return (*this)[key_];}
|
|
Type value(Key key_) const {return (*this)[key_];}
|
|
};
|
|
|
|
#endif // PICONTAINERS_H
|