cgal/Packages/Triangulation_2/include/CGAL/IO/triangulation_Window_stream.h

89 lines
2.4 KiB
C++

// ============================================================================
//
// Copyright (c) 1997 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 :
//
// file : include/CGAL/IO/triangulation_Window_stream.h
// source : web/Triangulation_2.fw
// revision : $Revision$
// revision_date : $Date$
// author(s) : Olivier Devillers
// Andreas Fabri
// Monique Teillaud
// Mariette Yvinec
//
// coordinator : Herve Bronnimann <Herve.Bronnimann@sophia.inria.fr>
//
// ============================================================================
#ifdef CGAL_TRIANGULATION_2_H
#ifndef CGAL_WINDOW_STREAM_TRIANGULATION_2_H
#define CGAL_WINDOW_STREAM_TRIANGULATION_2_H
template < class I >
CGAL_Window_stream&
operator<<(CGAL_Window_stream& os,
const CGAL_Triangulation_2<I> &T)
{
CGAL_Triangulation_2<I>::Edge_iterator it = T.edges_begin();
while(it != T.edges_end()){
os << T.segment(it);
++it;
}
return os;
}
#endif // CGAL_WINDOW_STREAM_TRIANGULATION_2_H
#endif // CGAL_TRIANGULATION_2_H
#ifdef CGAL_DELAUNAY_TRIANGULATION_2_H
#ifndef CGAL_WINDOW_STREAM_DELAUNAY_TRIANGULATION_2_H
#define CGAL_WINDOW_STREAM_DELAUNAY_TRIANGULATION_2_H
template < class I >
CGAL_Window_stream&
operator<<(CGAL_Window_stream& os,
const CGAL_Delaunay_triangulation_2<I> &T)
{
CGAL_Delaunay_triangulation_2<I>::Edge_iterator it = T.edges_begin();
while(it != T.edges_end()){
os << T.segment(it);
++it;
}
return os;
}
#endif // CGAL_WINDOW_STREAM_DELAUNAY_TRIANGULATION_2_H
#endif // CGAL_DELAUNAY_TRIANGULATION_2_H
#ifdef CGAL_CONSTRAINED_TRIANGULATION_2_H
#ifndef CGAL_WINDOW_STREAM_CONSTRAINED_TRIANGULATION_2_H
#define CGAL_WINDOW_STREAM_CONSTRAINED_TRIANGULATION_2_H
template < class I >
CGAL_Window_stream&
operator<<(CGAL_Window_stream& os,
const CGAL_Constrained_triangulation_2<I> &T)
{
CGAL_Constrained_triangulation_2<I>::Edge_iterator it = T.edges_begin();
while(it != T.edges_end()){
os << T.segment(it);
++it;
}
return os;
}
#endif // CGAL_WINDOW_STREAM_CONSTRAINED_TRIANGULATION_2_H
#endif // CGAL_CONSTRAINED_TRIANGULATION_2_H