tlds
Transactional Operations for Linked Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
edge Struct Reference

#include <edge.hpp>

Collaboration diagram for edge:

Public Member Functions

TRANSACTION_PURE void print (const char *prefix="") const
 
TRANSACTION_SAFE int index_of (const point *p)
 
TRANSACTION_SAFE bool reconsider (const int seam, bool txnal, edge **surrounding_edges)
 
TRANSACTION_SAFE edge (point *a, point *b, edge *ea, edge *eb, int dir)
 
TRANSACTION_SAFE void destroy ()
 
 ~edge ()
 

Public Attributes

pointpoints [2]
 
edgeneighbors [2][2]
 
bool deleted
 
ULONGINT_T startVertex
 
ULONGINT_T endVertex
 
ULONGINT_T edgeNum
 

Private Member Functions

TRANSACTION_SAFE void initialize_end (point *p, edge *e, int end, int dir)
 

Constructor & Destructor Documentation

edge::edge ( point a,
point b,
edge ea,
edge eb,
int  dir 
)

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

Here is the call graph for this function:

Here is the caller graph for this function:

edge::~edge ( )
inline

Member Function Documentation

void edge::destroy ( )

Here is the call graph for this function:

Here is the caller graph for this function:

TRANSACTION_SAFE int edge::index_of ( const point p)
inline

Here is the caller graph for this function:

TRANSACTION_SAFE void edge::initialize_end ( point p,
edge e,
int  end,
int  dir 
)
inlineprivate

Here is the call graph for this function:

Here is the caller graph for this function:

TRANSACTION_PURE void edge::print ( const char *  prefix = "") const
inline

Here is the caller graph for this function:

bool edge::reconsider ( const int  seam,
bool  txnal,
edge **  surrounding_edges 
)

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

bool edge::deleted
ULONGINT_T edge::edgeNum
ULONGINT_T edge::endVertex
edge* edge::neighbors[2][2]
point* edge::points[2]
ULONGINT_T edge::startVertex

The documentation for this struct was generated from the following files: