# HG changeset patch
# User alpar
# Date 1160488247 0
# Node ID b3abb7ed76a832b99d686c78fdf34c3b3e1c35ef
# Parent  ae8562537502f3212ff901342b5ef35572cf85c5
docfix

diff -r ae8562537502 -r b3abb7ed76a8 doc/groups.dox
--- a/doc/groups.dox	Thu Oct 05 10:18:58 2006 +0000
+++ b/doc/groups.dox	Tue Oct 10 13:50:47 2006 +0000
@@ -292,7 +292,7 @@
   to avoid document multiplications, an implementation of a concept
   simply refers to the corresponding concept class.
 
-- These classes declare every functions, <tt>typedef<tt>s etc. an
+- These classes declare every functions, <tt>typedef</tt>s etc. an
   implementation of the concepts should provide, however completely
   without implementations and real data structures behind the
   interface. On the other hand they should provide nothing else. All
@@ -301,7 +301,7 @@
   of course.) In this way it is easily to check if an algorithm
   doesn't use any extra feature of a certain implementation.
 
-- The concept descriptor classes also provide a <em>checker class<em>
+- The concept descriptor classes also provide a <em>checker class</em>
   that makes it possible check whether a certain implementation of a
   concept indeed provides all the required features.