summaryrefslogtreecommitdiff
path: root/math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h
diff options
context:
space:
mode:
authorYuri Victorovich <yuri@FreeBSD.org>2022-07-15 10:41:42 -0700
committerYuri Victorovich <yuri@FreeBSD.org>2022-07-15 10:42:15 -0700
commit4f0c26c304e87ca5271983bc6dd9bab2354a49fc (patch)
tree37fdc77174df888ca951d5c109d6af7086041dbe /math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h
parentmath/R-cran-recipes: Update to 1.0.1 (diff)
math/combblas: Update 1.6.2 -> 2.0.0
Diffstat (limited to 'math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h')
-rw-r--r--math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h22
1 files changed, 22 insertions, 0 deletions
diff --git a/math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h b/math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h
new file mode 100644
index 000000000000..eafeb4939e62
--- /dev/null
+++ b/math/combblas/files/patch-Applications_BipartiteMatchings_ApproxWeightPerfectMatching.h
@@ -0,0 +1,22 @@
+--- Applications/BipartiteMatchings/ApproxWeightPerfectMatching.h.orig 2022-07-15 16:38:29 UTC
++++ Applications/BipartiteMatchings/ApproxWeightPerfectMatching.h
+@@ -12,8 +12,8 @@
+ #include "CombBLAS/CombBLAS.h"
+ #include "BPMaximalMatching.h"
+ #include "BPMaximumMatching.h"
+-#include <parallel/algorithm>
+-#include <parallel/numeric>
++#include <algorithm>
++//#include <parallel/numeric>
+ #include <memory>
+ #include <limits>
+
+@@ -563,7 +563,7 @@ std::vector< std::tuple<IT,IT,IT,NT> > Phase2(const AW
+ double tstart = MPI_Wtime();
+
+ // Step 1: Sort for effecient searching of indices
+- __gnu_parallel::sort(recvTuples.begin(), recvTuples.end());
++ sort(recvTuples.begin(), recvTuples.end());
+ std::vector<std::vector<std::tuple<IT,IT, IT, NT>>> tempTuples1 (param.nprocs);
+
+ std::vector<int> sendcnt(param.nprocs,0); // number items to be sent to each processor