Ok. I have written a first version for the Hash Module API.
Also added the Arch entry on the wiki page.
Thanks.
I would add the following functions:
`pdf_bool_t pdf_hash_key_p (hash_table, key)'
Return PDF_TRUE if there is an entry in HASH_TABLE with key KEY.
`pdf_size_t pdf_hash_num_entries (hash_table)'
Return the number of entries in HASH_TABLE.
`pdf_status_t pdf_hash_rename (hash_table, key, new_key)'
Rename KEY to NEW_KEY in HASH_TABLE.
`pdf_status_t pdf_hash_mapkeys (hash_table,
pdf_hash_mapkeys_fn_t func,
void *client_data)'
Apply FUNC to each element contained in HASH_TABLE. The prototype
of FUNC should be:
pdf_status_t func (pdf_hash_t hash_table, char *key, void *client_data)
FIXME: Should we define an order???
I don't know how the enum "pdf_hash_value_type_e" is going to be
used yet.
We are not going to use that type, since we are working with generic
pointers to store data into the hash table. The definition of
`pdf_hash_value_type_e' in gnupdf.texi should be deleted.
