commit 4ddfac128aaec0d258ba078ea8bb24de445d4a7f
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 311900b473af8334a968f301ccc25b9d55d26c19
parent 74c4ca146eaa279d3ca2b411dfb3f0f24d8c09e9

close run-away tag


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33828 91177308-0d34-0410-b5e6-96231b3b80d8

docs/ProgrammersManual.html

diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html
index 633b167..46077b8 100644
--- a/docs/ProgrammersManual.html
+++ b/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