tst_bounded_noall< ThrTree > Class Template Reference

In t12, tests with limited buffers, without allocator. More...

List of all members.

Public Member Functions
	tst_bounded_noall (const ThrTree &aThrTree, size_t aBufSz)
const char *	what (void) const
template<class RangeT>
void	operator() (const RangeT &aRng, ObjT::CounterT expectedCount, ListObjT &aLstOfObjs)
rpa::thr_nb_t	thrs (void) const
	Number of threads.
Private Attributes
ThrTree	_ThrTree
size_t	_BufSz

---

Detailed Description

template<class ThrTree>
class tst_bounded_noall< ThrTree >

In t12, tests with limited buffers, without allocator.

---

Constructor & Destructor Documentation

template<class ThrTree>

tst_bounded_noall< ThrTree >::tst_bounded_noall	(	const ThrTree &	aThrTree,
		size_t	aBufSz
	)			[inline]

---

Member Function Documentation

template<class ThrTree>

template<class RangeT>

void tst_bounded_noall< ThrTree >::operator()	(	const RangeT &	aRng,
		ObjT::CounterT	expectedCount,
		ListObjT &	aLstOfObjs
	)			[inline]

* 'buffer_back_inserter' does the same is 'back_inserter', but allows more parallelization. 'make_thread_tree' creates, out of any threads iterator, a 'thread_tree' object which is necessary for parallel execution. A mutex is necessary because buffers have a limited size and will be periodically flushed into the output iterator.

template<class ThrTree>

rpa::thr_nb_t tst_bounded_noall< ThrTree >::thrs

(

void

)

const [inline]

Number of threads.

template<class ThrTree>

const char* tst_bounded_noall< ThrTree >::what

(

void

)

const [inline]

---

Member Data Documentation

template<class ThrTree>

size_t tst_bounded_noall< ThrTree >::_BufSz [private]

template<class ThrTree>

ThrTree tst_bounded_noall< ThrTree >::_ThrTree [private]

---

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

• t12_TransformRngJumpStats.cpp

---