llvm::orc::detail::WaitingOnGraph< ContainerIdT, ElementIdT >::ElementSet Class Reference

#include "llvm/ExecutionEngine/Orc/WaitingOnGraph.h"

Inheritance diagram for llvm::orc::detail::WaitingOnGraph< ContainerIdT, ElementIdT >::ElementSet:

Public Member Functions
bool	merge (const ElementSet &Other, bool AssertNoOverlap=false)
	Merge the elements of Other into this set.
bool	remove (const ElementSet &Other)
	Remove all elements in Other from this set.
template<typename Pred>
bool	remove_if (Pred &&P)
	Remove all elements for which Pred returns true.
Public Member Functions inherited from llvm::detail::DenseSetImpl< ValueT, DenseMap< ValueT, DenseSetEmpty, ValueInfoT, DenseSetPair< ValueT > >, ValueInfoT >
	DenseSetImpl (unsigned InitialReserve=0)
	DenseSetImpl (const InputIt &I, const InputIt &E)
	DenseSetImpl (std::initializer_list< ValueT > Elems)
	DenseSetImpl (llvm::from_range_t, Range &&R)
bool	empty () const
size_type	size () const
size_t	getMemorySize () const
void	resize (size_t Size)
	Grow the DenseSet so that it has at least Size buckets.
void	reserve (size_t Size)
	Grow the DenseSet so that it can contain at least NumEntries items before resizing again.
void	clear ()
bool	erase (const ValueT &V)
void	swap (DenseSetImpl &RHS)
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
iterator	find (const_arg_type_t< ValueT > V)
const_iterator	find (const_arg_type_t< ValueT > V) const
bool	contains (const_arg_type_t< ValueT > V) const
	Check if the set contains the given element.
size_type	count (const_arg_type_t< ValueT > V) const
	Return 1 if the specified key is in the set, 0 otherwise.
iterator	find_as (const LookupKeyT &Val)
	Alternative version of find() which allows a different, and possibly less expensive, key type.
const_iterator	find_as (const LookupKeyT &Val) const
void	erase (iterator I)
void	erase (const_iterator CI)
std::pair< iterator, bool >	insert (const ValueT &V)
std::pair< iterator, bool >	insert (ValueT &&V)
std::pair< iterator, bool >	insert_as (const ValueT &V, const LookupKeyT &LookupKey)
	Alternative version of insert that uses a different (and possibly less expensive) key type.
std::pair< iterator, bool >	insert_as (ValueT &&V, const LookupKeyT &LookupKey)
void	insert (InputIt I, InputIt E)
void	insert_range (Range &&R)

Friends
class	ElementSetTest

Additional Inherited Members
Public Types inherited from llvm::detail::DenseSetImpl< ValueT, DenseMap< ValueT, DenseSetEmpty, ValueInfoT, DenseSetPair< ValueT > >, ValueInfoT >
using	key_type
using	value_type
using	size_type
using	iterator
using	const_iterator

Detailed Description

template<typename ContainerIdT, typename ElementIdT>
class llvm::orc::detail::WaitingOnGraph< ContainerIdT, ElementIdT >::ElementSet

Definition at line 89 of file WaitingOnGraph.h.

Member Function Documentation

merge()

template<typename ContainerIdT, typename ElementIdT>

bool llvm::orc::detail::WaitingOnGraph< ContainerIdT, ElementIdT >::ElementSet::merge ( const ElementSet & Other, bool AssertNoOverlap = false )

inline

Merge the elements of Other into this set.

Returns true if any new elements are added.

Definition at line 97 of file WaitingOnGraph.h.

References assert(), llvm::detail::DenseSetImpl< ValueT, DenseMap< ValueT, DenseSetEmpty, ValueInfoT, DenseSetPair< ValueT > >, ValueInfoT >::insert(), llvm::Other, and llvm::size().

remove()

template<typename ContainerIdT, typename ElementIdT>

bool llvm::orc::detail::WaitingOnGraph< ContainerIdT, ElementIdT >::ElementSet::remove ( const ElementSet & Other )

inline

Remove all elements in Other from this set.

Returns true if any elements were removed.

Definition at line 107 of file WaitingOnGraph.h.

References llvm::erase(), llvm::Other, llvm::size(), and ToRemove.

remove_if()

template<typename ContainerIdT, typename ElementIdT>

template<typename Pred>

bool llvm::orc::detail::WaitingOnGraph< ContainerIdT, ElementIdT >::ElementSet::remove_if ( Pred && P )

inline

Remove all elements for which Pred returns true.

Returns true if any elements were removed.

Definition at line 132 of file WaitingOnGraph.h.

References llvm::detail::DenseSetImpl< ValueT, DenseMap< ValueT, DenseSetEmpty, ValueInfoT, DenseSetPair< ValueT > >, ValueInfoT >::empty(), llvm::erase(), P, and ToRemove.

Friends And Related Symbol Documentation

ElementSetTest

template<typename ContainerIdT, typename ElementIdT>

friend class ElementSetTest

friend

Definition at line 90 of file WaitingOnGraph.h.

References ElementSetTest.

Referenced by ElementSetTest.

---

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

• include/llvm/ExecutionEngine/Orc/WaitingOnGraph.h