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

removed files _test_cls_edge_circulator.C _test_cls_face_circulator.C 

_test_cls_vertex_circulator.C
This commit is contained in:
Mariette Yvinec 1999-07-26 17:20:08 +00:00
parent fb004121b4
commit c88ef2a123
4 changed files with 0 additions and 137 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
Packages/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_edge_circulator.C
View File

@ -1,43 +0,0 @@
// ============================================================================
//
// Copyright (c) 1998 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------------
//
// release :
// release_date :
//
// source :
// file : include/CGAL/_test_cls_edge_circulator.C
// revision :
// revision_date :
// author(s) : Herve Bronnimann (Herve.Bronnimann@sophia.inria.fr)
//
// coordinator : INRIA Sophia-Antipolis
// ============================================================================
template < class Triangulation >
int
_test_cls_edge_circulator( const Triangulation &T )
{
typedef typename Triangulation::All_vertices_iterator All_vertices_iterator;
typedef typename Triangulation::Edge_circulator Edge_circulator;
int n = 0;
All_vertices_iterator vit;
Edge_circulator ec, ec0;
for (vit = T.all_vertices_begin(); vit != T.all_vertices_end(); ++vit)
{
ec0 = ec = vit->incident_edges( vit->face() );
//n++;
do {
ec++; n++;
} while (ec != ec0);
}
return n;
}

45
Packages/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_face_circulator.C
View File

@ -1,45 +0,0 @@
// ============================================================================
//
// Copyright (c) 1998 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------------
//
// release :
// release_date :
//
// source :
// file : include/CGAL/_test_cls_face_circulator.C
// revision :
// revision_date :
// author(s) : Herve Bronnimann (Herve.Bronnimann@sophia.inria.fr)
//
// coordinator : INRIA Sophia-Antipolis
// ============================================================================
template < class Triangulation >
int
_test_cls_face_circulator( const Triangulation &T )
{
typedef typename Triangulation::All_vertices_iterator
All_vertices_iterator;
typedef typename Triangulation::Face_circulator Face_circulator;
int n = 0;
All_vertices_iterator vit;
Face_circulator fc, fc0;
for (vit = T.all_vertices_begin(); vit != T.all_vertices_end(); ++vit)
{
fc0 = fc = vit->incident_faces( vit->face() );
if ( ! fc.is_empty()) {
do {
fc++; n++;
} while (fc != fc0);
}
}
return n;
}

45
Packages/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_vertex_circulator.C
View File

@ -1,45 +0,0 @@
// ============================================================================
//
// Copyright (c) 1998 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------------
//
// release :
// release_date :
//
// source :
// file : include/CGAL/_test_cls_vertex_circulator.C
// revision :
// revision_date :
// author(s) : Herve Bronnimann (Herve.Bronnimann@sophia.inria.fr)
//
// coordinator : INRIA Sophia-Antipolis
// ============================================================================
template < class Triangulation >
int
_test_cls_vertex_circulator( const Triangulation &T )
{
typedef typename Triangulation::All_vertices_iterator All_vertices_iterator;
typedef typename Triangulation::Vertex_circulator Vertex_circulator;
int n = 0;
All_vertices_iterator vit;
Vertex_circulator vc, vc0;
for (vit = T.all_vertices_begin(); vit != T.all_vertices_end(); ++vit)
{
vc0 = vc = vit->incident_vertices( vit->face() );
if (! vc.is_empty()) {
do {
vc++; n++;
} while (vc != vc0);
}
}
return n;
}

4
Packages/Triangulation_2/test/Triangulation_2/include/CGAL/_test_triangulation_iterators.C
View File

@ -21,10 +21,6 @@
// ============================================================================
//#include <CGAL/_test_cls_vertex_iterator.C>
//#include <CGAL/_test_cls_edge_iterator.C>
//#include <CGAL/_test_cls_face_iterator.C>
template < class Triangulation >
void
_test_iterators( const Triangulation &T )