PrimeDecomp/prime
2
0
Fork 0
mirror of https://github.com/PrimeDecomp/prime.git synced 2025-12-11 19:43:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

More CMediumAllocPool matches

Browse Source 
Former-commit-id: 07962b0ff0
This commit is contained in:
Phillip Stephens
2023-10-03 23:56:48 -07:00
parent 67e861c0f0
commit ec593c79e5
3 changed files with 45 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
include/rstl/list.hpp
View File

@@ -12,7 +12,7 @@ class list {
public:
class iterator;
class const_iterator;
iterator erase(const iterator& item);
iterator erase(const iterator& item) { return do_erase(item.get_node()); }
private:
struct node;
@@ -33,9 +33,7 @@ public:
size_t size() const { return x14_count; }
bool empty() const { return x14_count == 0; }
void pop_front() {
erase(x4_start);
}
void pop_front() { erase(x4_start); }
iterator begin() { return iterator(x4_start); }
const_iterator begin() const { return const_iterator(x4_start); }
@@ -45,15 +43,15 @@ public:
iterator erase(const iterator& start, const iterator& end) {
node* last = end.get_node();
node* it = start.get_node();
for(node* t = it; t != last; t = t->get_next()) {
for (node* t = it; t != last; t = t->get_next()) {
}
while (it != last) {
it = do_erase(it);
}
return iterator(it);
}
struct node {
node* x0_prev;
node* x4_next;
@@ -72,7 +70,7 @@ public:
node* create_node(node* prev, node* next, const T& val) {
node* n;
x0_allocator.allocate(n, 1);
new(n) node(prev, next);
new (n) node(prev, next);
construct(n->get_value(), val);
return n;
}
@@ -166,7 +164,6 @@ list< T, Alloc >::~list() {
}
}
template < typename T, typename Alloc >
typename list< T, Alloc >::node* list< T, Alloc >::do_erase(node* node) {
typename list< T, Alloc >::node* result = node->get_next();