11 #include "QhullFacetSet.h"
13 #include "QhullFacet.h"
14 #include "QhullPoint.h"
15 #include "QhullRidge.h"
16 #include "QhullVertex.h"
23 #pragma warning( disable : 4611)
24 #pragma warning( disable : 4996)
34 std::vector<QhullFacet> QhullFacetSet::
37 QhullSetIterator<QhullFacet> i(*
this);
38 std::vector<QhullFacet> vs;
40 QhullFacet f= i.next();
41 if(isSelectAll() || f.isGood()){
52 contains(
const QhullFacet &facet)
const
57 for(QhullFacetSet::const_iterator i=begin(); i != end(); ++i){
59 if(f==facet && f.isGood()){
73 for(QhullFacetSet::const_iterator i=begin(); i != end(); ++i){
83 count(
const QhullFacet &facet)
const
89 for(QhullFacetSet::const_iterator i=begin(); i != end(); ++i){
91 if(f==facet && f.isGood()){
104 using orgQhull::QhullFacet;
105 using orgQhull::QhullFacetSet;
116 operator<<(ostream &os,
const QhullFacetSet::PrintFacetSet &pr)
118 os << pr.print_message;
119 QhullFacetSet
fs= *pr.facet_set;
120 for(QhullFacetSet::iterator i=
fs.begin(); i !=
fs.end(); ++i){
122 if(
fs.isSelectAll() || f.isGood()){
131 operator<<(ostream &os,
const QhullFacetSet::PrintIdentifiers &p)
133 os << p.print_message;
134 for(QhullFacetSet::const_iterator i=p.facet_set->begin(); i!=p.facet_set->end(); ++i){
135 const QhullFacet f= *i;
136 if(f.getFacetT()==qh_MERGEridge){
138 }
else if(f.getFacetT()==qh_DUPLICATEridge){
140 }
else if(p.facet_set->isSelectAll() || f.isGood()){
141 os <<
" f" << f.id();
ostream & operator<<(ostream &os, const QhullFacetSet &fs)
bool contains(const Container &container, const T &value)
Equivalent to container.end() != std::find(container.begin(), container.end(), value)
QhullRidge – Qhull's ridge structure, ridgeT, as a C++ class.