From 0d4a66304bb18b8077e692d4a76db2d2433a8878 Mon Sep 17 00:00:00 2001
From: Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
Date: Tue, 17 Apr 2007 15:32:22 +0000
Subject: [PATCH] Spell check.

---
 STL_Extension/doc_tex/STL_Extension/main.tex                  | 2 +-
 STL_Extension/doc_tex/STL_Extension_ref/compact_container.tex | 2 +-
 STL_Extension/doc_tex/STL_Extension_ref/in_place_list.tex     | 2 +-
 STL_Extension/doc_tex/STL_Extension_ref/multiset.tex          | 2 +-
 4 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/STL_Extension/doc_tex/STL_Extension/main.tex b/STL_Extension/doc_tex/STL_Extension/main.tex
index 1c2742389a1..691321174ae 100644
--- a/STL_Extension/doc_tex/STL_Extension/main.tex
+++ b/STL_Extension/doc_tex/STL_Extension/main.tex
@@ -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
 stored elements by reference instead of copying them. It is possible
 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
 does not need this anymore). The usual iterators are also available.
 
diff --git a/STL_Extension/doc_tex/STL_Extension_ref/compact_container.tex b/STL_Extension/doc_tex/STL_Extension_ref/compact_container.tex
index dd7aa1cfe89..39c1435bfee 100644
--- a/STL_Extension/doc_tex/STL_Extension_ref/compact_container.tex
+++ b/STL_Extension/doc_tex/STL_Extension_ref/compact_container.tex
@@ -105,7 +105,7 @@
   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()}
   (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
   the halfedge data structures.
 
diff --git a/STL_Extension/doc_tex/STL_Extension_ref/in_place_list.tex b/STL_Extension/doc_tex/STL_Extension_ref/in_place_list.tex
index 8683c81b641..d35b41b5079 100644
--- a/STL_Extension/doc_tex/STL_Extension_ref/in_place_list.tex
+++ b/STL_Extension/doc_tex/STL_Extension_ref/in_place_list.tex
@@ -176,7 +176,7 @@
   \ccHidden\ccMethod{const T& back() 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}
diff --git a/STL_Extension/doc_tex/STL_Extension_ref/multiset.tex b/STL_Extension/doc_tex/STL_Extension_ref/multiset.tex
index e227f505d66..727d9637fe6 100644
--- a/STL_Extension/doc_tex/STL_Extension_ref/multiset.tex
+++ b/STL_Extension/doc_tex/STL_Extension_ref/multiset.tex
@@ -77,7 +77,7 @@ The \ccc{Multiset} class-template has three parameters:
 \begin{itemize}
 \item \ccc{Type} --- the type of the stored elements.
 \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;}\\
     The \ccc{CGAL::Compare<Type>} functor is used by default. In this case,
     \ccc{Type} must support an equality operator (\ccc{operator==}) and a