mirror of https://github.com/CGAL/cgal
Fixed warning message in decorator and changed program inclusion in
hds.tex to use path names, which allowed to remove *.C files from the doc_tex directory.
This commit is contained in:
parent
9e64165b92
commit
dddf7f827f
|
|
@ -1,5 +1,10 @@
|
|||
Halfedge_DS Package: Release changes:
|
||||
---------------------------------------------------------------------
|
||||
|
||||
- Halfedge_data_structure_using_vector.h: Fixed bug in updating
|
||||
face pointers in the border case. Bug reported by Steve M. Robbins.
|
||||
- Fixed warnings in the test suite about unused variables.
|
||||
|
||||
2.9 (01 Jun 2001)
|
||||
|
||||
- Halfedge_data_structure_using_vector.h: Fixed missing & in
|
||||
|
|
|
|||
|
|
@ -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{hds_prog_default.C}
|
||||
\ccIncludeVerbatim{examples/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{hds_prog_graph.C}
|
||||
\ccIncludeVerbatim{examples/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{hds_prog_vector.C}
|
||||
\ccIncludeVerbatim{examples/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{hds_prog_color.C}
|
||||
\ccIncludeVerbatim{examples/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{hds_prog_compact.C}
|
||||
\ccIncludeVerbatim{examples/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{hds_prog_halfedge_iterator.C}
|
||||
\ccIncludeVerbatim{examples/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{hds_prog_edge_iterator.C}
|
||||
\ccIncludeVerbatim{examples/Halfedge_DS/hds_prog_edge_iterator.C}
|
||||
|
||||
% +--------------------------------------------------------+
|
||||
|
||||
|
|
|
|||
|
|
@ -740,8 +740,7 @@ public:
|
|||
}
|
||||
|
||||
protected: // Supports_halfedge_vertices
|
||||
void erase_connected_component_vertex( HDS& hds, Halfedge* h,
|
||||
Tag_false) {}
|
||||
void erase_connected_component_vertex( HDS&, Halfedge*, Tag_false) {}
|
||||
void erase_connected_component_vertex( HDS& hds, Halfedge* h,
|
||||
Tag_true) {
|
||||
// Erases the the vertex incident to h and sets all references
|
||||
|
|
|
|||
Loading…
Reference in New Issue