<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>libg722_1: slist.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="css.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libg722_1
 <span id="projectnumber">0.1.0</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('slist_8h_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">slist.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/* slist.h -- generalised singly linked lists</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"></span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> Copyright (C) 2000, 2004, 2009, 2011-2015 Free Software Foundation,</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> Inc.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> Written by Gary V. Vaughan, 2000</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"></span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> NOTE: The canonical source of this file is maintained with the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> GNU Libtool package. Report bugs to bug-libtool@gnu.org.</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"></span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">GNU Libltdl is free software; you can redistribute it and/or</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">modify it under the terms of the GNU Lesser General Public</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">License as published by the Free Software Foundation; either</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">version 2 of the License, or (at your option) any later version.</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"></span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">As a special exception to the GNU Lesser General Public License,</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">if you distribute this file as part of a program or library that</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">is built using GNU Libtool, you may include this file under the</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">same distribution terms that you use for the rest of that program.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">GNU Libltdl is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">GNU Lesser General Public License for more details.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">You should have received a copy of the GNU Lesser General Public</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">License along with GNU Libltdl; see the file COPYING.LIB. If not, a</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">copy can be downloaded from http://www.gnu.org/licenses/lgpl.html,</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">or obtained by writing to the Free Software Foundation, Inc.,</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">*/</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">/* A generalised list. This is deliberately transparent so that you</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> can make the NEXT field of all your chained data structures first,</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> and then cast them to '(SList *)' so that they can be manipulated</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> by this API.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> Alternatively, you can generate raw SList elements using slist_new(),</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> and put the element data in the USERDATA field. Either way you</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> get to manage the memory involved by yourself.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">*/</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#if !defined SLIST_H</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#define SLIST_H 1</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#if defined LTDL</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor"># include <libltdl/lt__glibc.h></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor"># include <libltdl/lt_system.h></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor"># define LT_SCOPE</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#include <stddef.h></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#if defined __cplusplus</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="structslist.html"> 58</a></span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structslist.html">slist</a> {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">struct </span><a class="code" href="structslist.html">slist</a> *next; <span class="comment">/* chain forward pointer*/</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> <span class="keywordtype">void</span> *userdata; <span class="comment">/* for boxed 'SList' item */</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> } <a class="code" href="structslist.html">SList</a>;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">typedef</span> <span class="keywordtype">void</span> * SListCallback (<a class="code" href="structslist.html">SList</a> *item, <span class="keywordtype">void</span> *userdata);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">typedef</span> <span class="keywordtype">int</span> SListCompare (<span class="keyword">const</span> <a class="code" href="structslist.html">SList</a> *item1, <span class="keyword">const</span> <a class="code" href="structslist.html">SList</a> *item2,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">void</span> *userdata);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_concat (<a class="code" href="structslist.html">SList</a> *head, <a class="code" href="structslist.html">SList</a> *tail);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_cons (<a class="code" href="structslist.html">SList</a> *item, <a class="code" href="structslist.html">SList</a> *<a class="code" href="structslist.html">slist</a>);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_delete (<a class="code" href="structslist.html">SList</a> *slist, <span class="keywordtype">void</span> (*delete_fct) (<span class="keywordtype">void</span> *item));</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_remove (<a class="code" href="structslist.html">SList</a> **phead, SListCallback *find,</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">void</span> *matchdata);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_reverse (<a class="code" href="structslist.html">SList</a> *slist);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_sort (<a class="code" href="structslist.html">SList</a> *slist, SListCompare *compare,</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">void</span> *userdata);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_tail (<a class="code" href="structslist.html">SList</a> *slist);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_nth (<a class="code" href="structslist.html">SList</a> *slist, <span class="keywordtype">size_t</span> n);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> LT_SCOPE <span class="keywordtype">void</span> * slist_find (<a class="code" href="structslist.html">SList</a> *slist, SListCallback *find,</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordtype">void</span> *matchdata);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> LT_SCOPE <span class="keywordtype">size_t</span> slist_length (<a class="code" href="structslist.html">SList</a> *slist);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> LT_SCOPE <span class="keywordtype">void</span> * slist_foreach (<a class="code" href="structslist.html">SList</a> *slist, SListCallback *<span class="keywordflow">foreach</span>,</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">void</span> *userdata);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> LT_SCOPE <a class="code" href="structslist.html">SList</a> *slist_box (<span class="keyword">const</span> <span class="keywordtype">void</span> *userdata);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> LT_SCOPE <span class="keywordtype">void</span> * slist_unbox (<a class="code" href="structslist.html">SList</a> *item);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor">#if defined __cplusplus</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor">#if !defined LTDL</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor"># undef LT_SCOPE</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif </span><span class="comment">/*!defined SLIST_H*/</span><span class="preprocessor"></span></div><div class="ttc" id="structslist_html"><div class="ttname"><a href="structslist.html">slist</a></div><div class="ttdef"><b>Definition:</b> slist.h:58</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_7594949b0bc11ccff0467624b372eab6.html">libltdl</a></li><li class="navelem"><a class="el" href="dir_2c696f629122c74b008f0c0b216da9f3.html">libltdl</a></li><li class="navelem"><b>slist.h</b></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.11 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
6
>
x86_64
>
media
>
core-release
>
by-pkgid
>
05fc0584f673454cc88e1c4ad77fb76b
>
files
>
183
