RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-15 07:39:31 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

ELIMINATE the SCC class completely. One less thing deriving from std::vector

Browse Source 
llvm-svn: 8272
This commit is contained in:
Chris Lattner 2003-08-31 19:55:31 +00:00
parent b16810e6ee
commit 076533d11b
1 changed files with 9 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
include/Support/SCCIterator.h
View File

@ -20,36 +20,20 @@
#include <vector>
#include <map>
//--------------------------------------------------------------------------
// class SCC - A simple representation of an SCC in a generic Graph.
//--------------------------------------------------------------------------
//===----------------------------------------------------------------------===//
///
/// TarjanSCC_iterator - Enumerate the SCCs of a directed graph, in
/// reverse topological order of the SCC DAG.
///
template<class GraphT, class GT = GraphTraits<GraphT> >
struct SCC : public std::vector<typename GT::NodeType*> {
typedef typename GT::NodeType NodeType;
class TarjanSCC_iterator
: public forward_iterator<std::vector<typename GT::NodeType>, ptrdiff_t> {
typedef typename GT::NodeType NodeType;
typedef typename GT::ChildIteratorType ChildItTy;
typedef std::vector<typename GT::NodeType*> super;
typedef typename super::iterator iterator;
typedef typename super::const_iterator const_iterator;
typedef typename super::reverse_iterator reverse_iterator;
typedef typename super::const_reverse_iterator const_reverse_iterator;
};
//--------------------------------------------------------------------------
// class TarjanSCC_iterator: Enumerate the SCCs of a directed graph, in
// reverse topological order of the SCC DAG.
//--------------------------------------------------------------------------
template<class GraphT, class GT = GraphTraits<GraphT> >
class TarjanSCC_iterator : public forward_iterator<SCC<GraphT, GT>, ptrdiff_t> {
typedef SCC<GraphT, GT> SccTy;
typedef std::vector<NodeType*> SccTy;
typedef forward_iterator<SccTy, ptrdiff_t> super;
typedef typename super::reference reference;
typedef typename super::pointer pointer;
typedef typename GT::NodeType NodeType;
typedef typename GT::ChildIteratorType ChildItTy;
// The visit counters used to detect when a complete SCC is on the stack.
// visitNum is the global counter.