summaryrefslogtreecommitdiff
path: root/docs/ProgrammersManual.html
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2007-02-03 07:59:51 +0000
committerChris Lattner <sabre@nondot.org>2007-02-03 07:59:51 +0000
commit4ddfac128aaec0d258ba078ea8bb24de445d4a7f (patch)
tree311900b473af8334a968f301ccc25b9d55d26c19 /docs/ProgrammersManual.html
parent74c4ca146eaa279d3ca2b411dfb3f0f24d8c09e9 (diff)
downloadllvm-4ddfac128aaec0d258ba078ea8bb24de445d4a7f.tar.gz
llvm-4ddfac128aaec0d258ba078ea8bb24de445d4a7f.tar.bz2
llvm-4ddfac128aaec0d258ba078ea8bb24de445d4a7f.tar.xz
close run-away tag
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33828 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs/ProgrammersManual.html')
-rw-r--r--docs/ProgrammersManual.html2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html
index 633b167b4c..46077b82d4 100644
--- a/docs/ProgrammersManual.html
+++ b/docs/ProgrammersManual.html
@@ -904,7 +904,7 @@ with a standard binary search.</p>
<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