RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 20:39:47 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Document MapVector.

Browse Source 
llvm-svn: 165366
This commit is contained in:
Rafael Espindola 2012-10-07 00:56:09 +00:00
parent c5f946b170
commit 2619103729
1 changed files with 19 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
docs/ProgrammersManual.html
View File

@ -98,6 +98,7 @@ option</a></li>
<li><a href="#dss_valuemap">"llvm/ADT/ValueMap.h"</a></li>
<li><a href="#dss_intervalmap">"llvm/ADT/IntervalMap.h"</a></li>
<li><a href="#dss_map">&lt;map&gt;</a></li>
<li><a href="#dss_mapvector">"llvm/ADT/MapVector.h"</a></li>
<li><a href="#dss_inteqclasses">"llvm/ADT/IntEqClasses.h"</a></li>
<li><a href="#dss_immutablemap">"llvm/ADT/ImmutableMap.h"</a></li>
<li><a href="#dss_othermap">Other Map-Like Container Options</a></li>
@ -1848,6 +1849,24 @@ another element takes place).</p>
</div>
<!-- _______________________________________________________________________ -->
<h4>
<a name="dss_mapvector">"llvm/ADT/MapVector.h"</a>
</h4>
<div>
<p> MapVector&lt;KeyT,ValueT&gt provides a subset of the DenseMap interface.
The main difference is that the iteration order is guaranteed to be
the insertion order, making it an easy (but somewhat expensive) solution
for non-deterministic iteration over maps of pointers. </p>
<p> It is implemented by mapping from key to an index in a vector of key,value
pairs. This provides fast lookup and iteration, but has two main drawbacks:
The key is stored twice and it doesn't support removing elements. </p>
</div>
<!-- _______________________________________________________________________ -->
<h4>
<a name="dss_inteqclasses">"llvm/ADT/IntEqClasses.h"</a>