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

Fixed example code inclusion in the doc.

This commit is contained in:
Lutz Kettner 2001-06-18 01:25:15 +00:00
parent 468b78eca9
commit c4161da4ca
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Old_Packages/Halfedge_DS/doc_tex/basic/Halfedge_DS/hds.tex
View File

@ -1644,7 +1644,7 @@ Section~\ref{sectionHdsDecorator} for the decorator. The program
creates a loop, consisting of two halfedges, one vertex and two
facets, and checks its validity.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_default.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_default.C}
% +-------------------------------------------------------------+
@ -1658,7 +1658,7 @@ maintaining only halfedges with next and opposite pointers. No
vertices or facets are stored. The data structure models an {\em
undirected graph}.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_graph.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_graph.C}
% +-------------------------------------------------------------+
@ -1672,7 +1672,7 @@ Note that for the vector storage the size of the halfedge data
structure must be reserved beforehand, either with the constructor as
shown in the example or with the {\tt reserve()} member function.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_vector.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_vector.C}
% +-------------------------------------------------------------+
@ -1689,7 +1689,7 @@ since they are only maintained as {\tt void*} pointers at this
level. The internal classes, which are responsible for the type safe
pointers, must be extended to achieve this.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_color.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_color.C}
% +-------------------------------------------------------------+
@ -1743,7 +1743,7 @@ the list management. They are added internally of the halfedge data
structure using the base class \ccc{In_place_list_base<My_halfedge>}.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_compact.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_compact.C}
\end{ccAdvanced}
@ -1753,7 +1753,7 @@ structure using the base class \ccc{In_place_list_base<My_halfedge>}.
Three edges are created in the default halfedge data structure.
The halfedge iterator is used to count the halfedges.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_halfedge_iterator.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_halfedge_iterator.C}
% +-------------------------------------------------------------+
\subsection{Example for an Adaptor to Build an Edge Iterator}
@ -1762,7 +1762,7 @@ Three edges are created in the default halfedge data structure.
The adaptor {\tt N\_step\_adaptor} is used to declare an edge
iterator, which is used to count the edges.
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_edge_iterator.C}
\ccIncludeExampleCode{Halfedge_DS/hds_prog_edge_iterator.C}
% +--------------------------------------------------------+