diff options
Diffstat (limited to 'boost/polygon/detail/polygon_arbitrary_formation.hpp')
-rw-r--r-- | boost/polygon/detail/polygon_arbitrary_formation.hpp | 38 |
1 files changed, 0 insertions, 38 deletions
diff --git a/boost/polygon/detail/polygon_arbitrary_formation.hpp b/boost/polygon/detail/polygon_arbitrary_formation.hpp index 6f9eb7394f..a5a63833b1 100644 --- a/boost/polygon/detail/polygon_arbitrary_formation.hpp +++ b/boost/polygon/detail/polygon_arbitrary_formation.hpp @@ -338,12 +338,6 @@ namespace boost { namespace polygon{ }; template <typename unsigned_product_type> - static inline void unsigned_mod(unsigned_product_type& result, int& result_sign, unsigned_product_type a, int a_sign, unsigned_product_type b, int b_sign) { - result = a % b; - result_sign = a_sign; - } - - template <typename unsigned_product_type> static inline void unsigned_add(unsigned_product_type& result, int& result_sign, unsigned_product_type a, int a_sign, unsigned_product_type b, int b_sign) { int switcher = 0; if(a_sign < 0) switcher += 1; @@ -739,13 +733,9 @@ namespace boost { namespace polygon{ inline vertex_half_edge(const vertex_half_edge& vertex) : pt(vertex.pt), other_pt(vertex.other_pt), count(vertex.count) {} inline vertex_half_edge& operator=(const vertex_half_edge& vertex){ pt = vertex.pt; other_pt = vertex.other_pt; count = vertex.count; return *this; } - inline vertex_half_edge(const std::pair<Point, Point>& vertex) : pt(), other_pt(), count() {} - inline vertex_half_edge& operator=(const std::pair<Point, Point>& vertex){ return *this; } inline bool operator==(const vertex_half_edge& vertex) const { return pt == vertex.pt && other_pt == vertex.other_pt && count == vertex.count; } inline bool operator!=(const vertex_half_edge& vertex) const { return !((*this) == vertex); } - inline bool operator==(const std::pair<Point, Point>& vertex) const { return false; } - inline bool operator!=(const std::pair<Point, Point>& vertex) const { return !((*this) == vertex); } inline bool operator<(const vertex_half_edge& vertex) const { if(pt.get(HORIZONTAL) < vertex.pt.get(HORIZONTAL)) return true; if(pt.get(HORIZONTAL) == vertex.pt.get(HORIZONTAL)) { @@ -1283,13 +1273,9 @@ namespace boost { namespace polygon{ inline vertex_arbitrary_compact(const vertex_arbitrary_compact& vertex) : pt(vertex.pt), count(vertex.count) {} inline vertex_arbitrary_compact& operator=(const vertex_arbitrary_compact& vertex){ pt = vertex.pt; count = vertex.count; return *this; } - //inline vertex_arbitrary_compact(const std::pair<Point, Point>& vertex) {} - inline vertex_arbitrary_compact& operator=(const std::pair<Point, Point>& vertex){ return *this; } inline bool operator==(const vertex_arbitrary_compact& vertex) const { return pt == vertex.pt && count == vertex.count; } inline bool operator!=(const vertex_arbitrary_compact& vertex) const { return !((*this) == vertex); } - inline bool operator==(const std::pair<Point, Point>& vertex) const { return false; } - inline bool operator!=(const std::pair<Point, Point>& vertex) const { return !((*this) == vertex); } inline bool operator<(const vertex_arbitrary_compact& vertex) const { if(pt.get(HORIZONTAL) < vertex.pt.get(HORIZONTAL)) return true; if(pt.get(HORIZONTAL) == vertex.pt.get(HORIZONTAL)) { @@ -2140,19 +2126,7 @@ namespace boost { namespace polygon{ //use default copy and assign inline iterator begin() const { return p_->getTail()->begin(); } inline iterator end() const { return p_->getTail()->end(); } - //inline compact_iterator_type begin_compact() const { return compact_iterator_type(begin()); } - //inline compact_iterator_type end_compact() const { return compact_iterator_type(end()); } inline std::size_t size() const { return 0; } - template<class iT> - inline poly_line_arbitrary_hole_data& set(iT inputBegin, iT inputEnd) { - //assert this is not called - return *this; - } - template<class iT> - inline poly_line_arbitrary_hole_data& set_compact(iT inputBegin, iT inputEnd) { - //assert this is not called - return *this; - } }; template <typename Unit> @@ -2219,18 +2193,6 @@ namespace boost { namespace polygon{ //stub out these four required functions that will not be used but are needed for the interface inline std::size_t size_holes() const { return 0; } inline std::size_t size() const { return 0; } - template<class iT> - inline poly_line_arbitrary_polygon_data& set(iT inputBegin, iT inputEnd) { - return *this; - } - template<class iT> - inline poly_line_arbitrary_polygon_data& set_compact(iT inputBegin, iT inputEnd) { - return *this; - } - template<class iT> - inline poly_line_arbitrary_polygon_data& set_holes(iT inputBegin, iT inputEnd) { - return *this; - } }; template <typename Unit> |