From: Jakob Stoklund Olesen Date: Tue, 5 Apr 2011 20:56:08 +0000 (+0000) Subject: Document llvm/ADT/IntEqClasses.h in ProgrammersManual.html X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=4359e5eccf1d0b7c1bf4f466c914ede09ddd3f9d;p=oota-llvm.git Document llvm/ADT/IntEqClasses.h in ProgrammersManual.html git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@128927 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 95632bdf824..a280144eb61 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -86,6 +86,7 @@ option
  • "llvm/ADT/ValueMap.h"
  • "llvm/ADT/IntervalMap.h"
  • <map>
  • +
  • "llvm/ADT/IntEqClasses.h"
  • Other Map-Like Container Options
  • String-like containers @@ -1545,6 +1546,26 @@ another element takes place).

    + + + +
    + +

    IntEqClasses provides a compact representation of equivalence classes of +small integers. Initially, each integer in the range 0..n-1 has its own +equivalence class. Classes can be joined by passing two class representatives to +the join(a, b) method. Two integers are in the same class when findLeader() +returns the same representative.

    + +

    Once all equivalence classes are formed, the map can be compressed so each +integer 0..n-1 maps to an equivalence class number in the range 0..m-1, where m +is the total number of equivalence classes. The map must be uncompressed before +it can be edited again.

    + +
    +