mirror of
https://github.com/SoftFever/OrcaSlicer.git
synced 2025-10-23 08:41:11 -06:00
Initial work for G-code sender and more intensive usage of Boost
This commit is contained in:
Alessandro Ranellucci
parent
43cbad8867
commit
11dd67ab34
1649 changed files with 1860 additions and 1642 deletions
222
xs/include/boost/polygon/detail/polygon_set_view.hpp
Normal file
222
xs/include/boost/polygon/detail/polygon_set_view.hpp
Normal file
|
|
@ -0,0 +1,222 @@
|
|||
/*
|
||||
Copyright 2008 Intel Corporation
|
||||
|
||||
Use, modification and distribution are subject to the Boost Software License,
|
||||
Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||
http://www.boost.org/LICENSE_1_0.txt).
|
||||
*/
|
||||
#ifndef BOOST_POLYGON_POLYGON_SET_VIEW_HPP
|
||||
#define BOOST_POLYGON_POLYGON_SET_VIEW_HPP
|
||||
namespace boost { namespace polygon{
|
||||
|
||||
|
||||
template <typename coordinate_type>
|
||||
inline void polygon_set_data<coordinate_type>::clean() const {
|
||||
if(dirty_) {
|
||||
//polygon_45_set_data<coordinate_type> tmp;
|
||||
//very important:
|
||||
//the 45 degree algorithm does not satisfy
|
||||
//the precondition of arbitrary polygon formation
|
||||
//that vertices be "linearly consistent"
|
||||
//therefore it doesn't work to fall back on 45-degree
|
||||
//booleans for arbitrary angle polygons
|
||||
//if(0) { //downcast(tmp) ) {
|
||||
// tmp.clean();
|
||||
// data_.clear();
|
||||
// is_45_ = true;
|
||||
// polygon_set_data<coordinate_type> tmp2;
|
||||
// tmp2.insert(tmp);
|
||||
// data_.swap(tmp2.data_);
|
||||
// dirty_ = false;
|
||||
// sort();
|
||||
//} else {
|
||||
sort();
|
||||
arbitrary_boolean_op<coordinate_type> abo;
|
||||
polygon_set_data<coordinate_type> tmp2;
|
||||
abo.execute(tmp2, begin(), end(), end(), end(), 0);
|
||||
data_.swap(tmp2.data_);
|
||||
is_45_ = tmp2.is_45_;
|
||||
dirty_ = false;
|
||||
//}
|
||||
}
|
||||
}
|
||||
|
||||
template <>
|
||||
inline void polygon_set_data<double>::clean() const {
|
||||
if(dirty_) {
|
||||
sort();
|
||||
arbitrary_boolean_op<double> abo;
|
||||
polygon_set_data<double> tmp2;
|
||||
abo.execute(tmp2, begin(), end(), end(), end(), 0);
|
||||
data_.swap(tmp2.data_);
|
||||
is_45_ = tmp2.is_45_;
|
||||
dirty_ = false;
|
||||
}
|
||||
}
|
||||
|
||||
template <typename value_type, typename arg_type>
|
||||
inline void insert_into_view_arg(value_type& dest, const arg_type& arg);
|
||||
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
class polygon_set_view;
|
||||
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
struct polygon_set_traits<polygon_set_view<ltype, rtype, op_type> > {
|
||||
typedef typename polygon_set_view<ltype, rtype, op_type>::coordinate_type coordinate_type;
|
||||
typedef typename polygon_set_view<ltype, rtype, op_type>::iterator_type iterator_type;
|
||||
typedef typename polygon_set_view<ltype, rtype, op_type>::operator_arg_type operator_arg_type;
|
||||
|
||||
static inline iterator_type begin(const polygon_set_view<ltype, rtype, op_type>& polygon_set);
|
||||
static inline iterator_type end(const polygon_set_view<ltype, rtype, op_type>& polygon_set);
|
||||
|
||||
static inline bool clean(const polygon_set_view<ltype, rtype, op_type>& polygon_set);
|
||||
|
||||
static inline bool sort(const polygon_set_view<ltype, rtype, op_type>& polygon_set);
|
||||
};
|
||||
|
||||
//template <typename value_type, typename geometry_type_1, typename geometry_type_2, int op_type>
|
||||
//void execute_boolean_op(value_type& output_, const geometry_type_1& lvalue_, const geometry_type_2& rvalue_,
|
||||
// double coord) {
|
||||
// typedef geometry_type_1 ltype;
|
||||
// typedef geometry_type_2 rtype;
|
||||
// typedef typename polygon_set_traits<ltype>::coordinate_type coordinate_type;
|
||||
// value_type linput_;
|
||||
// value_type rinput_;
|
||||
// insert_into_view_arg(linput_, lvalue_);
|
||||
// insert_into_view_arg(rinput_, rvalue_);
|
||||
// arbitrary_boolean_op<coordinate_type> abo;
|
||||
// abo.execute(output_, linput_.begin(), linput_.end(),
|
||||
// rinput_.begin(), rinput_.end(), op_type);
|
||||
//}
|
||||
|
||||
template <typename value_type, typename geometry_type_1, typename geometry_type_2, int op_type>
|
||||
void execute_boolean_op(value_type& output_, const geometry_type_1& lvalue_, const geometry_type_2& rvalue_) {
|
||||
typedef geometry_type_1 ltype;
|
||||
typedef geometry_type_2 rtype;
|
||||
typedef typename polygon_set_traits<ltype>::coordinate_type coordinate_type;
|
||||
value_type linput_;
|
||||
value_type rinput_;
|
||||
insert_into_view_arg(linput_, lvalue_);
|
||||
insert_into_view_arg(rinput_, rvalue_);
|
||||
polygon_45_set_data<coordinate_type> l45, r45, o45;
|
||||
// if(linput_.downcast(l45) && rinput_.downcast(r45)) {
|
||||
// //the op codes are screwed up between 45 and arbitrary
|
||||
//#ifdef BOOST_POLYGON_MSVC
|
||||
//#pragma warning (push)
|
||||
//#pragma warning (disable: 4127)
|
||||
//#endif
|
||||
// if(op_type < 2)
|
||||
// l45.template applyAdaptiveBoolean_<op_type>(o45, r45);
|
||||
// else if(op_type == 2)
|
||||
// l45.template applyAdaptiveBoolean_<3>(o45, r45);
|
||||
// else
|
||||
// l45.template applyAdaptiveBoolean_<2>(o45, r45);
|
||||
//#ifdef BOOST_POLYGON_MSVC
|
||||
//#pragma warning (pop)
|
||||
//#endif
|
||||
// output_.insert(o45);
|
||||
// } else {
|
||||
arbitrary_boolean_op<coordinate_type> abo;
|
||||
abo.execute(output_, linput_.begin(), linput_.end(),
|
||||
rinput_.begin(), rinput_.end(), op_type);
|
||||
// }
|
||||
}
|
||||
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
class polygon_set_view {
|
||||
public:
|
||||
typedef typename polygon_set_traits<ltype>::coordinate_type coordinate_type;
|
||||
typedef polygon_set_data<coordinate_type> value_type;
|
||||
typedef typename value_type::iterator_type iterator_type;
|
||||
typedef polygon_set_view operator_arg_type;
|
||||
private:
|
||||
const ltype& lvalue_;
|
||||
const rtype& rvalue_;
|
||||
mutable value_type output_;
|
||||
mutable bool evaluated_;
|
||||
polygon_set_view& operator=(const polygon_set_view&);
|
||||
public:
|
||||
polygon_set_view(const ltype& lvalue,
|
||||
const rtype& rvalue ) :
|
||||
lvalue_(lvalue), rvalue_(rvalue), output_(), evaluated_(false) {}
|
||||
|
||||
// get iterator to begin vertex data
|
||||
public:
|
||||
const value_type& value() const {
|
||||
if(!evaluated_) {
|
||||
evaluated_ = true;
|
||||
execute_boolean_op<value_type, ltype, rtype, op_type>(output_, lvalue_, rvalue_);
|
||||
}
|
||||
return output_;
|
||||
}
|
||||
public:
|
||||
iterator_type begin() const { return value().begin(); }
|
||||
iterator_type end() const { return value().end(); }
|
||||
|
||||
bool dirty() const { return false; } //result of a boolean is clean
|
||||
bool sorted() const { return true; } //result of a boolean is sorted
|
||||
|
||||
void sort() const {} //is always sorted
|
||||
};
|
||||
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
typename polygon_set_traits<polygon_set_view<ltype, rtype, op_type> >::iterator_type
|
||||
polygon_set_traits<polygon_set_view<ltype, rtype, op_type> >::
|
||||
begin(const polygon_set_view<ltype, rtype, op_type>& polygon_set) {
|
||||
return polygon_set.begin();
|
||||
}
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
typename polygon_set_traits<polygon_set_view<ltype, rtype, op_type> >::iterator_type
|
||||
polygon_set_traits<polygon_set_view<ltype, rtype, op_type> >::
|
||||
end(const polygon_set_view<ltype, rtype, op_type>& polygon_set) {
|
||||
return polygon_set.end();
|
||||
}
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
bool polygon_set_traits<polygon_set_view<ltype, rtype, op_type> >::
|
||||
clean(const polygon_set_view<ltype, rtype, op_type>& ) {
|
||||
return true; }
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
bool polygon_set_traits<polygon_set_view<ltype, rtype, op_type> >::
|
||||
sort(const polygon_set_view<ltype, rtype, op_type>& ) {
|
||||
return true; }
|
||||
|
||||
template <typename value_type, typename arg_type>
|
||||
inline void insert_into_view_arg(value_type& dest, const arg_type& arg) {
|
||||
typedef typename polygon_set_traits<arg_type>::iterator_type literator;
|
||||
literator itr1, itr2;
|
||||
itr1 = polygon_set_traits<arg_type>::begin(arg);
|
||||
itr2 = polygon_set_traits<arg_type>::end(arg);
|
||||
dest.insert(itr1, itr2);
|
||||
}
|
||||
|
||||
template <typename geometry_type_1, typename geometry_type_2, int op_type>
|
||||
geometry_type_1& self_assignment_boolean_op(geometry_type_1& lvalue_, const geometry_type_2& rvalue_) {
|
||||
typedef geometry_type_1 ltype;
|
||||
typedef typename polygon_set_traits<ltype>::coordinate_type coordinate_type;
|
||||
typedef polygon_set_data<coordinate_type> value_type;
|
||||
value_type output_;
|
||||
execute_boolean_op<value_type, geometry_type_1, geometry_type_2, op_type>(output_, lvalue_, rvalue_);
|
||||
polygon_set_mutable_traits<geometry_type_1>::set(lvalue_, output_.begin(), output_.end());
|
||||
return lvalue_;
|
||||
}
|
||||
|
||||
// copy constructor
|
||||
template <typename coordinate_type>
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
polygon_set_data<coordinate_type>::polygon_set_data(const polygon_set_view<ltype, rtype, op_type>& that) :
|
||||
data_(that.value().data_), dirty_(that.value().dirty_), unsorted_(that.value().unsorted_), is_45_(that.value().is_45_) {}
|
||||
|
||||
// equivalence operator
|
||||
template <typename coordinate_type>
|
||||
inline bool polygon_set_data<coordinate_type>::operator==(const polygon_set_data<coordinate_type>& p) const {
|
||||
typedef polygon_set_data<coordinate_type> value_type;
|
||||
value_type output_;
|
||||
execute_boolean_op<value_type, value_type, value_type, 2>(output_, (*this), p);
|
||||
return output_.data_.empty();
|
||||
}
|
||||
|
||||
template <typename ltype, typename rtype, int op_type>
|
||||
struct geometry_concept<polygon_set_view<ltype, rtype, op_type> > { typedef polygon_set_concept type; };
|
||||
}
|
||||
}
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue