Minor optimization.

Author: 5cript

draw.hpp

@@ -16,7 +16,7 @@ namespace lib_interval_tree
 {
     namespace
     {
-        using int_tree_for_draw = interval_tree <int, closed>;
+        using int_tree_for_draw = interval_tree <interval<int, closed>>;
         using int_tree_iterator = int_tree_for_draw::iterator;
         using const_int_tree_iterator = int_tree_for_draw::const_iterator;
 

interval_tree.hpp

@@ -673,9 +673,10 @@ namespace lib_interval_tree
         /**
          *  Inserts an interval into the tree.
          */
-        iterator insert(interval_type const& ival)
+        template <typename IntervalType = interval_type>
+        iterator insert(IntervalType&& ival)
         {
-            node_type* z = new node_type(nullptr, ival);
+            node_type* z = new node_type(nullptr, std::forward <IntervalType&&> (ival));
             node_type* y = nullptr;
             node_type* x = root_;
             while (x)
@@ -708,9 +709,10 @@ namespace lib_interval_tree
          *  @param ival The interval
          *  @param exclusive Exclude borders.
          */
-        iterator insert_overlap(interval_type const& ival, bool exclusive = false)
+        template <typename IntervalType = interval_type>
+        iterator insert_overlap(IntervalType&& ival, bool exclusive = false)
         {
-            auto iter = overlap_find(ival, exclusive);
+            auto iter = overlap_find(std::forward <IntervalType&&> (ival), exclusive);
             if (iter == end())
                 return insert(ival);
             else