| tlds
    Transactional Operations for Linked Data Structures | 
#include <DList.hpp>
| Classes | |
| struct | Node | 
| Public Member Functions | |
| DList () | |
| TM_CALLABLE void | insert (int val TM_ARG) | 
| TM_CALLABLE bool | lookup (int val TM_ARG) const | 
| TM_CALLABLE void | remove (int val TM_ARG) | 
| bool | isSane () const | 
| TM_CALLABLE void | increment_forward (TM_ARG_ALONE) | 
| TM_CALLABLE void | increment_backward (TM_ARG_ALONE) | 
| TM_CALLABLE void | increment_forward_pattern (int start, int seq TM_ARG) | 
| TM_CALLABLE void | increment_backward_pattern (int start, int seq TM_ARG) | 
| TM_CALLABLE void | increment_chunk (int chunk_num, int chunk_size TM_ARG) | 
| Public Attributes | |
| Node * | head | 
| Node * | tail | 
Copyright (C) 2011 University of Rochester Department of Computer Science and Lehigh University Department of Computer Science and Engineering
License: Modified BSD Please see the file LICENSE.RSTM for licensing information
| DList::DList | ( | ) | 
| TM_CALLABLE void DList::increment_backward | ( | TM_ARG_ALONE | ) | 
| TM_CALLABLE void DList::increment_backward_pattern | ( | int | start, | 
| int seq | TM_ARG | ||
| ) | 
| TM_CALLABLE void DList::increment_chunk | ( | int | chunk_num, | 
| int chunk_size | TM_ARG | ||
| ) | 
| TM_CALLABLE void DList::increment_forward | ( | TM_ARG_ALONE | ) | 
| TM_CALLABLE void DList::increment_forward_pattern | ( | int | start, | 
| int seq | TM_ARG | ||
| ) | 
| TM_CALLABLE void DList::insert | ( | int val | TM_ARG | ) | 
| bool DList::isSane | ( | void | ) | const | 
| TM_CALLABLE bool DList::lookup | ( | int val | TM_ARG | ) | const | 
| TM_CALLABLE void DList::remove | ( | int val | TM_ARG | ) | 
| Node* DList::head | 
| Node* DList::tail |