Chombo + EB + MF  3.2
Macros | Functions
KDTree.H File Reference
#include <string>
#include "KDStruct.H"
#include "REAL.H"
#include "NamespaceHeader.H"
#include "NamespaceFooter.H"
Include dependency graph for KDTree.H:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define _KDTREE_H_
 
#define USE_LIST_NODE_ALLOCATOR   1
 
#define RESTRICT   __restrict__
 

Functions

KDTreeKDCreate (int const k, int *ierr)
 
int KDFree (KDTree *tree)
 
int KDClear (KDTree *tree)
 
void KDSetGlobalData (KDTree *tree, void *data)
 
int KDSetGlobalDataDestructor (KDTree *tree, void(*destr)(void *))
 
void KDGetGlobalData (KDTree *tree, void **data)
 
int KDSetDataDestructor (KDTree *tree, void(*destr)(void *))
 
int KDInsert (KDTree *tree, Real const *pos, void *data)
 
int KDTreeStatistics (KDTree const *tree)
 
int KDTreePrint (KDTree const *tree)
 
int KDNodePrint (KDNode const *node, const string &prefix)
 
int KDSearch (KDTree const *tree, Real const *pos, int *foundFlag)
 
int KDExhaustiveSearch (KDTree const *tree, Real const *pos, int *numFound)
 
int KDNearestNeighbor (KDTree const *tree, Real const *const queryPoint, Real *resultPoint, void **resultData, Real *bestDistSquared, int const approx)
 
int KDBBoxSearch (KDTree const *tree, Real const *RESTRICT xbb, int *pnData, void ***resultData)
 
KDResultKDNearestRange (KDTree *kd, Real const *query, Real const range, int *ierr)
 
void KDResultFree (KDResult *set)
 
int KDResultSize (KDResult const *set)
 
void KDResultRewind (KDResult *set)
 
int KDResultEnd (KDResult const *set)
 
int KDResultNext (KDResult *set)
 
void * KDResultItem (KDResult const *set, Real *pos)
 
void * KDResultItemData (KDResult const *set)
 
int LListInsert (ListHead *head, void *data, Real const key, int const useListIter)
 
int LListInsertFirst (ListHead *head, void *data, Real const key)
 
ListHeadLListCreate (int const ordered, int *ierr)
 
void LListFree (ListHead *head)
 
int LListSize (ListHead const *head)
 
void LListRewind (ListHead *head)
 
int LListIterIsNull (ListHead const *head)
 
int LListAtLast (ListHead const *head)
 
int LListNext (ListHead *head)
 
void * LListItem (ListHead const *head)
 
Real LListKey (ListHead const *head)
 
void LListDataDestructor (ListHead *head, void(*destr)(void *))
 
void LListFinalize (void)
 
void KDTreeFinalize (void)
 
void * StackPop (ListHead *head, int *ierr)
 
int StackPush (ListHead *head, void *data)
 
void * StackPopWithKey (ListHead *head, Real *key, int *ierr)
 
int StackPushWithKey (ListHead *head, void *data, Real const key)
 
ListHeadStackCreate (int *ierr, int const prealloc)
 
void StackFree (ListHead *head)
 

Macro Definition Documentation

◆ _KDTREE_H_

#define _KDTREE_H_

◆ USE_LIST_NODE_ALLOCATOR

#define USE_LIST_NODE_ALLOCATOR   1

◆ RESTRICT

#define RESTRICT   __restrict__

Function Documentation

◆ KDCreate()

KDTree* KDCreate ( int const  k,
int *  ierr 
)

◆ KDFree()

int KDFree ( KDTree tree)

◆ KDClear()

int KDClear ( KDTree tree)

◆ KDSetGlobalData()

void KDSetGlobalData ( KDTree tree,
void *  data 
)

◆ KDSetGlobalDataDestructor()

int KDSetGlobalDataDestructor ( KDTree tree,
void(*)(void *)  destr 
)

◆ KDGetGlobalData()

void KDGetGlobalData ( KDTree tree,
void **  data 
)

◆ KDSetDataDestructor()

int KDSetDataDestructor ( KDTree tree,
void(*)(void *)  destr 
)

◆ KDInsert()

int KDInsert ( KDTree tree,
Real const *  pos,
void *  data 
)

◆ KDTreeStatistics()

int KDTreeStatistics ( KDTree const *  tree)

◆ KDTreePrint()

int KDTreePrint ( KDTree const *  tree)

◆ KDNodePrint()

int KDNodePrint ( KDNode const *  node,
const string &  prefix 
)

◆ KDSearch()

int KDSearch ( KDTree const *  tree,
Real const *  pos,
int *  foundFlag 
)

◆ KDExhaustiveSearch()

int KDExhaustiveSearch ( KDTree const *  tree,
Real const *  pos,
int *  numFound 
)

◆ KDNearestNeighbor()

int KDNearestNeighbor ( KDTree const *  tree,
Real const *const  queryPoint,
Real resultPoint,
void **  resultData,
Real bestDistSquared,
int const  approx 
)

◆ KDBBoxSearch()

int KDBBoxSearch ( KDTree const *  tree,
Real const *RESTRICT  xbb,
int *  pnData,
void ***  resultData 
)

◆ KDNearestRange()

KDResult* KDNearestRange ( KDTree kd,
Real const *  query,
Real const  range,
int *  ierr 
)

◆ KDResultFree()

void KDResultFree ( KDResult set)

◆ KDResultSize()

int KDResultSize ( KDResult const *  set)

◆ KDResultRewind()

void KDResultRewind ( KDResult set)

◆ KDResultEnd()

int KDResultEnd ( KDResult const *  set)

◆ KDResultNext()

int KDResultNext ( KDResult set)

◆ KDResultItem()

void* KDResultItem ( KDResult const *  set,
Real pos 
)

◆ KDResultItemData()

void* KDResultItemData ( KDResult const *  set)

◆ LListInsert()

int LListInsert ( ListHead head,
void *  data,
Real const  key,
int const  useListIter 
)

◆ LListInsertFirst()

int LListInsertFirst ( ListHead head,
void *  data,
Real const  key 
)

◆ LListCreate()

ListHead* LListCreate ( int const  ordered,
int *  ierr 
)

◆ LListFree()

void LListFree ( ListHead head)

◆ LListSize()

int LListSize ( ListHead const *  head)

◆ LListRewind()

void LListRewind ( ListHead head)

◆ LListIterIsNull()

int LListIterIsNull ( ListHead const *  head)

◆ LListAtLast()

int LListAtLast ( ListHead const *  head)

◆ LListNext()

int LListNext ( ListHead head)

◆ LListItem()

void* LListItem ( ListHead const *  head)

◆ LListKey()

Real LListKey ( ListHead const *  head)

◆ LListDataDestructor()

void LListDataDestructor ( ListHead head,
void(*)(void *)  destr 
)

◆ LListFinalize()

void LListFinalize ( void  )

◆ KDTreeFinalize()

void KDTreeFinalize ( void  )

◆ StackPop()

void* StackPop ( ListHead head,
int *  ierr 
)

◆ StackPush()

int StackPush ( ListHead head,
void *  data 
)

◆ StackPopWithKey()

void* StackPopWithKey ( ListHead head,
Real key,
int *  ierr 
)

◆ StackPushWithKey()

int StackPushWithKey ( ListHead head,
void *  data,
Real const  key 
)

◆ StackCreate()

ListHead* StackCreate ( int *  ierr,
int const  prealloc 
)

◆ StackFree()

void StackFree ( ListHead head)