blob: 1b94f316f248d6dc00fc81cb329a84e67c561192 (
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
111
112
113
114
115
116
117
118
119
120
121
122
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef INCLUDED_O3TL_VECTOR_POOL_HXX
#define INCLUDED_O3TL_VECTOR_POOL_HXX
#include <vector>
namespace o3tl
{
namespace detail
{
template<typename ValueType, class Container> class simple_pool_impl :
public Container
{
typedef typename Container::value_type value_type;
std::ptrdiff_t mnFirstFreeIndex;
public:
simple_pool_impl() :
mnFirstFreeIndex(-1)
{}
std::ptrdiff_t alloc()
{
return store(ValueType());
}
std::ptrdiff_t store(const ValueType& rCopy)
{
if( mnFirstFreeIndex != -1 )
{
std::ptrdiff_t nIdx=mnFirstFreeIndex;
mnFirstFreeIndex = this->at(mnFirstFreeIndex).nextFree;
this->at(nIdx).value = rCopy;
this->at(nIdx).nextFree = -1;
return nIdx;
}
else
{
this->push_back(value_type(rCopy));
return this->size()-1;
}
}
void free( std::ptrdiff_t nIdx )
{
this->at(nIdx).nextFree = mnFirstFreeIndex;
mnFirstFreeIndex = nIdx;
}
const ValueType& get( std::ptrdiff_t nIdx ) const
{
return this->operator[](nIdx).value;
}
ValueType& get( std::ptrdiff_t nIdx )
{
return this->operator[](nIdx).value;
}
};
template< typename ValueType > struct struct_from_value
{
struct type
{
type() :
value(),
nextFree(-1)
{}
explicit type( const ValueType& val ) :
value(val),
nextFree(-1)
{}
ValueType value;
std::ptrdiff_t nextFree;
};
};
}
/** Simple vector-based memory pool allocator
This template can be used to provide simple pooled memory
allocation from a container class that adheres to the stl
random access container concept. Note that alloc/free works
with _indices_ into the container!
@example
<pre>
vector_pool<type> myPool;
int nIdx=myPool.alloc();
myPool[nIdx] = myVal;
... do stuff ...
myPool.free(nIdx);
</pre>
*/
template<typename ValueType> struct vector_pool :
public detail::simple_pool_impl<ValueType,
std::vector<typename detail::struct_from_value<ValueType>::type > >
{};
}
#endif /* INCLUDED_O3TL_VECTOR_POOL_HXX */
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
