llvm::SmallVectorImpl< T > Class Template Reference

SmallVectorImpl - This class consists of common code factored out of the SmallVector class to reduce code duplication based on the SmallVector 'N' template parameter. More...

#include <SmallVector.h>

Inheritance diagram for llvm::SmallVectorImpl< T >:
llvm::SmallVectorTemplateBase< T, isPodLike< T >::value > llvm::SmallVectorTemplateCommon< T > llvm::SmallVectorBase llvm::SmallVector< T, N > llvm::SmallVector< T, 0 >

List of all members.

Public Types

typedef SuperClass::iterator iterator
typedef SuperClass::size_type size_type

Public Member Functions

 SmallVectorImpl (unsigned N)
 ~SmallVectorImpl ()
void clear ()
void resize (unsigned N)
void resize (unsigned N, const T &NV)
void reserve (unsigned N)
void push_back (const T &Elt)
void pop_back ()
pop_back_val ()
void swap (SmallVectorImpl &RHS)
template<typename in_iter >
void append (in_iter in_start, in_iter in_end)
 append - Add the specified range to the end of the SmallVector.
void append (size_type NumInputs, const T &Elt)
 append - Add the specified range to the end of the SmallVector.
void assign (unsigned NumElts, const T &Elt)
iterator erase (iterator I)
iterator erase (iterator S, iterator E)
iterator insert (iterator I, const T &Elt)
iterator insert (iterator I, size_type NumToInsert, const T &Elt)
template<typename ItTy >
iterator insert (iterator I, ItTy From, ItTy To)
const SmallVectorImploperator= (const SmallVectorImpl &RHS)
bool operator== (const SmallVectorImpl &RHS) const
bool operator!= (const SmallVectorImpl &RHS) const
bool operator< (const SmallVectorImpl &RHS) const
void set_size (unsigned N)
 set_size - Set the array size to

Private Types

typedef
SmallVectorTemplateBase< T,
isPodLike< T >::value > 
SuperClass

Private Member Functions

 SmallVectorImpl (const SmallVectorImpl &)

Static Private Member Functions

static void construct_range (T *S, T *E, const T &Elt)

Detailed Description

template<typename T>
class llvm::SmallVectorImpl< T >

SmallVectorImpl - This class consists of common code factored out of the SmallVector class to reduce code duplication based on the SmallVector 'N' template parameter.


Member Typedef Documentation

template<typename T>
typedef SuperClass::iterator llvm::SmallVectorImpl< T >::iterator
template<typename T>
typedef SuperClass::size_type llvm::SmallVectorImpl< T >::size_type
template<typename T>
typedef SmallVectorTemplateBase<T, isPodLike<T>::value > llvm::SmallVectorImpl< T >::SuperClass [private]

Constructor & Destructor Documentation

template<typename T>
llvm::SmallVectorImpl< T >::SmallVectorImpl ( const SmallVectorImpl< T > &   )  [private]
template<typename T>
llvm::SmallVectorImpl< T >::SmallVectorImpl ( unsigned  N  )  [inline, explicit]
template<typename T>
llvm::SmallVectorImpl< T >::~SmallVectorImpl (  )  [inline]

Member Function Documentation

template<typename T>
void llvm::SmallVectorImpl< T >::append ( size_type  NumInputs,
const T &  Elt 
) [inline]

append - Add the specified range to the end of the SmallVector.

template<typename T>
template<typename in_iter >
void llvm::SmallVectorImpl< T >::append ( in_iter  in_start,
in_iter  in_end 
) [inline]

append - Add the specified range to the end of the SmallVector.

template<typename T>
void llvm::SmallVectorImpl< T >::assign ( unsigned  NumElts,
const T &  Elt 
) [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::clear (  )  [inline]
template<typename T>
static void llvm::SmallVectorImpl< T >::construct_range ( T *  S,
T *  E,
const T &  Elt 
) [inline, static, private]
template<typename T>
iterator llvm::SmallVectorImpl< T >::erase ( iterator  S,
iterator  E 
) [inline]
template<typename T>
iterator llvm::SmallVectorImpl< T >::erase ( iterator  I  )  [inline]
template<typename T>
template<typename ItTy >
iterator llvm::SmallVectorImpl< T >::insert ( iterator  I,
ItTy  From,
ItTy  To 
) [inline]
template<typename T>
iterator llvm::SmallVectorImpl< T >::insert ( iterator  I,
size_type  NumToInsert,
const T &  Elt 
) [inline]
template<typename T>
iterator llvm::SmallVectorImpl< T >::insert ( iterator  I,
const T &  Elt 
) [inline]
template<typename T>
bool llvm::SmallVectorImpl< T >::operator!= ( const SmallVectorImpl< T > &  RHS  )  const [inline]
template<typename T>
bool llvm::SmallVectorImpl< T >::operator< ( const SmallVectorImpl< T > &  RHS  )  const [inline]
template<typename T >
const SmallVectorImpl< T > & llvm::SmallVectorImpl< T >::operator= ( const SmallVectorImpl< T > &  RHS  )  [inline]

Reimplemented in llvm::SmallVector< T, N >.

template<typename T>
bool llvm::SmallVectorImpl< T >::operator== ( const SmallVectorImpl< T > &  RHS  )  const [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::pop_back (  )  [inline]
template<typename T>
T llvm::SmallVectorImpl< T >::pop_back_val (  )  [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::push_back ( const T &  Elt  )  [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::reserve ( unsigned  N  )  [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::resize ( unsigned  N,
const T &  NV 
) [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::resize ( unsigned  N  )  [inline]
template<typename T>
void llvm::SmallVectorImpl< T >::set_size ( unsigned  N  )  [inline]

set_size - Set the array size to

  • N, which the current array must have enough capacity for.

This does not construct or destroy any elements in the vector.

Clients can use this in conjunction with capacity() to write past the end of the buffer when they know that more elements are available, and only update the size later. This avoids the cost of value initializing elements which will only be overwritten.

template<typename T >
void llvm::SmallVectorImpl< T >::swap ( SmallVectorImpl< T > &  RHS  )  [inline]

The documentation for this class was generated from the following file:

Generated on 2 Nov 2013 for Galois by  doxygen 1.6.1