LLVM  6.0.0svn
Classes | Namespaces | Typedefs | Functions
BreadthFirstIterator.h File Reference
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/None.h"
#include "llvm/ADT/Optional.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/iterator_range.h"
#include <iterator>
#include <queue>
#include <utility>
Include dependency graph for BreadthFirstIterator.h:

Go to the source code of this file.

Classes

class  llvm::bf_iterator_storage< SetType >
 
class  llvm::bf_iterator< GraphT, SetType, GT >
 

Namespaces

 llvm
 Compute iterated dominance frontiers using a linear time algorithm.
 

Typedefs

template<typename NodeRef , unsigned SmallSize = 8>
using llvm::bf_iterator_default_set = SmallPtrSet< NodeRef, SmallSize >
 

Functions

template<class T >
bf_iterator< Tllvm::bf_begin (const T &G)
 
template<class T >
bf_iterator< Tllvm::bf_end (const T &G)
 
template<class T >
iterator_range< bf_iterator< T > > llvm::breadth_first (const T &G)