diff options
| author | Chris Lattner <sabre@nondot.org> | 2007-02-03 07:59:51 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2007-02-03 07:59:51 +0000 |
| commit | cb292fc808249e302d82d25bfddc3cc245d8f6e9 (patch) | |
| tree | 76bad538685e7ed15075d366235dfbfb629d29ff /llvm/docs | |
| parent | ac76029f91ccb007e8593a632b4ef0efee233873 (diff) | |
| download | bcm5719-llvm-cb292fc808249e302d82d25bfddc3cc245d8f6e9.tar.gz bcm5719-llvm-cb292fc808249e302d82d25bfddc3cc245d8f6e9.zip | |
close run-away tag
llvm-svn: 33828
Diffstat (limited to 'llvm/docs')
| -rw-r--r-- | llvm/docs/ProgrammersManual.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/docs/ProgrammersManual.html b/llvm/docs/ProgrammersManual.html index 633b167b4c3..46077b82d42 100644 --- a/llvm/docs/ProgrammersManual.html +++ b/llvm/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<Type, N> is a good choice. This set +are reasonably small, a <tt>SmallSet<Type, N></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 |
