tlds
Transactional Operations for Linked Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
adtree.c File Reference
#include <assert.h>
#include <stdlib.h>
#include "adtree.h"
#include "data.h"
#include "query.h"
#include "utility.h"
#include "vector.h"
Include dependency graph for adtree.c:

Functions

adtree_node_tallocNode (long index)
 
void freeNode (adtree_node_t *nodePtr)
 
adtree_vary_tallocVary (long index)
 
void freeVary (adtree_vary_t *varyPtr)
 
adtree_tadtree_alloc ()
 
static void freeNodes (adtree_node_t *nodePtr)
 
void adtree_free (adtree_t *adtreePtr)
 
static adtree_vary_tmakeVary (long parentIndex, long index, long start, long numRecord, data_t *dataPtr)
 
static adtree_node_tmakeNode (long parentIndex, long index, long start, long numRecord, data_t *dataPtr)
 
void adtree_make (adtree_t *adtreePtr, data_t *dataPtr)
 
static long getCount (adtree_node_t *nodePtr, long i, long q, vector_t *queryVectorPtr, long lastQueryIndex, adtree_t *adtreePtr)
 
long adtree_getCount (adtree_t *adtreePtr, vector_t *queryVectorPtr)
 

Function Documentation

adtree_t* adtree_alloc ( )

Here is the caller graph for this function:

void adtree_free ( adtree_t adtreePtr)

Here is the call graph for this function:

Here is the caller graph for this function:

long adtree_getCount ( adtree_t adtreePtr,
vector_t queryVectorPtr 
)

Here is the call graph for this function:

Here is the caller graph for this function:

void adtree_make ( adtree_t adtreePtr,
data_t dataPtr 
)

Here is the call graph for this function:

Here is the caller graph for this function:

adtree_node_t* allocNode ( long  index)

Here is the call graph for this function:

Here is the caller graph for this function:

adtree_vary_t* allocVary ( long  index)

Here is the caller graph for this function:

void freeNode ( adtree_node_t nodePtr)

Here is the call graph for this function:

Here is the caller graph for this function:

static void freeNodes ( adtree_node_t nodePtr)
static

Here is the call graph for this function:

Here is the caller graph for this function:

void freeVary ( adtree_vary_t varyPtr)

Here is the caller graph for this function:

static long getCount ( adtree_node_t nodePtr,
long  i,
long  q,
vector_t queryVectorPtr,
long  lastQueryIndex,
adtree_t adtreePtr 
)
static

Here is the call graph for this function:

Here is the caller graph for this function:

static adtree_node_t * makeNode ( long  parentIndex,
long  index,
long  start,
long  numRecord,
data_t dataPtr 
)
static

Here is the call graph for this function:

Here is the caller graph for this function:

static adtree_vary_t * makeVary ( long  parentIndex,
long  index,
long  start,
long  numRecord,
data_t dataPtr 
)
static

Here is the call graph for this function:

Here is the caller graph for this function: