Go to the SVN repository for this file.
105 if(newnode !=
NULL)
107newnode->
choice= choice;
131 if(newnode !=
NULL)
133newnode->
choice= choice;
Definitions used throughout BLAST.
#define sfree(x)
Safe free a pointer: belongs to a higher level header.
static DLIST_TYPE *DLIST_NAME() next(DLIST_LIST_TYPE *list, DLIST_TYPE *item)
static const char * str(char *buf, int n)
uint8_t Uint1
1-byte (8-bit) unsigned integer
where boath are integers</td > n< td ></td > n</tr > n< tr > n< td > tse</td > n< td > optional</td > n< td > String</td > n< td class=\"description\"> TSE option controls what blob is orig
const struct ncbi::grid::netcache::search::fields::SIZE size
const GenericPointer< typename T::ValueType > T2 value
ListNode * ListNodeNew(ListNode *vnp)
Create a new list node.
ListNode * ListNodeCopyStr(ListNode **head, Uint1 choice, const char *str)
Add a node to the list with a provided choice, and attached data pointing to a provided string.
ListNode * ListNodeAdd(ListNode **head)
Add a node to the list.
void * BlastMemDup(const void *orig, size_t size)
Copies memory using memcpy and malloc.
ListNode * ListNodeAddPointer(ListNode **head, Uint1 choice, void *value)
Add a node to the list with a given choice and data pointer.
ListNode * ListNodeFreeData(ListNode *vnp)
Free nodes as well as data (vnp->ptr) assuming it is one contiguous chunk.
ListNode * ListNodeFree(ListNode *vnp)
Free all list's nodes, does not attempt to free data.
Type and macro definitions from C toolkit that are not defined in C++ toolkit.
void copy(Njn::Matrix< S > *matrix_, const Njn::Matrix< T > &matrix0_)
A generic linked list node structure.
struct ListNode * next
next in linked list
Uint1 choice
to pick a choice
voidp calloc(uInt items, uInt size)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4