bdlcc::Cache_QueueProctor< KEY > Class Template Reference

#include <bdlcc_cache.h>

Detailed Description

template<class KEY>
class bdlcc::Cache_QueueProctor< KEY >

This class implements a proctor that, on destruction, restores the queue to its state at the time of the proctor's creation. We assume that the only change to the queue is that 0 or more items have been added to the end. If release has been called, the destructor takes no action.

See bdlcc_cache

Public Member Functions
	Cache_QueueProctor (bsl::list< KEY > *queue)
	~Cache_QueueProctor ()
void	release ()

Constructor & Destructor Documentation

Cache_QueueProctor()

template<class KEY >

bdlcc::Cache_QueueProctor< KEY >::Cache_QueueProctor ( bsl::list< KEY > *  queue )

inlineexplicit

Create a Cache_QueueProctor object to monitor the specified queue.

~Cache_QueueProctor()

template<class KEY >

bdlcc::Cache_QueueProctor< KEY >::~Cache_QueueProctor ( )

inline

Destroy this proctor object. Remove any elements that we added since the proctor was created.

Member Function Documentation

release()

template<class KEY >

void bdlcc::Cache_QueueProctor< KEY >::release ( )

inline

Release the queue specified on construction, so that it will not be modified on the destruction of this proctor.

---

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

• bdlcc_cache.h