|
Eneboo - Documentación para desarrolladores
|
#include "libxml.h"#include <string.h>#include <libxml/parser.h>#include <libxml/hash.h>#include <libxml/xmlmemory.h>#include <libxml/xmlerror.h>#include <libxml/globals.h>#include "elfgcchack.h"Clases | |
| struct | _xmlHashEntry |
| struct | _xmlHashTable |
| struct | stubData |
'defines' | |
| #define | IN_LIBXML |
| #define | MAX_HASH_LEN 8 |
'typedefs' | |
| typedef struct _xmlHashEntry | xmlHashEntry |
| typedef xmlHashEntry * | xmlHashEntryPtr |
Funciones | |
| xmlHashTablePtr | xmlHashCreate (int size) |
| xmlHashTablePtr | xmlHashCreateDict (int size, xmlDictPtr dict) |
| void | xmlHashFree (xmlHashTablePtr table, xmlHashDeallocator f) |
. Duplicate names generate errors. | |
Returns 0 the addition succeeded and -1 in case of error. | |
| int | xmlHashAddEntry (xmlHashTablePtr table, const xmlChar *name, void *userdata) |
, @name2) tuple. Duplicate tuples generate errors. | |
Returns 0 the addition succeeded and -1 in case of error. | |
| int | xmlHashAddEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) |
. Existing entry for this @name will be removed | |
and freed with if found. Returns 0 the addition succeeded and -1 in case of error. | |
| int | xmlHashUpdateEntry (xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) |
, @name2) tuple. Existing entry for this tuple will | |
be removed and freed with if found. Returns 0 the addition succeeded and -1 in case of error. | |
| int | xmlHashUpdateEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) |
. | |
Returns the pointer to the userdata | |
| void * | xmlHashLookup (xmlHashTablePtr table, const xmlChar *name) |
, @name2) tuple. | |
Returns the pointer to the userdata | |
| void * | xmlHashLookup2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) |
/@name. | |
Returns the pointer to the userdata | |
| void * | xmlHashQLookup (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) |
2: a second name of the userdata | |
| void * | xmlHashQLookup2 (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) |
, @name2, @name3). Duplicate entries generate | |
errors. Returns 0 the addition succeeded and -1 in case of error. | |
| int | xmlHashAddEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) |
, @name2, @name3). Existing entry for this tuple | |
will be removed and freed with if found. Returns 0 the addition succeeded and -1 in case of error. | |
| int | xmlHashUpdateEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) |
, @name2, @name3) tuple. | |
Returns the a pointer to the userdata | |
| void * | xmlHashLookup3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) |
| void * | xmlHashQLookup3 (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) |
| void | xmlHashScan (xmlHashTablePtr table, xmlHashScanner f, void *data) |
| void | xmlHashScanFull (xmlHashTablePtr table, xmlHashScannerFull f, void *data) |
, @name2, @name3) tuple. If one of the names is null, | |
the comparison is considered to match. | |
| void | xmlHashScan3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) |
| void | xmlHashScanFull3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) |
| xmlHashTablePtr | xmlHashCopy (xmlHashTablePtr table, xmlHashCopier f) |
| int | xmlHashSize (xmlHashTablePtr table) |
and remove | |
it from the hash . Existing userdata for this tuple will be removed and freed with . Returns 0 if the removal succeeded and -1 in case of error or not found. | |
| int | xmlHashRemoveEntry (xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) |
, @name2) tuple and remove | |
it from the hash . Existing userdata for this tuple will be removed and freed with . Returns 0 if the removal succeeded and -1 in case of error or not found. | |
| int | xmlHashRemoveEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) |
, @name2, @name3) tuple and remove | |
it from the hash . Existing userdata for this tuple will be removed and freed with . Returns 0 if the removal succeeded and -1 in case of error or not found. | |
| #define | bottom_hash |
| int | xmlHashRemoveEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) |
| #define bottom_hash |
| #define IN_LIBXML |
| #define MAX_HASH_LEN 8 |
| typedef struct _xmlHashEntry xmlHashEntry |
| typedef xmlHashEntry* xmlHashEntryPtr |
| int xmlHashAddEntry | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| void * | userdata | ||
| ) |
| int xmlHashAddEntry2 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| void * | userdata | ||
| ) |
| int xmlHashAddEntry3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | name3, | ||
| void * | userdata | ||
| ) |
| xmlHashTablePtr xmlHashCopy | ( | xmlHashTablePtr | table, |
| xmlHashCopier | f | ||
| ) |
xmlHashCopy: : the hash table : the copier function for items in the hash
Scan the hash and applied to each value.
Returns the new table or NULL in case of error.
| xmlHashTablePtr xmlHashCreate | ( | int | size | ) |
xmlHashCreate: : the size of the hash table
Create a new xmlHashTablePtr.
Returns the newly created object, or NULL if an error occured.
| xmlHashTablePtr xmlHashCreateDict | ( | int | size, |
| xmlDictPtr | dict | ||
| ) |
xmlHashCreateDict: : the size of the hash table : a dictionary to use for the hash
Create a new xmlHashTablePtr which will use as the internal dictionary
Returns the newly created object, or NULL if an error occured.
| void xmlHashFree | ( | xmlHashTablePtr | table, |
| xmlHashDeallocator | f | ||
| ) |
xmlHashFree: : the hash table : the deallocator function for items in the hash
Free the hash and its contents. The userdata is deallocated with if provided.
| void* xmlHashLookup | ( | xmlHashTablePtr | table, |
| const xmlChar * | name | ||
| ) |
| void* xmlHashLookup2 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2 | ||
| ) |
| void* xmlHashLookup3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | name3 | ||
| ) |
| void* xmlHashQLookup | ( | xmlHashTablePtr | table, |
| const xmlChar * | prefix, | ||
| const xmlChar * | name | ||
| ) |
| void* xmlHashQLookup2 | ( | xmlHashTablePtr | table, |
| const xmlChar * | prefix, | ||
| const xmlChar * | name, | ||
| const xmlChar * | prefix2, | ||
| const xmlChar * | name2 | ||
| ) |
| void* xmlHashQLookup3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | prefix, | ||
| const xmlChar * | name, | ||
| const xmlChar * | prefix2, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | prefix3, | ||
| const xmlChar * | name3 | ||
| ) |
| int xmlHashRemoveEntry | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| xmlHashDeallocator | f | ||
| ) |
| int xmlHashRemoveEntry2 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| xmlHashDeallocator | f | ||
| ) |
| int xmlHashRemoveEntry3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | name3, | ||
| xmlHashDeallocator | f | ||
| ) |
| void xmlHashScan | ( | xmlHashTablePtr | table, |
| xmlHashScanner | f, | ||
| void * | data | ||
| ) |
xmlHashScan: : the hash table : the scanner function for items in the hash : extra data passed to f
Scan the hash and applied to each value.
| void xmlHashScan3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | name3, | ||
| xmlHashScanner | f, | ||
| void * | data | ||
| ) |
| void xmlHashScanFull | ( | xmlHashTablePtr | table, |
| xmlHashScannerFull | f, | ||
| void * | data | ||
| ) |
xmlHashScanFull: : the hash table : the scanner function for items in the hash : extra data passed to f
Scan the hash and applied to each value.
| void xmlHashScanFull3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | name3, | ||
| xmlHashScannerFull | f, | ||
| void * | data | ||
| ) |
| int xmlHashSize | ( | xmlHashTablePtr | table | ) |
xmlHashSize: : the hash table
Query the number of elements installed in the hash .
Returns the number of elements in the hash table or -1 in case of error
| int xmlHashUpdateEntry | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| void * | userdata, | ||
| xmlHashDeallocator | f | ||
| ) |
| int xmlHashUpdateEntry2 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| void * | userdata, | ||
| xmlHashDeallocator | f | ||
| ) |
| int xmlHashUpdateEntry3 | ( | xmlHashTablePtr | table, |
| const xmlChar * | name, | ||
| const xmlChar * | name2, | ||
| const xmlChar * | name3, | ||
| void * | userdata, | ||
| xmlHashDeallocator | f | ||
| ) |
1.7.4