53 bool remove(
int val
TM_ARG);
84 while (curr != NULL) {
99 while (curr != NULL) {
117 while (curr != NULL) {
126 Node* insert_point =
const_cast<Node*
>(prev);
148 while (curr != NULL) {
154 found = ((curr != NULL) && (
TM_READ(curr->
m_val) == val));
164 while (curr != NULL) {
191 while (curr != NULL) {
194 Node* mod_point =
const_cast<Node*
>(prev);
198 TM_FREE(const_cast<Node*>(curr));
221 while (curr != NULL) {
224 Node* wcurr =
const_cast<Node*
>(curr);
Node * sentinel
Definition: rstmlist.hpp:39
#define TM_CALLABLE
Definition: cxxtm.hpp:32
#define TM_ARG_ALONE
Definition: cxxtm.hpp:41
#define TM_WRITE(x, y)
Definition: cxxtm.hpp:46
Node * m_next
Definition: rstmlist.hpp:29
TM_CALLABLE bool remove(int val TM_ARG)
Definition: rstmlist.hpp:185
bool isSane() const
Definition: rstmlist.hpp:79
TM_CALLABLE int findmin(TM_ARG_ALONE) const
Definition: rstmlist.hpp:173
#define TM_ARG
Definition: cxxtm.hpp:40
Definition: rstmlist.hpp:22
#define TM_READ(x)
Definition: cxxtm.hpp:45
TM_CALLABLE bool lookup(int val TM_ARG) const
Definition: rstmlist.hpp:142
TM_CALLABLE int findmax(TM_ARG_ALONE) const
Definition: rstmlist.hpp:160
Node(int val=-1)
Definition: rstmlist.hpp:32
bool(* verifier)(uint32_t, uint32_t)
Definition: rstmlist.hpp:19
bool ret
Definition: stmskip.cc:242
#define TM_ALLOC
Definition: library.hpp:294
int m_val
Definition: rstmlist.hpp:28
bool extendedSanityCheck(verifier v, uint32_t param) const
Definition: rstmlist.hpp:95
Definition: rstmlist.hpp:26
TM_CALLABLE bool insert(int val TM_ARG)
Definition: rstmlist.hpp:111
RSTMList()
Definition: rstmlist.hpp:76
TM_CALLABLE void overwrite(int val TM_ARG)
Definition: rstmlist.hpp:216
Node(int val, Node *next)
Definition: rstmlist.hpp:34
#define TM_FREE
Definition: library.hpp:295