dlNode Struct Reference

#include <dlist.h>

Collaboration diagram for dlNode:

[legend]

Data Fields
dlNode *	next
dlNode *	prev
void *	val

---

Detailed Description

Definition at line 13 of file dlist.h.

---

Field Documentation

struct dlNode* dlNode::next [read]

Definition at line 16 of file dlist.h.

Referenced by boxFindClumps(), checkComplete(), clearHits(), clusterEncompassedBefore(), clusterRemoveEncompassed(), contigEncompassedBefore(), contigRemoveEncompassed(), dgConstrainedPriorityOrder(), dgRemoveFromConList(), dlAddAfter(), dlAddTail(), dlGetAfterTail(), dlInsertBetween(), dlListReset(), dlPopHead(), dlRemove(), dlSort(), dlValInList(), finishContigs(), freeContigList(), freeDlListAndVals(), medianVal(), mergeContigs(), mergeIntoAdjacentClusters(), mergeWithinCluster(), and splitList().

struct dlNode* dlNode::prev [read]

Definition at line 17 of file dlist.h.

Referenced by dlAddBefore(), dlAddHead(), dlGetBeforeHead(), dlInsertBetween(), dlListToSlList(), dlPopTail(), and dlRemove().

void* dlNode::val

Definition at line 18 of file dlist.h.

Referenced by bfGraphFromRangeGraph(), boxFindClumps(), checkComplete(), clearHits(), clusterEncompassedBefore(), clusterRemoveEncompassed(), contigEncompassedBefore(), contigRemoveEncompassed(), dgConnectWithVal(), dgConstrainedPriorityOrder(), dgDirectlyFollows(), dgDisconnect(), dgFindPath(), dgFindSubEdges(), dlAddValAfter(), dlAddValBefore(), dlAddValHead(), dlAddValTail(), dlListToSlList(), dlNodeCmp(), dlValInList(), finishContigs(), freeContigList(), freeDlListAndVals(), kdBuild(), kdTreeMake(), medianVal(), mergeContigs(), mergeIntoAdjacentClusters(), mergeWithinCluster(), splitList(), synQueueGet(), and synQueueGrab().

---

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

• inc/dlist.h

---