Copyright © 2001 - 2002 SILC Project SILC Project Website | SILC Toolkit Reference Manual

SILC Toolkit Reference Manual SILC Core Library SILC Authentication Interface SILC Channel Interface SILC Command Interface SILC ID Interface SILC ID Cache Interface SILC Modes SILC Notify Interface SILC Argument Interface SILC Private Message Interface Packet Protocol Interface SILC Math Library SILC MP Interface SILC Math Interface SILC SFTP Library SILC SFTP Interface SFTP Filesystems Interface SILC Utility Library Basic SILC Types SILC Buffer Interface SILC Buffer Format Interface SILC Hash Table Interface SILC Logging Interface SILC Memory Interface SILC Mutex Interface SILC Thread Interface SILC Network Interface SILC Schedule Interface SILC Socket Interface SILC Protocol Interface SILC Config Interface SILC File Util Interface SILC Util Interface SILC List Interface SILC Dynamic List Interface SILC Zip API SILC Key Exchange Library SILC SKE Interface SKE Status Types SKE Diffie Hellman Groups SKE Payloads SILC Client Library Using SILC Client Library Client Library Interface SILC Crypto Library Introduction to SILC RNG SILC RNG Interface SILC HMAC Interface SILC Cipher API SILC Hash API SILC PKCS API Resource Links SILC Project Website SILC Protocol Documentation SILC White Paper SILC FAQ
SILC Hash Table Interface Header: silchashtable.h DESCRIPTION
     Implementation of collision resistant hash table. This is a hash table
     that provides a reliable (what you add there stays there, and duplicate
     keys are allowed) with as fast reference to the key as possible. If
     there are a lot of duplicate keys in the hash table the lookup gets
     slower of course. However, this is reliable and no data is lost at any
     point. If you know that you never have duplicate keys then this is as
     fast as any simple hash table.

     The interface provides many ways to search the hash table including
     an extended interface where caller can specify its own hash and comparison
     functions.

     There are two ways to traverse the entire hash table if this feature
     is needed. There exists a foreach function that calls a foreach
     callback for each entry in the hash table. Other way is to use
     SilcHashTableList structure and traverse the hash table inside while()
     using the list structure. Both are equally fast.
SilcHashTable SilcHashTableList SilcHashFunction SilcHashCompare SilcHashDestructor SilcHashForeach silc_hash_table_alloc silc_hash_table_free silc_hash_table_size silc_hash_table_count silc_hash_table_add silc_hash_table_replace silc_hash_table_del silc_hash_table_del_by_context silc_hash_table_find silc_hash_table_find_foreach silc_hash_table_foreach silc_hash_table_rehash silc_hash_table_list silc_hash_table_list_reset silc_hash_table_get silc_hash_table_add_ext silc_hash_table_replace_ext silc_hash_table_del_ext silc_hash_table_del_by_context_ext silc_hash_table_find_ext silc_hash_table_find_foreach_ext silc_hash_table_rehash_ext

Copyright © 2001 - 2002 SILC Project SILC Project Website | SILC Toolkit Reference Manual