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
|
/* Copyright (c) 1997-2024
Ewgenij Gawrilow, Michael Joswig, and the polymake team
Technische Universität Berlin, Germany
https://polymake.org
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 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
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.
--------------------------------------------------------------------------------
*/
#pragma once
#include <cstddef>
#include <memory>
#if defined(__GLIBCXX__)
# include <ext/pool_allocator.h>
# define PM_ALLOCATOR_BASE __gnu_cxx::__pool_alloc
#else
# define PM_ALLOCATOR_BASE std::allocator
#endif
namespace pm {
class allocator : public PM_ALLOCATOR_BASE<char> {
using base_t = PM_ALLOCATOR_BASE<char>;
public:
void* allocate(std::size_t n)
{
#if __cplusplus < 201703L
return base_t::allocate(n, nullptr);
#else
return base_t::allocate(n);
#endif
}
void deallocate(void* p, std::size_t n)
{
base_t::deallocate(reinterpret_cast<char*>(p), n);
}
void* reallocate(void* p, std::size_t old_sz, std::size_t new_sz);
template <typename Data, typename... Args>
Data* construct(Args&&... args)
{
return new(allocate(sizeof(Data))) Data(std::forward<Args>(args)...);
}
template <typename Data>
void destroy(Data* p)
{
p->~Data();
deallocate(p, sizeof(Data));
}
};
}
#undef PM_ALLOCATOR_BASE
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|
