public:
/// Guarded pointer
- typedef cds::gc::guarded_ptr< gc, node_type, value_type, details::guarded_ptr_cast_map<node_type, value_type> > guarded_ptr;
+ typedef typename gc::template guarded_ptr< node_type, value_type, details::guarded_ptr_cast_map<node_type, value_type> > guarded_ptr;
protected:
//@cond
/// Extracts the item from the list with specified \p key
/** \anchor cds_nonintrusive_LazyKVList_hp_extract
The function searches an item with key equal to \p key,
- unlinks it from the list, and returns it in \p dest parameter.
- If the item with key equal to \p key is not found the function returns \p false.
+ unlinks it from the list, and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
Note the compare functor should accept a parameter of type \p K that can be not the same as \p key_type.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- theList.extract( gp, 5 );
- // Deal with gp
- // ...
-
+ ord_list::guarded_ptr gp( theList.extract( 5 ));
+ if ( gp ) {
+ // Deal with gp
+ // ...
+ }
// Destructor of gp releases internal HP guard and frees the item
}
\endcode
*/
template <typename K>
- bool extract( guarded_ptr& dest, K const& key )
+ guarded_ptr extract( K const& key )
{
- return extract_at( head(), dest.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Extracts the item from the list with comparing functor \p pred
/**
- The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_extract "extract(guarded_ptr&, K const&)"
+ The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_extract "extract(K const&)"
but \p pred predicate is used for key comparing.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename K, typename Less>
- bool extract_with( guarded_ptr& dest, K const& key, Less pred )
+ guarded_ptr extract_with( K const& key, Less pred )
{
CDS_UNUSED( pred );
- return extract_at( head(), dest.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Finds the key \p key
/// Finds \p key and return the item found
/** \anchor cds_nonintrusive_LazyKVList_hp_get
The function searches the item with key equal to \p key
- and assigns the item found to guarded pointer \p ptr.
- The function returns \p true if \p key is found, and \p false otherwise.
- If \p key is not found the \p ptr parameter is not changed.
+ and returns the item found as a guarded pointer.
+ If \p key is not found the functions returns an empty \p guarded_ptr.
@note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- if ( theList.get( gp, 5 )) {
+ ord_list::guarded_ptr gp( theList.get( 5 ));
+ if ( gp ) {
// Deal with gp
//...
}
should accept a parameter of type \p K that can be not the same as \p key_type.
*/
template <typename K>
- bool get( guarded_ptr& ptr, K const& key )
+ guarded_ptr get( K const& key )
{
- return get_at( head(), ptr.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Finds the key \p val and return the item found
/**
- The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_get "get(guarded_ptr& ptr, K const&)"
+ The function is an analog of \ref cds_nonintrusive_LazyKVList_hp_get "get(K const&)"
but \p pred is used for comparing the keys.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename K, typename Less>
- bool get_with( guarded_ptr& ptr, K const& key, Less pred )
+ guarded_ptr get_with( K const& key, Less pred )
{
CDS_UNUSED( pred );
- return get_at( head(), ptr.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Checks if the list is empty
}
template <typename K, typename Compare>
- bool extract_at( head_type& refHead, typename gc::Guard& dest, K const& key, Compare cmp )
+ bool extract_at( head_type& refHead, typename guarded_ptr::native_guard& guard, K const& key, Compare cmp )
{
- return base_class::extract_at( &refHead, dest, key, cmp );
+ return base_class::extract_at( &refHead, guard, key, cmp );
}
template <typename K, typename Func>
}
template <typename K, typename Compare>
- bool get_at( head_type& refHead, typename gc::Guard& guard, K const& key, Compare cmp )
+ bool get_at( head_type& refHead, typename guarded_ptr::native_guard& guard, K const& key, Compare cmp )
{
return base_class::get_at( &refHead, guard, key, cmp );
}
public:
/// Guarded pointer
- typedef cds::gc::guarded_ptr< gc, node_type, value_type, details::guarded_ptr_cast_set<node_type, value_type> > guarded_ptr;
+ typedef typename gc::template guarded_ptr< node_type, value_type, details::guarded_ptr_cast_set<node_type, value_type> > guarded_ptr;
private:
//@cond
/// Extracts the item from the list with specified \p key
/** \anchor cds_nonintrusive_LazyList_hp_extract
The function searches an item with key equal to \p key,
- unlinks it from the list, and returns it in \p dest parameter.
- If the item with key equal to \p key is not found the function returns \p false.
+ unlinks it from the list, and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
Note the compare functor should accept a parameter of type \p Q that can be not the same as \p value_type.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- theList.extract( gp, 5 );
- // Deal with gp
- // ...
-
+ ord_list::guarded_ptr gp(theList.extract( 5 ));
+ if ( gp ) {
+ // Deal with gp
+ // ...
+ }
// Destructor of gp releases internal HP guard and frees the item
}
\endcode
*/
template <typename Q>
- bool extract( guarded_ptr& dest, Q const& key )
+ guarded_ptr extract( Q const& key )
{
- return extract_at( head(), dest.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Extracts the item from the list with comparing functor \p pred
/**
- The function is an analog of \ref cds_nonintrusive_LazyList_hp_extract "extract(guarded_ptr&, Q const&)"
+ The function is an analog of \ref cds_nonintrusive_LazyList_hp_extract "extract(Q const&)"
but \p pred predicate is used for key comparing.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool extract_with( guarded_ptr& dest, Q const& key, Less pred )
+ guarded_ptr extract_with( Q const& key, Less pred )
{
CDS_UNUSED( pred );
- return extract_at( head(), dest.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Finds the key \p key
/// Finds the key \p key and return the item found
/** \anchor cds_nonintrusive_LazyList_hp_get
The function searches the item with key equal to \p key
- and assigns the item found to guarded pointer \p ptr.
- The function returns \p true if \p key is found, and \p false otherwise.
- If \p key is not found the \p ptr parameter is not changed.
+ and returns the item found as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
@note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- if ( theList.get( gp, 5 )) {
+ ord_list::guarded_ptr gp( theList.get( 5 ));
+ if ( gp ) {
// Deal with gp
//...
}
should accept a parameter of type \p Q that can be not the same as \p value_type.
*/
template <typename Q>
- bool get( guarded_ptr& ptr, Q const& key )
+ guarded_ptr get( Q const& key )
{
- return get_at( head(), ptr.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Finds the key \p key and return the item found
/**
- The function is an analog of \ref cds_nonintrusive_LazyList_hp_get "get( guarded_ptr& ptr, Q const&)"
+ The function is an analog of \ref cds_nonintrusive_LazyList_hp_get "get( Q const&)"
but \p pred is used for comparing the keys.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool get_with( guarded_ptr& ptr, Q const& key, Less pred )
+ guarded_ptr get_with( Q const& key, Less pred )
{
CDS_UNUSED( pred );
- return get_at( head(), ptr.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Checks whether the list is empty
}
template <typename Q, typename Compare>
- bool extract_at( head_type& refHead, typename gc::Guard& dest, Q const& key, Compare cmp )
+ bool extract_at( head_type& refHead, typename guarded_ptr::native_guard& guard, Q const& key, Compare cmp )
{
- return base_class::extract_at( &refHead, dest, key, cmp );
+ return base_class::extract_at( &refHead, guard, key, cmp );
}
template <typename Q, typename Func>
}
template <typename Q, typename Compare>
- bool get_at( head_type& refHead, typename gc::Guard& guard, Q const& key, Compare cmp )
+ bool get_at( head_type& refHead, typename guarded_ptr::native_guard& guard, Q const& key, Compare cmp )
{
return base_class::get_at( &refHead, guard, key, cmp );
}
public:
/// Guarded pointer
- typedef cds::gc::guarded_ptr< gc, node_type, value_type, details::guarded_ptr_cast_map<node_type, value_type> > guarded_ptr;
+ typedef typename gc::template guarded_ptr< node_type, value_type, details::guarded_ptr_cast_map<node_type, value_type> > guarded_ptr;
protected:
//@cond
/// Extracts the item from the list with specified \p key
/** \anchor cds_nonintrusive_MichaelKVList_hp_extract
The function searches an item with key equal to \p key,
- unlinks it from the list, and returns it in \p dest parameter.
- If the item with key equal to \p key is not found the function returns \p false.
+ unlinks it from the list, and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
Note the compare functor should accept a parameter of type \p K that can be not the same as \p key_type.
- The \ref disposer specified in \p Traits class template parameter is called automatically
- by garbage collector \p GC specified in class' template parameters when returned \ref guarded_ptr object
+ The \p disposer specified in \p Traits class template parameter is called automatically
+ by garbage collector \p GC specified in class' template parameters when returned \p guarded_ptr object
will be destroyed or released.
@note Each \p guarded_ptr object uses the GC's guard that can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- theList.extract( gp, 5 );
- // Deal with gp
- // ...
-
+ ord_list::guarded_ptr gp(theList.extract( 5 ));
+ if ( gp ) {
+ // Deal with gp
+ // ...
+ }
// Destructor of gp releases internal HP guard
}
\endcode
*/
template <typename K>
- bool extract( guarded_ptr& dest, K const& key )
+ guarded_ptr extract( K const& key )
{
- return extract_at( head(), dest.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Extracts the item from the list with comparing functor \p pred
/**
- The function is an analog of \ref cds_nonintrusive_MichaelKVList_hp_extract "extract(guarded_ptr&, K const&)"
+ The function is an analog of \ref cds_nonintrusive_MichaelKVList_hp_extract "extract(K const&)"
but \p pred predicate is used for key comparing.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref key_type and \p K
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename K, typename Less>
- bool extract_with( guarded_ptr& dest, K const& key, Less pred )
+ guarded_ptr extract_with( K const& key, Less pred )
{
CDS_UNUSED( pred );
- return extract_at( head(), dest.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Finds the key \p key
/// Finds the \p key and return the item found
/** \anchor cds_nonintrusive_MichaelKVList_hp_get
The function searches the item with key equal to \p key
- and assigns the item found to guarded pointer \p ptr.
- The function returns \p true if \p key is found, and \p false otherwise.
- If \p key is not found the \p ptr parameter is not changed.
+ and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
- The \ref disposer specified in \p Traits class template parameter is called
- by garbage collector \p GC automatically when returned \ref guarded_ptr object
+ The \p disposer specified in \p Traits class template parameter is called
+ by garbage collector \p GC automatically when returned \p guarded_ptr object
will be destroyed or released.
@note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- if ( theList.get( gp, 5 )) {
+ ord_list::guarded_ptr gp(theList.get( 5 ));
+ if ( gp ) {
// Deal with gp
//...
}
should accept a parameter of type \p K that can be not the same as \p key_type.
*/
template <typename K>
- bool get( guarded_ptr& ptr, K const& key )
+ guarded_ptr get( K const& key )
{
- return get_at( head(), ptr.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Finds the \p key and return the item found
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename K, typename Less>
- bool get_with( guarded_ptr& ptr, K const& key, Less pred )
+ guarded_ptr get_with( K const& key, Less pred )
{
CDS_UNUSED( pred );
- return get_at( head(), ptr.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Checks if the list is empty
return base_class::erase_at( refHead, key, cmp, [&f]( node_type const & node ){ f( const_cast<value_type&>(node.m_Data)); });
}
template <typename K, typename Compare>
- bool extract_at( head_type& refHead, typename gc::Guard& dest, K const& key, Compare cmp )
+ bool extract_at( head_type& refHead, typename guarded_ptr::native_guard& guard, K const& key, Compare cmp )
{
- return base_class::extract_at( refHead, dest, key, cmp );
+ return base_class::extract_at( refHead, guard, key, cmp );
}
template <typename K, typename Compare>
}
template <typename K, typename Compare>
- bool get_at( head_type& refHead, typename gc::Guard& guard, K const& key, Compare cmp )
+ bool get_at( head_type& refHead, typename guarded_ptr::native_guard& guard, K const& key, Compare cmp )
{
return base_class::get_at( refHead, guard, key, cmp );
}
public:
/// Guarded pointer
- typedef cds::gc::guarded_ptr< gc, node_type, value_type, details::guarded_ptr_cast_set<node_type, value_type> > guarded_ptr;
+ typedef typename gc::template guarded_ptr< node_type, value_type, details::guarded_ptr_cast_set<node_type, value_type> > guarded_ptr;
private:
//@cond
/// Extracts the item from the list with specified \p key
/** \anchor cds_nonintrusive_MichaelList_hp_extract
The function searches an item with key equal to \p key,
- unlinks it from the list, and returns it in \p dest parameter.
- If the item with key equal to \p key is not found the function returns \p false.
+ unlinks it from the list, and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
Note the compare functor should accept a parameter of type \p Q that can be not the same as \p value_type.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- theList.extract( gp, 5 );
- // Deal with gp
- // ...
-
+ ord_list::guarded_ptr gp(theList.extract( 5 ));
+ if ( gp ) {
+ // Deal with gp
+ // ...
+ }
// Destructor of gp releases internal HP guard and frees the item
}
\endcode
*/
template <typename Q>
- bool extract( guarded_ptr& dest, Q const& key )
+ guarded_ptr extract( Q const& key )
{
- return extract_at( head(), dest.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Extracts the item from the list with comparing functor \p pred
/**
- The function is an analog of \ref cds_nonintrusive_MichaelList_hp_extract "extract(guarded_ptr&, Q const&)"
+ The function is an analog of \ref cds_nonintrusive_MichaelList_hp_extract "extract(Q const&)"
but \p pred predicate is used for key comparing.
\p Less functor has the semantics like \p std::less but it should accept arguments of type \p value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool extract_with( guarded_ptr& dest, Q const& key, Less pred )
+ guarded_ptr extract_with( Q const& key, Less pred )
{
CDS_UNUSED( pred );
- return extract_at( head(), dest.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ extract_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Finds \p key
/// Finds \p key and return the item found
/** \anchor cds_nonintrusive_MichaelList_hp_get
The function searches the item with key equal to \p key
- and assigns the item found to guarded pointer \p ptr.
- The function returns \p true if \p key is found, and \p false otherwise.
- If \p key is not found the \p ptr parameter is not changed.
+ and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
@note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- if ( theList.get( gp, 5 )) {
+ ord_list::guarded_ptr gp(theList.get( 5 ));
+ if ( gp ) {
// Deal with gp
//...
}
should accept a parameter of type \p Q that can be not the same as \p value_type.
*/
template <typename Q>
- bool get( guarded_ptr& ptr, Q const& key )
+ guarded_ptr get( Q const& key )
{
- return get_at( head(), ptr.guard(), key, intrusive_key_comparator() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, intrusive_key_comparator() );
+ return gp;
}
/// Finds \p key and return the item found
/**
- The function is an analog of \ref cds_nonintrusive_MichaelList_hp_get "get( guarded_ptr& ptr, Q const&)"
+ The function is an analog of \ref cds_nonintrusive_MichaelList_hp_get "get( Q const&)"
but \p pred is used for comparing the keys.
\p Less functor has the semantics like \p std::less but should accept arguments of type \p value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool get_with( guarded_ptr& ptr, Q const& key, Less pred )
+ guarded_ptr get_with( Q const& key, Less pred )
{
CDS_UNUSED( pred );
- return get_at( head(), ptr.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ guarded_ptr gp;
+ get_at( head(), gp.guard(), key, typename maker::template less_wrapper<Less>::type() );
+ return gp;
}
/// Check if the list is empty
}
template <typename Q, typename Compare>
- bool extract_at( head_type& refHead, typename gc::Guard& dest, Q const& key, Compare cmp )
+ bool extract_at( head_type& refHead, typename guarded_ptr::native_guard& guard, Q const& key, Compare cmp )
{
- return base_class::extract_at( refHead, dest, key, cmp );
+ return base_class::extract_at( refHead, guard, key, cmp );
}
template <typename Q, typename Func>
}
template <typename Q, typename Compare>
- bool get_at( head_type& refHead, typename gc::Guard& guard, Q const& key, Compare cmp )
+ bool get_at( head_type& refHead, typename guarded_ptr::native_guard& guard, Q const& key, Compare cmp )
{
return base_class::get_at( refHead, guard, key, cmp );
}
typedef typename traits::item_counter item_counter ; ///< Item counting policy used
typedef typename traits::memory_model memory_model; ///< C++ memory ordering (see \p lazy_list::traits::memory_model)
- typedef cds::gc::guarded_ptr< gc, value_type > guarded_ptr; ///< Guarded pointer
+ typedef typename gc::template guarded_ptr< value_type > guarded_ptr; ///< Guarded pointer
//@cond
// Rebind traits (split-list support)
/// Extracts the item from the list with specified \p key
/** \anchor cds_intrusive_LazyList_hp_extract
The function searches an item with key equal to \p key,
- unlinks it from the list, and returns it in \p dest parameter.
- If the item with key equal to \p key is not found the function returns \p false.
+ unlinks it from the list, and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
Note the compare functor should accept a parameter of type \p Q that can be not the same as \p value_type.
The \ref disposer specified in \p Traits class template parameter is called automatically
- by garbage collector \p GC specified in class' template parameters when returned \ref guarded_ptr object
+ by garbage collector \p GC specified in class' template parameters when returned \p guarded_ptr object
will be destroyed or released.
@note Each \p guarded_ptr object uses the GC's guard that can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- theList.extract( gp, 5 );
+ ord_list::guarded_ptr gp( theList.extract( 5 ));
// Deal with gp
// ...
\endcode
*/
template <typename Q>
- bool extract( guarded_ptr& dest, Q const& key )
+ guarded_ptr extract( Q const& key )
{
- return extract_at( &m_Head, dest.guard(), key, key_comparator() );
+ guarded_ptr gp;
+ extract_at( &m_Head, gp.guard(), key, key_comparator() );
+ return gp;
}
/// Extracts the item from the list with comparing functor \p pred
/**
- The function is an analog of \ref cds_intrusive_LazyList_hp_extract "extract(guarded_ptr&, Q const&)"
+ The function is an analog of \ref cds_intrusive_LazyList_hp_extract "extract(Q const&)"
but \p pred predicate is used for key comparing.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool extract_with( guarded_ptr& dest, Q const& key, Less pred )
+ guarded_ptr extract_with( Q const& key, Less pred )
{
- return extract_at( &m_Head, dest.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ guarded_ptr gp;
+ extract_at( &m_Head, gp.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ return gp;
}
/// Finds the key \p key
/// Finds \p key and return the item found
/** \anchor cds_intrusive_LazyList_hp_get
The function searches the item with key equal to \p key
- and assigns the item found to guarded pointer \p ptr.
- The function returns \p true if \p key is found, and \p false otherwise.
- If \p key is not found the \p ptr parameter is not changed.
+ and returns an guarded pointer to it.
+ If \p key is not found the function returns an empty guarded pointer.
The \ref disposer specified in \p Traits class template parameter is called
- by garbage collector \p GC automatically when returned \ref guarded_ptr object
+ by garbage collector \p GC automatically when returned \p guarded_ptr object
will be destroyed or released.
@note Each \p guarded_ptr object uses one GC's guard which can be limited resource.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- if ( theList.get( gp, 5 )) {
+ ord_list::guarded_ptr gp(theList.get( 5 ));
+ if ( gp ) {
// Deal with gp
//...
}
should accept a parameter of type \p Q that can be not the same as \p value_type.
*/
template <typename Q>
- bool get( guarded_ptr& ptr, Q const& key )
+ guarded_ptr get( Q const& key )
{
- return get_at( &m_Head, ptr.guard(), key, key_comparator() );
+ guarded_ptr gp;
+ get_at( &m_Head, gp.guard(), key, key_comparator() );
+ return gp;
}
/// Finds \p key and return the item found
/**
- The function is an analog of \ref cds_intrusive_LazyList_hp_get "get( guarded_ptr& ptr, Q const&)"
+ The function is an analog of \ref cds_intrusive_LazyList_hp_get "get( Q const&)"
but \p pred is used for comparing the keys.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool get_with( guarded_ptr& ptr, Q const& key, Less pred )
+ guarded_ptr get_with( Q const& key, Less pred )
{
- return get_at( &m_Head, ptr.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ guarded_ptr gp;
+ get_at( &m_Head, gp.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ return gp;
}
/// Clears the list
}
template <typename Q, typename Compare>
- bool extract_at( node_type * pHead, typename gc::Guard& gp, const Q& val, Compare cmp )
+ bool extract_at( node_type * pHead, typename guarded_ptr::native_guard& gp, const Q& val, Compare cmp )
{
position pos;
if ( erase_at( pHead, val, cmp, [](value_type const &){}, pos )) {
- gp.assign( pos.guards.template get<value_type>(position::guard_current_item) );
+ gp.set( pos.guards.template get<value_type>(position::guard_current_item) );
return true;
}
return false;
}
template <typename Q, typename Compare>
- bool get_at( node_type * pHead, typename gc::Guard& gp, Q const& val, Compare cmp )
+ bool get_at( node_type * pHead, typename guarded_ptr::native_guard& gp, Q const& val, Compare cmp )
{
position pos;
&& !pos.pCur->is_marked()
&& cmp( *node_traits::to_value_ptr( *pos.pCur ), val ) == 0 )
{
- gp.assign( pos.guards.template get<value_type>( position::guard_current_item ));
+ gp.set( pos.guards.template get<value_type>( position::guard_current_item ));
return true;
}
return false;
typedef typename traits::item_counter item_counter; ///< Item counting policy used
typedef typename traits::memory_model memory_model; ///< Memory ordering. See cds::opt::memory_model option
- typedef cds::gc::guarded_ptr< gc, value_type > guarded_ptr; ///< Guarded pointer
+ typedef typename gc::template guarded_ptr< value_type > guarded_ptr; ///< Guarded pointer
//@cond
// Rebind traits (split-list support)
/// Extracts the item from the list with specified \p key
/** \anchor cds_intrusive_MichaelList_hp_extract
The function searches an item with key equal to \p key,
- unlinks it from the list, and returns it in \p dest parameter.
- If the item with key equal to \p key is not found the function returns \p false.
+ unlinks it from the list, and returns it as \p guarded_ptr.
+ If \p key is not found returns an empty guarded pointer.
Note the compare functor should accept a parameter of type \p Q that can be not the same as \p value_type.
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- theList.extract( gp, 5 );
- // Deal with gp
- // ...
-
+ ord_list::guarded_ptr gp(theList.extract( 5 ));
+ if ( gp ) {
+ // Deal with gp
+ // ...
+ }
// Destructor of gp releases internal HP guard
}
\endcode
*/
template <typename Q>
- bool extract( guarded_ptr& dest, Q const& key )
+ guarded_ptr extract( Q const& key )
{
- return extract_at( m_pHead, dest.guard(), key, key_comparator() );
+ guarded_ptr gp;
+ extract_at( m_pHead, gp.guard(), key, key_comparator() );
+ return gp;
}
/// Extracts the item using compare functor \p pred
/**
- The function is an analog of \ref cds_intrusive_MichaelList_hp_extract "extract(guarded_ptr&, Q const&)"
+ The function is an analog of \ref cds_intrusive_MichaelList_hp_extract "extract(Q const&)"
but \p pred predicate is used for key comparing.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool extract_with( guarded_ptr& dest, Q const& key, Less pred )
+ guarded_ptr extract_with( Q const& key, Less pred )
{
- return extract_at( m_pHead, dest.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ guarded_ptr gp;
+ extract_at( m_pHead, gp.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ return gp;
}
/// Finds \p key in the list
/// Finds the \p key and return the item found
/** \anchor cds_intrusive_MichaelList_hp_get
The function searches the item with key equal to \p key
- and assigns the item found to guarded pointer \p ptr.
- The function returns \p true if \p key is found, and \p false otherwise.
- If \p key is not found the \p ptr parameter is not changed.
+ and returns it as \p guarded_ptr.
+ If \p key is not found the function returns an empty guarded pointer.
The \ref disposer specified in \p Traits class template parameter is called
by garbage collector \p GC automatically when returned \ref guarded_ptr object
ord_list theList;
// ...
{
- ord_list::guarded_ptr gp;
- if ( theList.get( gp, 5 )) {
+ ord_list::guarded_ptr gp(theList.get( 5 ));
+ if ( gp ) {
// Deal with gp
//...
}
should accept a parameter of type \p Q that can be not the same as \p value_type.
*/
template <typename Q>
- bool get( guarded_ptr& ptr, Q const& key )
+ guarded_ptr get( Q const& key )
{
- return get_at( m_pHead, ptr.guard(), key, key_comparator() );
+ guarded_ptr gp;
+ get_at( m_pHead, gp.guard(), key, key_comparator() );
+ return gp;
}
/// Finds the \p key and return the item found
/**
- The function is an analog of \ref cds_intrusive_MichaelList_hp_get "get( guarded_ptr& ptr, Q const&)"
+ The function is an analog of \ref cds_intrusive_MichaelList_hp_get "get( Q const&)"
but \p pred is used for comparing the keys.
\p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
\p pred must imply the same element order as the comparator used for building the list.
*/
template <typename Q, typename Less>
- bool get_with( guarded_ptr& ptr, Q const& key, Less pred )
+ guarded_ptr get_with( Q const& key, Less pred )
{
- return get_at( m_pHead, ptr.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ guarded_ptr gp;
+ get_at( m_pHead, gp.guard(), key, cds::opt::details::make_comparator_from_less<Less>() );
+ return gp;
}
/// Clears the list
}
template <typename Q, typename Compare>
- bool extract_at( atomic_node_ptr& refHead, typename gc::Guard& dest, Q const& val, Compare cmp )
+ bool extract_at( atomic_node_ptr& refHead, typename guarded_ptr::native_guard& dest, Q const& val, Compare cmp )
{
position pos;
back_off bkoff;
while ( search( refHead, val, pos, cmp )) {
if ( unlink_node( pos ) ) {
- dest.assign( pos.guards.template get<value_type>( position::guard_current_item ) );
+ dest.set( pos.guards.template get<value_type>( position::guard_current_item ) );
--m_ItemCounter;
return true;
}
}
template <typename Q, typename Compare>
- bool get_at( atomic_node_ptr& refHead, typename gc::Guard& guard, Q const& val, Compare cmp )
+ bool get_at( atomic_node_ptr& refHead, typename guarded_ptr::native_guard& guard, Q const& val, Compare cmp )
{
position pos;
if ( search( refHead, val, pos, cmp )) {
- guard.assign( pos.guards.template get<value_type>( position::guard_current_item ));
+ guard.set( pos.guards.template get<value_type>( position::guard_current_item ));
return true;
}
return false;
static int const nLimit = 20;
typename OrdList::value_type arrItem[nLimit];
-
{
int a[nLimit];
for (int i = 0; i < nLimit; ++i)
CPPUNIT_ASSERT( l.insert( arrItem[i] ) );
for ( int i=0; i < nLimit; ++i ) {
- CPPUNIT_ASSERT( l.get( gp, arrItem[i].nKey ));
+ gp = l.get( arrItem[i].nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( l.extract( gp, arrItem[i].nKey ));
+ gp = l.extract( arrItem[i].nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( !l.get( gp, arrItem[i].nKey ));
+ gp = l.get( arrItem[i].nKey );
+ CPPUNIT_ASSERT( !gp );
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract( gp, arrItem[i].nKey ));
+ CPPUNIT_ASSERT( !l.extract( arrItem[i].nKey ));
CPPUNIT_ASSERT( gp.empty());
}
CPPUNIT_ASSERT( l.empty() );
- CPPUNIT_ASSERT( !l.get( gp, nLimit/2 ));
- CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract( gp, nLimit/2 ));
- CPPUNIT_ASSERT( gp.empty());
+ CPPUNIT_ASSERT( !l.get( nLimit/2 ));
+ CPPUNIT_ASSERT( !l.extract( nLimit/2 ));
// Apply retired pointer
OrdList::gc::force_dispose();
for ( int i=0; i < nLimit; ++i ) {
other_item itm( arrItem[i].nKey );
- CPPUNIT_ASSERT( l.get_with( gp, itm, other_less() ));
+ gp = l.get_with( itm, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( l.extract_with( gp, itm, other_less() ));
+ gp = l.extract_with( itm, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( !l.get_with( gp, itm, other_less() ));
+ gp = l.get_with( itm, other_less() );
+ CPPUNIT_ASSERT( !gp );
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract_with( gp, itm, other_less() ));
+ CPPUNIT_ASSERT( !l.extract_with( itm, other_less() ));
CPPUNIT_ASSERT( gp.empty());
}
CPPUNIT_ASSERT( l.empty() );
- CPPUNIT_ASSERT( !l.get_with( gp, other_item(nLimit/2), other_less() ));
+ CPPUNIT_ASSERT( !l.get_with( other_item(nLimit/2), other_less() ));
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract_with( gp, other_item(nLimit/2), other_less() ));
+ CPPUNIT_ASSERT( !l.extract_with( other_item(nLimit/2), other_less() ));
CPPUNIT_ASSERT( gp.empty());
// Apply retired pointer
static int const nLimit = 20;
typename OrdList::value_type arrItem[nLimit];
-
{
int a[nLimit];
for (int i = 0; i < nLimit; ++i)
CPPUNIT_ASSERT( l.insert( arrItem[i] ) );
for ( int i=0; i < nLimit; ++i ) {
- CPPUNIT_ASSERT( l.get( gp, arrItem[i].nKey ));
+ gp = l.get( arrItem[i].nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( l.extract( gp, arrItem[i].nKey ));
+ gp = l.extract( arrItem[i].nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( !l.get( gp, arrItem[i].nKey ));
+ gp = l.get( arrItem[i].nKey );
+ CPPUNIT_ASSERT( !gp );
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract( gp, arrItem[i].nKey ));
+ CPPUNIT_ASSERT( !l.extract( arrItem[i].nKey ));
CPPUNIT_ASSERT( gp.empty());
}
CPPUNIT_ASSERT( l.empty() );
- CPPUNIT_ASSERT( !l.get( gp, nLimit/2 ));
+ CPPUNIT_ASSERT( !l.get( nLimit/2 ));
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract( gp, nLimit/2 ));
+ CPPUNIT_ASSERT( !l.extract( nLimit/2 ));
CPPUNIT_ASSERT( gp.empty());
// Apply retired pointer
for ( int i=0; i < nLimit; ++i ) {
other_item itm( arrItem[i].nKey );
- CPPUNIT_ASSERT( l.get_with( gp, itm, other_less() ));
+ gp = l.get_with( itm, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( l.extract_with( gp, itm, other_less() ));
+ gp = l.extract_with( itm, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
- gp.release();
- CPPUNIT_ASSERT( !l.get_with( gp, itm, other_less() ));
+ gp = l.get_with( itm, other_less() );
+ CPPUNIT_ASSERT( !gp );
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract_with( gp, itm, other_less() ));
+ CPPUNIT_ASSERT( !l.extract_with( itm, other_less() ));
CPPUNIT_ASSERT( gp.empty());
}
CPPUNIT_ASSERT( l.empty() );
- CPPUNIT_ASSERT( !l.get_with( gp, other_item(nLimit/2), other_less() ));
+ CPPUNIT_ASSERT( !l.get_with( other_item(nLimit/2), other_less() ));
CPPUNIT_ASSERT( gp.empty());
- CPPUNIT_ASSERT( !l.extract_with( gp, other_item(nLimit/2), other_less() ));
+ CPPUNIT_ASSERT( !l.extract_with( other_item(nLimit/2), other_less() ));
CPPUNIT_ASSERT( gp.empty());
// Apply retired pointer
for ( int i = 0; i < nLimit; ++i ) {
int nKey = arr[i];
- CPPUNIT_ASSERT( l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract(gp, nKey));
+ gp = l.extract( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, nKey));
+ CPPUNIT_CHECK( !l.extract( nKey));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get(gp, arr[0]));
+ CPPUNIT_CHECK( !l.get(arr[0]));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, arr[0]));
+ CPPUNIT_CHECK( !l.extract( arr[0]));
CPPUNIT_CHECK( gp.empty());
}
int nKey = arr[i];
other_item key( nKey );
- CPPUNIT_ASSERT( l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract_with(gp, key, other_less()));
+ gp = l.extract_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, key, other_less()));
+ CPPUNIT_CHECK( !l.extract_with( key, other_less()));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get_with(gp, other_item(arr[0]), other_less()));
+ CPPUNIT_CHECK( !l.get_with(other_item(arr[0]), other_less()));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, other_item(arr[0]), other_less()));
+ CPPUNIT_CHECK( !l.extract_with( other_item(arr[0]), other_less()));
CPPUNIT_CHECK( gp.empty());
}
for ( int i = 0; i < nLimit; ++i ) {
int nKey = arr[i];
- CPPUNIT_ASSERT( l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract(gp, nKey));
+ gp = l.extract( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, nKey));
+ CPPUNIT_CHECK( !l.extract( nKey));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get(gp, arr[0]));
+ CPPUNIT_CHECK( !l.get(arr[0]));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, arr[0]));
+ CPPUNIT_CHECK( !l.extract( arr[0]));
CPPUNIT_CHECK( gp.empty());
}
int nKey = arr[i];
other_key key = float(nKey + 0.3);
- CPPUNIT_ASSERT( l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract_with(gp, key, other_less()));
+ gp = l.extract_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, key, other_less()));
+ CPPUNIT_CHECK( !l.extract_with( key, other_less()));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get_with(gp, 3.4f, other_less()));
+ CPPUNIT_CHECK( !l.get_with(3.4f, other_less()));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, 3.4f, other_less()));
+ CPPUNIT_CHECK( !l.extract_with( 3.4f, other_less()));
CPPUNIT_CHECK( gp.empty());
}
}
for ( int i = 0; i < nLimit; ++i ) {
int nKey = arr[i];
- CPPUNIT_ASSERT( l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract(gp, nKey));
+ gp = l.extract( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, nKey));
+ CPPUNIT_CHECK( !l.extract( nKey));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get(gp, arr[0]));
+ CPPUNIT_CHECK( !l.get(arr[0]));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, arr[0]));
+ CPPUNIT_CHECK( !l.extract( arr[0]));
CPPUNIT_CHECK( gp.empty());
}
int nKey = arr[i];
other_item key( nKey );
- CPPUNIT_ASSERT( l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract_with(gp, key, other_less()));
+ gp = l.extract_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->nKey == nKey );
CPPUNIT_CHECK( gp->nVal == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, key, other_less()));
+ CPPUNIT_CHECK( !l.extract_with( key, other_less()));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get_with(gp, other_item(arr[0]), other_less()));
+ CPPUNIT_CHECK( !l.get_with(other_item(arr[0]), other_less()));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, other_item(arr[0]), other_less()));
+ CPPUNIT_CHECK( !l.extract_with( other_item(arr[0]), other_less()));
CPPUNIT_CHECK( gp.empty());
}
}
for ( int i = 0; i < nLimit; ++i ) {
int nKey = arr[i];
- CPPUNIT_ASSERT( l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract(gp, nKey));
+ gp = l.extract( nKey );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get(gp, nKey));
+ gp = l.get( nKey );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, nKey));
+ CPPUNIT_CHECK( !l.extract( nKey));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get(gp, arr[0]));
+ CPPUNIT_CHECK( !l.get(arr[0]));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract( gp, arr[0]));
+ CPPUNIT_CHECK( !l.extract( arr[0]));
CPPUNIT_CHECK( gp.empty());
}
int nKey = arr[i];
other_key key = float(nKey + 0.3);
- CPPUNIT_ASSERT( l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
- CPPUNIT_ASSERT( l.extract_with(gp, key, other_less()));
+ gp = l.extract_with( key, other_less() );
+ CPPUNIT_ASSERT( gp );
CPPUNIT_ASSERT( !gp.empty());
CPPUNIT_CHECK( gp->first == nKey );
CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
- gp.release();
- CPPUNIT_CHECK( !l.get_with(gp, key, other_less()));
+ gp = l.get_with( key, other_less() );
+ CPPUNIT_CHECK( !gp );
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, key, other_less()));
+ CPPUNIT_CHECK( !l.extract_with( key, other_less()));
CPPUNIT_CHECK( gp.empty());
}
CPPUNIT_ASSERT( l.empty());
- CPPUNIT_CHECK( !l.get_with(gp, 3.4f, other_less()));
+ CPPUNIT_CHECK( !l.get_with( 3.4f, other_less()));
CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !l.extract_with( gp, 3.4f, other_less()));
+ CPPUNIT_CHECK( !l.extract_with( 3.4f, other_less()));
CPPUNIT_CHECK( gp.empty());
}
}
projects / libcds.git / commitdiff