ispell

Modular_arithmetic/doc_tex/Modular_arithmetic/PkgDescription.tex

@@ -2,8 +2,8 @@
 \ccPkgHowToCiteCgal{cgal:h-ma-07}
 \ccPkgSummary{
 This package provides arithmetic over finite fields.
-The provided tools are in particular usefull for filters based on 
-modular arithmetic and algorithms based on chinese remainder.
+The provided tools are in particular useful for filters based on 
+modular arithmetic and algorithms based on Chinese remainder.
 }
 
 %\ccPkgDependsOn{}

Modular_arithmetic/doc_tex/Modular_arithmetic/main.tex

@@ -10,15 +10,15 @@
 This package introduces a type \ccc{CGAL::Modular} 
 representing a finite field over some prime. 
 This prime can be changed at runtime. From there, the type may serve
-as the workhorse for algorithms base on chinese remainder.  
+as the workhorse for algorithms base on Chinese remainder.  
 
 Moreover, the package introduces the \ccc{CGAL::Modular_traits<T>} 
-providing a mapping from some algebraic strucutre \ccc{T} into algebraic 
+providing a mapping from some algebraic structure \ccc{T} into algebraic 
 structure that is based on the type \ccc{CGAL::Modular}.  
-For scalar types, e.g. Integers, this mapping is just the kanonical homomorphism
+For scalar types, e.g. Integers, this mapping is just the canonical homomorphism
 into the type \ccc{CGAL::Modular}. 
-For compount types, e.g. Polynomials, the mapping is applied to the 
-coefficients of the compount type. 
+For compound types, e.g. Polynomials, the mapping is applied to the 
+coefficients of the compound type. 
 
 \section{Software Design}
 

Modular_arithmetic/doc_tex/Modular_arithmetic_ref/Modular.tex

@@ -14,7 +14,7 @@ The class provides static member functions to change this value.
 of this type.}
 However, already existing objects do not lose their value with respect to the 
 old prime and can be reused after restoring the old prime. 
-Since the type is base on double 
+Since the type is based on double 
 arithmetic the prime is restricted to values less than $2^{26}$. 
 The initial value of $p$ is 67111067. 
 
@@ -30,16 +30,16 @@ Note that due to the static prime the type is not thread-safe.
 \ccCreationVariable{x}
 
 \ccConstructor{Modular();}
-{introduces a variable \ccVar, which is initalized with zero;}
+{introduces a variable \ccVar, which is initialized with zero;}
 \ccGlue
 \ccConstructor{Modular(const Modular& m);}
 {copy constructor;}
 \ccGlue
 \ccConstructor{Modular(int i);}
-{intorduces a variable \ccVar, which is initalized with $i \%  p$;}
+{introduces a variable \ccVar, which is initialized with $i \%  p$;}
 \ccGlue
 \ccConstructor{Modular(long i);}
-{intorduces a variable \ccVar, which is initalized with $i \%  p$;}
+{introduces a variable \ccVar, which is initialized with $i \%  p$;}
 
 \ccOperations
 

Modular_arithmetic/doc_tex/Modular_arithmetic_ref/Modularizable.tex

@@ -4,9 +4,9 @@
 
 An algebraic structure is called \ccRefName, if there is an suitable mapping 
 into an algebraic structure which is based on the type \ccc{CGAL::Modular}. 
-For scalar types, e.g. Integers, this mapping is just the kanonical homomorphism 
-into the type \ccc{CGAL::Modular}. For compount types, e.g. Polynomials, 
-the mapping is applied to the coefficients of the compount type. 
+For scalar types, e.g. Integers, this mapping is just the canonical homomorphism 
+into the type \ccc{CGAL::Modular}. For compound types, e.g. Polynomials, 
+the mapping is applied to the coefficients of the compound type. 
 
 The mapping is provided via \ccc{CGAL::Modular_traits<Modularizable>}, 
 being a model of \ccc{ModularTraits}.