📄 set_8h.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>C Algorithms: set.h File Reference</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.4 --><div class="qindex"><a class="qindex" href="index.html">Main Page</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="globals.html">Globals</a></div><h1>set.h File Reference</h1>Set of values. <a href="#_details">More...</a><p><table border="0" cellpadding="0" cellspacing="0"><tr><td></td></tr><tr><td colspan="2"><br><h2>Typedefs</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef _Set </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a0">Set</a></td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Represents a set of data. <a href="#a0"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef unsigned long(* </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a1">SetHashFunc</a> )(void *data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Hash function. <a href="#a1"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef int(* </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a2">SetEqualFunc</a> )(void *data1, void *data2)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Equality function. <a href="#a2"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef void *(* </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a3">SetCopyFunc</a> )(void *data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Copy function. <a href="#a3"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef void(* </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a4">SetIterator</a> )(void *data, void *user_data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Set iterator. <a href="#a4"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">typedef void(* </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a5">SetFreeFunc</a> )(void *data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Function used to free values stored in a set. <a href="#a5"></a><br></td></tr><tr><td colspan="2"><br><h2>Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="set_8h.html#a0">Set</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a6">set_new</a> (<a class="el" href="set_8h.html#a1">SetHashFunc</a> hash_func, <a class="el" href="set_8h.html#a2">SetEqualFunc</a> equal_func)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Create a new set. <a href="#a6"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a7">set_free</a> (<a class="el" href="set_8h.html#a0">Set</a> *set)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Destroy a set. <a href="#a7"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a8">set_register_free_function</a> (<a class="el" href="set_8h.html#a0">Set</a> *set, <a class="el" href="set_8h.html#a5">SetFreeFunc</a> free_func)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Register a function to be called when values are removed from the set. <a href="#a8"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a9">set_insert</a> (<a class="el" href="set_8h.html#a0">Set</a> *set, void *data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Add a value to a set. <a href="#a9"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a10">set_remove</a> (<a class="el" href="set_8h.html#a0">Set</a> *set, void *data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Remove a value from a set. <a href="#a10"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a11">set_query</a> (<a class="el" href="set_8h.html#a0">Set</a> *set, void *data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Query if a particular value is in a set. <a href="#a11"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a12">set_foreach</a> (<a class="el" href="set_8h.html#a0">Set</a> *set, <a class="el" href="set_8h.html#a4">SetIterator</a> callback, void *user_data)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Iterate over all values in a set. <a href="#a12"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a13">set_num_entries</a> (<a class="el" href="set_8h.html#a0">Set</a> *set)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Retrieve the number of entries in a set. <a href="#a13"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">void ** </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a14">set_to_array</a> (<a class="el" href="set_8h.html#a0">Set</a> *set)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Create an array containing all entries in a set. <a href="#a14"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="set_8h.html#a0">Set</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a15">set_union</a> (<a class="el" href="set_8h.html#a0">Set</a> *set1, <a class="el" href="set_8h.html#a0">Set</a> *set2, <a class="el" href="set_8h.html#a3">SetCopyFunc</a> copy_func)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Perform a union of two sets. <a href="#a15"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="set_8h.html#a0">Set</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="set_8h.html#a16">set_intersection</a> (<a class="el" href="set_8h.html#a0">Set</a> *set1, <a class="el" href="set_8h.html#a0">Set</a> *set2, <a class="el" href="set_8h.html#a3">SetCopyFunc</a> copy_func)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">Perform an intersection of two sets. <a href="#a16"></a><br></td></tr></table><hr><a name="_details"></a><h2>Detailed Description</h2>Set of values. <p>A set stores a collection of values. Each value can only exist once in the set.<p>To create a new set, use <a class="el" href="set_8h.html#a6">set_new</a>. To destroy a set, use <a class="el" href="set_8h.html#a7">set_free</a>.<p>To add a value to a set, use <a class="el" href="set_8h.html#a9">set_insert</a>. To remove a value from a set, use <a class="el" href="set_8h.html#a10">set_remove</a>.<p>To find the number of entries in a set, use <a class="el" href="set_8h.html#a13">set_num_entries</a>.<p>To query if a particular value is in a set, use <a class="el" href="set_8h.html#a11">set_query</a>.<p>To iterate over all values in a set, use <a class="el" href="set_8h.html#a12">set_foreach</a>.<hr><h2>Typedef Documentation</h2><a class="anchor" name="a0"></a><!-- doxytag: member="set.h::Set" ref="a0" args="" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">typedef struct _Set <a class="el" href="set_8h.html#a0">Set</a> </td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Represents a set of data. <p>Created using the set_new function and destroyed using the set_free function.<p><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="set_8h.html#a6">set_new</a> <p><a class="el" href="set_8h.html#a7">set_free</a></dd></dl> </td> </tr></table><a class="anchor" name="a3"></a><!-- doxytag: member="set.h::SetCopyFunc" ref="a3" args=")(void *data)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">typedef void*(* <a class="el" href="set_8h.html#a3">SetCopyFunc</a>)(void *data) </td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Copy function. <p>Given a pointer to some data, return a copy of it. Used by <a class="el" href="set_8h.html#a16">set_intersection</a> and <a class="el" href="set_8h.html#a15">set_union</a>. </td> </tr></table><a class="anchor" name="a2"></a><!-- doxytag: member="set.h::SetEqualFunc" ref="a2" args=")(void *data1, void *data2)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">typedef int(* <a class="el" href="set_8h.html#a2">SetEqualFunc</a>)(void *data1, void *data2) </td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Equality function. <p>Compares two values to determine if they are equivalent. </td> </tr></table><a class="anchor" name="a5"></a><!-- doxytag: member="set.h::SetFreeFunc" ref="a5" args=")(void *data)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">typedef void(* <a class="el" href="set_8h.html#a5">SetFreeFunc</a>)(void *data) </td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Function used to free values stored in a set. <p>See <a class="el" href="set_8h.html#a8">set_register_free_function</a>. </td> </tr></table><a class="anchor" name="a1"></a><!-- doxytag: member="set.h::SetHashFunc" ref="a1" args=")(void *data)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">typedef unsigned long(* <a class="el" href="set_8h.html#a1">SetHashFunc</a>)(void *data) </td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Hash function. <p>Generates a hash key for data to be stored in a set. </td> </tr></table><a class="anchor" name="a4"></a><!-- doxytag: member="set.h::SetIterator" ref="a4" args=")(void *data, void *user_data)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">typedef void(* <a class="el" href="set_8h.html#a4">SetIterator</a>)(void *data, void *user_data) </td> </tr> </table> </td> </tr></table><table cellspacing="5" cellpadding="0" border="0"> <tr> <td> </td> <td><p>Set iterator. <p>Callback function used to iterate over values in a set. </td> </tr></table><hr><h2>Function Documentation</h2><a class="anchor" name="a12"></a><!-- doxytag: member="set.h::set_foreach" ref="a12" args="(Set *set, SetIterator callback, void *user_data)" --><p><table class="mdTable" cellpadding="2" cellspacing="0"> <tr> <td class="mdRow"> <table cellpadding="0" cellspacing="0" border="0"> <tr> <td class="md" nowrap valign="top">void set_foreach </td> <td class="md" valign="top">( </td> <td class="md" nowrap valign="top"><a class="el" href="set_8h.html#a0">Set</a> * </td> <td class="mdname" nowrap> <em>set</em>, </td> </tr> <tr> <td class="md" nowrap align="right"></td> <td class="md"></td> <td class="md" nowrap><a class="el" href="set_8h.html#a4">SetIterator</a> </td>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -