haskal
/
kicad
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

geometry: placeholder method for converting compounds to simple polygons [wip]

This commit is contained in:
Tomasz Wlostowski 2020-10-07 15:13:48 +02:00
parent 30f8cc1346
commit 7ffef32ea0
1 changed files with 64 additions and 62 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

118
libs/kimath/include/geometry/shape_compound.h
View File

@ -30,63 +30,64 @@
#include <list>
#include <vector>
class SHAPE_SIMPLE;
class SHAPE_COMPOUND : public SHAPE
{
public:
SHAPE_COMPOUND() :
SHAPE( SH_COMPOUND ),
m_dirty( true )
{}
public:
SHAPE_COMPOUND() : SHAPE( SH_COMPOUND ), m_dirty( true )
{
}
SHAPE_COMPOUND( const std::vector<SHAPE*>& aShapes );
SHAPE_COMPOUND( const std::vector<SHAPE*>& aShapes );
SHAPE_COMPOUND( const SHAPE_COMPOUND& aOther );
~SHAPE_COMPOUND();
SHAPE_COMPOUND( const SHAPE_COMPOUND& aOther );
~SHAPE_COMPOUND();
SHAPE_COMPOUND* Clone() const override;
const std::string Format() const override;
SHAPE_COMPOUND* Clone() const override;
const std::string Format() const override;
bool Collide( const SEG& aSeg, int aClearance = 0, int* aActual = nullptr,
VECTOR2I* aLocation = nullptr ) const override;
bool Collide( const SEG& aSeg, int aClearance = 0, int* aActual = nullptr,
VECTOR2I* aLocation = nullptr ) const override;
bool Collide( const SHAPE* aShape, int aClearance, VECTOR2I* aMTV ) const override
{
return SHAPE::Collide( aShape, aClearance, aMTV );
}
bool Collide( const SHAPE* aShape, int aClearance, VECTOR2I* aMTV ) const override
{
return SHAPE::Collide( aShape, aClearance, aMTV );
}
bool Collide( const SHAPE* aShape, int aClearance = 0, int* aActual = nullptr,
VECTOR2I* aLocation = nullptr ) const override
{
return SHAPE::Collide( aShape, aClearance, aActual, aLocation );
}
bool Collide( const SHAPE* aShape, int aClearance = 0, int* aActual = nullptr,
VECTOR2I* aLocation = nullptr ) const override
{
return SHAPE::Collide( aShape, aClearance, aActual, aLocation );
}
const std::vector<SHAPE*>& Shapes() const
{
return m_shapes;
}
const std::vector<SHAPE*>& Shapes() const
{
return m_shapes;
}
const BOX2I BBox( int aClearance = 0 ) const override;
const BOX2I BBox( int aClearance = 0 ) const override;
int Distance( const SEG& aSeg ) const;
int Distance( const SEG& aSeg ) const;
void Move ( const VECTOR2I& aVector ) override;
void Move( const VECTOR2I& aVector ) override;
void AddShape( SHAPE* aShape )
{
m_shapes.push_back( aShape );
m_dirty = true;
}
void AddShape( SHAPE* aShape )
{
m_shapes.push_back( aShape );
m_dirty = true;
}
bool Empty() const
{
return m_shapes.empty();
}
bool Empty() const
{
return m_shapes.empty();
}
int Size() const
{
return m_shapes.size();
}
int Size() const
{
return m_shapes.size();
}
void Rotate( double aAngle, const VECTOR2I& aCenter = { 0, 0 } ) override;
@ -94,29 +95,30 @@ class SHAPE_COMPOUND : public SHAPE
SHAPE* UniqueSubshape() const
{
return m_shapes.size() != 1 ? nullptr : m_shapes[0];
return m_shapes.size() != 1 ? nullptr : m_shapes[0];
}
virtual bool HasIndexableSubshapes() const override
{
return true;
}
virtual bool HasIndexableSubshapes() const override
{
return true;
}
virtual size_t GetIndexableSubshapeCount() const override
{
return m_shapes.size();
}
virtual size_t GetIndexableSubshapeCount() const override
{
return m_shapes.size();
}
virtual void GetIndexableSubshapes( std::vector<SHAPE*>& aSubshapes ) override
{
aSubshapes = m_shapes;
}
virtual void GetIndexableSubshapes( std::vector<SHAPE*>& aSubshapes ) override
{
aSubshapes = m_shapes;
}
private:
bool ConvertToSimplePolygon( SHAPE_SIMPLE* aOut ) const;
BOX2I m_cachedBBox;
bool m_dirty;
std::vector<SHAPE*> m_shapes;
private:
BOX2I m_cachedBBox;
bool m_dirty;
std::vector<SHAPE*> m_shapes;
};
#endif // __SHAPE_COMPOUND_H