SquareGameLiberationFront/F.E.I.S
1
0
Fork 0
mirror of https://gitlab.com/square-game-liberation-front/F.E.I.S.git synced 2025-02-28 23:41:33 +01:00
Code Releases Wiki Activity

Update interval_tree.hpp

Browse Source
This commit is contained in:
Stepland 2022-04-12 23:00:31 +02:00
parent dcb0614bf6
commit 6adf48cb77
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
include/interval_tree.hpp
View File

@ -1,6 +1,6 @@
/* /*
From my own for of : https://github.com/NicoG60/interval-tree From my own fork of https://github.com/NicoG60/interval-tree
(https://github.com/Stepland/interval-tree) ( https://github.com/Stepland/interval-tree )
*/ */
#ifndef INTERVAL_TREE_H #ifndef INTERVAL_TREE_H
@ -430,7 +430,7 @@ public:
template<class P, typename std::enable_if<std::is_convertible<value_type, P&&>::value, int>::type = 0> template<class P, typename std::enable_if<std::is_convertible<value_type, P&&>::value, int>::type = 0>
iterator insert(P&& value) iterator insert(P&& value)
{ {
return emplace(std::forward(value)); return emplace(std::forward<P>(value));
} }
iterator insert(const_iterator hint, const value_type& value) iterator insert(const_iterator hint, const value_type& value)
@ -530,7 +530,7 @@ public:
if(!root) if(!root)
return 0; return 0;
node* n = find(root, key); node* n = _find<node*>(key);
if(!n) if(!n)
return 0; return 0;
@ -1211,7 +1211,7 @@ bool operator==(const interval_tree<K, T, C>& lhs,
auto rit = rhs.cbegin(); auto rit = rhs.cbegin();
auto er = rhs.cend(); auto er = rhs.cend();
while(lit != el && rit != er) for(;lit != el && rit != er; ++lit, ++rit)
{ {
if(*lit != *rit) if(*lit != *rit)
return false; return false;