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
|
/*
* This file is part of din.
*
* din is copyright (c) 2006 - 2012 S Jagannathan <jag@dinisnoise.org>
* For more information, please visit http://dinisnoise.org
*
* din 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 2 of the License, or
* (at your option) any later version.
*
* din 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 din. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef __container
#define __container
template<class S, class T> inline void clear (S& container) {
// clears container of pointers. deletes the pointers.
typedef typename S::iterator Si;
for (Si i = container.begin(), j = container.end(); i != j; ++i) {
T* t = *i;
delete t;
}
container.clear ();
}
template<class T> inline void erase (T& container, unsigned int q) {
// erases qth item in container
typedef typename T::iterator Ti;
Ti iter = container.begin();
for (unsigned int p = 0; p < q; ++p, ++iter);
if (iter != container.end()) container.erase (iter);
}
template<class S, class T> inline T& get (S& container, unsigned int q) {
// gets qth item in container
typedef typename S::iterator Si;
Si iter = container.begin ();
for (unsigned int p = 0; p < q; ++p, ++iter);
return *iter;
}
template<class S, class T, class I> inline T& get (S& container, I& iter, unsigned int q) {
// gets qth item of container and its iterator
iter = container.begin ();
for (unsigned int p = 0; p < q; p++, ++iter);
return *iter;
}
#endif
|