diff --git a/concept_covering.htm b/concept_covering.htm
index 42b301d..0ae2029 100644
--- a/concept_covering.htm
+++ b/concept_covering.htm
@@ -35,7 +35,7 @@ component. If the program compiles then one can be sure that the
concepts cover the component.
The following code shows the archetype class for the TrivialIterator
+href="http://www.sgi.com/tech/stl/trivial.html">TrivialIterator
concept. Some care must be taken to ensure that the archetype is an
exact match to the concept. For example, the concept states that the
return type of operator*() must be convertible to the value
@@ -94,7 +94,7 @@ The following is an excerpt from stl_concept_covering.cpp
that shows how archetypes can be used to check the requirement
documentation for
-
+
std::stable_sort(). In this case, it looks like the CopyConstructible and Assignable requirements were