w_ascend_list_t< T, LOCK, K > Class Template Reference

Inherits w_keyed_list_t< T, LOCK, K >< T, LOCK, K >.

Inheritance diagram for w_ascend_list_t< T, LOCK, K >:

[legend]Collaboration diagram for w_ascend_list_t< T, LOCK, K >:

[legend]List of all members.

---

Detailed Description

template<class T, class LOCK, class K>
class w_ascend_list_t< T, LOCK, K >

List maintained in ascending order.

T is the type of the objects in the list. K is the type of the key used for sorting. This type must have an operator <=.

Definition at line 588 of file w_list.h.

Public Member Functions
NORET	w_ascend_list_t (w_base_t::uint4_t key_offset, w_base_t::uint4_t link_offset, LOCK *lock)
NORET	~w_ascend_list_t ()
virtual T *	search (const K &k)
virtual void	put_in_order (T *t)

---

Member Function Documentation

template<class T, class LOCK, class K>

void w_ascend_list_t< T, LOCK, K >::put_in_order

(

T *

t

)

[virtual]

For ordered lists, this uses the ordering. For unordered lists (simply w_list_t<T,LOCK>), it just inserts.

Reimplemented from w_list_t< T, LOCK >.

Definition at line 716 of file w_list.h.

References w_list_base_t::_tail, w_link_t::attach(), w_list_t< T, LOCK >::base_of(), w_keyed_list_t< T, LOCK, K >::key_of(), w_list_t< T, LOCK >::link_of(), w_link_t::next(), and w_link_t::prev().

Here is the call graph for this function:

---

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

• src/fc/w_list.h

---