A queue of line segment nodes together with a table for accessing them by coordinate value. The slots of the hash table are allocated at creation of the queue and the queue/table entries are allocated in blocks. More...

Data Fields
int	nSlt

struct _WlzLSNod *	top

struct _WlzLSNod **	tbl

struct _WlzLSNod *	freeQ

size_t	blkSz

struct _AlcBlockStack *	freeStack

Detailed Description

A queue of line segment nodes together with a table for accessing them by coordinate value. The slots of the hash table are allocated at creation of the queue and the queue/table entries are allocated in blocks.

Field Documentation

◆ nSlt

int _WlzLSNodQueue::nSlt

Number of hash table slots. Must not be changed once allocated.

◆ top

struct _WlzLSNod* _WlzLSNodQueue::top

Top node in the queue with circular doubly linked nodes. Lowest cost nodes are at the top of the queue.

◆ tbl

struct _WlzLSNod** _WlzLSNodQueue::tbl

Node hash table with singly linked nodes in slots and slots indexed by position based hash key.

◆ freeQ

struct _WlzLSNod* _WlzLSNodQueue::freeQ

Singly linked list of available allocated nodes.

◆ blkSz

size_t _WlzLSNodQueue::blkSz

Number of nodes to allocate in a block.

◆ freeStack

struct _AlcBlockStack* _WlzLSNodQueue::freeStack

Free stack used to efficiently allocate and free blocks of nodes.

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

/export/data0/bill/MouseAtlas/Build/src/Woolz/libWlz/WlzLineSkeleton.c

Data Fields