Skip to content

Fixed build issue for gcc. #26

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 24, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 18 additions & 4 deletions include/interval-tree/interval_tree.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -205,6 +205,11 @@ namespace lib_interval_tree
friend lib_interval_tree::interval_tree_iterator <node <numerical_type, interval_type>, true>;
friend lib_interval_tree::interval_tree_iterator <node <numerical_type, interval_type>, false>;

template <typename T>
friend void increment(T& iter);
template <typename T>
friend void increment_reverse(T& iter);

public:
node(node* parent, interval_type interval)
: interval_{std::move(interval)}
Expand Down Expand Up @@ -432,8 +437,10 @@ namespace lib_interval_tree
const_interval_tree_iterator& operator=(const_interval_tree_iterator const&) = default;
const_interval_tree_iterator& operator=(const_interval_tree_iterator&&) noexcept = default;

friend void increment<const_interval_tree_iterator<node_type, reverse>>(const_interval_tree_iterator<node_type, reverse>& iter);
friend void increment_reverse<const_interval_tree_iterator<node_type, reverse>>(const_interval_tree_iterator<node_type, reverse>& iter);
template <typename T>
friend void increment(T& iter);
template <typename T>
friend void increment_reverse(T& iter);

const_interval_tree_iterator& operator++()
{
Expand Down Expand Up @@ -535,8 +542,10 @@ namespace lib_interval_tree
interval_tree_iterator& operator=(interval_tree_iterator const&) = default;
interval_tree_iterator& operator=(interval_tree_iterator&&) noexcept = default;

friend void increment<interval_tree_iterator<node_type, reverse>>(interval_tree_iterator<node_type, reverse>& iter);
friend void increment_reverse<interval_tree_iterator<node_type, reverse>>(interval_tree_iterator<node_type, reverse>& iter);
template <typename T>
friend void increment(T& iter);
template <typename T>
friend void increment_reverse(T& iter);

interval_tree_iterator& operator++()
{
Expand Down Expand Up @@ -702,6 +711,11 @@ namespace lib_interval_tree
friend interval_tree_iterator <node_type, true>;
friend interval_tree_iterator <node_type, false>;

template <typename T>
friend void increment(T& iter);
template <typename T>
friend void increment_reverse(T& iter);

public:
interval_tree()
: root_{nullptr}
Expand Down