@@ -806,7 +806,7 @@ class IntervalTree
806806
807807 if (node->left != m_nill
808808 && (boundary ? !(node->left ->highest < interval.low ) : interval.low < node->left ->highest )) {
809- subtreeOverlappingIntervals (node->left , interval, boundary, std::forward<Callback>( callback) );
809+ subtreeOverlappingIntervals (node->left , interval, boundary, callback);
810810 }
811811
812812 if (boundary ? !(interval.high < node->intervals .front ().low ) : node->intervals .front ().low < interval.high ) {
@@ -833,7 +833,7 @@ class IntervalTree
833833 }
834834
835835 if (boundary ? !(node->intervals .front ().low < interval.low ) : interval.low < node->intervals .front ().low ) {
836- subtreeInnerIntervals (node->left , interval, boundary, std::forward<Callback>( callback) );
836+ subtreeInnerIntervals (node->left , interval, boundary, callback);
837837 for (auto it = node->intervals .begin (); it != node->intervals .end (); ++it) {
838838 if (boundary ? !(interval.high < it->high ) : it->high < interval.high ) {
839839 callback (*it);
@@ -861,7 +861,7 @@ class IntervalTree
861861
862862 if (node->left != m_nill
863863 && (boundary ? !(node->left ->highest < interval.high ) : interval.high < node->left ->highest )) {
864- subtreeOuterIntervals (node->left , interval, boundary, std::forward<Callback>( callback) );
864+ subtreeOuterIntervals (node->left , interval, boundary, callback);
865865 }
866866
867867 if (boundary ? !(interval.low < node->intervals .front ().low ) : node->intervals .front ().low < interval.low ) {
@@ -889,7 +889,7 @@ class IntervalTree
889889
890890 if (node->left != m_nill
891891 && (boundary ? !(node->left ->highest < point) : point < node->left ->highest )) {
892- subtreeIntervalsContainPoint (node->left , point, boundary, std::forward<Callback>( callback) );
892+ subtreeIntervalsContainPoint (node->left , point, boundary, callback);
893893 }
894894
895895 if (boundary ? !(point < node->intervals .front ().low ) : node->intervals .front ().low < point) {
0 commit comments