songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fixed more ledaing underscores.

This commit is contained in:
Michael Hoffmann 2000-04-14 11:31:17 +00:00
parent 34aa251a0f
commit 7710f6d70b
3 changed files with 20 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Packages/Matrix_search/include/CGAL/Sorted_matrix_search_traits_adaptor.h
View File

@ -28,17 +28,17 @@
CGAL_BEGIN_NAMESPACE
template < class _FeasibilityTest, class _Matrix >
template < class FeasibilityTest_, class Matrix_ >
class Sorted_matrix_search_traits_adaptor {
public:
typedef _FeasibilityTest FeasibilityTest;
typedef _Matrix Matrix;
typedef typename _Matrix::Value Value;
typedef FeasibilityTest_ FeasibilityTest;
typedef Matrix_ Matrix;
typedef typename Matrix::Value Value;
typedef std::less< Value > Compare_strictly;
typedef std::less_equal< Value > Compare_non_strictly;
Sorted_matrix_search_traits_adaptor(FeasibilityTest ft)
: _ft( ft)
: ft_( ft)
{}
Compare_strictly
@ -51,10 +51,10 @@ public:
bool
is_feasible(Value a)
{ return _ft( a); }
{ return ft_( a); }
protected:
FeasibilityTest _ft;
FeasibilityTest ft_;
};
//!!! with iterator traits we replace const Matrix&

10
Packages/Matrix_search/include/CGAL/Transform_iterator.h
View File

@ -40,10 +40,10 @@ struct Transform_iterator {
Transform_iterator( const OutputIterator& o,
const Operation& op)
: _o( o), _op( op)
: o_( o), op_( op)
{}
operator OutputIterator() { return _o; }
operator OutputIterator() { return o_; }
self& operator*() { return *this; }
@ -52,13 +52,13 @@ struct Transform_iterator {
self& operator++( int) { return *this; }
self& operator=( const argument_type& a) {
*(_o++) = _op( a);
*(o_++) = op_( a);
return *this;
}
private:
OutputIterator _o;
Operation _op;
OutputIterator o_;
Operation op_;
};
template < class OutputIterator, class Operation > inline

16
Packages/Matrix_search/include/CGAL/extremal_polygon_2.h
View File

@ -183,7 +183,7 @@ template < class RandomAccessIC,
template < class RandomAccessIC,
class Outputiterator,
class Traits,
class _FT >
class FT_ >
#endif
Outputiterator
CGAL_maximum_inscribed_rooted_k_gon(
@ -193,7 +193,7 @@ CGAL_maximum_inscribed_rooted_k_gon(
#ifndef CGAL_CFG_MATCHING_BUG_1
typename Traits::FT& max_area,
#else
_FT& max_area,
FT_& max_area,
#endif
Outputiterator o,
const Traits& t)
@ -282,7 +282,7 @@ template < class RandomAccessIC_point,
class RandomAccessIC_int,
class OutputIterator,
class Traits,
class _FT >
class FT_ >
#endif
OutputIterator
CGAL_maximum_inscribed_rooted_k_gon(
@ -296,7 +296,7 @@ CGAL_maximum_inscribed_rooted_k_gon(
#ifndef CGAL_CFG_MATCHING_BUG_1
typename Traits::FT& max_area,
#else
_FT& max_area,
FT_& max_area,
#endif
OutputIterator o,
const Traits& t)
@ -373,7 +373,7 @@ CGAL_maximum_inscribed_rooted_k_gon(
#ifndef CGAL_CFG_MATCHING_BUG_1
typedef typename Traits::FT FT;
#else
typedef _FT FT;
typedef FT_ FT;
#endif
typedef std::vector< FT > FT_cont;
typedef std::vector< int > Index_cont;
@ -654,7 +654,7 @@ template < class RandomAccessIC_point,
class RandomAccessIC_int,
class OutputIterator,
class Traits,
class _FT >
class FT_ >
#endif
OutputIterator
CGAL_maximum_inscribed_k_gon(
@ -670,7 +670,7 @@ CGAL_maximum_inscribed_k_gon(
#ifndef CGAL_CFG_MATCHING_BUG_1
typename Traits::FT& max_area,
#else
_FT& max_area,
FT_& max_area,
#endif
OutputIterator o,
const Traits& t)
@ -710,7 +710,7 @@ CGAL_maximum_inscribed_k_gon(
#ifndef CGAL_CFG_MATCHING_BUG_1
typedef typename Traits::FT FT;
#else
typedef _FT FT;
typedef FT_ FT;
#endif
typedef std::vector< int > Index_cont;