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
|
// This file is part of The New Aspell
// Copyright (C) 2001-2003 by Kevin Atkinson under the GNU LGPL license
// version 2.0 or 2.1. You should have received a copy of the LGPL
// license along with this library if you did not you can find
// it at http://www.gnu.org/.
#ifndef ASPELL_VECTOR__HPP
#define ASPELL_VECTOR__HPP
#include <vector>
namespace acommon
{
template <typename T>
class Vector : public std::vector<T>
{
public:
Vector() {}
Vector(unsigned int s) : std::vector<T>(s) {}
Vector(unsigned int s, const T & val) : std::vector<T>(s, val) {}
void append(T t) {
this->push_back(t);
}
void append(const T * begin, unsigned int size) {
insert(this->end(), begin, begin+size);
}
void append(const T * begin, const T * end) {
insert(this->end(), begin, end);
}
int alloc(int s) {
int pos = this->size();
this->resize(pos + s);
return pos;
}
T * data() {return &*this->begin();}
T * data(int pos) {return &*this->begin() + pos;}
T * data_end() {return &*this->end();}
T * pbegin() {return &*this->begin();}
T * pend() {return &*this->end();}
const T * pbegin() const {return &*this->begin();}
const T * pend() const {return &*this->end();}
template <typename U>
U * datap() {
return reinterpret_cast<U * >(&this->front());
}
template <typename U>
U * datap(int pos) {
return reinterpret_cast<U * >(&this->front() + pos);
}
void pop_front() {this->erase(this->begin());}
void push_front(const T & v) {this->insert(this->begin(), v);}
};
}
#endif
|
