|
IDZEBRA 2.2.8
|
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <idzebra/data1.h>#include <yaz/log.h>Go to the source code of this file.
Macros | |
| #define | MAX_TAG_SIZE 50 |
Functions | |
| char | data1_ScanNextToken (char *pBuffer, char **pPosInBuffer, char *pBreakChars, char *pWhitespaceChars, char *pTokenBuffer) |
| char * | data1_getNodeValue (data1_node *node, char *pTagPath) |
| data1_node * | data1_LookupNode (data1_node *node, char *pTagPath) |
| int | data1_CountOccurences (data1_node *node, char *pTagPath) |
| Count the number of occurences of the last instance on a tagpath. | |
| int data1_CountOccurences | ( | data1_node * | node, |
| char * | pTagPath | ||
| ) |
Count the number of occurences of the last instance on a tagpath.
| node | : The root of the tree we wish to look for occurences in |
| pTagPath | : The tagpath we want to count the occurences of... |
Definition at line 253 of file d1_if.c.
References data1_node::child, data1_LookupNode(), DATA1N_tag, data1_node::next, data1_node::parent, data1_node::tag, data1_node::u, and data1_node::which.
| char * data1_getNodeValue | ( | data1_node * | node, |
| char * | pTagPath | ||
| ) |
Definition at line 75 of file d1_if.c.
References data1_node::child, data1_node::data, data1_LookupNode(), DATA1N_data, data1_node::u, and data1_node::which.
| data1_node * data1_LookupNode | ( | data1_node * | node, |
| char * | pTagPath | ||
| ) |
Definition at line 115 of file d1_if.c.
References data1_node::child, data1_LookupNode(), data1_ScanNextToken(), DATA1N_tag, MAX_TAG_SIZE, data1_node::next, data1_node::tag, data1_node::u, and data1_node::which.
Referenced by data1_CountOccurences(), data1_getNodeValue(), and data1_LookupNode().
| char data1_ScanNextToken | ( | char * | pBuffer, |
| char ** | pPosInBuffer, | ||
| char * | pBreakChars, | ||
| char * | pWhitespaceChars, | ||
| char * | pTokenBuffer | ||
| ) |
Definition at line 39 of file d1_if.c.
Referenced by data1_LookupNode().