Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
82 lines (58 loc) · 1.69 KB

File metadata and controls

82 lines (58 loc) · 1.69 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#include <iostream>
// new (adresse) Type(constructor_args…)
// Une idée comme ça:
// faire un système d'allocator avec Mixins
// et CRTP pour pouvoir swap et composer ;)
struct Point {
int x, y;
Point(int a, int b) : x(a), y(b) {}
void print() { std::cout << "(" << x << "," << y << ")\n"; }
};
template<typename T>
struct Allocator {
T* allocate(std::size_t n) {
return static_cast<T*>(::operator new(sizeof(T) * n));
}
void deallocate(T* ptr, std::size_t n) {
::operator delete(ptr);
}
template<typename... Args>
void construct(T* ptr, Args&&... args) {
new (ptr) T(std::forward<Args>(args)...);
}
void destroy(T* ptr) {
ptr->~T();
}
std::size_t max_size() const {
return std::numeric_limits<std::size_t>::max() / sizeof(T);
}
};
int main() {
{
auto a = 1.34534554645645643535;
void* mem = ::operator new(100);
::operator delete(mem);
//std::cout << sizeof(a) << "\n";
}
{
void* p_mem = ::operator new(sizeof(Point));
Point* p1 = new (p_mem) Point(10, 10);
//p1->print();
p1->~Point();
::operator delete(p_mem);
}
{
std::size_t n = 10;
Allocator<Point> alloc;
Point* base = alloc.allocate(n);
std::cout << "Max Point objects in memory: "
<< alloc.max_size() << "\n";
for (std::size_t i = 0; i < n; i++)
alloc.construct(base + i, i, i + 10);
for (std::size_t i = 0; i < n; i++)
base[i].print();
for (std::size_t i = 0; i < n; i++)
alloc.destroy(base);
alloc.deallocate(base, n);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.