PrimeDecomp/prime
2
0
Fork 0
mirror of https://github.com/PrimeDecomp/prime.git synced 2025-12-16 08:57:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixing build

Browse Source
This commit is contained in:
Henrique Gemignani Passos Lima
2022-12-22 01:26:49 -03:00
parent e088e8cbd9
commit f8e02c251c
9 changed files with 16 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/rstl/algorithm.hpp
View File

@@ -146,10 +146,10 @@ public:
};
template <typename T>
inline pair_sorter_finder< T::value_type, less< select1st< typename T::value_type >::value_type > > default_pair_sorter_finder()
inline pair_sorter_finder< typename T::value_type, less< typename select1st< typename T::value_type >::value_type > > default_pair_sorter_finder()
{
less< select1st< typename T::value_type >::value_type > l;
pair_sorter_finder< T::value_type, less< select1st< typename T::value_type >::value_type > > a(l);
less< typename select1st< typename T::value_type >::value_type > l;
pair_sorter_finder< typename T::value_type, less< typename select1st< typename T::value_type >::value_type > > a(l);
return a;
}

6
include/rstl/red_black_tree.hpp
View File

@@ -101,9 +101,9 @@ public:
struct iterator : public const_iterator {
iterator(node* node, const header* header, bool b) : const_iterator(node, header, b) {}
P* operator->() { return mNode->get_value(); }
P* operator*() { return mNode->get_value(); }
node* get_node() { return mNode; }
P* operator->() { return const_iterator::mNode->get_value(); }
P* operator*() { return const_iterator::mNode->get_value(); }
node* get_node() { return const_iterator::mNode; }
};
red_black_tree() : x0_(0), x1_(0), x4_count(0) {}