From c4161da4ca1900dfec1b253e48b2c784f5cb641a Mon Sep 17 00:00:00 2001 From: Lutz Kettner Date: Mon, 18 Jun 2001 01:25:15 +0000 Subject: [PATCH] Fixed example code inclusion in the doc. --- .../Halfedge_DS/doc_tex/basic/Halfedge_DS/hds.tex | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/Old_Packages/Halfedge_DS/doc_tex/basic/Halfedge_DS/hds.tex b/Old_Packages/Halfedge_DS/doc_tex/basic/Halfedge_DS/hds.tex index d0951c22976..c586da9aae5 100644 --- a/Old_Packages/Halfedge_DS/doc_tex/basic/Halfedge_DS/hds.tex +++ b/Old_Packages/Halfedge_DS/doc_tex/basic/Halfedge_DS/hds.tex @@ -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}. -\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}. 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} % +--------------------------------------------------------+