extra run of the script to remove tabs and trailing whitespaces

This commit is contained in:
Sébastien Loriot 2020-03-26 18:58:50 +01:00
parent c1a42c7d37
commit 58b10a3605
16 changed files with 539 additions and 539 deletions

View File

@ -554,7 +554,7 @@ protected:
// If user gave vertex indices
if (m_indices_of_points_of_face.size()>0)
{
add_indexed_point(m_indices_of_points_of_face[i]);
add_indexed_point(m_indices_of_points_of_face[i]);
}
else
{

View File

@ -1067,11 +1067,11 @@ void CGAL::QGLViewer::closeEvent(QCloseEvent *e) {
C : closeEvent called
D : destructor called
E N C D
y y
y n y
n y y
n n y y
E N C D
y y
y n y
n y y
n n y y
closeEvent is called iif the widget is NOT embedded.
@ -3823,7 +3823,7 @@ void CGAL::QGLViewer::initFromDOMElement(const QDomElement &element) {
// #CONNECTION# default values from defaultConstructor()
// setMouseTracking(DomUtils::boolFromDom(child, "mouseTracking", false));
// if ((child.attribute("cameraMode", "revolve") == "fly") &&
// (cameraIsInRevolveMode())) toggleCameraMode();
// (cameraIsInRevolveMode())) toggleCameraMode();
QDomElement ch = child.firstChild().toElement();
while (!ch.isNull()) {

View File

@ -58,7 +58,7 @@ public:
#ifdef CGAL_USE_BOOST_BIMAP
typedef ::boost::bimap< ::boost::bimaps::set_of<Key, Direct_compare>,
::boost::bimaps::multiset_of<Data, Reverse_compare> > Boost_bimap;
::boost::bimaps::multiset_of<Data, Reverse_compare> > Boost_bimap;
typedef typename Boost_bimap::left_map Direct_func;
typedef typename Boost_bimap::right_map Reverse_func;
@ -161,7 +161,7 @@ public :
#ifdef CGAL_USE_BOOST_BIMAP
for(direct_const_iterator rit = dm.direct_func().begin();
rit != dm.direct_func().end();
rit != dm.direct_func().end();
++rit)
{
direct_func().insert(*rit);
@ -190,7 +190,7 @@ public :
direct_iterator hint = boost_bimap.left.lower_bound(k);
if(hint != boost_bimap.left.end() && hint->first == k)
return false;
return false;
boost_bimap.left.insert(hint, Direct_entry(k, d));
return true;
@ -198,7 +198,7 @@ public :
direct_iterator direct_hint = direct_func().lower_bound(k);
if(direct_hint != direct_func().end() &&
direct_hint->first == k)
direct_hint->first == k)
return false;
reverse_iterator reverse_it = reverse_func().insert(Reverse_entry(d, k));
@ -248,20 +248,20 @@ public :
template <typename Func_key, typename Func_data>
void dump_direct_func(std::ostream& out,
Func_key func_key,
Func_data func_data)
Func_key func_key,
Func_data func_data)
{
for(typename Direct_func::iterator it = direct_func().begin();
it != direct_func().end();
++it)
it != direct_func().end();
++it)
{
out << func_key(it->first) << " -> "
#ifdef CGAL_USE_BOOST_BIMAP
<< func_data(it->second)
<< func_data(it->second)
#else
<< func_data(it->second->first)
<< func_data(it->second->first)
#endif
<< std::endl;
<< std::endl;
}
}
@ -272,15 +272,15 @@ public :
template <typename Func_key, typename Func_data>
void dump_reverse_func(std::ostream& out,
Func_key func_key,
Func_data func_data)
Func_key func_key,
Func_data func_data)
{
for(typename Reverse_func::iterator it = reverse_func().begin();
it != reverse_func().end();
++it)
it != reverse_func().end();
++it)
{
out << func_data(it->first) << " "
<< func_key(it->second) << std::endl;
<< func_key(it->second) << std::endl;
}
}