mirror of
https://gitlab.gnome.org/GNOME/libxml2.git
synced 2025-10-21 14:53:44 +03:00
Added informations about xml2-config in the FAQ, Daniel
This commit is contained in:
Daniel Veillard
@@ -123,29 +123,34 @@ void <a href="libxml-hash.html#xmlHashScanFull3">xmlHashScanFull3</a>
|
||||
|
||||
</p></div><div class="refsect1" lang="en"><h2>Details</h2><div class="refsect2" lang="en"><h3><a name="xmlHashTable"></a>struct xmlHashTable</h3><pre class="programlisting">struct xmlHashTable;</pre><p>
|
||||
|
||||
</p></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashTablePtr"></a>xmlHashTablePtr</h3><pre class="programlisting">typedef xmlHashTable *xmlHashTablePtr;
|
||||
</pre><p>
|
||||
</p></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashTablePtr"></a>xmlHashTablePtr</h3><p>
|
||||
|
||||
</p></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashDeallocator"></a>xmlHashDeallocator ()</h3><pre class="programlisting">void (*xmlHashDeallocator) (void *payload,
|
||||
<a href="libxml-tree.html#xmlChar">xmlChar</a> *name);</pre><p>
|
||||
Callback to free data from a hash.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td> the data in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name associated
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashCopier"></a>xmlHashCopier ()</h3><pre class="programlisting">void* (*xmlHashCopier) (void *payload,
|
||||
<a href="libxml-tree.html#xmlChar">xmlChar</a> *name);</pre><p>
|
||||
Callback to copy data from a hash.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td> the data in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name associated
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashScanner"></a>xmlHashScanner ()</h3><pre class="programlisting">void (*xmlHashScanner) (void *payload,
|
||||
void *data,
|
||||
<a href="libxml-tree.html#xmlChar">xmlChar</a> *name);</pre><p>
|
||||
Callback when scanning data in a hash with the simple scanner.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td> the data in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td> extra scannner data
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name associated
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashScannerFull"></a>xmlHashScannerFull ()</h3><pre class="programlisting">void (*xmlHashScannerFull) (void *payload,
|
||||
void *data,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
@@ -153,33 +158,41 @@ Callback when scanning data in a hash with the simple scanner.</p><p>
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name3);</pre><p>
|
||||
Callback when scanning data in a hash with the full scanner.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td> the data in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td> extra scannner data
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name associated
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> the second name associated
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> the third name associated
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>payload</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashCreate"></a>xmlHashCreate ()</h3><pre class="programlisting"><a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> xmlHashCreate (int size);</pre><p>
|
||||
Create a new xmlHashTablePtr.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>size</tt></i><EFBFBD>:</span></td><td> the size of the hash table
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>the newly created object, or NULL if an error occured.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>size</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashFree"></a>xmlHashFree ()</h3><pre class="programlisting">void xmlHashFree (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
<a href="libxml-hash.html#xmlHashDeallocator">xmlHashDeallocator</a> f);</pre><p>
|
||||
Free the hash <i><tt>table</tt></i> and its contents. The userdata is
|
||||
deallocated with <i><tt>f</tt></i> if provided.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for items in the hash
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashAddEntry"></a>xmlHashAddEntry ()</h3><pre class="programlisting">int xmlHashAddEntry (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
void *userdata);</pre><p>
|
||||
Add the <i><tt>userdata</tt></i> to the hash <i><tt>table</tt></i>. This can later be retrieved
|
||||
by using the <i><tt>name</tt></i>. Duplicate names generate errors.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td> a pointer to the userdata
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 the addition succeeded and -1 in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashUpdateEntry"></a>xmlHashUpdateEntry ()</h3><pre class="programlisting">int xmlHashUpdateEntry (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
void *userdata,
|
||||
@@ -188,11 +201,13 @@ Add the <i><tt>userdata</tt></i> to the hash <i><tt>table</tt></i>. This can lat
|
||||
by using the <i><tt>name</tt></i>. Existing entry for this <i><tt>name</tt></i> will be removed
|
||||
and freed with <i><tt>f</tt></i> if found.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td> a pointer to the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for replaced item (if any)
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 the addition succeeded and -1 in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashAddEntry2"></a>xmlHashAddEntry2 ()</h3><pre class="programlisting">int xmlHashAddEntry2 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -200,11 +215,13 @@ and freed with <i><tt>f</tt></i> if found.</p><p>
|
||||
Add the <i><tt>userdata</tt></i> to the hash <i><tt>table</tt></i>. This can later be retrieved
|
||||
by using the (<i><tt>name</tt></i>, <i><tt>name2</tt></i>) tuple. Duplicate tuples generate errors.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td> a pointer to the userdata
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 the addition succeeded and -1 in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashUpdateEntry2"></a>xmlHashUpdateEntry2 ()</h3><pre class="programlisting">int xmlHashUpdateEntry2 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -214,12 +231,14 @@ Add the <i><tt>userdata</tt></i> to the hash <i><tt>table</tt></i>. This can lat
|
||||
by using the (<i><tt>name</tt></i>, <i><tt>name2</tt></i>) tuple. Existing entry for this tuple will
|
||||
be removed and freed with <i><tt>f</tt></i> if found.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td> a pointer to the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for replaced item (if any)
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 the addition succeeded and -1 in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashAddEntry3"></a>xmlHashAddEntry3 ()</h3><pre class="programlisting">int xmlHashAddEntry3 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -229,12 +248,14 @@ Add the <i><tt>userdata</tt></i> to the hash <i><tt>table</tt></i>. This can lat
|
||||
by using the tuple (<i><tt>name</tt></i>, <i><tt>name2</tt></i>, <i><tt>name3</tt></i>). Duplicate entries generate
|
||||
errors.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> a third name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td> a pointer to the userdata
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 the addition succeeded and -1 in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashUpdateEntry3"></a>xmlHashUpdateEntry3 ()</h3><pre class="programlisting">int xmlHashUpdateEntry3 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -245,13 +266,15 @@ Add the <i><tt>userdata</tt></i> to the hash <i><tt>table</tt></i>. This can lat
|
||||
by using the tuple (<i><tt>name</tt></i>, <i><tt>name2</tt></i>, <i><tt>name3</tt></i>). Existing entry for this tuple
|
||||
will be removed and freed with <i><tt>f</tt></i> if found.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> a third name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td> a pointer to the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for replaced item (if any)
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 the addition succeeded and -1 in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>userdata</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashRemoveEntry"></a>xmlHashRemoveEntry ()</h3><pre class="programlisting">int xmlHashRemoveEntry (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
<a href="libxml-hash.html#xmlHashDeallocator">xmlHashDeallocator</a> f);</pre><p>
|
||||
@@ -259,10 +282,12 @@ Find the userdata specified by the <i><tt>name</tt></i> and remove
|
||||
it from the hash <i><tt>table</tt></i>. Existing userdata for this tuple will be removed
|
||||
and freed with <i><tt>f</tt></i>.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for removed item (if any)
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 if the removal succeeded and -1 in case of error or not found.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashRemoveEntry2"></a>xmlHashRemoveEntry2 ()</h3><pre class="programlisting">int xmlHashRemoveEntry2 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -271,11 +296,13 @@ Find the userdata specified by the (<i><tt>name</tt></i>, <i><tt>name2</tt></i>)
|
||||
it from the hash <i><tt>table</tt></i>. Existing userdata for this tuple will be removed
|
||||
and freed with <i><tt>f</tt></i>.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for removed item (if any)
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 if the removal succeeded and -1 in case of error or not found.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashRemoveEntry3"></a>xmlHashRemoveEntry3 ()</h3><pre class="programlisting">int xmlHashRemoveEntry3 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -285,57 +312,70 @@ Find the userdata specified by the (<i><tt>name</tt></i>, <i><tt>name2</tt></i>,
|
||||
it from the hash <i><tt>table</tt></i>. Existing userdata for this tuple will be removed
|
||||
and freed with <i><tt>f</tt></i>.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> a third name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the deallocator function for removed item (if any)
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>0 if the removal succeeded and -1 in case of error or not found.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashLookup"></a>xmlHashLookup ()</h3><pre class="programlisting">void* xmlHashLookup (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name);</pre><p>
|
||||
Find the userdata specified by the <i><tt>name</tt></i>.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashLookup2"></a>xmlHashLookup2 ()</h3><pre class="programlisting">void* xmlHashLookup2 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2);</pre><p>
|
||||
Find the userdata specified by the (<i><tt>name</tt></i>, <i><tt>name2</tt></i>) tuple.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashLookup3"></a>xmlHashLookup3 ()</h3><pre class="programlisting">void* xmlHashLookup3 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name3);</pre><p>
|
||||
Find the userdata specified by the (<i><tt>name</tt></i>, <i><tt>name2</tt></i>, <i><tt>name3</tt></i>) tuple.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> a third name of the userdata
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashCopy"></a>xmlHashCopy ()</h3><pre class="programlisting"><a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> xmlHashCopy (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
<a href="libxml-hash.html#xmlHashCopier">xmlHashCopier</a> f);</pre><p>
|
||||
Scan the hash <i><tt>table</tt></i> and applied <i><tt>f</tt></i> to each value.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the copier function for items in the hash
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>the new table or NULL in case of error.
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashSize"></a>xmlHashSize ()</h3><pre class="programlisting">int xmlHashSize (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table);</pre><p>
|
||||
Query the number of elements installed in the hash <i><tt>table</tt></i>.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>the number of elements in the hash table or
|
||||
-1 in case of error
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><span class="emphasis"><em>Returns</em></span> :</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashScan"></a>xmlHashScan ()</h3><pre class="programlisting">void xmlHashScan (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
<a href="libxml-hash.html#xmlHashScanner">xmlHashScanner</a> f,
|
||||
void *data);</pre><p>
|
||||
Scan the hash <i><tt>table</tt></i> and applied <i><tt>f</tt></i> to each value.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the scanner function for items in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td> extra data passed to f
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashScan3"></a>xmlHashScan3 ()</h3><pre class="programlisting">void xmlHashScan3 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -346,20 +386,24 @@ Scan the hash <i><tt>table</tt></i> and applied <i><tt>f</tt></i> to each value
|
||||
(<i><tt>name</tt></i>, <i><tt>name2</tt></i>, <i><tt>name3</tt></i>) tuple. If one of the names is null,
|
||||
the comparison is considered to match.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata or NULL
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata or NULL
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> a third name of the userdata or NULL
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the scanner function for items in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td> extra data passed to f
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashScanFull"></a>xmlHashScanFull ()</h3><pre class="programlisting">void xmlHashScanFull (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
<a href="libxml-hash.html#xmlHashScannerFull">xmlHashScannerFull</a> f,
|
||||
void *data);</pre><p>
|
||||
Scan the hash <i><tt>table</tt></i> and applied <i><tt>f</tt></i> to each value.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the scanner function for items in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td> extra data passed to f
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div><hr xmlns="http://www.w3.org/TR/xhtml1/transitional"></hr><div class="refsect2" lang="en"><h3><a name="xmlHashScanFull3"></a>xmlHashScanFull3 ()</h3><pre class="programlisting">void xmlHashScanFull3 (<a href="libxml-hash.html#xmlHashTablePtr">xmlHashTablePtr</a> table,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name,
|
||||
const <a href="libxml-tree.html#xmlChar">xmlChar</a> *name2,
|
||||
@@ -370,10 +414,12 @@ Scan the hash <i><tt>table</tt></i> and applied <i><tt>f</tt></i> to each value
|
||||
(<i><tt>name</tt></i>, <i><tt>name2</tt></i>, <i><tt>name3</tt></i>) tuple. If one of the names is null,
|
||||
the comparison is considered to match.</p><p>
|
||||
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td> the hash table
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td> the name of the userdata or NULL
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td> a second name of the userdata or NULL
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td> a third name of the userdata or NULL
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td> the scanner function for items in the hash
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td> extra data passed to f
|
||||
</p><div class="variablelist"><table border="0"><col align="left" valign="top"><tbody><tr><td><span class="term"><i><tt>table</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name2</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>name3</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>f</tt></i><EFBFBD>:</span></td><td>
|
||||
</td></tr><tr><td><span class="term"><i><tt>data</tt></i><EFBFBD>:</span></td><td>
|
||||
|
||||
|
||||
</td></tr></tbody></table></div></div></div></div><table xmlns="http://www.w3.org/TR/xhtml1/transitional" class="navigation" width="100%" summary="Navigation footer" cellpadding="2" cellspacing="0"><tr valign="middle"><td align="left"><a accesskey="p" href="libxml-encoding.html"><b><<<EFBFBD>encoding</b></a></td><td align="right"><a accesskey="n" href="libxml-debugXML.html"><b>debugXML<EFBFBD>>></b></a></td></tr></table></body></html>
|
||||
|
||||
Reference in New Issue
Block a user