Lines Matching defs:node
35 const char *value, mxml_node_t *node);
68 * 'mxmlIndexEnum()' - Return the next node in the index.
73 mxml_node_t * /* O - Next node or NULL if there is none */
84 * Return the next node...
95 * 'mxmlIndexFind()' - Find the next matching node.
156 * If cur_node == 0, then find the first matching node...
162 * Find the first node using a modified binary search algorithm...
252 * Return the next matching node...
305 * contain a sorted list of the elements in the node tree. Nodes are
311 mxmlIndexNew(mxml_node_t *node, /* I - XML node tree */
316 mxml_node_t *current, /* Current node in index */
317 **temp; /* Temporary node pointer array */
325 printf("mxmlIndexNew(node=%p, element=\"%s\", attr=\"%s\")\n",
326 node, element ? element : "(null)", attr ? attr : "(null)");
329 if (!node)
347 current = node;
349 current = mxmlFindElement(node, node, element, attr, NULL, MXML_DESCEND);
380 current = mxmlFindElement(current, node, element, attr, NULL, MXML_DESCEND);
392 printf("%d node(s) in index.\n\n", ind->num_nodes);
462 * return the first node in the index.
468 mxml_node_t * /* O - First node or NULL if there is none */
489 * Return the first node...
505 mxml_node_t *first, /* I - First node */
506 mxml_node_t *second) /* I - Second node */
539 * 'index_find()' - Compare a node with index values.
546 mxml_node_t *node) /* I - Node */
557 if ((diff = strcmp(element, node->value.element.name)) != 0)
567 if ((diff = strcmp(value, mxmlElementGetAttr(node, ind->attr))) != 0)
587 int left, /* I - Left node in partition */
588 int right) /* I - Right node in partition */
590 mxml_node_t *pivot, /* Pivot node */
591 *temp; /* Swap node */
592 int templ, /* Temporary left node */
593 tempr; /* Temporary right node */
611 * Move left while left node <= pivot node...
619 * Move right while right node > pivot node...
639 * When we get here, the right (tempr) node is the new position for the
640 * pivot node...