22 if ( region && !region->test( i ) )
40 if ( region && !region->test( i ) )
#define MR_TIMER
namespace MR
Definition MRTimer.h:56
Definition MRBitSet.h:229
TypedBitSet & set(IndexType n, size_type len, bool val)
Definition MRBitSet.h:241
Union-find data structure for representing disjoin sets of elements with few very quick operations: 1...
Definition MRUnionFind.h:23
auto BitSetParallelForAll(const BS &bs, F &&f, Cb &&... cb)
Definition MRBitSetParallelFor.h:133
auto BitSetParallelForAllRanged(const BS &bs, F &&... f)
namespace BitSetParallel
Definition MRBitSetParallelFor.h:111
I find(I a)
finds the root of the set containing given element with optimizing data structure updates
Definition MRUnionFind.h:86
bool isRoot(I a) const
returns true if given element is the root of some set
Definition MRUnionFind.h:80
auto size() const
returns the number of elements in union-find
Definition MRUnionFind.h:34
I findUpdateRange(I a, I begin, I end)
finds the root of the set containing given element with optimizing data structure in the range [begin...
Definition MRUnionFind.h:89
TypedBitSet< I > findComponentBitSet(UnionFind< I > &uf, I a, const TypedBitSet< I > *region=nullptr)
Definition MRUnionFindParallel.h:33
TypedBitSet< I > findRootsBitSet(const UnionFind< I > &uf, const TypedBitSet< I > *region=nullptr)
Definition MRUnionFindParallel.h:16
only for bindings generation
Definition MRCameraOrientationPlugin.h:8