RWTPCValQueuePrioritized< Type > Class Template Reference

First-in-first-out (FIFO) queue that provides producer-consumer synchronization semantics for exchanging prioritized values between cooperating threads. More...

#include <rw/itc/RWTPCValQueuePrioritized.h>

Inheritance diagram for RWTPCValQueuePrioritized< Type >:

Public Member Functions
	RWTPCValQueuePrioritized (size_t maxCapacity)
	RWTPCValQueuePrioritized (size_t maxCapacity, bool isOpen)
	RWTPCValQueuePrioritized (void)
	~RWTPCValQueuePrioritized (void)
Public Member Functions inherited from RWTPCValBufferBasePrioritized< Type, RWTPriorityDecorator< Type > >
virtual	~RWTPCValBufferBasePrioritized (void)
bool	tryWrite (long priority, const Type &value)
void	write (long priority, const Type &value)
RWWaitStatus	write (long priority, const Type &value, unsigned long milliseconds)
Public Member Functions inherited from RWTPCValBufferBaseDecorated< Type, RWTPriorityDecorator< Type > >
virtual	~RWTPCValBufferBaseDecorated (void)
RWWaitStatus	peek (Type &result, unsigned long milliseconds)
Type	peek (void)
RWWaitStatus	read (Type &result, unsigned long milliseconds)
Type	read (void)
bool	tryPeek (Type &result)
bool	tryRead (Type &result)
bool	tryWrite (const Type &value)
void	write (const Type &value)
RWWaitStatus	write (const Type &value, unsigned long milliseconds)

Additional Inherited Members
Protected Types inherited from RWTMonitor< RWMutexLock >
typedef RWTLockGuard< RWTMonitor< RWMutexLock > >	LockGuard
typedef RWTTryLockGuard< RWTMonitor< RWMutexLock > >	TryLockGuard
typedef RWTUnlockGuard< RWTMonitor< RWMutexLock > >	UnlockGuard
Protected Member Functions inherited from RWTPCValBufferBase< RWTPriorityDecorator< Type > >
virtual	~RWTPCValBufferBase (void)
RWWaitStatus	peek (Type &result, unsigned long milliseconds)
Type	peek (void)
RWWaitStatus	read (Type &result, unsigned long milliseconds)
Type	read (void)
bool	tryPeek (Type &result)
bool	tryRead (Type &result)
bool	tryWrite (const Type &value)
void	write (const Type &value)
RWWaitStatus	write (const Type &value, unsigned long milliseconds)
virtual	~RWPCBufferBase (void)
bool	canRead (void) const
bool	canWrite (void) const
void	close (void)
size_t	entries (void) const
void	flush (void)
size_t	getCapacity (void) const
RWTFunctor< void()>	getCloseCallback (void) const
RWTFunctor< void()>	getEmptyCallback (void) const
RWTFunctor< void()>	getFullCallback (void) const
RWTFunctor< void()>	getOpenCallback (void) const
bool	isOpen (void) const
void	open (void)
size_t	setCapacity (size_t maxCapacity)
void	setCloseCallback (const RWTFunctor< void()> &onCloseCallback)
void	setEmptyCallback (const RWTFunctor< void()> &onEmptyCallback)
void	setFullCallback (const RWTFunctor< void()> &onFullCallback)
void	setOpenCallback (const RWTFunctor< void()> &onOpenCallback)
Protected Member Functions inherited from RWTMonitor< RWMutexLock >
	RWTMonitor (const RWTMonitor< RWMutexLock > &second)
	RWTMonitor (RWStaticCtor)
	RWTMonitor (void)
	~RWTMonitor (void)
void	acquire (void)
bool	isAcquired (void) const
RWTMonitor< RWMutexLock > &	monitor (void) const
RWMutexLock &	mutex (void)
RWTMonitor< RWMutexLock > &	operator= (const RWTMonitor< RWMutexLock > &)
void	release (void)
bool	tryAcquire (void)

Detailed Description

template<class Type>
class RWTPCValQueuePrioritized< Type >

RWTPCValQueuePrioritized is a first-in-first-out (FIFO) queue that provides producer-consumer synchronization semantics for exchanging prioritized values between cooperating threads.

In the producer-consumer synchronization model, reader threads (consumers) are blocked while the queue is empty, and writer threads (producers) are blocked while the queue is full. The queue is considered full when the number of unread entries equals or exceeds some user-specified maximum capacity.

The write operations inherited by this class bind a priority value to each data value prior to storing that value in an internal buffer. The priority value is used by these write operations to determine a value's insertion point within the queue, such that the set of unread values will be retrieved in priority order when they are eventually read from the queue. A new value is retrieved after any previously inserted values of the same priority.

Example

#include <rw/thread/RWThreadFunction.h>
#include <rw/itc/RWTPCValQueuePrioritized.h>
#include <rw/cstring.h>
#include <iostream>
 
RWTPCValQueuePrioritized<RWCString> pcQueue;
 
void reader(void) {
  // Get values from queue and write to stdout.
  RWCString message;
  while ("Exit" != (message = pcQueue.read())) {
    std::cout << message << std::endl;
    rwSleep(100);  // Let the messages pile up
  }
  std::cout << "EXIT" << std::endl;
}
 
int main() {
  RWThread thread = RWThreadFunction::make(reader);
  RWCString high("High"), medium("Medium"), low("Low");
 
  thread.start();
  pcQueue.write(1, low);
  pcQueue.write(1, low);
  pcQueue.write(2, medium);
  pcQueue.write(1, low);
  pcQueue.write(3, high);
  pcQueue.write(2, medium);
  pcQueue.write(1, low);
  pcQueue.write(1, low);
  pcQueue.write(3, high);
  pcQueue.write(1, low);
  pcQueue.write(2, medium);
  pcQueue.write(2, medium);
  pcQueue.write(0, "Exit");
  thread.join();
  return 0;
}

OUTPUT:

High
High
Medium
Medium
Medium
Medium
Low
Low
Low
Low
Low
EXIT

Constructor & Destructor Documentation

RWTPCValQueuePrioritized() [1/3]

template<class Type >

RWTPCValQueuePrioritized< Type >::RWTPCValQueuePrioritized ( void )

inline

Constructs a value-based, prioritized, producer-consumer queue instance.

The queue is open on construction and enforces no limit on the number of items in the queue.

RWTPCValQueuePrioritized() [2/3]

template<class Type >

RWTPCValQueuePrioritized< Type >::RWTPCValQueuePrioritized ( size_t maxCapacity )

inline

Constructs a value-based, prioritized, producer-consumer queue instance.

The parameter maxCapacity specifies the maximum number of unread entries to allow to accumulate within the queue. Once the number of entries in the queue equals this number, any thread attempting to write an additional entry is blocked until an entry is removed by a read() operation, or until the capacity is increased. A capacity of zero is used to indicate that the queue has no size limit other than that imposed by memory limitations, and that all write() operations should complete without blocking.

The queue is open on construction.

RWTPCValQueuePrioritized() [3/3]

template<class Type >

RWTPCValQueuePrioritized< Type >::RWTPCValQueuePrioritized ( size_t maxCapacity, bool isOpen )

inline

Constructs a value-based, prioritized, producer-consumer queue instance.

The parameter maxCapacity specifies the maximum number of unread entries to allow to accumulate within the queue. Once the number of entries in the queue equals this number, any thread attempting to write an additional entry is blocked until an entry is removed by a read() operation, or until the capacity is increased. A capacity of zero is used to indicate that the queue has no size limit other than that imposed by memory limitations, and that all write() operations should complete without blocking.

The parameter isOpen is a bool value that specifies whether the queue should be initialized in the open state, true, or the closed state, false.

~RWTPCValQueuePrioritized()

template<class Type >

RWTPCValQueuePrioritized< Type >::~RWTPCValQueuePrioritized ( void )

inline

Destructor.