Movatterモバイル変換

A FILO worklist that prioritizes on re-insertion without duplication.More...

#include "llvm/ADT/PriorityWorklist.h"

Inheritance diagram for llvm::PriorityWorklist< T, VectorT, MapT >:

Public Types
using	value_type =T

using	key_type =T

using	reference =T &

using	const_reference =const T &

using	size_type = typename MapT::size_type

Public Member Functions
	PriorityWorklist ()=default
	Construct an emptyPriorityWorklist.

bool	empty ()const
	Determine if thePriorityWorklist is empty or not.

size_type	size ()const
	Returns the number of elements in the worklist.

size_type	count (const key_type &key)const
	Count the number of elements of a given key in thePriorityWorklist.

const T &	back ()const
	Return the last element of thePriorityWorklist.

bool	insert (const T &X)
	Insert a new element into thePriorityWorklist.

template<typename SequenceT >
std::enable_if_t<!std::is_convertible< SequenceT,T >::value >	insert (SequenceT &&Input)
	Insert a sequence of new elements into thePriorityWorklist.

void	pop_back ()
	Remove the last element of thePriorityWorklist.

T	pop_back_val ()

bool	erase (const T &X)
	Erase an item from the worklist.

template<typename UnaryPredicate >
bool	erase_if (UnaryPredicateP)
	Erase items from the set vector based on a predicate function.

void	clear ()
	Reverse the items in thePriorityWorklist.

Detailed Description

template<typenameT, typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>
class llvm::PriorityWorklist< T, VectorT, MapT >

A FILO worklist that prioritizes on re-insertion without duplication.

This is very similar to aSetVector with the primary difference that while re-insertion does not create a duplicate, it does adjust the visitation order to respect the last insertion point. This can be useful when the visit order needs to be prioritized based on insertion point without actually having duplicate visits.

Note that this doesn't prevent re-insertion of elements which have been visited – if you need to break cycles, a set will still be necessary.

The typeT must be default constructable to a null value that will be ignored. It is an error to insert such a value, and popping elements will never produce such a value. It is expected to be used with common nullable types like pointers or optionals.

Internally this uses a vector to store the worklist and a map to identify existing elements in the worklist. Both of these may be customized, but the map must support the basicDenseMap API for mapping from a T to an integer index into the vector.

A partial specialization is provided to automatically select aSmallVector and aSmallDenseMap if custom data structures are not provided.

Definition at line55 of filePriorityWorklist.h.

Member Typedef Documentation

◆ const_reference

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

usingllvm::PriorityWorklist<T, VectorT,MapT >::const_reference =const T&

Definition at line60 of filePriorityWorklist.h.

◆ key_type

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

usingllvm::PriorityWorklist<T, VectorT,MapT >::key_type =T

Definition at line58 of filePriorityWorklist.h.

◆ reference

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

usingllvm::PriorityWorklist<T, VectorT,MapT >::reference =T&

Definition at line59 of filePriorityWorklist.h.

◆ size_type

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

usingllvm::PriorityWorklist<T, VectorT,MapT >::size_type = typename MapT::size_type

Definition at line61 of filePriorityWorklist.h.

◆ value_type

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

usingllvm::PriorityWorklist<T, VectorT,MapT >::value_type =T

Definition at line57 of filePriorityWorklist.h.

Constructor & Destructor Documentation

◆ PriorityWorklist()

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

llvm::PriorityWorklist<T, VectorT,MapT >::PriorityWorklist

(

)

default

Construct an emptyPriorityWorklist.

Member Function Documentation

◆ back()

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

const T &llvm::PriorityWorklist<T, VectorT,MapT >::back

(

)

const

inline

Return the last element of thePriorityWorklist.

Definition at line83 of filePriorityWorklist.h.

Referencesassert(), andllvm::PriorityWorklist< T, VectorT, MapT >::empty().

Referenced byllvm::PriorityWorklist< T, VectorT, MapT >::pop_back(), andllvm::PriorityWorklist< T, VectorT, MapT >::pop_back_val().

◆ clear()

template<typenameT , typename VectorT = std::vector<T>, typenameMapT = DenseMap<T, ptrdiff_t>>

voidllvm::PriorityWorklist<T, VectorT,MapT >::clear

(

)

inline

Reverse the items in thePriorityWorklist.

This does an in-place reversal. Other kinds of reverse aren't easy to support in the face of the worklist semantics. Completely clear thePriorityWorklist

Definition at line211 of filePriorityWorklist.h.