| Gnome XML Library Reference Manual | |||
|---|---|---|---|
| <<< Previous Page | Home | Up | Next Page >>> | 
| void        (*xmlHashDeallocator)           (void *payload,
                                             xmlChar *name); | 
Callback to free data from a hash.
| void*       (*xmlHashCopier)                (void *payload,
                                             xmlChar *name); | 
Callback to copy data from a hash.
| void        (*xmlHashScanner)               (void *payload,
                                             void *data,
                                             xmlChar *name); | 
Callback when scanning data in a hash with the simple scanner.
| void        (*xmlHashScannerFull)           (void *payload,
                                             void *data,
                                             const xmlChar *name,
                                             const xmlChar *name2,
                                             const xmlChar *name3); | 
Callback when scanning data in a hash with the full scanner.
| void xmlHashFree (xmlHashTablePtr table, xmlHashDeallocator f); | 
Free the hash table and its contents. The userdata is deallocated with f if provided.
| int xmlHashAddEntry (xmlHashTablePtr table, const xmlChar *name, void *userdata); | 
Add the userdata to the hash table. This can later be retrieved by using the name. Duplicate names generate errors.
| int xmlHashUpdateEntry (xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f); | 
Add the userdata to the hash table. This can later be retrieved by using the name. Existing entry for this name will be removed and freed with f if found.
| int xmlHashAddEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata); | 
Add the userdata to the hash table. This can later be retrieved by using the (name, name2) tuple. Duplicate tuples generate errors.
| int xmlHashUpdateEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f); | 
Add the userdata to the hash table. This can later be retrieved by using the (name, name2) tuple. Existing entry for this tuple will be removed and freed with f if found.
| int xmlHashAddEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata); | 
Add the userdata to the hash table. This can later be retrieved by using the tuple (name, name2, name3). Duplicate entries generate errors.
| int xmlHashUpdateEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f); | 
Add the userdata to the hash table. This can later be retrieved by using the tuple (name, name2, name3). Existing entry for this tuple will be removed and freed with f if found.
| int xmlHashRemoveEntry (xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f); | 
Find the userdata specified by the name and remove it from the hash table. Existing userdata for this tuple will be removed and freed with f.
| int xmlHashRemoveEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f); | 
Find the userdata specified by the (name, name2) tuple and remove it from the hash table. Existing userdata for this tuple will be removed and freed with f.
| int xmlHashRemoveEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f); | 
Find the userdata specified by the (name, name2, name3) tuple and remove it from the hash table. Existing userdata for this tuple will be removed and freed with f.
| void* xmlHashLookup (xmlHashTablePtr table, const xmlChar *name); | 
Find the userdata specified by the name.
| void* xmlHashLookup2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2); | 
Find the userdata specified by the (name, name2) tuple.
| void* xmlHashLookup3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3); | 
Find the userdata specified by the (name, name2, name3) tuple.
| xmlHashTablePtr xmlHashCopy (xmlHashTablePtr table, xmlHashCopier f); | 
Scan the hash table and applied f to each value.
| int xmlHashSize (xmlHashTablePtr table); | 
Query the number of elements installed in the hash table.
| void xmlHashScan (xmlHashTablePtr table, xmlHashScanner f, void *data); | 
Scan the hash table and applied f to each value.
| void xmlHashScan3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data); | 
Scan the hash table and applied f to each value matching (name, name2, name3) tuple. If one of the names is null, the comparison is considered to match.
| void xmlHashScanFull (xmlHashTablePtr table, xmlHashScannerFull f, void *data); | 
Scan the hash table and applied f to each value.
| void xmlHashScanFull3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data); | 
Scan the hash table and applied f to each value matching (name, name2, name3) tuple. If one of the names is null, the comparison is considered to match.