let iterators return smart handles

This commit is contained in:
Max Lyon
2019-09-26 11:14:31 +02:00
parent 89f0dcbb51
commit 253c9b6afa
5 changed files with 97 additions and 72 deletions

View File

@@ -40,9 +40,7 @@
* ========================================================================= */ * ========================================================================= */
#pragma once
#ifndef OPENMESH_ITERATORS_HH
#define OPENMESH_ITERATORS_HH
//============================================================================= //=============================================================================
// //
@@ -56,6 +54,7 @@
#include <OpenMesh/Core/System/config.h> #include <OpenMesh/Core/System/config.h>
#include <OpenMesh/Core/Mesh/Status.hh> #include <OpenMesh/Core/Mesh/Status.hh>
#include <OpenMesh/Core/Mesh/SmartHandles.hh>
#include <cassert> #include <cassert>
#include <cstddef> #include <cstddef>
#include <iterator> #include <iterator>
@@ -89,19 +88,20 @@ class GenericIteratorT {
typedef value_handle value_type; typedef value_handle value_type;
typedef std::bidirectional_iterator_tag iterator_category; typedef std::bidirectional_iterator_tag iterator_category;
typedef std::ptrdiff_t difference_type; typedef std::ptrdiff_t difference_type;
typedef const value_type& reference;
typedef const value_type* pointer;
typedef const Mesh* mesh_ptr; typedef const Mesh* mesh_ptr;
typedef const Mesh& mesh_ref; typedef const Mesh& mesh_ref;
typedef decltype(make_smart(std::declval<ValueHandle>(), std::declval<Mesh>())) SmartHandle;
typedef const SmartHandle& reference;
typedef const SmartHandle* pointer;
/// Default constructor. /// Default constructor.
GenericIteratorT() GenericIteratorT()
: mesh_(0), skip_bits_(0) : hnd_(make_smart(ValueHandle(),nullptr)), skip_bits_(0)
{} {}
/// Construct with mesh and a target handle. /// Construct with mesh and a target handle.
GenericIteratorT(mesh_ref _mesh, value_handle _hnd, bool _skip=false) GenericIteratorT(mesh_ref _mesh, value_handle _hnd, bool _skip=false)
: mesh_(&_mesh), hnd_(_hnd), skip_bits_(0) : hnd_(make_smart(_hnd, _mesh)), skip_bits_(0)
{ {
if (_skip) enable_skipping(); if (_skip) enable_skipping();
} }
@@ -139,7 +139,7 @@ class GenericIteratorT {
/// Are two iterators equal? Only valid if they refer to the same mesh! /// Are two iterators equal? Only valid if they refer to the same mesh!
bool operator==(const GenericIteratorT& _rhs) const { bool operator==(const GenericIteratorT& _rhs) const {
return ((mesh_ == _rhs.mesh_) && (hnd_ == _rhs.hnd_)); return ((hnd_.mesh() == _rhs.hnd_.mesh()) && (hnd_ == _rhs.hnd_));
} }
/// Not equal? /// Not equal?
@@ -210,7 +210,7 @@ class GenericIteratorT {
/// Turn on skipping: automatically skip deleted/hidden elements /// Turn on skipping: automatically skip deleted/hidden elements
void enable_skipping() { void enable_skipping() {
if (mesh_ && (mesh_->*PrimitiveStatusMember)()) { if (hnd_.mesh() && (hnd_.mesh()->*PrimitiveStatusMember)()) {
Attributes::StatusInfo status; Attributes::StatusInfo status;
status.set_deleted(true); status.set_deleted(true);
status.set_hidden(true); status.set_hidden(true);
@@ -228,21 +228,20 @@ class GenericIteratorT {
private: private:
void skip_fwd() { void skip_fwd() {
assert(mesh_ && skip_bits_); assert(hnd_.mesh() && skip_bits_);
while ((hnd_.idx() < (signed) (mesh_->*PrimitiveCountMember)()) while ((hnd_.idx() < (signed) (hnd_.mesh()->*PrimitiveCountMember)())
&& (mesh_->status(hnd_).bits() & skip_bits_)) && (hnd_.mesh()->status(hnd_).bits() & skip_bits_))
hnd_.__increment(); hnd_.__increment();
} }
void skip_bwd() { void skip_bwd() {
assert(mesh_ && skip_bits_); assert(hnd_.mesh() && skip_bits_);
while ((hnd_.idx() >= 0) && (mesh_->status(hnd_).bits() & skip_bits_)) while ((hnd_.idx() >= 0) && (hnd_.mesh()->status(hnd_).bits() & skip_bits_))
hnd_.__decrement(); hnd_.__decrement();
} }
protected: protected:
mesh_ptr mesh_; SmartHandle hnd_;
value_handle hnd_;
unsigned int skip_bits_; unsigned int skip_bits_;
}; };
@@ -250,5 +249,3 @@ class GenericIteratorT {
} // namespace Iterators } // namespace Iterators
} // namespace OpenMesh } // namespace OpenMesh
//============================================================================= //=============================================================================
#endif
//=============================================================================

View File

@@ -719,6 +719,46 @@ PolyConnectivity::ConstFaceIter PolyConnectivity::faces_end() const
return ConstFaceIter(*this, FaceHandle(int(n_faces()))); return ConstFaceIter(*this, FaceHandle(int(n_faces())));
} }
PolyConnectivity::VertexIter PolyConnectivity::vertices_sbegin()
{
return VertexIter(*this, VertexHandle(0), true);
}
PolyConnectivity::ConstVertexIter PolyConnectivity::vertices_sbegin() const
{
return ConstVertexIter(*this, VertexHandle(0), true);
}
PolyConnectivity::HalfedgeIter PolyConnectivity::halfedges_sbegin()
{
return HalfedgeIter(*this, HalfedgeHandle(0), true);
}
PolyConnectivity::ConstHalfedgeIter PolyConnectivity::halfedges_sbegin() const
{
return ConstHalfedgeIter(*this, HalfedgeHandle(0), true);
}
PolyConnectivity::EdgeIter PolyConnectivity::edges_sbegin()
{
return EdgeIter(*this, EdgeHandle(0), true);
}
PolyConnectivity::ConstEdgeIter PolyConnectivity::edges_sbegin() const
{
return ConstEdgeIter(*this, EdgeHandle(0), true);
}
PolyConnectivity::FaceIter PolyConnectivity::faces_sbegin()
{
return FaceIter(*this, FaceHandle(0), true);
}
PolyConnectivity::ConstFaceIter PolyConnectivity::faces_sbegin() const
{
return ConstFaceIter(*this, FaceHandle(0), true);
}
//----------------------------------------------------------------------------- //-----------------------------------------------------------------------------
void PolyConnectivity::collapse(HalfedgeHandle _hh) void PolyConnectivity::collapse(HalfedgeHandle _hh)
{ {

View File

@@ -45,12 +45,17 @@
#define OPENMESH_POLYCONNECTIVITY_HH #define OPENMESH_POLYCONNECTIVITY_HH
#include <OpenMesh/Core/Mesh/ArrayKernel.hh> #include <OpenMesh/Core/Mesh/ArrayKernel.hh>
#include <OpenMesh/Core/Mesh/IteratorsT.hh>
#include <OpenMesh/Core/Mesh/CirculatorsT.hh> #include <OpenMesh/Core/Mesh/CirculatorsT.hh>
namespace OpenMesh namespace OpenMesh
{ {
namespace Iterators
{
template <class Mesh, class ValueHandle, class MemberOwner, bool (MemberOwner::*PrimitiveStatusMember)() const, size_t (MemberOwner::*PrimitiveCountMember)() const>
class GenericIteratorT;
}
/** \brief Connectivity Class for polygonal meshes /** \brief Connectivity Class for polygonal meshes
*/ */
class OPENMESHDLLEXPORT PolyConnectivity : public ArrayKernel class OPENMESHDLLEXPORT PolyConnectivity : public ArrayKernel
@@ -532,32 +537,24 @@ public:
//@{ //@{
/// Begin iterator for vertices /// Begin iterator for vertices
VertexIter vertices_sbegin() VertexIter vertices_sbegin();
{ return VertexIter(*this, VertexHandle(0), true); }
/// Const begin iterator for vertices /// Const begin iterator for vertices
ConstVertexIter vertices_sbegin() const ConstVertexIter vertices_sbegin() const;
{ return ConstVertexIter(*this, VertexHandle(0), true); }
/// Begin iterator for halfedges /// Begin iterator for halfedges
HalfedgeIter halfedges_sbegin() HalfedgeIter halfedges_sbegin();
{ return HalfedgeIter(*this, HalfedgeHandle(0), true); }
/// Const begin iterator for halfedges /// Const begin iterator for halfedges
ConstHalfedgeIter halfedges_sbegin() const ConstHalfedgeIter halfedges_sbegin() const;
{ return ConstHalfedgeIter(*this, HalfedgeHandle(0), true); }
/// Begin iterator for edges /// Begin iterator for edges
EdgeIter edges_sbegin() EdgeIter edges_sbegin();
{ return EdgeIter(*this, EdgeHandle(0), true); }
/// Const begin iterator for edges /// Const begin iterator for edges
ConstEdgeIter edges_sbegin() const ConstEdgeIter edges_sbegin() const;
{ return ConstEdgeIter(*this, EdgeHandle(0), true); }
/// Begin iterator for faces /// Begin iterator for faces
FaceIter faces_sbegin() FaceIter faces_sbegin();
{ return FaceIter(*this, FaceHandle(0), true); }
/// Const begin iterator for faces /// Const begin iterator for faces
ConstFaceIter faces_sbegin() const ConstFaceIter faces_sbegin() const;
{ return ConstFaceIter(*this, FaceHandle(0), true); }
//@} //@}
@@ -1627,4 +1624,6 @@ private: // Working storage for add_face()
}//namespace OpenMesh }//namespace OpenMesh
#include <OpenMesh/Core/Mesh/IteratorsT.hh>
#endif//OPENMESH_POLYCONNECTIVITY_HH #endif//OPENMESH_POLYCONNECTIVITY_HH

View File

@@ -40,8 +40,7 @@
* ========================================================================= */ * ========================================================================= */
#ifndef OPENMESH_SMARTHANDLES_HH #pragma once
#define OPENMESH_SMARTHANDLES_HH
//== INCLUDES ================================================================= //== INCLUDES =================================================================
@@ -401,6 +400,4 @@ inline bool SmartFaceHandle::is_boundary() const
} // namespace OpenMesh } // namespace OpenMesh
//============================================================================= //=============================================================================
#endif // OPENMESH_SMARTHANDLES_HH
//============================================================================= //=============================================================================

View File

@@ -162,34 +162,30 @@ TEST_F(OpenMeshSmartHandles, SimpleNavigation)
{ {
for (auto vh : mesh_.vertices()) for (auto vh : mesh_.vertices())
{ {
auto svh = OpenMesh::make_smart(vh, mesh_); EXPECT_EQ(mesh_.halfedge_handle(vh), vh.halfedge()) << "outgoing halfedge of vertex does not match";
EXPECT_EQ(mesh_.halfedge_handle(vh), svh.halfedge()) << "outgoing halfedge of vertex does not match";
} }
for (auto heh : mesh_.halfedges()) for (auto heh : mesh_.halfedges())
{ {
auto sheh = OpenMesh::make_smart(heh, mesh_); EXPECT_EQ(mesh_.next_halfedge_handle(heh), heh.next()) << "next halfedge of halfedge does not match";
EXPECT_EQ(mesh_.next_halfedge_handle(heh), sheh.next()) << "next halfedge of halfedge does not match"; EXPECT_EQ(mesh_.prev_halfedge_handle(heh), heh.prev()) << "prevt halfedge of halfedge does not match";
EXPECT_EQ(mesh_.prev_halfedge_handle(heh), sheh.prev()) << "prevt halfedge of halfedge does not match"; EXPECT_EQ(mesh_.opposite_halfedge_handle(heh), heh.opp()) << "opposite halfedge of halfedge does not match";
EXPECT_EQ(mesh_.opposite_halfedge_handle(heh), sheh.opp()) << "opposite halfedge of halfedge does not match"; EXPECT_EQ(mesh_.to_vertex_handle(heh), heh.to()) << "to vertex handle of halfedge does not match";
EXPECT_EQ(mesh_.to_vertex_handle(heh), sheh.to()) << "to vertex handle of halfedge does not match"; EXPECT_EQ(mesh_.from_vertex_handle(heh), heh.from()) << "from vertex handle of halfedge does not match";
EXPECT_EQ(mesh_.from_vertex_handle(heh), sheh.from()) << "from vertex handle of halfedge does not match"; EXPECT_EQ(mesh_.face_handle(heh), heh.face()) << "face handle of halfedge does not match";
EXPECT_EQ(mesh_.face_handle(heh), sheh.face()) << "face handle of halfedge does not match";
} }
for (auto eh : mesh_.edges()) for (auto eh : mesh_.edges())
{ {
auto seh = OpenMesh::make_smart(eh, mesh_); EXPECT_EQ(mesh_.halfedge_handle(eh, 0), eh.h0()) << "halfedge 0 of edge does not match";
EXPECT_EQ(mesh_.halfedge_handle(eh, 0), seh.h0()) << "halfedge 0 of edge does not match"; EXPECT_EQ(mesh_.halfedge_handle(eh, 1), eh.h1()) << "halfedge 1 of edge does not match";
EXPECT_EQ(mesh_.halfedge_handle(eh, 1), seh.h1()) << "halfedge 1 of edge does not match"; EXPECT_EQ(mesh_.from_vertex_handle(mesh_.halfedge_handle(eh, 0)), eh.v0()) << "first vertex of edge does not match";
EXPECT_EQ(mesh_.from_vertex_handle(mesh_.halfedge_handle(eh, 0)), seh.v0()) << "first vertex of edge does not match"; EXPECT_EQ(mesh_.to_vertex_handle (mesh_.halfedge_handle(eh, 0)), eh.v1()) << "second vertex of edge does not match";
EXPECT_EQ(mesh_.to_vertex_handle (mesh_.halfedge_handle(eh, 0)), seh.v1()) << "second vertex of edge does not match";
} }
for (auto fh : mesh_.faces()) for (auto fh : mesh_.faces())
{ {
auto sfh = OpenMesh::make_smart(fh, mesh_); EXPECT_EQ(mesh_.halfedge_handle(fh), fh.halfedge()) << "halfedge of face does not match";
EXPECT_EQ(mesh_.halfedge_handle(fh), sfh.halfedge()) << "halfedge of face does not match";
} }
} }
@@ -200,13 +196,12 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
{ {
for (auto vh : mesh_.vertices()) for (auto vh : mesh_.vertices())
{ {
auto svh = OpenMesh::make_smart(vh, mesh_);
{ {
std::vector<OpenMesh::VertexHandle> handles0; std::vector<OpenMesh::VertexHandle> handles0;
std::vector<OpenMesh::VertexHandle> handles1; std::vector<OpenMesh::VertexHandle> handles1;
for (auto h : mesh_.vv_range(vh)) for (auto h : mesh_.vv_range(vh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : svh.vertices()) for (auto h : vh.vertices())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "vertex range of vertex does not match"; EXPECT_EQ(handles0, handles1) << "vertex range of vertex does not match";
} }
@@ -215,7 +210,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::HalfedgeHandle> handles1; std::vector<OpenMesh::HalfedgeHandle> handles1;
for (auto h : mesh_.voh_range(vh)) for (auto h : mesh_.voh_range(vh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : svh.outgoing_halfedges()) for (auto h : vh.outgoing_halfedges())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "outgoing halfedge range of vertex does not match"; EXPECT_EQ(handles0, handles1) << "outgoing halfedge range of vertex does not match";
} }
@@ -224,7 +219,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::HalfedgeHandle> handles1; std::vector<OpenMesh::HalfedgeHandle> handles1;
for (auto h : mesh_.vih_range(vh)) for (auto h : mesh_.vih_range(vh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : svh.incoming_halfedges()) for (auto h : vh.incoming_halfedges())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "incoming halfedge range of vertex does not match"; EXPECT_EQ(handles0, handles1) << "incoming halfedge range of vertex does not match";
} }
@@ -233,7 +228,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::EdgeHandle> handles1; std::vector<OpenMesh::EdgeHandle> handles1;
for (auto h : mesh_.ve_range(vh)) for (auto h : mesh_.ve_range(vh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : svh.edges()) for (auto h : vh.edges())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "edge range of vertex does not match"; EXPECT_EQ(handles0, handles1) << "edge range of vertex does not match";
} }
@@ -242,7 +237,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::FaceHandle> handles1; std::vector<OpenMesh::FaceHandle> handles1;
for (auto h : mesh_.vf_range(vh)) for (auto h : mesh_.vf_range(vh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : svh.faces()) for (auto h : vh.faces())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "face range of vertex does not match"; EXPECT_EQ(handles0, handles1) << "face range of vertex does not match";
} }
@@ -250,13 +245,12 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
for (auto fh : mesh_.faces()) for (auto fh : mesh_.faces())
{ {
auto sfh = OpenMesh::make_smart(fh, mesh_);
{ {
std::vector<OpenMesh::VertexHandle> handles0; std::vector<OpenMesh::VertexHandle> handles0;
std::vector<OpenMesh::VertexHandle> handles1; std::vector<OpenMesh::VertexHandle> handles1;
for (auto h : mesh_.fv_range(fh)) for (auto h : mesh_.fv_range(fh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : sfh.vertices()) for (auto h : fh.vertices())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "vertex range of face does not match"; EXPECT_EQ(handles0, handles1) << "vertex range of face does not match";
} }
@@ -265,7 +259,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::HalfedgeHandle> handles1; std::vector<OpenMesh::HalfedgeHandle> handles1;
for (auto h : mesh_.fh_range(fh)) for (auto h : mesh_.fh_range(fh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : sfh.halfedges()) for (auto h : fh.halfedges())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "halfedge range of face does not match"; EXPECT_EQ(handles0, handles1) << "halfedge range of face does not match";
} }
@@ -274,7 +268,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::EdgeHandle> handles1; std::vector<OpenMesh::EdgeHandle> handles1;
for (auto h : mesh_.fe_range(fh)) for (auto h : mesh_.fe_range(fh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : sfh.edges()) for (auto h : fh.edges())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "edge range of face does not match"; EXPECT_EQ(handles0, handles1) << "edge range of face does not match";
} }
@@ -283,7 +277,7 @@ TEST_F(OpenMeshSmartHandles, SimpleRanges)
std::vector<OpenMesh::FaceHandle> handles1; std::vector<OpenMesh::FaceHandle> handles1;
for (auto h : mesh_.ff_range(fh)) for (auto h : mesh_.ff_range(fh))
handles0.push_back(h); handles0.push_back(h);
for (auto h : sfh.faces()) for (auto h : fh.faces())
handles1.push_back(h); handles1.push_back(h);
EXPECT_EQ(handles0, handles1) << "face range of face does not match"; EXPECT_EQ(handles0, handles1) << "face range of face does not match";
} }
@@ -297,18 +291,17 @@ TEST_F(OpenMeshSmartHandles, ComplicatedNavigtaion)
{ {
for (auto vh : mesh_.vertices()) for (auto vh : mesh_.vertices())
{ {
auto svh = OpenMesh::make_smart(vh, mesh_);
EXPECT_EQ(mesh_.next_halfedge_handle( EXPECT_EQ(mesh_.next_halfedge_handle(
mesh_.opposite_halfedge_handle( mesh_.opposite_halfedge_handle(
mesh_.halfedge_handle(vh))), mesh_.halfedge_handle(vh))),
svh.out().opp().next()); vh.out().opp().next());
EXPECT_EQ(mesh_.prev_halfedge_handle( EXPECT_EQ(mesh_.prev_halfedge_handle(
mesh_.prev_halfedge_handle( mesh_.prev_halfedge_handle(
mesh_.opposite_halfedge_handle( mesh_.opposite_halfedge_handle(
mesh_.next_halfedge_handle( mesh_.next_halfedge_handle(
mesh_.next_halfedge_handle( mesh_.next_halfedge_handle(
mesh_.halfedge_handle(vh)))))), mesh_.halfedge_handle(vh)))))),
svh.out().next().next().opp().prev().prev()); vh.out().next().next().opp().prev().prev());
EXPECT_EQ(mesh_.face_handle( EXPECT_EQ(mesh_.face_handle(
mesh_.opposite_halfedge_handle( mesh_.opposite_halfedge_handle(
mesh_.halfedge_handle( mesh_.halfedge_handle(
@@ -316,7 +309,7 @@ TEST_F(OpenMeshSmartHandles, ComplicatedNavigtaion)
mesh_.opposite_halfedge_handle( mesh_.opposite_halfedge_handle(
mesh_.next_halfedge_handle( mesh_.next_halfedge_handle(
mesh_.halfedge_handle(vh))))))), mesh_.halfedge_handle(vh))))))),
svh.out().next().opp().face().halfedge().opp().face()); vh.out().next().opp().face().halfedge().opp().face());
} }
} }
@@ -352,8 +345,7 @@ TEST_F(OpenMeshSmartHandles, Performance)
{ {
for (auto vh : mesh_.vertices()) for (auto vh : mesh_.vertices())
{ {
auto svh = OpenMesh::make_smart(vh, mesh_); auto heh = vh.out().next().next().opp().prev().prev();
auto heh = svh.out().next().next().opp().prev().prev();
if (i == 0) if (i == 0)
halfedges1.push_back(heh); halfedges1.push_back(heh);
} }