Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS > Class Template Reference

A simple database cacher that enables transaction shrinking. More...

#include <RBTreeDBCacheInsertThenDestroySimple.hpp>

Inheritance diagram for Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >:

[legend]Collaboration diagram for Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >:

[legend]List of all members.

Public Types
typedef RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::params_t	params_t
Public Member Functions
	RBTreeDBCacheInsertThenDestroySimple (const params_t *par)
void	rewind ()
counter_t	nextTransactionBIS_modifyPrevious (BIS &transaction, std::vector< unsigned int > &filter)
void	setCandidateSize (const size_t candidate_size)
void	insert (const BIS &transaction, const counter_t multiplicity)
counter_t	nextTransactionBIS (BIS &transaction)
template<class UAC>
counter_t	nextTransactionUAC (UAC &transaction)
Protected Attributes
std::map< BIS, counter_t >	temp_rb_tree
item_t	candidate_size
std::map< BIS, counter_t >	rb_tree
std::map< BIS, counter_t >::iterator	it

---

Detailed Description

template<class T_R, class BIS = std::vector<item_t>>
class Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >

A simple database cacher that enables transaction shrinking.

When inserting the modified transactions into the database cacher, we simply go through the tree that stores the modified transactions and insert each of them into the cacher by using a look-up. This is not a fast solution, because we do not make use of the fact that both trees are actually sorted associative containers.

Definition at line 27 of file RBTreeDBCacheInsertThenDestroySimple.hpp.

---

Member Typedef Documentation

template<class T_R, class BIS = std::vector<item_t>> typedef RBTreeDBCacheInsertThenDestroyBase<T_R, BIS>::params_t Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >::params_t

Reimplemented from Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >. Definition at line 32 of file RBTreeDBCacheInsertThenDestroySimple.hpp.

---

Constructor & Destructor Documentation

template<class T_R, class BIS = std::vector<item_t>> Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >::RBTreeDBCacheInsertThenDestroySimple (  const params_t *  par  )  [inline]

Definition at line 34 of file RBTreeDBCacheInsertThenDestroySimple.hpp.

---

Member Function Documentation

template<class T_R, class BIS = std::vector<item_t>> void Bodon::RBTreeDBCache< T_R, BIS >::insert (  const BIS &  transaction, const counter_t  multiplicity )  [inline, inherited]

Definition at line 19 of file RBTreeDBCache.hpp. References Bodon::RBTreeDBCache< T_R, BIS >::rb_tree.

template<class T_R, class BIS> counter_t Bodon::RBTreeDBCache< T_R, BIS >::nextTransactionBIS (  BIS &  transaction  )  [inline, inherited]

Definition at line 53 of file RBTreeDBCache.hpp. References Bodon::RBTreeDBCache< T_R, BIS >::it, and Bodon::RBTreeDBCache< T_R, BIS >::rb_tree.

template<class T_R, class BIS> counter_t Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::nextTransactionBIS_modifyPrevious (  BIS &  transaction, std::vector< unsigned int > &  filter )  [inline, inherited]

Definition at line 39 of file RBTreeDBCacheInsertThenDestroyBase.hpp. References Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::candidate_size, Bodon::RBTreeDBCache< T_R, BIS >::it, Bodon::RBTreeDBCache< T_R, BIS >::rb_tree, and Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::temp_rb_tree.

template<class T_R, class BIS> template<class UAC> counter_t Bodon::RBTreeDBCache< T_R, BIS >::nextTransactionUAC (  UAC &  transaction  )  [inline, inherited]

Definition at line 65 of file RBTreeDBCache.hpp. References Bodon::RBTreeDBCache< T_R, BIS >::it, and Bodon::RBTreeDBCache< T_R, BIS >::rb_tree.

template<class T_R, class BIS = std::vector<item_t>> void Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >::rewind (   )  [inline]

Reimplemented from Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >. Definition at line 37 of file RBTreeDBCacheInsertThenDestroySimple.hpp. References Bodon::RBTreeDBCache< T_R, BIS >::rb_tree, and Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::temp_rb_tree.

template<class T_R, class BIS = std::vector<item_t>> void Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::setCandidateSize (  const size_t  candidate_size  )  [inline, inherited]

Definition at line 28 of file RBTreeDBCacheInsertThenDestroyBase.hpp.

---

Member Data Documentation

template<class T_R, class BIS = std::vector<item_t>> item_t Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::candidate_size [protected, inherited]

Definition at line 34 of file RBTreeDBCacheInsertThenDestroyBase.hpp. Referenced by Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::nextTransactionBIS_modifyPrevious().

template<class T_R, class BIS = std::vector<item_t>> std::map<BIS, counter_t>::iterator Bodon::RBTreeDBCache< T_R, BIS >::it [protected, inherited]

Definition at line 36 of file RBTreeDBCache.hpp. Referenced by Bodon::RBTreeDBCache< T_R, BIS >::nextTransactionBIS(), Bodon::RBTreeDBCacheSimultaneous< T_R, BIS >::nextTransactionBIS_modifyPrevious(), Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::nextTransactionBIS_modifyPrevious(), Bodon::RBTreeDBCache< T_R, BIS >::nextTransactionUAC(), Bodon::RBTreeDBCache< T_R, BIS >::RBTreeDBCache(), and Bodon::RBTreeDBCache< T_R, BIS >::rewind().

template<class T_R, class BIS = std::vector<item_t>> std::map<BIS, counter_t> Bodon::RBTreeDBCache< T_R, BIS >::rb_tree [protected, inherited]

Definition at line 35 of file RBTreeDBCache.hpp. Referenced by Bodon::RBTreeDBCache< T_R, BIS >::insert(), Bodon::RBTreeDBCache< T_R, BIS >::nextTransactionBIS(), Bodon::RBTreeDBCacheSimultaneous< T_R, BIS >::nextTransactionBIS_modifyPrevious(), Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::nextTransactionBIS_modifyPrevious(), Bodon::RBTreeDBCache< T_R, BIS >::nextTransactionUAC(), Bodon::RBTreeDBCache< T_R, BIS >::RBTreeDBCache(), Bodon::RBTreeDBCacheSimultaneous< T_R, BIS >::rewind(), Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >::rewind(), Bodon::RBTreeDBCacheInsertThenDestroyPro< T_R, BIS >::rewind(), and Bodon::RBTreeDBCache< T_R, BIS >::rewind().

template<class T_R, class BIS = std::vector<item_t>> std::map<BIS, counter_t> Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::temp_rb_tree [protected, inherited]

Definition at line 33 of file RBTreeDBCacheInsertThenDestroyBase.hpp. Referenced by Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::nextTransactionBIS_modifyPrevious(), Bodon::RBTreeDBCacheInsertThenDestroySimple< T_R, BIS >::rewind(), Bodon::RBTreeDBCacheInsertThenDestroyPro< T_R, BIS >::rewind(), and Bodon::RBTreeDBCacheInsertThenDestroyBase< T_R, BIS >::rewind().

---

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

• RBTreeDBCacheInsertThenDestroySimple.hpp

---