diff options
-rw-r--r-- | docs/ProgrammersManual.html | 19 |
1 files changed, 19 insertions, 0 deletions
diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 93acb6d300..64ddb9d105 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -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"><map></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<KeyT,ValueT> 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> |