tlds
Transactional Operations for Linked Data Structures
|
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "element.h"
#include "list.h"
#include "map.h"
#include "mesh.h"
#include "queue.h"
#include "random.h"
#include "set.h"
#include "tm.h"
#include "types.h"
#include "utility.h"
Classes | |
struct | mesh |
Functions | |
mesh_t * | mesh_alloc () |
void | mesh_free (mesh_t *meshPtr) |
void | mesh_insert (mesh_t *meshPtr, element_t *elementPtr, MAP_T *edgeMapPtr) |
void | TMmesh_insert (TM_ARGDECL mesh_t *meshPtr, element_t *elementPtr, MAP_T *edgeMapPtr) |
void | TMmesh_remove (TM_ARGDECL mesh_t *meshPtr, element_t *elementPtr) |
bool_t | TMmesh_insertBoundary (TM_ARGDECL mesh_t *meshPtr, edge_t *boundaryPtr) |
bool_t | TMmesh_removeBoundary (TM_ARGDECL mesh_t *meshPtr, edge_t *boundaryPtr) |
static void | createElement (mesh_t *meshPtr, coordinate_t *coordinates, long numCoordinate, MAP_T *edgeMapPtr) |
long | mesh_read (mesh_t *meshPtr, char *fileNamePrefix) |
element_t * | mesh_getBad (mesh_t *meshPtr) |
void | mesh_shuffleBad (mesh_t *meshPtr, random_t *randomPtr) |
bool_t | mesh_check (mesh_t *meshPtr, long expectedNumElement) |
Variables | |
comparator_t mesh_listcompareedge & | element_listCompareEdge |
|
static |
mesh_t* mesh_alloc | ( | ) |
void mesh_free | ( | mesh_t * | meshPtr | ) |
long mesh_read | ( | mesh_t * | meshPtr, |
char * | fileNamePrefix | ||
) |
void TMmesh_insert | ( | TM_ARGDECL mesh_t * | meshPtr, |
element_t * | elementPtr, | ||
MAP_T * | edgeMapPtr | ||
) |
bool_t TMmesh_insertBoundary | ( | TM_ARGDECL mesh_t * | meshPtr, |
edge_t * | boundaryPtr | ||
) |
void TMmesh_remove | ( | TM_ARGDECL mesh_t * | meshPtr, |
element_t * | elementPtr | ||
) |
bool_t TMmesh_removeBoundary | ( | TM_ARGDECL mesh_t * | meshPtr, |
edge_t * | boundaryPtr | ||
) |
comparator_t mesh_listcompareedge& element_listCompareEdge |