STLExtras.h File Reference

#include <cstddef>
#include <cstdlib>
#include <functional>
#include <iterator>
#include <utility>

Include dependency graph for STLExtras.h:

Go to the source code of this file.

Classes
struct	llvm::identity< Ty >
struct	llvm::less_ptr< Ty >
struct	llvm::greater_ptr< Ty >
class	llvm::mapped_iterator< RootIt, UnaryFunc >
struct	llvm::tier< T1, T2 >
Namespaces
namespace	llvm
	List of target independent CodeGen pass IDs.
Functions
template<class T >
void	llvm::deleter (T *Ptr)
template<class _Iterator , class Func >
mapped_iterator< _Iterator, Func >	llvm::operator+ (typename mapped_iterator< _Iterator, Func >::difference_type N, const mapped_iterator< _Iterator, Func > &X)
template<class ItTy , class FuncTy >
mapped_iterator< ItTy, FuncTy >	llvm::map_iterator (const ItTy &I, FuncTy F)
template<typename ItTy , typename Dist >
ItTy	llvm::next (ItTy it, Dist n)
template<typename ItTy >
ItTy	llvm::next (ItTy it)
template<typename ItTy , typename Dist >
ItTy	llvm::prior (ItTy it, Dist n)
template<typename ItTy >
ItTy	llvm::prior (ItTy it)
template<typename T1 , typename T2 >
tier< T1, T2 >	llvm::tie (T1 &f, T2 &s)
template<class T , std::size_t N>
T *	llvm::array_endof (T(&x)[N])
template<class T , std::size_t N>
size_t	llvm::array_lengthof (T(&)[N])
	Find the length of an array.
template<typename T >
int	llvm::array_pod_sort_comparator (const void *P1, const void *P2)
template<class IteratorTy >
void	llvm::array_pod_sort (IteratorTy Start, IteratorTy End)
template<class IteratorTy >
void	llvm::array_pod_sort (IteratorTy Start, IteratorTy End, int(*Compare)(const void *, const void *))
template<typename Container >
void	llvm::DeleteContainerPointers (Container &C)
template<typename Container >
void	llvm::DeleteContainerSeconds (Container &C)
Variables
int(*)(const void *, const void *)	llvm::get_array_pod_sort_comparator (const T &)