Make functions inline

Since the function definitions might appear across multiple translation units, they should be defined inline.
ParBLiSS · May 1, 2023 · 3b68bef · 3b68bef
1 parent c50ef8c
commit 3b68bef
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/include/pairg/heuristics.hpp b/include/pairg/heuristics.hpp
@@ -22,7 +22,7 @@ namespace pairg
    *                    the target vertex
    * @return            boolean value (true if reached, false if not)
    */
-  bool queryReachabilityBFS(const matrixOps::crsMat_t &A, int d_up, matrixOps::lno_t src, matrixOps::lno_t target)
+  inline bool queryReachabilityBFS(const matrixOps::crsMat_t &A, int d_up, matrixOps::lno_t src, matrixOps::lno_t target)
   {
     if (src >= A.numRows() || target >= A.numCols()) {
       std::cout << "WARNING, pairg::matrixOps::queryValue, query index out of range" << std::endl;

diff --git a/include/pairg/reachability.hpp b/include/pairg/reachability.hpp
@@ -14,7 +14,7 @@ namespace pairg
    * @brief     build adjacency matrix from variaton graph
    */
   template< class TCharGraph >
-  matrixOps::crsMat_t getAdjacencyMatrix(const TCharGraph &cg)
+  inline matrixOps::crsMat_t getAdjacencyMatrix(const TCharGraph &cg)
   {
     typename matrixOps::lno_t nrows = cg.numVertices;
     typename matrixOps::size_type nnz = cg.numEdges;
@@ -47,7 +47,7 @@ namespace pairg
    * @return           validity matrix
    *                   cell (i,j) = 1 iff there is a valid path from v_i to v_j
    */
-  matrixOps::crsMat_t buildValidPairsMatrix(const matrixOps::crsMat_t &A, int d_low, int d_up)
+  inline matrixOps::crsMat_t buildValidPairsMatrix(const matrixOps::crsMat_t &A, int d_low, int d_up)
   {
     pairg::timer T1;
     matrixOps::crsMat_t B = matrixOps::addMatrices(A, matrixOps::createIdentityMatrix(A.numRows()));