class IntEqClasses

Declaration

class IntEqClasses { /* full declaration omitted */ };

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:27

Method Overview

Methods

IntEqClasses(unsigned int N = 0)

Description

IntEqClasses - Create an equivalence class mapping for 0 .. N-1.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:41

Parameters

unsigned int N = 0

void clear()

Description

clear - Clear all classes so that grow() will assign a unique class to every integer.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:50

void compress()

Description

compress - Compress equivalence classes by numbering them 0 .. M. This makes the equivalence class map immutable.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:67

unsigned int findLeader(unsigned int a) const

Description

findLeader - Compute the leader of a's equivalence class. This is the smallest member of the class. This requires an uncompressed map.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:63

Parameters

unsigned int a

unsigned int getNumClasses() const

Description

getNumClasses - Return the number of equivalence classes after compress() was called.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:71

void grow(unsigned int N)

Description

grow - Increase capacity to hold 0 .. N-1, putting new integers in unique equivalence classes. This requires an uncompressed map.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:46

Parameters

unsigned int N

unsigned int join(unsigned int a, unsigned int b)

Description

Join the equivalence classes of a and b. After joining classes, findLeader(a) == findLeader(b). This requires an uncompressed map. Returns the new leader.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:58

Parameters

unsigned int a
unsigned int b

void uncompress()

Description

uncompress - Change back to the uncompressed representation that allows editing.

Declared at: llvm/include/llvm/ADT/IntEqClasses.h:82