X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FProgrammersManual.html;h=f6854078b6c95c51ba142307ac2d24c07f7a7f89;hb=a75ce9f5d2236d93c117e861e60e6f3f748c9555;hp=e8d81a25061daa2db8d873767113226f2c1b5b2e;hpb=ea1fe2c0a79e7984da5d4fbd538a0bdb2cd1d149;p=oota-llvm.git diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index e8d81a25061..f6854078b6c 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -84,6 +84,7 @@ option
  • "llvm/ADT/IndexedMap.h"
  • "llvm/ADT/DenseMap.h"
  • "llvm/ADT/ValueMap.h"
  • +
  • "llvm/ADT/IntervalMap.h"
  • <map>
  • Other Map-Like Container Options
  • @@ -1507,6 +1508,23 @@ a Config parameter to the ValueMap template.

    + +
    + "llvm/ADT/IntervalMap.h" +
    + +
    + +

    IntervalMap is a compact map for small keys and values. It maps key +intervals instead of single keys, and it will automatically coalesce adjacent +intervals. When then map only contains a few intervals, they are stored in the +map object itself to avoid allocations.

    + +

    The IntervalMap iterators are quite big, so they should not be passed around +as STL iterators. The heavyweight iterators allow a smaller data structure.

    + +
    +
    <map>