addressable_fifo_queue< KeyType > Class Template Reference

Detailed Description

template<typename KeyType>
class foxxll::addressable_fifo_queue< KeyType >

An internal fifo queue that allows removing elements addressed with (a copy of) themselves.

Template Parameters

KeyType

Type of contained elements.

Definition at line 29 of file addressable_queues.hpp.

Inheritance diagram for addressable_fifo_queue< KeyType >:

#include <addressable_queues.hpp>

Public Types
using	handle = meta_iterator
	Type of handle to an entry. For use with insert and remove. More...

Public Member Functions
	addressable_fifo_queue ()
	Create an empty queue. More...
	~addressable_fifo_queue ()
bool	empty () const
bool	erase (const KeyType &e)
void	erase (handle i)
std::pair< handle, bool >	insert (const KeyType &e)
KeyType	pop ()
const KeyType &	top () const

Private Types
using	container_iterator = typename container_type::iterator
using	container_type = std::list< KeyType >
using	meta_iterator = typename meta_type::iterator
using	meta_type = std::map< KeyType, container_iterator >

Private Attributes
meta_type	meta
container_type	vals

Member Typedef Documentation

container_iterator

using container_iterator = typename container_type::iterator

private

Definition at line 32 of file addressable_queues.hpp.

container_type

using container_type = std::list<KeyType>

private

Definition at line 31 of file addressable_queues.hpp.

handle

using handle = meta_iterator

Type of handle to an entry. For use with insert and remove.

Definition at line 41 of file addressable_queues.hpp.

meta_iterator

using meta_iterator = typename meta_type::iterator

private

Definition at line 34 of file addressable_queues.hpp.

meta_type

using meta_type = std::map<KeyType, container_iterator>

private

Definition at line 33 of file addressable_queues.hpp.

Constructor & Destructor Documentation

addressable_fifo_queue()

addressable_fifo_queue ( )

inline

Create an empty queue.

Definition at line 44 of file addressable_queues.hpp.

~addressable_fifo_queue()

~addressable_fifo_queue ( )

inline

Definition at line 45 of file addressable_queues.hpp.

Member Function Documentation

empty()

bool empty ( ) const

inline

Check if queue is empty.

Returns

If queue is empty.

Definition at line 49 of file addressable_queues.hpp.

Referenced by block_scheduler_algorithm_online_lru< SwappableBlockType >::evictable_blocks_empty(), block_scheduler_algorithm_online_lru< SwappableBlockType >::get_free_internal_block(), addressable_fifo_queue< swappable_block_identifier_type >::pop(), addressable_priority_queue< swappable_block_identifier_type, foxxll::block_scheduler_algorithm_offline_lfd::priority >::pop(), and block_scheduler_algorithm_online_lru< SwappableBlockType >::~block_scheduler_algorithm_online_lru().

erase() [1/2]

bool erase ( const KeyType &  e )

inline

Erase element from the queue.

Parameters

e	Element to remove.

Returns

If element was in.

Definition at line 73 of file addressable_queues.hpp.

Referenced by block_scheduler_algorithm_online_lru< SwappableBlockType >::acquire(), block_scheduler_algorithm_online_lru< SwappableBlockType >::deinitialize(), and block_scheduler_algorithm_online_lru< SwappableBlockType >::extract_external_block().

erase() [2/2]

void erase ( handle  i )

inline

Erase element from the queue.

Parameters

i	Iterator to element to remove.

Definition at line 85 of file addressable_queues.hpp.

insert()

std::pair<handle, bool> insert ( const KeyType &  e )

inline

Insert new element. If the element is already in, it is moved to the back.

Parameters

e	Element to insert.

Returns

pair<handle, bool> Iterator to element; if element was newly inserted.

Definition at line 57 of file addressable_queues.hpp.

Referenced by block_scheduler_algorithm_online_lru< SwappableBlockType >::init(), and block_scheduler_algorithm_online_lru< SwappableBlockType >::release().

pop()

KeyType pop ( )

inline

Remove top element from the queue.

Returns

Top element.

Definition at line 98 of file addressable_queues.hpp.

Referenced by block_scheduler_algorithm_online_lru< SwappableBlockType >::evictable_blocks_pop(), block_scheduler_algorithm_online_lru< SwappableBlockType >::get_free_internal_block(), and block_scheduler_algorithm_online_lru< SwappableBlockType >::~block_scheduler_algorithm_online_lru().

top()

const KeyType& top ( ) const

inline

Access top element in the queue.

Returns

Const reference to top element.

Definition at line 93 of file addressable_queues.hpp.

Referenced by addressable_fifo_queue< swappable_block_identifier_type >::pop(), and addressable_priority_queue< swappable_block_identifier_type, foxxll::block_scheduler_algorithm_offline_lfd::priority >::pop().

Member Data Documentation

meta

meta_type meta

private

Definition at line 37 of file addressable_queues.hpp.

vals

container_type vals

private

Definition at line 36 of file addressable_queues.hpp.

---

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

• extlib/foxxll/foxxll/common/addressable_queues.hpp