Description

template<typename T, class Compare = std::less<T>>
class WorkList< T, Compare >

List of things to work on.

A WorkList is an ordered list of items of user-defined type. Items are inserted (and copied) onto either the front or back of the list and are removed from either the front or back, allowing the WorkList to be used as a queue, stack, or combination. The modifier method names (push, pop, unshift, shift) are the same as for lists in Perl, and the worklist operates in a similar manner: push/pop operate on one end of the list while unshift/shift operate on the other end of the list.

Methods that insert items can optionally check that the item to be inserted is not already in the list, and skip the insertion if it is. Their behavior in this regard is controlled by an optional Boolean (actually, boost::tribool) argument that that enables or disables the uniqueness check. If the argument is indeterminate (the default) then the uniqueness check depends on whether uniqueness checking was enabled or disabled when the list was constructed. The optional argument allows a list that was constructed one way to be used a different way, although doing so may be less efficient.

Subclasses WorkListUnique and WorkListNonUnique are convenient ways to create a worklist and provide better documentation as to the default setting for uniqueness checking.

Time and space complexity

Lists that are constructed to perform uniqueness checks store two copies of their elements: the extra copy is an std::map that's used for its ability to do O(log(N)) lookups for the uniqueness checks. Insertion is O(log N) regardless of whether uniqueness is checked at the time of insertion. Removal and existance are also O(log N).

Lists that are constructed to not perform uniqueness checks store only one copy of each element. Insertion and removal are constant time operations, but existance is linear.

Size is always a constant time operation even if the list is implemented with std::list.

Examples

The following code prints "7123456789"

static int tail[3] = {7, 8, 9}, head[3] = {3, 2, 1};
WorkListUnique<int> worklist;
worklist.push(5);
worklist.unshift(4);
worklist.push(5); //no-op for WorkListUnique
worklist.push(6);
worklist.push(tail+0, tail+3);
worklist.unshift(head+0, head+3);
worklist.unshift(6, true);  //no-op
worklist.unshift(7, false); //disable uniqueness check
while (!worklist.empty())
   std::cout <<worklist.shift();

If we change the worklist to a WorkListNonUnique, then it would print "71234556789" instead (the only difference is that the second push(5) defaulted to non-unique insertion).

Definition at line 64 of file WorkLists.h.

#include <frontend/BinaryFormats/WorkLists.h>

Inheritance diagram for WorkList< T, Compare >:

[legend]

Public Types
typedef T	value_type

typedef Compare	key_compare

Public Member Functions
	WorkList (bool check_uniqueness=false)

bool	empty () const
	Returns true if this work list is empty.

size_t	size () const
	Returns the number of items in the work list.

void	clear ()
	Reset the list to an empty state.

bool	exists (const T &item) const
	Return true if the specified item is already on the work list.

bool	unshift (const T &, boost::tribool check_uniqueness=boost::indeterminate)
	Add an item to the front of the work list.

template<class Iterator >
size_t	unshift (const Iterator &begin, const Iterator &end, boost::tribool check_uniqueness=boost::indeterminate)
	Adds multiple items to the front of the work list.

T	shift ()
	Remove and return the item from the front of the work list.

bool	push (const T &, boost::tribool check_uniqueness=boost::logic::indeterminate)
	Add an item to the back of the work list.

template<class Iterator >
size_t	push (const Iterator &begin, const Iterator &end, boost::tribool check_uniqueness=boost::indeterminate)
	Adds multiple items to the back of the work list.

T	pop ()
	Remove an item from the back of the work list.

T	take ()
	Remove and return an item from the front of the work list.


const T &	front () const
	Returns the object at the front/back of the list without removing it.

const T &	back () const
	Returns the object at the front/back of the list without removing it.


void	add (const T &item)
	Adds an item(s) to the end of the queue.

void	add (const std::vector< T > &items)
	Adds an item(s) to the end of the queue.

void	add (const std::set< T > &items)
	Adds an item(s) to the end of the queue.

Member Typedef Documentation

◆ value_type

template<typename T , class Compare = std::less<T>>

typedef T WorkList< T, Compare >::value_type

Definition at line 66 of file WorkLists.h.

◆ key_compare

template<typename T , class Compare = std::less<T>>

typedef Compare WorkList< T, Compare >::key_compare

Definition at line 67 of file WorkLists.h.

Constructor & Destructor Documentation

◆ WorkList()

template<typename T , class Compare = std::less<T>>

WorkList< T, Compare >::WorkList ( bool check_uniqueness = false )

inlineexplicit

Definition at line 69 of file WorkLists.h.

Member Function Documentation

◆ empty()

template<typename T , class Compare = std::less<T>>

bool WorkList< T, Compare >::empty ( ) const

inline

Returns true if this work list is empty.

This is a constant time operation.

Definition at line 72 of file WorkLists.h.

Referenced by Rose::BinaryAnalysis::ControlFlow::fixup_fcall_fret().

◆ size()

template<typename T , class Compare = std::less<T>>

size_t WorkList< T, Compare >::size ( ) const

inline

Returns the number of items in the work list.

This is a constant time operation.

Definition at line 75 of file WorkLists.h.

◆ clear()

template<typename T , class Compare = std::less<T>>

void WorkList< T, Compare >::clear ( )

inline

Reset the list to an empty state.

Definition at line 78 of file WorkLists.h.

◆ exists()

template<typename T , class Compare = std::less<T>>

bool WorkList< T, Compare >::exists ( const T & item ) const

inline

Return true if the specified item is already on the work list.

Time complexity is O(log(N)).

Definition at line 81 of file WorkLists.h.

◆ unshift() [1/2]

template<typename T , class Compare >

bool WorkList< T, Compare >::unshift	(	const T &	item,
		boost::tribool	check_uniqueness = `boost::indeterminate`
	)

Add an item to the front of the work list.

If unique is true (the default) then the item is added to the list only if it's not already on the list. Returns true if the item was added to the list. Time complexity is O(log(N)).

Definition at line 168 of file WorkLists.h.

◆ unshift() [2/2]

template<typename T , class Compare >

template<class Iterator >

size_t WorkList< T, Compare >::unshift	(	const Iterator &	begin,
		const Iterator &	end,
		boost::tribool	check_uniqueness = `boost::indeterminate`
	)

Adds multiple items to the front of the work list.

If unique is true (the default) then an item is added to the list only if it's not already on the list. Returns the number of items that were added to the list. Time complexity is O(M log(N+M)) where M is the number of items being inserted.

Definition at line 190 of file WorkLists.h.

◆ shift()

template<typename T , class Compare >

T WorkList< T, Compare >::shift ( )

Remove and return the item from the front of the work list.

The list must not be empty. Time complexity is O(log(N)).

Definition at line 236 of file WorkLists.h.

Referenced by Rose::BinaryAnalysis::ControlFlow::fixup_fcall_fret(), and WorkList< T, Compare >::take().

◆ push() [1/2]

template<typename T , class Compare >

bool WorkList< T, Compare >::push	(	const T &	item,
		boost::tribool	check_uniqueness = `boost::logic::indeterminate`
	)

Add an item to the back of the work list.

If unique is true (the default) then the item is added to the list only if it's not already on the list. Returns true if the item was added to the list. Time complexity is O(log(N)).

Definition at line 202 of file WorkLists.h.

Referenced by WorkList< T, Compare >::add(), WorkList< T, Compare >::add(), WorkList< T, Compare >::add(), and Rose::BinaryAnalysis::ControlFlow::fixup_fcall_fret().

◆ push() [2/2]

template<typename T , class Compare >

template<class Iterator >

size_t WorkList< T, Compare >::push	(	const Iterator &	begin,
		const Iterator &	end,
		boost::tribool	check_uniqueness = `boost::indeterminate`
	)

Adds multiple items to the back of the work list.

If unique is true (the default) then an item is added to the list only if it's not already on the list. Returns the number of items that were added to the list. Time complexity is O(M log(N+M)) where M is the number of items being inserted.

Definition at line 224 of file WorkLists.h.

◆ pop()

template<typename T , class Compare >

T WorkList< T, Compare >::pop ( )

Remove an item from the back of the work list.

The list must not be empty. Time complexity is O(log(N)).

Definition at line 247 of file WorkLists.h.

◆ front()

template<typename T , class Compare >

const T & WorkList< T, Compare >::front ( ) const

Returns the object at the front/back of the list without removing it.

The list must not be empty. Items are returned by const reference because changing their value could change their sort order. If you need to change the value of the front or back element then do so by a shift-modify-unshift or pop-modify-push sequence. Time complexity is O(1).

Definition at line 258 of file WorkLists.h.

◆ back()

template<typename T , class Compare >

const T & WorkList< T, Compare >::back ( ) const

Returns the object at the front/back of the list without removing it.

The list must not be empty. Items are returned by const reference because changing their value could change their sort order. If you need to change the value of the front or back element then do so by a shift-modify-unshift or pop-modify-push sequence. Time complexity is O(1).

Definition at line 266 of file WorkLists.h.

◆ add() [1/3]

template<typename T , class Compare = std::less<T>>

void WorkList< T, Compare >::add ( const T & item )

inline

Adds an item(s) to the end of the queue.

The item is not added if the list was constructed to check for duplicates and the item being inserted is already in the list.

Definition at line 126 of file WorkLists.h.

References WorkList< T, Compare >::push().

◆ add() [2/3]

template<typename T , class Compare = std::less<T>>

void WorkList< T, Compare >::add ( const std::vector< T > & items )

inline

Adds an item(s) to the end of the queue.

The item is not added if the list was constructed to check for duplicates and the item being inserted is already in the list.

Definition at line 127 of file WorkLists.h.

References WorkList< T, Compare >::push().

◆ add() [3/3]

template<typename T , class Compare = std::less<T>>

void WorkList< T, Compare >::add ( const std::set< T > & items )

inline

Adds an item(s) to the end of the queue.

The item is not added if the list was constructed to check for duplicates and the item being inserted is already in the list.

Definition at line 128 of file WorkLists.h.

References WorkList< T, Compare >::push().

◆ take()

template<typename T , class Compare = std::less<T>>

T WorkList< T, Compare >::take ( )

inline

Remove and return an item from the front of the work list.

The list must not be empty.

Definition at line 132 of file WorkLists.h.

References WorkList< T, Compare >::shift().

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

WorkLists.h

Description

Time and space complexity

Examples

Public Types

Public Member Functions

Member Typedef Documentation

◆ value_type

◆ key_compare

Constructor & Destructor Documentation

◆ WorkList()

Member Function Documentation

◆ empty()

◆ size()

◆ clear()

◆ exists()

◆ unshift() [1/2]

◆ unshift() [2/2]

◆ shift()

◆ push() [1/2]

◆ push() [2/2]

◆ pop()

◆ front()

◆ back()

◆ add() [1/3]

◆ add() [2/3]

◆ add() [3/3]

◆ take()