blob: 3de16a493631a6af09cd1280754419085a0a3f0b (
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
|
/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author(s): Marc Glisse
*
* Copyright (C) 2015 Inria
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef ALLOCATOR_H_
#define ALLOCATOR_H_
#include <memory>
#include <utility>
namespace Gudhi {
/** \private
* An allocator that can be used to build an uninitialized vector.
*/
template <class T, class Base = std::allocator<T>>
struct no_init_allocator : Base {
typedef std::allocator_traits<Base> Base_traits;
template <class U> struct rebind {
typedef no_init_allocator<U, typename Base_traits::template rebind_alloc<U>> other;
};
// Inherit constructors.
using Base::Base;
// Do nothing: that's the whole point!
template<class P>
void construct(P*) noexcept {}
template<class P, class...U> void construct(P*p, U&&...u) {
Base_traits::construct(*(Base*)this, p, std::forward<U>(u)...);
}
};
} // namespace Gudhi
#endif // ALLOCATOR_H_
|
