Pass rr edge indices by value in edge sorting functors

Author: AmirhosseinPoolad

libs/librrgraph/src/base/rr_graph_storage.cpp

@@ -143,7 +143,7 @@ class edge_compare_dest_node {
 public:
     edge_compare_dest_node(const t_rr_graph_storage& rr_graph_storage) : rr_graph_storage_(rr_graph_storage) {}
 
-    bool operator()(const size_t& lhs_idx, const size_t& rhs_idx) {
+    bool operator()(size_t lhs_idx, size_t rhs_idx) const {
         RREdgeId lhs = RREdgeId(lhs_idx);
         RREdgeId rhs = RREdgeId(rhs_idx);
 
@@ -269,7 +269,7 @@ class edge_compare_src_node_and_configurable_first {
         : rr_switch_inf_(rr_switch_inf),
           rr_graph_storage_(rr_graph_storage) {}
 
-    bool operator()(const size_t& lhs_idx, const size_t& rhs_idx) {
+    bool operator()(size_t lhs_idx, size_t rhs_idx) const {
         RREdgeId lhs = RREdgeId(lhs_idx);
         RREdgeId rhs = RREdgeId(rhs_idx);
 

libs/librrgraph/src/base/rr_graph_storage.h

@@ -818,7 +818,7 @@ class t_rr_graph_storage {
      * @brief Sorts edges according to comparison_function. This is an expensive method that builds the edge array from scratch
      * and invalidates all the RREdgeIds. This is not an inplace sort, and it is very expensive.
      * You should not be calling this method more than once or twice in the entire program, definitely do not use it in a hot loop.
-     * @tparam t_comp_func callable object with two const size_t& arguments. See 'edge_compare_dest_node' for example.
+     * @tparam t_comp_func callable object with two size_t arguments. See 'edge_compare_dest_node' for example.
      * @param comparison_function Comparison function to order edges with.
      */
     template <typename t_comp_func>