summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2005-03-19 05:14:29 +0000
committerChris Lattner <sabre@nondot.org>2005-03-19 05:14:29 +0000
commitc3256647e75065e83783eb214eede0727da7185d (patch)
treed4aa4ab1ff3d8e438d841a99468107e535e13625 /llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp
parentbed1c18a443505c2af689045e7bbb6b1ba200150 (diff)
downloadbcm5719-llvm-c3256647e75065e83783eb214eede0727da7185d.tar.gz
bcm5719-llvm-c3256647e75065e83783eb214eede0727da7185d.zip
Rewrite this class, making the following improvements:
1. It now actually uses tarjan's algorithm, so it is a efficient inverse ackerman's function for union operations, not linear time. 2. It now stores one copy of the data in the set instead of two. 3. It now works for elements other than pointers. 4. It now has a more STL-like interface that exposes iterators instead of internal implementation details. llvm-svn: 20677
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/EquivClassGraphs.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud