| alive(int cls) const | HeapUnionFind< V, IM, Comp > | inline | 
  | classPrio(int cls) const | HeapUnionFind< V, IM, Comp > | inline | 
  | classRep(int id) const | HeapUnionFind< V, IM, Comp > | inline | 
  | classTop(int cls) const | HeapUnionFind< V, IM, Comp > | inline | 
  | clear() | HeapUnionFind< V, IM, Comp > | inline | 
  | Compare typedef | HeapUnionFind< V, IM, Comp > |  | 
  | decrease(const Item &item, const Value &prio) | HeapUnionFind< V, IM, Comp > | inline | 
  | find(const Item &item) const | HeapUnionFind< V, IM, Comp > | inline | 
  | HeapUnionFind(ItemIntMap &_index) | HeapUnionFind< V, IM, Comp > | inline | 
  | increase(const Item &item, const Value &prio) | HeapUnionFind< V, IM, Comp > | inline | 
  | insert(const Item &item, const Value &prio) | HeapUnionFind< V, IM, Comp > | inline | 
  | Item typedef | HeapUnionFind< V, IM, Comp > |  | 
  | ItemIntMap typedef | HeapUnionFind< V, IM, Comp > |  | 
  | join(Iterator begin, Iterator end) | HeapUnionFind< V, IM, Comp > | inline | 
  | operator[](const Item &item) const | HeapUnionFind< V, IM, Comp > | inline | 
  | set(const Item &item, const Value &prio) | HeapUnionFind< V, IM, Comp > | inline | 
  | split(int cls, Iterator out) | HeapUnionFind< V, IM, Comp > | inline | 
  | trivial(int cls) const | HeapUnionFind< V, IM, Comp > | inline | 
  | Value typedef | HeapUnionFind< V, IM, Comp > |  |