#include "libxml.h"
#include <limits.h>
#include <string.h>
#include <stddef.h>
#include <math.h>
#include <float.h>
#include <ctype.h>
#include <libxml/xmlmemory.h>
#include <libxml/tree.h>
#include <libxml/xpath.h>
#include <libxml/xpathInternals.h>
#include <libxml/parserInternals.h>
#include <libxml/hash.h>
#include <libxml/xmlerror.h>
#include <libxml/threads.h>
#include "private/buf.h"
#include "private/error.h"
#include "private/xpath.h"
Go to the source code of this file.
◆ IN_LIBXML
◆ TODO
Value:
"Unimplemented block at %s:%d\n", \
__FILE__, __LINE__);
void * xmlGenericErrorContext
xmlGenericErrorFunc xmlGenericError
Definition at line 58 of file xpath.c.
◆ WITH_TIM_SORT
WITH_TIM_SORT:
Use the Timsort algorithm provided in timsort.h to sort nodeset as this is a great improvement over the old Shell sort used in xmlXPathNodeSetSort()
Definition at line 70 of file xpath.c.
◆ XP_OPTIMIZED_FILTER_FIRST
| #define XP_OPTIMIZED_FILTER_FIRST |
◆ XP_OPTIMIZED_NON_ELEM_COMPARISON
| #define XP_OPTIMIZED_NON_ELEM_COMPARISON |
◆ XPATH_MAX_NODESET_LENGTH
| #define XPATH_MAX_NODESET_LENGTH 10000000 |
◆ XPATH_MAX_RECURSION_DEPTH
| #define XPATH_MAX_RECURSION_DEPTH 5000 |
◆ XPATH_MAX_STACK_DEPTH
| #define XPATH_MAX_STACK_DEPTH 1000000 |
◆ XPATH_MAX_STEPS
| #define XPATH_MAX_STEPS 1000000 |