Commit 32f4739b authored by BRAMAS Berenger's avatar BRAMAS Berenger
Browse files

update anonymous fonction prototype

parent 7d15edd4
......@@ -153,7 +153,7 @@ public:
FAssert(np == flag, "Bitonic sort work only with power of 2 for now.")
}
FQuickSort<SortType,IndexType>::QsOmp(array, size, [&](const SortType& v1, const SortType& v2){
FQuickSort<SortType,IndexType>::QsOmp(array, size, [](const SortType& v1, const SortType& v2){
return CompareType(v1) <= CompareType(v2);
});
......@@ -177,7 +177,7 @@ public:
}
// A merge sort is possible since the array is composed
// by two part already sorted, but we want to do this in space
FQuickSort<SortType,IndexType>::QsOmp(array, size, [&](const SortType& v1, const SortType& v2){
FQuickSort<SortType,IndexType>::QsOmp(array, size, [](const SortType& v1, const SortType& v2){
return CompareType(v1) <= CompareType(v2);
});
}
......
......@@ -424,7 +424,7 @@ public:
////FLOG( FLog::Controller << currentComm.processId() << "] Sequential sort\n"; )
// Finish by a local sort
FQuickSort< SortType, IndexType>::QsOmp(workingArray, currentSize, [&](const SortType& v1, const SortType& v2){
FQuickSort< SortType, IndexType>::QsOmp(workingArray, currentSize, [](const SortType& v1, const SortType& v2){
return CompareType(v1) <= CompareType(v2);
});
(*outputSize) = currentSize;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment