1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200
|
<!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"/>
<title>polylib: ranking.h File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</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 class="tabs">
<ul>
<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>
<div class="contents">
<h1>ranking.h File Reference</h1><code>#include <<a class="el" href="polylib_8h_source.html">polylib/polylib.h</a>></code><br/>
<p><a href="ranking_8h_source.html">Go to the source code of this file.</a></p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td colspan="2"><h2>Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="ranking_8h.html#a1bcb45db9576a3016be0eab5d32f4741">LexSmaller</a> (<a class="el" href="structpolyhedron.html">Polyhedron</a> *P, <a class="el" href="structpolyhedron.html">Polyhedron</a> *D, unsigned dim, <a class="el" href="structpolyhedron.html">Polyhedron</a> *C, unsigned MAXRAYS)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J. <a href="#a1bcb45db9576a3016be0eab5d32f4741"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="struct__enumeration.html">Enumeration</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="ranking_8h.html#a89beba033ab097fc0bda2e685d292d0b">Polyhedron_LexSmallerEnumerate</a> (<a class="el" href="structpolyhedron.html">Polyhedron</a> *P, <a class="el" href="structpolyhedron.html">Polyhedron</a> *D, unsigned dim, <a class="el" href="structpolyhedron.html">Polyhedron</a> *C, unsigned MAXRAYS)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns the number of points in P that are lexicographically smaller than a given point in D. <a href="#a89beba033ab097fc0bda2e685d292d0b"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="struct__enumeration.html">Enumeration</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="ranking_8h.html#af8c8c703fc5a2eb9572decbce6a8f09b">Polyhedron_Ranking</a> (<a class="el" href="structpolyhedron.html">Polyhedron</a> *P, <a class="el" href="structpolyhedron.html">Polyhedron</a> *C, unsigned MAXRAYS)</td></tr>
</table>
<hr/><h2>Function Documentation</h2>
<a class="anchor" id="a1bcb45db9576a3016be0eab5d32f4741"></a><!-- doxytag: member="ranking.h::LexSmaller" ref="a1bcb45db9576a3016be0eab5d32f4741" args="(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="structpolyhedron.html">Polyhedron</a>* LexSmaller </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>P</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>D</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"> <em>dim</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>C</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"> <em>MAXRAYS</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J. </p>
<dl class="author"><dt><b>Author:</b></dt><dd>B. Meister <<a href="mailto:meister@icps.u-strasbg.fr">meister@icps.u-strasbg.fr</a>> 6/2005 LSIIT-ICPS, UMR 7005 CNRS Universit� Louis Pasteur HiPEAC Network</dd></dl>
<p>Tools to compute the ranking function of an iteration J: the number of integer points in P that are lexicographically inferior to J.</p>
<p>Meister 6/2005 LSIIT-ICPS, UMR 7005 CNRS Universit� Louis Pasteur HiPEAC Network Returns a list of polytopes needed to compute the number of points in P that are lexicographically smaller than a given point in D. Only the first dim dimensions are taken into account for computing the lexsmaller relation. The remaining variables are assumed to be extra existential/control variables. When P == D, this is the conventional ranking function. P and D are assumed to have the same parameter domain C.</p>
<p>The first <a class="el" href="structpolyhedron.html">polyhedron</a> in the list returned is the updated context: a combination of D and C or an extended C.</p>
<p>The order of the variables in the remaining polyhedra is</p>
<ul>
<li>first dim variables of P</li>
<li>existential variables of P</li>
<li>existential variables of D</li>
<li>first dim variables of D</li>
<li>the parameters </li>
</ul>
<p>Definition at line <a class="el" href="ranking_8c_source.html#l00051">51</a> of file <a class="el" href="ranking_8c_source.html">ranking.c</a>.</p>
<p>References <a class="el" href="assert_8h_source.html#l00026">assert</a>, <a class="el" href="types_8h_source.html#l00111">polyhedron::Constraint</a>, <a class="el" href="polyhedron_8c_source.html#l01906">Constraints2Polyhedron()</a>, <a class="el" href="types_8h_source.html#l00110">polyhedron::Dimension</a>, <a class="el" href="matrix_8c_source.html#l00045">Matrix_Alloc()</a>, <a class="el" href="Matop_8c_source.html#l00118">Matrix_Copy()</a>, <a class="el" href="matrix_8c_source.html#l00092">Matrix_Free()</a>, <a class="el" href="types_8h_source.html#l00092">matrix::NbColumns</a>, <a class="el" href="types_8h_source.html#l00110">polyhedron::NbConstraints</a>, <a class="el" href="types_8h_source.html#l00092">matrix::NbRows</a>, <a class="el" href="types_8h_source.html#l00115">polyhedron::next</a>, <a class="el" href="types_8h_source.html#l00093">matrix::p</a>, <a class="el" href="polyhedron_8h_source.html#l00022">POL_ENSURE_INEQUALITIES</a>, <a class="el" href="types_8h_source.html#l00082">POL_NO_DUAL</a>, <a class="el" href="matrix__addon_8h_source.html#l00032">show_matrix</a>, <a class="el" href="source_2arith_2arithmetique_8h_source.html#l00459">value_assign</a>, <a class="el" href="source_2arith_2arithmetique_8h_source.html#l00460">value_set_si</a>, and <a class="el" href="vector_8c_source.html#l00269">Vector_Copy()</a>.</p>
<p>Referenced by <a class="el" href="ranking_8c_source.html#l00192">Polyhedron_LexSmallerEnumerate()</a>.</p>
</div>
</div>
<a class="anchor" id="a89beba033ab097fc0bda2e685d292d0b"></a><!-- doxytag: member="ranking.h::Polyhedron_LexSmallerEnumerate" ref="a89beba033ab097fc0bda2e685d292d0b" args="(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="struct__enumeration.html">Enumeration</a>* Polyhedron_LexSmallerEnumerate </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>P</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>D</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"> <em>dim</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>C</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"> <em>MAXRAYS</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Returns the number of points in P that are lexicographically smaller than a given point in D. </p>
<p>Only the first dim dimensions are taken into account for computing the lexsmaller relation. The remaining variables are assumed to be extra existential/control variables. When P == D, this is the conventional ranking function. P and D are assumed to have the same parameter domain C. The variables in the Enumeration correspond to the first dim variables in D followed by the parameters of D (the variables of C). </p>
<p>Definition at line <a class="el" href="ranking_8c_source.html#l00192">192</a> of file <a class="el" href="ranking_8c_source.html">ranking.c</a>.</p>
<p>References <a class="el" href="ext__ehrhart_8c_source.html#l00702">Domain_Enumerate()</a>, <a class="el" href="polyhedron_8c_source.html#l01616">Domain_Free()</a>, <a class="el" href="ranking_8c_source.html#l00051">LexSmaller()</a>, <a class="el" href="types_8h_source.html#l00115">polyhedron::next</a>, and <a class="el" href="polyhedron_8c_source.html#l01603">Polyhedron_Free()</a>.</p>
<p>Referenced by <a class="el" href="ehrhart__ranking_8c_source.html#l00027">main()</a>, and <a class="el" href="ranking_8c_source.html#l00223">Polyhedron_Ranking()</a>.</p>
</div>
</div>
<a class="anchor" id="af8c8c703fc5a2eb9572decbce6a8f09b"></a><!-- doxytag: member="ranking.h::Polyhedron_Ranking" ref="af8c8c703fc5a2eb9572decbce6a8f09b" args="(Polyhedron *P, Polyhedron *C, unsigned MAXRAYS)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="struct__enumeration.html">Enumeration</a>* Polyhedron_Ranking </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>P</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structpolyhedron.html">Polyhedron</a> * </td>
<td class="paramname"> <em>C</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"> <em>MAXRAYS</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Definition at line <a class="el" href="ranking_8c_source.html#l00223">223</a> of file <a class="el" href="ranking_8c_source.html">ranking.c</a>.</p>
<p>References <a class="el" href="types_8h_source.html#l00110">polyhedron::Dimension</a>, and <a class="el" href="ranking_8c_source.html#l00192">Polyhedron_LexSmallerEnumerate()</a>.</p>
</div>
</div>
</div>
<hr size="1"/><address style="text-align: right;"><small>Generated on Wed Nov 25 17:45:27 2009 for polylib by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
</body>
</html>
|