Lines Matching +refs:math +refs:max +refs:list
26 #include <math.h>
255 "?? Unknown error ??\n" /* Must be last in the list! */
401 * Pointer-list for various purposes.
411 * TODO: Since such a list-handling is used in xmlschemas.c and libxslt
415 xmlPointerListAddSize(xmlPointerListPtr list,
419 if (list->items == NULL) {
422 list->items = (void **) xmlMalloc(
424 if (list->items == NULL) {
429 list->number = 0;
430 list->size = initialSize;
431 } else if (list->size <= list->number) {
432 list->size *= 2;
433 list->items = (void **) xmlRealloc(list->items,
434 list->size * sizeof(void *));
435 if (list->items == NULL) {
438 list->size = 0;
442 list->items[list->number++] = item;
476 * the content of the list.
479 xmlPointerListFree(xmlPointerListPtr list)
481 if (list == NULL)
483 if (list->items != NULL)
484 xmlFree(list->items);
485 xmlFree(list);
1733 printf("# max : %d\n", xmlXPathDebugObjMaxAll);
1739 printf("# max : %d\n", xmlXPathDebugObjMaxNodeset);
1745 printf("# max : %d\n", xmlXPathDebugObjMaxString);
1751 printf("# max : %d\n", xmlXPathDebugObjMaxBool);
1757 printf("# max : %d\n", xmlXPathDebugObjMaxNumber);
1763 printf("# max : %d\n", xmlXPathDebugObjMaxXSLTTree);
1769 printf("# max : %d\n", xmlXPathDebugObjMaxUndefined);
1810 xmlXPathCacheFreeObjectList(xmlPointerListPtr list)
1815 if (list == NULL)
1818 for (i = 0; i < list->number; i++) {
1819 obj = list->items[i];
1834 xmlPointerListFree(list);
2710 LOWER_DOUBLE_EXP is max number of leading zeroes in fraction
2976 return(-1); /* assume there is no sibling list corruption */
3267 return(-1); /* assume there is no sibling list corruption */
3843 * Note that doing a memcpy of the list, namespace nodes are
3954 * Note that doing a memcpy of the list, namespace nodes are
4052 * Removes an entry from an existing NodeSet list.
4093 * Clears the list from all temporary XPath objects (e.g. namespace nodes
4094 * are feed), but does *not* free the list itself. Sets the length of the
4095 * list to 0.
4121 * Clears the list from temporary XPath objects (e.g. namespace nodes
4122 * are feed) starting with the entry at @pos, but does *not* free the list
4123 * itself. Sets the length of the list to @pos.
4331 * the list contrary to xmlXPathFreeObject().
5495 * the list and free the ns-nodes.
5497 * Maybe we shouldn't try to preserve the list.
8242 * We keep the XML namespace node at the end of the list.
8343 * The last function returns the number of nodes in the context node list.
8369 * context node list. The first position is 1, and so the last position
8437 * @ids: a whitespace separated list of IDs
8504 * into a whitespace-separated list of tokens (whitespace is any sequence
8507 * have a unique ID equal to any of the tokens in the list.
9251 int offset, max;
9267 max = xmlUTF8Strlen(to->stringval);
9271 if (offset < max) {
9869 int max = len * 2;
9871 buffer = (xmlChar *) xmlMallocAtomic(max * sizeof(xmlChar));
9881 if (len + 10 > max) {
9882 max *= 2;
9884 max * sizeof(xmlChar));
10379 * be filtered does not evaluate to a node-set. The context node list
11037 * namespace list associated:
12582 * OPTIMIZE TODO: How do we know if the node-list wasn't
12901 * Run the evaluation with a node list made of a
13014 * Run the evaluation with a node list made of
13443 * will result in an ordered list if we have an
13581 * Run the evaluation with a node list made of a
13703 * Run the evaluation with a node list made of
13838 * Run the evaluation with a node list made of a
13903 * Run the evaluation with a node list made of a single item
14373 * context node in the context node list (as returned by the position
14411 * context node in the context node list (as returned by the position
14483 * Additionally, if there is no list of namespaces available and
14486 * to have a list of namespaces at compilation time in order to