1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
20 #ifndef INCLUDED_O3TL_VECTOR_POOL_HXX
21 #define INCLUDED_O3TL_VECTOR_POOL_HXX
30 template<typename ValueType
, class Container
> class simple_pool_impl
:
33 typedef typename
Container::value_type value_type
;
34 std::ptrdiff_t mnFirstFreeIndex
;
41 std::ptrdiff_t alloc()
43 return store(ValueType());
46 std::ptrdiff_t store(const ValueType
& rCopy
)
48 if( mnFirstFreeIndex
!= -1 )
50 std::ptrdiff_t nIdx
=mnFirstFreeIndex
;
51 mnFirstFreeIndex
= this->at(mnFirstFreeIndex
).nextFree
;
52 this->at(nIdx
).value
= rCopy
;
53 this->at(nIdx
).nextFree
= -1;
59 this->push_back(value_type(rCopy
));
60 return this->size()-1;
64 void free( std::ptrdiff_t nIdx
)
66 this->at(nIdx
).nextFree
= mnFirstFreeIndex
;
67 mnFirstFreeIndex
= nIdx
;
70 const ValueType
& get( std::ptrdiff_t nIdx
) const
72 return this->operator[](nIdx
).value
;
74 ValueType
& get( std::ptrdiff_t nIdx
)
76 return this->operator[](nIdx
).value
;
80 template< typename ValueType
> struct struct_from_value
88 explicit type( ValueType val
) :
89 value(std::move(val
)),
94 std::ptrdiff_t nextFree
;
99 /** Simple vector-based memory pool allocator
101 This template can be used to provide simple pooled memory
102 allocation from a container class that adheres to the stl
103 random access container concept. Note that alloc/free works
104 with _indices_ into the container!
108 vector_pool<type> myPool;
109 int nIdx=myPool.alloc();
110 myPool[nIdx] = myVal;
115 template<typename ValueType
> struct vector_pool
:
116 public detail::simple_pool_impl
<ValueType
,
117 std::vector
<typename
detail::struct_from_value
<ValueType
>::type
> >
121 #endif /* INCLUDED_O3TL_VECTOR_POOL_HXX */
123 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */