commit cb292fc808249e302d82d25bfddc3cc245d8f6e9
author Chris Lattner <sabre@nondot.org> Sat Feb 03 07:59:51 2007 +0000
committer Chris Lattner <sabre@nondot.org> Sat Feb 03 07:59:51 2007 +0000
tree 76bad538685e7ed15075d366235dfbfb629d29ff
parent ac76029f91ccb007e8593a632b4ef0efee233873

close run-away tag

llvm-svn: 33828

llvm/docs/ProgrammersManual.html

diff --git a/llvm/docs/ProgrammersManual.html b/llvm/docs/ProgrammersManual.html
index 633b167..46077b8 100644
--- a/llvm/docs/ProgrammersManual.html
+++ b/llvm/docs/ProgrammersManual.html
@@ -904,7 +904,7 @@
 <div class="doc_text">
 
 <p>If you have a set-like datastructure that is usually small and whose elements
-are reasonably small, a <tt>SmallSet&lt;Type, N&gt; is a good choice.  This set
+are reasonably small, a <tt>SmallSet&lt;Type, N&gt;</tt> is a good choice.  This set
 has space for N elements in place (thus, if the set is dynamically smaller than
 N, no malloc traffic is required) and access them with a simple linear search.
 When the set grows beyond 'N', it allocates a more expensive representation that