Lines Matching defs:tag
72 CSCbinTreeTagSearch - search a balanced binary tree for node with tag
84 CSCbinTreeNodeTagSearch - search a libcsc binary tree for a given tag
217 long tag;
305 long tag
337 if (cbFn != NULL) (void)(*cbFn) (node->tag, node->size, (void*)node->data);
483 long tag
492 if (tag < node->tag) tagNode = tagSearch (node->left, tag);
493 if (tag > node->tag) tagNode = tagSearch (node->right, tag);
494 if (tag == node->tag) tagNode = node;
552 (void)printf ("LEFT=%ld ",node->left->tag);
557 (void)printf ("RIGHT=%ld\n\n", node->right->tag);
729 (*cbFn) (tag, dataSize, dataPtr);
843 The client callback function `cmpfn' is called to compare the tag
845 the actual arguments are the addresses of the tag fields):
847 (*cmpfuncptr) ((void*)&node->tag, (void*)&P->tag);
856 The tag field of libcsc balanced binary tree nodes is a long, but its
943 switch ((*cmpfn)((void*)&(node->tag), (void*)&(P->tag)))
989 if ((*cmpfn)((void*)&(node->tag), (void*)&(S->tag)) == -1)
999 if ((*cmpfn)((void*)&(node->tag), (void*)&(P->tag)) == -1)
1005 if ((*cmpfn)((void*)&(node->tag), (void*)&(P->tag)) == +1)
1014 if ((*cmpfn)((void*)&(node->tag), (void*)&(S->tag)) == -1)
1142 The insertion order is strictly based upon the tag field values of node
1143 and the tag field values of the nodes in the libcsc balanced binary
1151 tag comparison function.
1429 CSCbinTreeTagSearch - search a balanced binary tree for node with tag
1436 long tag
1441 is a libcsc balanced binary tree node whose tag-field value is equal to
1442 `tag', or NULL if otherwise not successful.
1446 for a node with a tag-field that is equal to `tag'.
1474 long tag
1491 tempNode = tagSearch (tree->root, tag);
1646 node's tag field is printed for tracability.
1721 long tag,
1740 The new node's `tag' is used by client callback compare functions when
1779 long tag,
1805 newNode->tag = tag;
2401 CSCbinTreeNodeTagSearch - search a libcsc binary tree for a given tag
2408 long tag
2413 that is the node whose tag-field value is equal to tag, or NULL if
2418 children, for a node with a tag-field that is equal to `tag'.
2446 long tag
2463 tmpNode = tagSearch (node, tag);
2503 if `tagPtr' is not NULL, then the value of the tag field of `node' is
2560 if (tagPtr != NULL) *tagPtr = node->tag;
2593 balance, tag, and data size fields of node.
2638 printf (" tag: %ld\n", node->tag);