#include "llvm/Analysis/IRSimilarityIdentifier.h"

Inheritance diagram for llvm::IRSimilarity::IRInstructionDataList:

[legend]

Additional Inherited Members
Public Types inherited from llvm::simple_ilist< IRInstructionData, ilist_sentinel_tracking< true > >
using	value_type = typename OptionsT::value_type

using	pointer = typename OptionsT::pointer

using	reference = typename OptionsT::reference

using	const_pointer = typename OptionsT::const_pointer

using	const_reference = typename OptionsT::const_reference

using	iterator = typename ilist_select_iterator_type< OptionsT::has_iterator_bits, OptionsT, false, false >::type

using	const_iterator = typename ilist_select_iterator_type< OptionsT::has_iterator_bits, OptionsT, false, true >::type

using	reverse_iterator = typename ilist_select_iterator_type< OptionsT::has_iterator_bits, OptionsT, true, false >::type

using	const_reverse_iterator = typename ilist_select_iterator_type< OptionsT::has_iterator_bits, OptionsT, true, true >::type

using	size_type = size_t

using	difference_type = ptrdiff_t

Public Member Functions inherited from llvm::simple_ilist< IRInstructionData, ilist_sentinel_tracking< true > >
	simple_ilist ()=default

	simple_ilist (const simple_ilist &)=delete

	simple_ilist (simple_ilist &&X)

	~simple_ilist ()=default

simple_ilist &	operator= (const simple_ilist &)=delete

simple_ilist &	operator= (simple_ilist &&X)

iterator	begin ()

const_iterator	begin () const

iterator	end ()

const_iterator	end () const

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

bool	empty () const
	Check if the list is empty in constant time.

size_type	size () const
	Calculate the size of the list in linear time.

reference	front ()

const_reference	front () const

reference	back ()

const_reference	back () const

void	push_front (reference Node)
	Insert a node at the front; never copies.

void	push_back (reference Node)
	Insert a node at the back; never copies.

void	pop_front ()
	Remove the node at the front; never deletes.

void	pop_back ()
	Remove the node at the back; never deletes.

void	swap (simple_ilist &X)
	Swap with another list in place using std::swap.

iterator	insert (iterator I, reference Node)
	Insert a node by reference; never copies.

void	insert (iterator I, Iterator First, Iterator Last)
	Insert a range of nodes; never copies.

void	cloneFrom (const simple_ilist &L2, Cloner clone, Disposer dispose)
	Clone another list.

void	remove (reference N)
	Remove a node by reference; never deletes.

void	removeAndDispose (reference N, Disposer dispose)
	Remove a node by reference and dispose of it.

iterator	erase (iterator I)
	Remove a node by iterator; never deletes.

iterator	erase (iterator First, iterator Last)
	Remove a range of nodes; never deletes.

iterator	eraseAndDispose (iterator I, Disposer dispose)
	Remove a node by iterator and dispose of it.

iterator	eraseAndDispose (iterator First, iterator Last, Disposer dispose)
	Remove a range of nodes and dispose of them.

void	clear ()
	Clear the list; never deletes.

void	clearAndDispose (Disposer dispose)
	Clear the list and dispose of the nodes.

void	splice (iterator I, simple_ilist &L2)
	Splice in another list.

void	splice (iterator I, simple_ilist &L2, iterator Node)
	Splice in a node from another list.

void	splice (iterator I, simple_ilist &, iterator First, iterator Last)
	Splice in a range of nodes from another list.

void	merge (simple_ilist &RHS)
	Merge in another list.

void	merge (simple_ilist &RHS, Compare comp)

void	sort ()
	Sort the list.

void	sort (Compare comp)

Detailed Description

Definition at line 302 of file IRSimilarityIdentifier.h.

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

include/llvm/Analysis/IRSimilarityIdentifier.h

Additional Inherited Members

Detailed Description