<a href="config_8hh.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Voro++, a 3D cell-based Voronoi library</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// These constants set the initial memory allocation for the Voronoi cell</span><span class="comment"></span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">/** The initial memory allocation for the number of vertices. */</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">/** The initial memory allocation for the maximum vertex order. */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">/** The initial memory allocation for the number of regular vertices of order</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">/** The initial memory allocation for the number of vertices of higher order.</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">/** The initial buffer size for marginal cases used by the suretest class. */</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">/** The initial size for the delete stack. */</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">/** The initial size for the auxiliary delete stack. */</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">/** The initial size for the wall pointer array. */</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">/** The default initial size for the ordering class. */</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">/** The initial size of the pre_container chunk index. */</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// If the initial memory is too small, the program dynamically allocates more.</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// However, if the limits below are reached, then the program bails out.</span><span class="comment"></span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">/** The maximum memory allocation for the number of vertices. */</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">/** The maximum memory allocation for the maximum vertex order. */</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">/** The maximum memory allocation for the any particular order of vertex. */</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">/** The maximum buffer size for marginal cases used by the suretest class. */</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">/** The maximum size for the delete stack. */</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** The maximum size for the auxiliary delete stack. */</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">/** The maximum amount of particle memory allocated for a single region. */</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">/** The maximum size for the wall pointer array. */</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">/** The maximum size for the ordering class. */</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">/** The maximum size for the pre_container chunk index. */</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">/** The chunk size in the pre_container classes. */</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"></span><span class="comment">/** Voro++ can print a number of different status and debugging messages to</span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * notify the user of special behavior, and this macro sets the amount which</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * are displayed. At level 0, no messages are printed. At level 1, messages</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * about unusual cases during cell construction are printed, such as when the</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * plane routine bails out due to floating point problems. At level 2, general</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * messages about memory expansion are printed. At level 3, technical details</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * about memory management are printed. */</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">/** If a point is within this distance of a cutting plane, then the code</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * assumes that point exactly lies on the plane. */</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">/** If a point is within this distance of a cutting plane, then the code stores</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * whether this point is inside, outside, or exactly on the cutting plane in</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * the marginal cases buffer, to prevent the test giving a different result on</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * a subsequent evaluation due to floating point rounding errors. */</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">/** The square of the tolerance, used when deciding whether some squared</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * quantities are large enough to be used. */</span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">/** A large number that is used in the computation. */</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">/** A radius to use as a placeholder when no other information is available. */</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">/** The maximum number of shells of periodic images to test over. */</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment">/** A guess for the optimal number of particles per block, used to set up the</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">/** If this is set to 1, then the code reports any instances of particles being</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> * put outside of the container geometry. */</span></div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">/** Voro++ returns this status code if there is a file-related error, such as</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * not being able to open file. */</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">/** Voro++ returns this status code if there is a memory allocation error, if</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * one of the safe memory limits is exceeded. */</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment">/** Voro++ returns this status code if there is any type of internal error, if</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * it detects that representation of the Voronoi cell is inconsistent. This</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> * status code will generally indicate a bug, and the developer should be</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">/** Voro++ returns this status code if it could not interpret the command line</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * arguments passed to the command line utility. */</span></div>