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

Spell check.

This commit is contained in:
Sylvain Pion 2007-04-17 15:32:22 +00:00
parent c9323b9a9f
commit 0d4a66304b
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
STL_Extension/doc_tex/STL_Extension/main.tex
View File

@ -40,7 +40,7 @@ The class \ccc{In_place_list<T,bool>} is a container quite similar
to \stl\ containers, with the advantage that it is able to handle the to \stl\ containers, with the advantage that it is able to handle the
stored elements by reference instead of copying them. It is possible stored elements by reference instead of copying them. It is possible
to delete an element only knowing its address and no iterator to it. to delete an element only knowing its address and no iterator to it.
This used to simplify mutually pointered data structures like a halfedge This used to simplify mutually pointed data structures like a halfedge
data structure for planar maps or polyhedral surfaces (the current design data structure for planar maps or polyhedral surfaces (the current design
does not need this anymore). The usual iterators are also available. does not need this anymore). The usual iterators are also available.

2
STL_Extension/doc_tex/STL_Extension_ref/compact_container.tex
View File

@ -105,7 +105,7 @@
its memory size is \ccc{N*sizeof(T)+o(N)}, where \ccc{N} is the maximum size its memory size is \ccc{N*sizeof(T)+o(N)}, where \ccc{N} is the maximum size
that the container has had in its past history, its \ccc{capacity()} that the container has had in its past history, its \ccc{capacity()}
(the memory of erased elements is not deallocated until destruction of the (the memory of erased elements is not deallocated until destruction of the
container or a call to \ccc{clear()}). This container has been developped in container or a call to \ccc{clear()}). This container has been developed in
order to store large graph-like data structures like the triangulation and order to store large graph-like data structures like the triangulation and
the halfedge data structures. the halfedge data structures.

2
STL_Extension/doc_tex/STL_Extension_ref/in_place_list.tex
View File

@ -176,7 +176,7 @@
\ccHidden\ccMethod{const T& back() const;}{} \ccHidden\ccMethod{const T& back() const;}{}
\ccHidden\ccMethod{const T& front() const;}{} \ccHidden\ccMethod{const T& front() const;}{}
\ccMethod{allocator_type get_allocator() const;}{returns the alloctor.} \ccMethod{allocator_type get_allocator() const;}{returns the allocator.}
%% +-----------------------------------+ %% +-----------------------------------+
\ccHeading{Insertion} \ccHeading{Insertion}

2
STL_Extension/doc_tex/STL_Extension_ref/multiset.tex
View File

@ -77,7 +77,7 @@ The \ccc{Multiset} class-template has three parameters:
\begin{itemize} \begin{itemize}
\item \ccc{Type} --- the type of the stored elements. \item \ccc{Type} --- the type of the stored elements.
\item \ccc{Compare} --- the comparison-functor type. This type should provide \item \ccc{Compare} --- the comparison-functor type. This type should provide
the following opeator for comparing two \ccc{Type} elements, namely: \\ the following operator for comparing two \ccc{Type} elements, namely: \\
\ccc{Comparison_result operator() (const Type& t1, const Type& t2) const;}\\ \ccc{Comparison_result operator() (const Type& t1, const Type& t2) const;}\\
The \ccc{CGAL::Compare<Type>} functor is used by default. In this case, The \ccc{CGAL::Compare<Type>} functor is used by default. In this case,
\ccc{Type} must support an equality operator (\ccc{operator==}) and a \ccc{Type} must support an equality operator (\ccc{operator==}) and a