1
// rak - Rakshasa's toolbox
2
// Copyright (C) 2005-2007, Jari Sundell
4
// This program is free software; you can redistribute it and/or modify
5
// it under the terms of the GNU General Public License as published by
6
// the Free Software Foundation; either version 2 of the License, or
7
// (at your option) any later version.
9
// This program is distributed in the hope that it will be useful,
10
// but WITHOUT ANY WARRANTY; without even the implied warranty of
11
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
// GNU General Public License for more details.
14
// You should have received a copy of the GNU General Public License
15
// along with this program; if not, write to the Free Software
16
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18
// In addition, as a special exception, the copyright holders give
19
// permission to link the code of portions of this program with the
20
// OpenSSL library under certain conditions as described in each
21
// individual source file, and distribute linked combinations
24
// You must obey the GNU General Public License in all respects for
25
// all of the code used other than OpenSSL. If you modify file(s)
26
// with this exception, you may extend this exception to your version
27
// of the file(s), but you are not obligated to do so. If you do not
28
// wish to do so, delete this exception statement from your version.
29
// If you delete this exception statement from all source files in the
30
// program, then also delete it here.
32
// Contact: Jari Sundell <jaris@ifi.uio.no>
35
// 3185 Skoppum, NORWAY
37
#ifndef RAK_UNORDERED_VECTOR_H
38
#define RAK_UNORDERED_VECTOR_H
44
template <typename _Tp>
45
class unordered_vector : private std::vector<_Tp> {
47
typedef std::vector<_Tp> Base;
49
typedef typename Base::value_type value_type;
50
typedef typename Base::pointer pointer;
51
typedef typename Base::const_pointer const_pointer;
52
typedef typename Base::reference reference;
53
typedef typename Base::const_reference const_reference;
54
typedef typename Base::size_type size_type;
55
typedef typename Base::difference_type difference_type;
56
typedef typename Base::allocator_type allocator_type;
58
typedef typename Base::iterator iterator;
59
typedef typename Base::reverse_iterator reverse_iterator;
60
typedef typename Base::const_iterator const_iterator;
61
typedef typename Base::const_reverse_iterator const_reverse_iterator;
75
using Base::push_back;
78
// Use the range erase function, the single element erase gets
82
iterator insert(iterator position, const value_type& x);
83
iterator erase(iterator position);
88
template <typename _Tp>
89
typename unordered_vector<_Tp>::iterator
90
unordered_vector<_Tp>::insert(iterator position, const value_type& x) {
96
template <typename _Tp>
97
typename unordered_vector<_Tp>::iterator
98
unordered_vector<_Tp>::erase(iterator position) {
99
// We don't need to check if position == end - 1 since we then copy
100
// to the position we pop later.
101
*position = Base::back();