<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>Hash table</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.2.15 -->
<center>
<a class="qindex" href="index.html">Main Page</a> <a class="qindex" href="modules.html">Modules</a> <a class="qindex" href="annotated.html">Data Structures</a> <a class="qindex" href="files.html">File List</a> <a class="qindex" href="functions.html">Data Fields</a> <a class="qindex" href="pages.html">Related Pages</a> </center>
<hr><h1>Hash table<br>
<small>
[<a class="el" href="group__DBusInternals.html">D-BUS internal implementation details</a>]</small>
</h1>DBusHashTable data structure.
<a href="#_details">More...</a><table border=0 cellpadding=0 cellspacing=0>
<tr><td colspan=2><br><h2>Typedefs</h2></td></tr>
<tr><td nowrap align=right valign=top><a name="a0" doxytag="DBusHashTable::KeyCompareFunc"></a>
typedef int(* </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a0">KeyCompareFunc</a> )(const void *key_a, const void *key_b)</td></tr>
<tr><td> </td><td><font size=-1><em>Key comparison function.</em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a name="a37" doxytag="DBusHashTable::DBusHashIter"></a>
typedef DBusHashIter </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a37">DBusHashIter</a></td></tr>
<tr><td> </td><td><font size=-1><em>Public opaque hash table iterator object.</em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a name="a38" doxytag="DBusHashTable::DBusHashTable"></a>
typedef DBusHashTable </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a38">DBusHashTable</a></td></tr>
<tr><td> </td><td><font size=-1><em>Public opaque hash table object.</em></font><br><br></td></tr>
<tr><td colspan=2><br><h2>Enumerations</h2></td></tr>
<tr><td nowrap align=right valign=top>enum </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a39">DBusHashType</a> { <br>
<a class="el" href="group__DBusHashTable.html#a39a3">DBUS_HASH_STRING</a>,
<a class="el" href="group__DBusHashTable.html#a39a4">DBUS_HASH_TWO_STRINGS</a>,
<a class="el" href="group__DBusHashTable.html#a39a5">DBUS_HASH_INT</a>,
<a class="el" href="group__DBusHashTable.html#a39a6">DBUS_HASH_POINTER</a>,
<br>
<a class="el" href="group__DBusHashTable.html#a39a7">DBUS_HASH_ULONG</a>
<br>
}</td></tr>
<tr><td> </td><td><font size=-1><em>Indicates the type of a key in the hash table.</em> <a href="#a39">More...</a><em></em></font><br><br></td></tr>
<tr><td colspan=2><br><h2>Functions</h2></td></tr>
<tr><td nowrap align=right valign=top>DBusHashTable * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a1">_dbus_hash_table_new</a> (<a class="el" href="group__DBusHashTable.html#a39">DBusHashType</a> type, <a class="el" href="group__DBusMemory.html#a8">DBusFreeFunction</a> key_free_function, <a class="el" href="group__DBusMemory.html#a8">DBusFreeFunction</a> value_free_function)</td></tr>
<tr><td> </td><td><font size=-1><em>Constructs a new hash table.</em> <a href="#a1">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>DBusHashTable * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a2">_dbus_hash_table_ref</a> (DBusHashTable *table)</td></tr>
<tr><td> </td><td><font size=-1><em>Increments the reference count for a hash table.</em> <a href="#a2">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a3">_dbus_hash_table_unref</a> (DBusHashTable *table)</td></tr>
<tr><td> </td><td><font size=-1><em>Decrements the reference count for a hash table, freeing the hash table if the count reaches zero.</em> <a href="#a3">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a4">_dbus_hash_iter_init</a> (DBusHashTable *table, <a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Initializes a hash table iterator.</em> <a href="#a4">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a5">_dbus_hash_iter_next</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Move the hash iterator forward one step, to the next hash entry.</em> <a href="#a5">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a6">_dbus_hash_iter_remove_entry</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Removes the current entry from the hash table.</em> <a href="#a6">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a7">_dbus_hash_iter_get_value</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Gets the value of the current entry.</em> <a href="#a7">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a8">_dbus_hash_iter_set_value</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Sets the value of the current entry.</em> <a href="#a8">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>int </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a9">_dbus_hash_iter_get_int_key</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Gets the key for the current entry.</em> <a href="#a9">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>unsigned long </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a10">_dbus_hash_iter_get_ulong_key</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Gets the key for the current entry.</em> <a href="#a10">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>const char * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a11">_dbus_hash_iter_get_string_key</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Gets the key for the current entry.</em> <a href="#a11">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>const char * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a12">_dbus_hash_iter_get_two_strings_key</a> (<a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>Gets the key for the current entry.</em> <a href="#a12">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a13">_dbus_hash_iter_lookup</a> (DBusHashTable *table, void *key, <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> create_if_not_found, <a class="el" href="structDBusHashIter.html">DBusHashIter</a> *iter)</td></tr>
<tr><td> </td><td><font size=-1><em>A low-level but efficient interface for manipulating the hash table.</em> <a href="#a13">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a18">_dbus_hash_table_lookup_string</a> (DBusHashTable *table, const char *key)</td></tr>
<tr><td> </td><td><font size=-1><em>Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.</em> <a href="#a18">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a19">_dbus_hash_table_lookup_two_strings</a> (DBusHashTable *table, const char *key)</td></tr>
<tr><td> </td><td><font size=-1><em>Looks up the value for a given string in a hash table of type DBUS_HASH_TWO_STRINGS.</em> <a href="#a19">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a20">_dbus_hash_table_lookup_int</a> (DBusHashTable *table, int key)</td></tr>
<tr><td> </td><td><font size=-1><em>Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.</em> <a href="#a20">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a21">_dbus_hash_table_lookup_pointer</a> (DBusHashTable *table, void *key)</td></tr>
<tr><td> </td><td><font size=-1><em>Looks up the value for a given integer in a hash table of type DBUS_HASH_POINTER.</em> <a href="#a21">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a22">_dbus_hash_table_lookup_ulong</a> (DBusHashTable *table, unsigned long key)</td></tr>
<tr><td> </td><td><font size=-1><em>Looks up the value for a given integer in a hash table of type DBUS_HASH_ULONG.</em> <a href="#a22">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a23">_dbus_hash_table_remove_string</a> (DBusHashTable *table, const char *key)</td></tr>
<tr><td> </td><td><font size=-1><em>Removes the hash entry for the given key.</em> <a href="#a23">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a24">_dbus_hash_table_remove_two_strings</a> (DBusHashTable *table, const char *key)</td></tr>
<tr><td> </td><td><font size=-1><em>Removes the hash entry for the given key.</em> <a href="#a24">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a25">_dbus_hash_table_remove_int</a> (DBusHashTable *table, int key)</td></tr>
<tr><td> </td><td><font size=-1><em>Removes the hash entry for the given key.</em> <a href="#a25">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a26">_dbus_hash_table_remove_pointer</a> (DBusHashTable *table, void *key)</td></tr>
<tr><td> </td><td><font size=-1><em>Removes the hash entry for the given key.</em> <a href="#a26">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a27">_dbus_hash_table_remove_ulong</a> (DBusHashTable *table, unsigned long key)</td></tr>
<tr><td> </td><td><font size=-1><em>Removes the hash entry for the given key.</em> <a href="#a27">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a28">_dbus_hash_table_insert_string</a> (DBusHashTable *table, char *key, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Creates a hash entry with the given key and value.</em> <a href="#a28">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a29">_dbus_hash_table_insert_two_strings</a> (DBusHashTable *table, char *key, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Creates a hash entry with the given key and value.</em> <a href="#a29">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a30">_dbus_hash_table_insert_int</a> (DBusHashTable *table, int key, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Creates a hash entry with the given key and value.</em> <a href="#a30">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a31">_dbus_hash_table_insert_pointer</a> (DBusHashTable *table, void *key, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Creates a hash entry with the given key and value.</em> <a href="#a31">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a32">_dbus_hash_table_insert_ulong</a> (DBusHashTable *table, unsigned long key, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Creates a hash entry with the given key and value.</em> <a href="#a32">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>DBusPreallocatedHash * </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a33">_dbus_hash_table_preallocate_entry</a> (DBusHashTable *table)</td></tr>
<tr><td> </td><td><font size=-1><em>Preallocate an opaque data blob that allows us to insert into the hash table at a later time without allocating any memory.</em> <a href="#a33">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a34">_dbus_hash_table_free_preallocated_entry</a> (DBusHashTable *table, DBusPreallocatedHash *preallocated)</td></tr>
<tr><td> </td><td><font size=-1><em>Frees an opaque DBusPreallocatedHash that was *not* used in order to insert into the hash table.</em> <a href="#a34">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>void </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a35">_dbus_hash_table_insert_string_preallocated</a> (DBusHashTable *table, DBusPreallocatedHash *preallocated, char *key, void *value)</td></tr>
<tr><td> </td><td><font size=-1><em>Inserts a string-keyed entry into the hash table, using a preallocated data block from <a class="el" href="group__DBusHashTable.html#a33">_dbus_hash_table_preallocate_entry</a>().</em> <a href="#a35">More...</a><em></em></font><br><br></td></tr>
<tr><td nowrap align=right valign=top>int </td><td valign=bottom><a class="el" href="group__DBusHashTable.html#a36">_dbus_hash_table_get_n_entries</a> (DBusHashTable *table)</td></tr>
<tr><td> </td><td><font size=-1><em>Gets the number of hash entries in a hash table.</em> <a href="#a36">More...</a><em></em></font><br><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
DBusHashTable data structure.
<p>
<p>
Types and functions related to DBusHashTable. <hr><h2>Enumeration Type Documentation</h2>
<a name="a39" doxytag="dbus-hash.h::DBusHashType"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> enum DBusHashType
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Indicates the type of a key in the hash table.
<p>
<dl compact><dt><b>
Enumeration values:</b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em><a name="a39a3" doxytag="DBUS_HASH_STRING"></a><em>DBUS_HASH_STRING</em></em> </td><td>
Hash keys are strings.</td></tr>
<tr><td valign=top><em><a name="a39a4" doxytag="DBUS_HASH_TWO_STRINGS"></a><em>DBUS_HASH_TWO_STRINGS</em></em> </td><td>
Hash key is two strings in one memory block, i.e.
<p>
foo\0bar\0 </td></tr>
<tr><td valign=top><em><a name="a39a5" doxytag="DBUS_HASH_INT"></a><em>DBUS_HASH_INT</em></em> </td><td>
Hash keys are integers.</td></tr>
<tr><td valign=top><em><a name="a39a6" doxytag="DBUS_HASH_POINTER"></a><em>DBUS_HASH_POINTER</em></em> </td><td>
Hash keys are pointers.</td></tr>
<tr><td valign=top><em><a name="a39a7" doxytag="DBUS_HASH_ULONG"></a><em>DBUS_HASH_ULONG</em></em> </td><td>
Hash keys are unsigned long.</td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8h-source.html#l00053">53</a> of file <a class="el" href="dbus-hash_8h-source.html">dbus-hash.h</a>. </td>
</tr>
</table>
<hr><h2>Function Documentation</h2>
<a name="a9" doxytag="dbus-hash.c::_dbus_hash_iter_get_int_key"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> int _dbus_hash_iter_get_int_key </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Gets the key for the current entry.
<p>
Only works for hash tables of type DBUS_HASH_INT.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00650">650</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a11" doxytag="dbus-hash.c::_dbus_hash_iter_get_string_key"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> const char* _dbus_hash_iter_get_string_key </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Gets the key for the current entry.
<p>
Only works for hash tables of type DBUS_HASH_STRING <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00687">687</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a12" doxytag="dbus-hash.c::_dbus_hash_iter_get_two_strings_key"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> const char* _dbus_hash_iter_get_two_strings_key </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Gets the key for the current entry.
<p>
Only works for hash tables of type DBUS_HASH_TWO_STRINGS <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00705">705</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a10" doxytag="dbus-hash.c::_dbus_hash_iter_get_ulong_key"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> unsigned long _dbus_hash_iter_get_ulong_key </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Gets the key for the current entry.
<p>
Only works for hash tables of type DBUS_HASH_ULONG.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00669">669</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a7" doxytag="dbus-hash.c::_dbus_hash_iter_get_value"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void* _dbus_hash_iter_get_value </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Gets the value of the current entry.
<p>
<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00604">604</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a4" doxytag="dbus-hash.c::_dbus_hash_iter_init"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void _dbus_hash_iter_init </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname" nowrap> <em>iter</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Initializes a hash table iterator.
<p>
To iterate over all entries in a hash table, use the following code (the printf assumes a hash from strings to strings obviously):
<p>
<div class="fragment"><pre> <a class="code" href="structDBusHashIter.html">DBusHashIter</a> iter;
_dbus_hash_iter_init (table, &iter);
<font class="keywordflow">while</font> (_dbus_hash_iter_next (&iter))
{
printf (<font class="stringliteral">"The first key is %s and value is %s\n"</font>,
_dbus_hash_iter_get_string_key (&iter),
_dbus_hash_iter_get_value (&iter));
}
</pre></div>
<p>
The iterator is initialized pointing "one before" the first hash entry. The first call to <a class="el" href="group__DBusHashTable.html#a5">_dbus_hash_iter_next</a>() moves it onto the first valid entry or returns <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if the hash table is empty. Subsequent calls move to the next valid entry or return <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if there are no more entries.
<p>
Note that it is guaranteed to be safe to remove a hash entry during iteration, but it is not safe to add a hash entry.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table to iterate over. </td></tr>
<tr><td valign=top><em>iter</em> </td><td>
the iterator to initialize. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00508">508</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00214">DBusRealHashIter::bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00181">n_entries</a>, <a class="el" href="dbus-hash_8c-source.html#l00221">DBusRealHashIter::n_entries_on_init</a>, <a class="el" href="dbus-hash_8c-source.html#l00220">DBusRealHashIter::next_bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00219">DBusRealHashIter::next_entry</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a13" doxytag="dbus-hash.c::_dbus_hash_iter_lookup"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_iter_lookup </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap><a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> </td>
<td class="mdname" nowrap> <em>create_if_not_found</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname" nowrap> <em>iter</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
A low-level but efficient interface for manipulating the hash table.
<p>
It's efficient because you can get, set, and optionally create the hash entry while only running the hash function one time.
<p>
Note that while calling <a class="el" href="group__DBusHashTable.html#a5">_dbus_hash_iter_next</a>() on the iterator filled in by this function may work, it's completely undefined which entries are after this iter and which are before it. So it would be silly to iterate using this iterator.
<p>
If the hash entry is created, its value will be initialized to all bits zero.
<p>
<a class="el" href="group__DBusMacros.html#a3">FALSE</a> may be returned due to memory allocation failure, or because create_if_not_found was <a class="el" href="group__DBusMacros.html#a3">FALSE</a> and the entry did not exist.
<p>
If create_if_not_found is <a class="el" href="group__DBusMacros.html#a2">TRUE</a> and the entry is created, the hash table takes ownership of the key that's passed in.
<p>
For a hash table of type DBUS_HASH_INT, cast the int key to the key parameter using <a class="el" href="group__DBusInternalsUtils.html#a135">_DBUS_INT_TO_POINTER</a>().<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key. </td></tr>
<tr><td valign=top><em>create_if_not_found</em> </td><td>
if <a class="el" href="group__DBusMacros.html#a2">TRUE</a>, create the entry if it didn't exist. </td></tr>
<tr><td valign=top><em>iter</em> </td><td>
the iterator to initialize. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a2">TRUE</a> if the hash entry now exists (and the iterator is thus valid). </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00749">749</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00214">DBusRealHashIter::bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00170">buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00181">n_entries</a>, <a class="el" href="dbus-hash_8c-source.html#l00221">DBusRealHashIter::n_entries_on_init</a>, <a class="el" href="dbus-hash_8c-source.html#l00144">DBusHashEntry::next</a>, <a class="el" href="dbus-hash_8c-source.html#l00220">DBusRealHashIter::next_bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00219">DBusRealHashIter::next_entry</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a5" doxytag="dbus-hash.c::_dbus_hash_iter_next"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_iter_next </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Move the hash iterator forward one step, to the next hash entry.
<p>
The documentation for <a class="el" href="group__DBusHashTable.html#a4">_dbus_hash_iter_init</a>() explains in more detail.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the iterator to move forward. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a3">FALSE</a> if there are no more entries to move to. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00534">534</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00214">DBusRealHashIter::bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00170">buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00178">n_buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00181">n_entries</a>, <a class="el" href="dbus-hash_8c-source.html#l00221">DBusRealHashIter::n_entries_on_init</a>, <a class="el" href="dbus-hash_8c-source.html#l00144">DBusHashEntry::next</a>, <a class="el" href="dbus-hash_8c-source.html#l00220">DBusRealHashIter::next_bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00219">DBusRealHashIter::next_entry</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a6" doxytag="dbus-hash.c::_dbus_hash_iter_remove_entry"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void _dbus_hash_iter_remove_entry </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>iter</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Removes the current entry from the hash table.
<p>
If a key_free_function or value_free_function was provided to <a class="el" href="group__DBusHashTable.html#a1">_dbus_hash_table_new</a>(), frees the key and/or value for this entry.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00583">583</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00214">DBusRealHashIter::bucket</a>, <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, and <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>. </td>
</tr>
</table>
<a name="a8" doxytag="dbus-hash.c::_dbus_hash_iter_set_value"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void _dbus_hash_iter_set_value </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashIter.html">DBusHashIter</a> * </td>
<td class="mdname" nowrap> <em>iter</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Sets the value of the current entry.
<p>
If the hash table has a value_free_function it will be used to free the previous value. The hash table will own the passed-in value (it will not be copied).<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>iter</em> </td><td>
the hash table iterator. </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the new value. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00627">627</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00218">DBusRealHashIter::entry</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00213">DBusRealHashIter::table</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a34" doxytag="dbus-hash.c::_dbus_hash_table_free_preallocated_entry"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void _dbus_hash_table_free_preallocated_entry </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>DBusPreallocatedHash * </td>
<td class="mdname" nowrap> <em>preallocated</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Frees an opaque DBusPreallocatedHash that was *not* used in order to insert into the hash table.
<p>
<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table </td></tr>
<tr><td valign=top><em>preallocated</em> </td><td>
the preallocated data </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01602">1602</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00205">entry_pool</a>. </td>
</tr>
</table>
<a name="a36" doxytag="dbus-hash.c::_dbus_hash_table_get_n_entries"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> int _dbus_hash_table_get_n_entries </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>table</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Gets the number of hash entries in a hash table.
<p>
<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the number of entries in the table. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01660">1660</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00181">n_entries</a>. </td>
</tr>
</table>
<a name="a30" doxytag="dbus-hash.c::_dbus_hash_table_insert_int"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_insert_int </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>int </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Creates a hash entry with the given key and value.
<p>
The key and value are not copied; they are stored in the hash table by reference. If an entry with the given key already exists, the previous key and value are overwritten (and freed if the hash table has a key_free_function and/or value_free_function).
<p>
Returns <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if memory for the new hash entry can't be allocated.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash entry key. </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the hash entry value. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01467">1467</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00202">free_key_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a31" doxytag="dbus-hash.c::_dbus_hash_table_insert_pointer"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_insert_pointer </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Creates a hash entry with the given key and value.
<p>
The key and value are not copied; they are stored in the hash table by reference. If an entry with the given key already exists, the previous key and value are overwritten (and freed if the hash table has a key_free_function and/or value_free_function).
<p>
Returns <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if memory for the new hash entry can't be allocated.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash entry key. </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the hash entry value. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01510">1510</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00202">free_key_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a28" doxytag="dbus-hash.c::_dbus_hash_table_insert_string"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_insert_string </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>char * </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Creates a hash entry with the given key and value.
<p>
The key and value are not copied; they are stored in the hash table by reference. If an entry with the given key already exists, the previous key and value are overwritten (and freed if the hash table has a key_free_function and/or value_free_function).
<p>
Returns <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if memory for the new hash entry can't be allocated.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash entry key. </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the hash entry value. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01392">1392</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>. </td>
</tr>
</table>
<a name="a35" doxytag="dbus-hash.c::_dbus_hash_table_insert_string_preallocated"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void _dbus_hash_table_insert_string_preallocated </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>DBusPreallocatedHash * </td>
<td class="mdname" nowrap> <em>preallocated</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>char * </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Inserts a string-keyed entry into the hash table, using a preallocated data block from <a class="el" href="group__DBusHashTable.html#a33">_dbus_hash_table_preallocate_entry</a>().
<p>
This function cannot fail due to lack of memory. The DBusPreallocatedHash object is consumed and should not be reused or freed. Otherwise this function works just like <a class="el" href="group__DBusHashTable.html#a28">_dbus_hash_table_insert_string</a>().<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table </td></tr>
<tr><td valign=top><em>preallocated</em> </td><td>
the preallocated data </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the value </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01629">1629</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00202">free_key_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a29" doxytag="dbus-hash.c::_dbus_hash_table_insert_two_strings"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_insert_two_strings </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>char * </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Creates a hash entry with the given key and value.
<p>
The key and value are not copied; they are stored in the hash table by reference. If an entry with the given key already exists, the previous key and value are overwritten (and freed if the hash table has a key_free_function and/or value_free_function).
<p>
Returns <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if memory for the new hash entry can't be allocated.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash entry key. </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the hash entry value. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01426">1426</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00202">free_key_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a32" doxytag="dbus-hash.c::_dbus_hash_table_insert_ulong"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_insert_ulong </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>unsigned long </td>
<td class="mdname" nowrap> <em>key</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>value</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Creates a hash entry with the given key and value.
<p>
The key and value are not copied; they are stored in the hash table by reference. If an entry with the given key already exists, the previous key and value are overwritten (and freed if the hash table has a key_free_function and/or value_free_function).
<p>
Returns <a class="el" href="group__DBusMacros.html#a3">FALSE</a> if memory for the new hash entry can't be allocated.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash entry key. </td></tr>
<tr><td valign=top><em>value</em> </td><td>
the hash entry value. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01552">1552</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00202">free_key_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00148">DBusHashEntry::key</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a20" doxytag="dbus-hash.c::_dbus_hash_table_lookup_int"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void* _dbus_hash_table_lookup_int </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>int </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.
<p>
Returns NULL if the value is not present. (A not-present entry is indistinguishable from an entry with a value of NULL.) <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the integer to look up. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the value of the hash entry. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01165">1165</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a21" doxytag="dbus-hash.c::_dbus_hash_table_lookup_pointer"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void* _dbus_hash_table_lookup_pointer </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Looks up the value for a given integer in a hash table of type DBUS_HASH_POINTER.
<p>
Returns NULL if the value is not present. (A not-present entry is indistinguishable from an entry with a value of NULL.) <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the integer to look up. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the value of the hash entry. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01192">1192</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a18" doxytag="dbus-hash.c::_dbus_hash_table_lookup_string"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void* _dbus_hash_table_lookup_string </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>const char * </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.
<p>
Returns NULL if the value is not present. (A not-present entry is indistinguishable from an entry with a value of NULL.) <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the string to look up. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the value of the hash entry. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01115">1115</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a19" doxytag="dbus-hash.c::_dbus_hash_table_lookup_two_strings"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void* _dbus_hash_table_lookup_two_strings </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>const char * </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Looks up the value for a given string in a hash table of type DBUS_HASH_TWO_STRINGS.
<p>
Returns NULL if the value is not present. (A not-present entry is indistinguishable from an entry with a value of NULL.) <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the string to look up. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the value of the hash entry. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01140">1140</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a22" doxytag="dbus-hash.c::_dbus_hash_table_lookup_ulong"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void* _dbus_hash_table_lookup_ulong </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>unsigned long </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Looks up the value for a given integer in a hash table of type DBUS_HASH_ULONG.
<p>
Returns NULL if the value is not present. (A not-present entry is indistinguishable from an entry with a value of NULL.) <dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the integer to look up. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the value of the hash entry. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01218">1218</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, and <a class="el" href="dbus-hash_8c-source.html#l00149">DBusHashEntry::value</a>. </td>
</tr>
</table>
<a name="a1" doxytag="dbus-hash.c::_dbus_hash_table_new"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="structDBusHashTable.html">DBusHashTable</a>* _dbus_hash_table_new </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="group__DBusHashTable.html#a39">DBusHashType</a> </td>
<td class="mdname" nowrap> <em>type</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap><a class="el" href="group__DBusMemory.html#a8">DBusFreeFunction</a> </td>
<td class="mdname" nowrap> <em>key_free_function</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap><a class="el" href="group__DBusMemory.html#a8">DBusFreeFunction</a> </td>
<td class="mdname" nowrap> <em>value_free_function</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Constructs a new hash table.
<p>
Should be freed with <a class="el" href="group__DBusHashTable.html#a3">_dbus_hash_table_unref</a>(). If memory cannot be allocated for the hash table, returns <a class="el" href="group__DBusMacros.html#a4">NULL</a>.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>type</em> </td><td>
the type of hash key to use. </td></tr>
<tr><td valign=top><em>key_free_function</em> </td><td>
function to free hash keys. </td></tr>
<tr><td valign=top><em>value_free_function</em> </td><td>
function to free hash values. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
a new <a class="el" href="structDBusHashTable.html">DBusHashTable</a> or <a class="el" href="group__DBusMacros.html#a4">NULL</a> if no memory. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00288">288</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00170">buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00190">down_shift</a>, <a class="el" href="dbus-hash_8c-source.html#l00205">entry_pool</a>, <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00202">free_key_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00203">free_value_function</a>, <a class="el" href="dbus-hash_8c-source.html#l00184">hi_rebuild_size</a>, <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>, <a class="el" href="dbus-hash_8c-source.html#l00187">lo_rebuild_size</a>, <a class="el" href="dbus-hash_8c-source.html#l00194">mask</a>, <a class="el" href="dbus-hash_8c-source.html#l00178">n_buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00181">n_entries</a>, <a class="el" href="dbus-hash_8c-source.html#l00168">refcount</a>, and <a class="el" href="dbus-hash_8c-source.html#l00175">static_buckets</a>. </td>
</tr>
</table>
<a name="a33" doxytag="dbus-hash.c::_dbus_hash_table_preallocate_entry"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> DBusPreallocatedHash* _dbus_hash_table_preallocate_entry </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>table</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Preallocate an opaque data blob that allows us to insert into the hash table at a later time without allocating any memory.
<p>
<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the preallocated data, or <a class="el" href="group__DBusMacros.html#a4">NULL</a> if no memory </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01585">1585</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>. </td>
</tr>
</table>
<a name="a2" doxytag="dbus-hash.c::_dbus_hash_table_ref"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="structDBusHashTable.html">DBusHashTable</a>* _dbus_hash_table_ref </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>table</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Increments the reference count for a hash table.
<p>
<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table to add a reference to. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
the hash table. </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00354">354</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00168">refcount</a>. </td>
</tr>
</table>
<a name="a25" doxytag="dbus-hash.c::_dbus_hash_table_remove_int"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_remove_int </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>int </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Removes the hash entry for the given key.
<p>
If no hash entry for the key exists, does nothing.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a2">TRUE</a> if the entry existed </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01298">1298</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, and <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>. </td>
</tr>
</table>
<a name="a26" doxytag="dbus-hash.c::_dbus_hash_table_remove_pointer"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_remove_pointer </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>void * </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Removes the hash entry for the given key.
<p>
If no hash entry for the key exists, does nothing.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a2">TRUE</a> if the entry existed </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01328">1328</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, and <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>. </td>
</tr>
</table>
<a name="a23" doxytag="dbus-hash.c::_dbus_hash_table_remove_string"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_remove_string </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>const char * </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Removes the hash entry for the given key.
<p>
If no hash entry for the key exists, does nothing.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a2">TRUE</a> if the entry existed </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01242">1242</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, and <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>. </td>
</tr>
</table>
<a name="a24" doxytag="dbus-hash.c::_dbus_hash_table_remove_two_strings"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_remove_two_strings </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>const char * </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Removes the hash entry for the given key.
<p>
If no hash entry for the key exists, does nothing.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a2">TRUE</a> if the entry existed </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01270">1270</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, and <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>. </td>
</tr>
</table>
<a name="a27" doxytag="dbus-hash.c::_dbus_hash_table_remove_ulong"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> <a class="el" href="group__DBusTypes.html#a2">dbus_bool_t</a> _dbus_hash_table_remove_ulong </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname" nowrap> <em>table</em>, </td>
</tr>
<tr>
<td></td>
<td></td>
<td class="md" nowrap>unsigned long </td>
<td class="mdname" nowrap> <em>key</em></td>
</tr>
<tr>
<td></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Removes the hash entry for the given key.
<p>
If no hash entry for the key exists, does nothing.<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table. </td></tr>
<tr><td valign=top><em>key</em> </td><td>
the hash key. </td></tr>
</table>
</dl><dl compact><dt><b>
Returns: </b><dd>
<a class="el" href="group__DBusMacros.html#a2">TRUE</a> if the entry existed </dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l01357">1357</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00200">find_function</a>, and <a class="el" href="dbus-hash_8c-source.html#l00197">key_type</a>. </td>
</tr>
</table>
<a name="a3" doxytag="dbus-hash.c::_dbus_hash_table_unref"></a><p>
<table width="100%" cellpadding="2" cellspacing="0" border="0">
<tr>
<td class="md">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top"> void _dbus_hash_table_unref </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top"><a class="el" href="structDBusHashTable.html">DBusHashTable</a> * </td>
<td class="mdname1" valign="top" nowrap> <em>table</em> </td>
<td class="md" valign="top">) </td>
<td class="md" nowrap></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing=5 cellpadding=0 border=0>
<tr>
<td>
</td>
<td>
<p>
Decrements the reference count for a hash table, freeing the hash table if the count reaches zero.
<p>
<dl compact><dt><b>
Parameters: </b><dd>
<table border=0 cellspacing=2 cellpadding=0>
<tr><td valign=top><em>table</em> </td><td>
the hash table to remove a reference from. </td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="dbus-hash_8c-source.html#l00368">368</a> of file <a class="el" href="dbus-hash_8c-source.html">dbus-hash.c</a>.
<p>
References <a class="el" href="dbus-hash_8c-source.html#l00170">buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00205">entry_pool</a>, <a class="el" href="dbus-hash_8c-source.html#l00178">n_buckets</a>, <a class="el" href="dbus-hash_8c-source.html#l00144">DBusHashEntry::next</a>, <a class="el" href="dbus-hash_8c-source.html#l00168">refcount</a>, and <a class="el" href="dbus-hash_8c-source.html#l00175">static_buckets</a>. </td>
</tr>
</table>
<hr><address align="right"><small>Generated on Wed Jun 9 05:01:27 2004 for D-BUS by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border=0
width=110 height=53></a>1.2.15 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2007.0
>
x86_64
>
media
>
main-release
>
by-pkgid
>
926d2d1e3111287cee1b0a4fad4fb4f6
>
files
>
174
