From 522600a229b950314b5f4af84eba4f3e8a0ffea1 Mon Sep 17 00:00:00 2001 From: Dimitry Andric Date: Sun, 2 Dec 2012 13:10:19 +0000 Subject: Vendor import of llvm release_32 branch r168974 (effectively, 3.2 RC2): http://llvm.org/svn/llvm-project/llvm/branches/release_32@168974 --- docs/ProgrammersManual.html | 29 ++++++++++++++++++++++++----- 1 file changed, 24 insertions(+), 5 deletions(-) (limited to 'docs/ProgrammersManual.html') diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 5bf499b2db4d..7c2e6c8aad92 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -98,6 +98,7 @@ option
  • "llvm/ADT/ValueMap.h"
  • "llvm/ADT/IntervalMap.h"
  • <map>
  • +
  • "llvm/ADT/MapVector.h"
  • "llvm/ADT/IntEqClasses.h"
  • "llvm/ADT/ImmutableMap.h"
  • Other Map-Like Container Options
  • @@ -432,10 +433,10 @@ if (AllocationInst *AI = dyn_cast<How to set up LLVM-style +RTTI for your class hierarchy . +

    @@ -1848,6 +1849,24 @@ another element takes place).

    + + +

    + "llvm/ADT/MapVector.h" +

    +
    + +

    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.

    + +

    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.

    + +
    +

    "llvm/ADT/IntEqClasses.h" @@ -4130,7 +4149,7 @@ arguments. An argument has a pointer to the parent Function.

    Dinakar Dhurjati and Chris Lattner
    The LLVM Compiler Infrastructure
    - Last modified: $Date: 2012-07-25 15:46:11 +0200 (Wed, 25 Jul 2012) $ + Last modified: $Date: 2012-10-07 02:56:09 +0200 (Sun, 07 Oct 2012) $ -- cgit v1.2.3