blob: 8c79b99bb21d70b32a1d2e09828d8665750718d9 (
plain)
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
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
Copyright (c) 2007-2010 iMatix Corporation
This file is part of 0MQ.
0MQ is free software; you can redistribute it and/or modify it under
the terms of the Lesser GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
0MQ 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
Lesser GNU General Public License for more details.
You should have received a copy of the Lesser GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __ZMQ_YARRAY_INCLUDED__
#define __ZMQ_YARRAY_INCLUDED__
#include <vector>
#include <algorithm>
namespace zmq
{
// Fast array implementation with O(1) access to item, insertion and
// removal. Yarray stores pointers rather than objects. The objects have
// to be derived from yarray_item_t class.
template <typename T> class yarray_t
{
public:
typedef typename std::vector <T*>::size_type size_type;
inline yarray_t ()
{
}
inline ~yarray_t ()
{
}
inline size_type size ()
{
return items.size ();
}
inline bool empty ()
{
return items.empty ();
}
inline T *&operator [] (size_type index_)
{
return items [index_];
}
inline void push_back (T *item_)
{
if (item_)
item_->set_yarray_index (items.size ());
items.push_back (item_);
}
inline void erase (T *item_) {
erase (item_->get_yarray_index ());
}
inline void erase (size_type index_) {
if (items.back ())
items.back ()->set_yarray_index (index_);
items [index_] = items.back ();
items.pop_back ();
}
inline void swap (size_type index1_, size_type index2_)
{
if (items [index1_])
items [index1_]->set_yarray_index (index2_);
if (items [index2_])
items [index2_]->set_yarray_index (index1_);
std::swap (items [index1_], items [index2_]);
}
inline void clear ()
{
items.clear ();
}
inline size_type index (T *item_)
{
return (size_type) item_->get_yarray_index ();
}
private:
typedef std::vector <T*> items_t;
items_t items;
yarray_t (const yarray_t&);
void operator = (const yarray_t&);
};
}
#endif
|
