RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-29 14:40:25 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Reword the SetVector description to reflect reality.

Browse Source 
Patch by Michael Ilseman!


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@141648 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Bill Wendling 2011-10-11 06:33:56 +00:00
parent 66b20c4db6
commit 3478173e4a
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
docs/ProgrammersManual.html
View File

@ -1582,12 +1582,13 @@ elements out of (linear time), unless you use it's "pop_back" method, which is
faster.
</p>
<p>SetVector is an adapter class that defaults to using std::vector and std::set
for the underlying containers, so it is quite expensive. However,
<tt>"llvm/ADT/SetVector.h"</tt> also provides a SmallSetVector class, which
defaults to using a SmallVector and SmallSet of a specified size. If you use
this, and if your sets are dynamically smaller than N, you will save a lot of
heap traffic.</p>
<p><tt>SetVector</tt> is an adapter class that defaults to
using <tt>std::vector</tt> and a size 16 <tt>SmallSet</tt> for the underlying
containers, so it is quite expensive. However,
<tt>"llvm/ADT/SetVector.h"</tt> also provides a <tt>SmallSetVector</tt>
class, which defaults to using a <tt>SmallVector</tt> and <tt>SmallSet</tt>
of a specified size. If you use this, and if your sets are dynamically
smaller than <tt>N</tt>, you will save a lot of heap traffic.</p>
</div>