mirror of https://github.com/CGAL/cgal
parent
9201d861fd
commit
f7c65ff114
|
|
@ -34,7 +34,8 @@ data structure parameter, and the Triangulation data structure then uses a
|
|||
{\it rebind}-like mecanism (similar to the one specified in
|
||||
\ccc{std::allocator}) in order to put itself as parameter to the vertex and
|
||||
cell classes. The {\it rebound} base classes so obtained are the classes
|
||||
which are used as base class for the final vertex and cell classes.
|
||||
which are used as base classes for the final vertex and cell classes.
|
||||
More information can be found in Section~\ref{TDS3-sec-design}.
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef TriangulationDataStructure_3::Vertex_handle}{}{}
|
||||
|
|
|
|||
|
|
@ -33,7 +33,8 @@ Triangulation data structure parameter, and the Triangulation data structure
|
|||
then uses a {\it rebind}-like mecanism (similar to the one specified in
|
||||
\ccc{std::allocator}) in order to put itself as parameter to the vertex and
|
||||
cell classes. The {\it rebound} base classes so obtained are the classes which
|
||||
are used as base class for the final vertex and cell classes.
|
||||
are used as base classes for the final vertex and cell classes.
|
||||
More information can be found in Section~\ref{TDS3-sec-design}.
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef TriangulationDataStructure_3::Vertex_handle}{}{}
|
||||
|
|
@ -104,7 +105,7 @@ the optional point and other possible information.}
|
|||
|
||||
\ccFunction{ostream& operator<< (ostream& os,
|
||||
const TriangulationDSVertexBase_3 & v);}
|
||||
{Outputs the non combinatorial operation given by the vertex: the
|
||||
{Outputs the non-combinatorial information given by the vertex: the
|
||||
optional point and other possible information.}
|
||||
%\ccPrecond{The point and the other information have a corresponding
|
||||
%operator \ccc{<<}. \textit{This precondition is optional for the
|
||||
|
|
|
|||
|
|
@ -34,7 +34,8 @@ data structure parameter, and the Triangulation data structure then uses a
|
|||
{\it rebind}-like mecanism (similar to the one specified in
|
||||
\ccc{std::allocator}) in order to put itself as parameter to the vertex and
|
||||
cell classes. The {\it rebound} base classes so obtained are the classes
|
||||
which are used as base class for the final vertex and cell classes.
|
||||
which are used as base classes for the final vertex and cell classes.
|
||||
More information can be found in Section~\ref{TDS3-sec-design}.
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef TriangulationDataStructure_3::Vertex_handle}{}{}
|
||||
|
|
|
|||
|
|
@ -33,7 +33,8 @@ Triangulation data structure parameter, and the Triangulation data structure
|
|||
then uses a {\it rebind}-like mecanism (similar to the one specified in
|
||||
\ccc{std::allocator}) in order to put itself as parameter to the vertex and
|
||||
cell classes. The {\it rebound} base classes so obtained are the classes which
|
||||
are used as base class for the final vertex and cell classes.
|
||||
are used as base classes for the final vertex and cell classes.
|
||||
More information can be found in Section~\ref{TDS3-sec-design}.
|
||||
|
||||
\ccTypes
|
||||
\ccThree{typedef TriangulationDataStructure_3::Vertex_handle}{}{}
|
||||
|
|
@ -104,7 +105,7 @@ the optional point and other possible information.}
|
|||
|
||||
\ccFunction{ostream& operator<< (ostream& os,
|
||||
const TriangulationDSVertexBase_3 & v);}
|
||||
{Outputs the non combinatorial operation given by the vertex: the
|
||||
{Outputs the non-combinatorial information given by the vertex: the
|
||||
optional point and other possible information.}
|
||||
%\ccPrecond{The point and the other information have a corresponding
|
||||
%operator \ccc{<<}. \textit{This precondition is optional for the
|
||||
|
|
|
|||
Loading…
Reference in New Issue