Page MenuHomec4science
Files F93735461

v__compute_8cc_source.html
No OneTemporary
Actions

File Metadata

Created
Sun, Dec 1, 02:03

v__compute_8cc_source.html
View Options

<!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"/>
<title>Voro++: v_compute.cc 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="doxygen.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 style="padding-left: 0.5em;">
<div id="projectname">Voro++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main&#160;Page</span></a></li>
<li><a href="annotated.html"><span>Data&#160;Structures</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&#160;List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">v_compute.cc</div> </div>
</div><!--header-->
<div class="contents">
<a href="v__compute_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Voro++, a 3D cell-based Voronoi library</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">//</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment">// Author : Chris H. Rycroft (LBL / UC Berkeley)</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment">// Email : chr@alum.mit.edu</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment">// Date : August 30th 2011</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment">/** \file v_compute.cc</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment"> * \brief Function implementantions for the voro_compute template. */</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;</div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="worklist_8hh.html" title="Header file for setting constants used in the block worklists that are used during cell computation...">worklist.hh</a>&quot;</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="v__compute_8hh.html" title="Header file for the voro_compute template and related classes.">v_compute.hh</a>&quot;</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="rad__option_8hh.html" title="Header file for the classes encapsulating functionality for the regular and radical Voronoi tessellat...">rad_option.hh</a>&quot;</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="container_8hh.html" title="Header file for the container_base and related classes.">container.hh</a>&quot;</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="container__prd_8hh.html" title="Header file for the container_periodic_base and related classes.">container_prd.hh</a>&quot;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;</div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="keyword">namespace </span>voro {</div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">/** The class constructor initializes constants from the container class, and</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment"> * sets up the mask and queue used for Voronoi computations.</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment"> * \param[in] con_ a reference to the container class to use.</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment"> * \param[in] (hx_,hy_,hz_) the size of the mask to use. */</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00023"></a><span class="lineno"><a class="code" href="classvoro_1_1voro__compute.html#a4f268f7749e431df1a54b2dd17bb090f"> 23</a></span>&#160;<a class="code" href="classvoro_1_1voro__compute.html#a4f268f7749e431df1a54b2dd17bb090f">voro_compute&lt;c_class&gt;::voro_compute</a>(c_class &amp;con_,<span class="keywordtype">int</span> hx_,<span class="keywordtype">int</span> hy_,<span class="keywordtype">int</span> hz_) :</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; con(con_), boxx(con_.boxx), boxy(con_.boxy), boxz(con_.boxz),</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; xsp(con_.xsp), ysp(con_.ysp), zsp(con_.zsp),</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; hx(hx_), hy(hy_), hz(hz_), hxy(hx_*hy_), hxyz(hxy*hz_), ps(con_.ps),</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; id(con_.id), p(con_.p), co(con_.co), bxsq(boxx*boxx+boxy*boxy+boxz*boxz),</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; mv(0), qu_size(3*(3+hxy+hz*(hx+hy))), wl(con_.wl), mrad(con_.mrad),</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; mask(new unsigned int[hxyz]), qu(new int[qu_size]), qu_l(qu+qu_size) {</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160; reset_mask();</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;}</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;<span class="comment">/** Scans all of the particles within a block to see if any of them have a</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160;<span class="comment"> * smaller distance to the given test vector. If one is found, the routine</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;<span class="comment"> * updates the minimum distance and store information about this particle.</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;<span class="comment"> * \param[in] ijk the index of the block.</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;<span class="comment"> * \param[in] (x,y,z) the test vector to consider (which may have already had a</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="comment"> * periodic displacement applied to it).</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;<span class="comment"> * \param[in] (di,dj,dk) the coordinates of the current block, to store if the</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="comment"> * particle record is updated.</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;<span class="comment"> * \param[in,out] w a reference to a particle record in which to store</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160;<span class="comment"> * information about the particle whose Voronoi cell the</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160;<span class="comment"> * vector is within.</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;<span class="comment"> * \param[in,out] mrs the current minimum distance, that may be updated if a</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160;<span class="comment"> * closer particle is found. */</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html" title="Template for carrying out Voronoi cell computations.">voro_compute&lt;c_class&gt;::scan_all</a>(<span class="keywordtype">int</span> ijk,<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">int</span> di,<span class="keywordtype">int</span> dj,<span class="keywordtype">int</span> dk,<a class="code" href="structvoro_1_1particle__record.html" title="Structure for holding information about a particle.">particle_record</a> &amp;w,<span class="keywordtype">double</span> &amp;mrs) {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keywordtype">double</span> x1,y1,z1,rs;<span class="keywordtype">bool</span> in_block=<span class="keyword">false</span>;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> l=0;l&lt;co[ijk];l++) {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; x1=p[ijk][ps*l]-x;</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; y1=p[ijk][ps*l+1]-y;</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; z1=p[ijk][ps*l+2]-z;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; rs=con.r_current_sub(x1*x1+y1*y1+z1*z1,ijk,l);</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">if</span>(rs&lt;mrs) {mrs=rs;w.<a class="code" href="structvoro_1_1particle__record.html#a5faf0f540ad3ee3ffcee5cae5a8b20fc">l</a>=l;in_block=<span class="keyword">true</span>;}</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; }</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">if</span>(in_block) {w.<a class="code" href="structvoro_1_1particle__record.html#ac65fa5fc929dda2dd454369eab68ef8b">ijk</a>=ijk;w.<a class="code" href="structvoro_1_1particle__record.html#a36ea6a17eb9dc145a3e5f14720b30d15">di</a>=di;w.<a class="code" href="structvoro_1_1particle__record.html#a25c3b01e32ccdb6bb37e279f14899bab">dj</a>=dj,w.<a class="code" href="structvoro_1_1particle__record.html#a56e78394cc8a114cedf353a2d54c0077">dk</a>=dk;}</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;}</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;<span class="comment">/** Finds the Voronoi cell that given vector is within. For containers that are</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;<span class="comment"> * not radially dependent, this corresponds to findig the particle that is</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160;<span class="comment"> * closest to the vector; for the radical tessellation containers, this</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160;<span class="comment"> * corresponds to a finding the minimum weighted distance.</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160;<span class="comment"> * \param[in] (x,y,z) the vector to consider.</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160;<span class="comment"> * \param[in] (ci,cj,ck) the coordinates of the block that the test particle is</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160;<span class="comment"> * in relative to the container data structure.</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;<span class="comment"> * \param[in] ijk the index of the block that the test particle is in.</span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160;<span class="comment"> * \param[out] w a reference to a particle record in which to store information</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160;<span class="comment"> * about the particle whose Voronoi cell the vector is within.</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160;<span class="comment"> * \param[out] mrs the minimum computed distance. */</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00071"></a><span class="lineno"><a class="code" href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d"> 71</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d">voro_compute&lt;c_class&gt;::find_voronoi_cell</a>(<span class="keywordtype">double</span> x,<span class="keywordtype">double</span> y,<span class="keywordtype">double</span> z,<span class="keywordtype">int</span> ci,<span class="keywordtype">int</span> cj,<span class="keywordtype">int</span> ck,<span class="keywordtype">int</span> ijk,<a class="code" href="structvoro_1_1particle__record.html" title="Structure for holding information about a particle.">particle_record</a> &amp;w,<span class="keywordtype">double</span> &amp;mrs) {</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="keywordtype">double</span> qx=0,qy=0,qz=0,rs;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordtype">int</span> i,j,k,di,dj,dk,ei,ej,ek,f,g,disp;</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordtype">double</span> fx,fy,fz,mxs,mys,mzs,*radp;</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> q,*e,*mijk;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="comment">// Init setup for parameters to return</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; w.<a class="code" href="structvoro_1_1particle__record.html#ac65fa5fc929dda2dd454369eab68ef8b">ijk</a>=-1;mrs=large_number;</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; con.initialize_search(ci,cj,ck,ijk,i,j,k,disp);</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="comment">// Test all particles in the particle&#39;s local region first</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; scan_all(ijk,x,y,z,0,0,0,w,mrs);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="comment">// Now compute the fractional position of the particle within its</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="comment">// region and store it in (fx,fy,fz). We use this to compute an index</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="comment">// (di,dj,dk) of which subregion the particle is within.</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m1,m2;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; con.frac_pos(x,y,z,ci,cj,ck,fx,fy,fz);</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; di=int(fx*xsp*wl_fgrid);dj=int(fy*ysp*wl_fgrid);dk=int(fz*zsp*wl_fgrid);</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="comment">// The indices (di,dj,dk) tell us which worklist to use, to test the</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="comment">// blocks in the optimal order. But we only store worklists for the</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="comment">// eighth of the region where di, dj, and dk are all less than half the</span></div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="comment">// full grid. The rest of the cases are handled by symmetry. In this</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="comment">// section, we detect for these cases, by reflecting high values of di,</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="comment">// dj, and dk. For these cases, a mask is constructed in m1 and m2</span></div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="comment">// which is used to flip the worklist information when it is loaded.</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="keywordflow">if</span>(di&gt;=wl_hgrid) {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; mxs=boxx-fx;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; m1=127+(3&lt;&lt;21);m2=1+(1&lt;&lt;21);di=wl_fgrid-1-di;<span class="keywordflow">if</span>(di&lt;0) di=0;</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; } <span class="keywordflow">else</span> {m1=m2=0;mxs=fx;}</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keywordflow">if</span>(dj&gt;=wl_hgrid) {</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; mys=boxy-fy;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; m1|=(127&lt;&lt;7)+(3&lt;&lt;24);m2|=(1&lt;&lt;7)+(1&lt;&lt;24);dj=wl_fgrid-1-dj;<span class="keywordflow">if</span>(dj&lt;0) dj=0;</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; } <span class="keywordflow">else</span> mys=fy;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="keywordflow">if</span>(dk&gt;=wl_hgrid) {</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; mzs=boxz-fz;</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; m1|=(127&lt;&lt;14)+(3&lt;&lt;27);m2|=(1&lt;&lt;14)+(1&lt;&lt;27);dk=wl_fgrid-1-dk;<span class="keywordflow">if</span>(dk&lt;0) dk=0;</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; } <span class="keywordflow">else</span> mzs=fz;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160;</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="comment">// Do a quick test to account for the case when the minimum radius is</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="comment">// small enought that no other blocks need to be considered</span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; rs=con.r_max_add(mrs);</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordflow">if</span>(mxs*mxs&gt;rs&amp;&amp;mys*mys&gt;rs&amp;&amp;mzs*mzs&gt;rs) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="comment">// Now compute which worklist we are going to use, and set radp and e to</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <span class="comment">// point at the right offsets</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; ijk=di+wl_hgrid*(dj+wl_hgrid*dk);</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; radp=mrad+ijk*wl_seq_length;</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; e=(<span class="keyword">const_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>*<span class="keyword">&gt;</span> (wl))+ijk*wl_seq_length;</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="comment">// Read in how many items in the worklist can be tested without having to</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <span class="comment">// worry about writing to the mask</span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; f=e[0];g=0;</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160;</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <span class="comment">// If mrs is less than the minimum distance to any untested</span></div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="comment">// block, then we are done</span></div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <span class="keywordflow">if</span>(con.r_max_add(mrs)&lt;radp[g]) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; g++;</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160;</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="comment">// Load in a block off the worklist, permute it with the</span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="comment">// symmetry mask, and decode its position. These are all</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="comment">// integer bit operations so they should run very fast.</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; q=e[g];q^=m1;q+=m2;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; di=q&amp;127;di-=64;</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; dj=(q&gt;&gt;7)&amp;127;dj-=64;</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; dk=(q&gt;&gt;14)&amp;127;dk-=64;</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160;</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <span class="comment">// Check that the worklist position is in range</span></div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; ei=di+i;<span class="keywordflow">if</span>(ei&lt;0||ei&gt;=hx) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; ej=dj+j;<span class="keywordflow">if</span>(ej&lt;0||ej&gt;=hy) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; ek=dk+k;<span class="keywordflow">if</span>(ek&lt;0||ek&gt;=hz) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160;</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; <span class="comment">// Call the compute_min_max_radius() function. This returns</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="comment">// true if the minimum distance to the block is bigger than the</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <span class="comment">// current mrs, in which case we skip this block and move on.</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; <span class="comment">// Otherwise, it computes the maximum distance to the block and</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; <span class="comment">// returns it in crs.</span></div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; <span class="keywordflow">if</span>(compute_min_radius(di,dj,dk,fx,fy,fz,mrs)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160;</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="comment">// Now compute which region we are going to loop over, adding a</span></div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="comment">// displacement for the periodic cases</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; ijk=con.region_index(ci,cj,ck,ei,ej,ek,qx,qy,qz,disp);</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160;</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <span class="comment">// If mrs is bigger than the maximum distance to the block,</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; <span class="comment">// then we have to test all particles in the block for</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="comment">// intersections. Otherwise, we do additional checks and skip</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; <span class="comment">// those particles which can&#39;t possibly intersect the block.</span></div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; scan_all(ijk,x-qx,y-qy,z-qz,di,dj,dk,w,mrs);</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; } <span class="keywordflow">while</span>(g&lt;f);</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160;</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="comment">// Update mask value and initialize queue</span></div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; mv++;</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; <span class="keywordflow">if</span>(mv==0) {reset_mask();mv=1;}</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="keywordtype">int</span> *qu_s=qu,*qu_e=qu;</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160;</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; <span class="keywordflow">while</span>(g&lt;wl_seq_length-1) {</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160;</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; <span class="comment">// If mrs is less than the minimum distance to any untested</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; <span class="comment">// block, then we are done</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; <span class="keywordflow">if</span>(con.r_max_add(mrs)&lt;radp[g]) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; g++;</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160;</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="comment">// Load in a block off the worklist, permute it with the</span></div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <span class="comment">// symmetry mask, and decode its position. These are all</span></div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="comment">// integer bit operations so they should run very fast.</span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; q=e[g];q^=m1;q+=m2;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; di=q&amp;127;di-=64;</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; dj=(q&gt;&gt;7)&amp;127;dj-=64;</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; dk=(q&gt;&gt;14)&amp;127;dk-=64;</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160;</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="comment">// Compute the position in the mask of the current block. If</span></div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; <span class="comment">// this lies outside the mask, then skip it. Otherwise, mark</span></div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <span class="comment">// it.</span></div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; ei=di+i;<span class="keywordflow">if</span>(ei&lt;0||ei&gt;=hx) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; ej=dj+j;<span class="keywordflow">if</span>(ej&lt;0||ej&gt;=hy) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; ek=dk+k;<span class="keywordflow">if</span>(ek&lt;0||ek&gt;=hz) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; mijk=mask+ei+hx*(ej+hy*ek);</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; *mijk=mv;</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160;</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="comment">// Skip this block if it is further away than the current</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="comment">// minimum radius</span></div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; <span class="keywordflow">if</span>(compute_min_radius(di,dj,dk,fx,fy,fz,mrs)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160;</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="comment">// Now compute which region we are going to loop over, adding a</span></div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="comment">// displacement for the periodic cases</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; ijk=con.region_index(ci,cj,ck,ei,ej,ek,qx,qy,qz,disp);</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; scan_all(ijk,x-qx,y-qy,z-qz,di,dj,dk,w,mrs);</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; <span class="keywordflow">if</span>(qu_e&gt;qu_l-18) add_list_memory(qu_s,qu_e);</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; scan_bits_mask_add(q,mijk,ei,ej,ek,qu_e);</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; }</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160;</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <span class="comment">// Do a check to see if we&#39;ve reached the radius cutoff</span></div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; <span class="keywordflow">if</span>(con.r_max_add(mrs)&lt;radp[g]) <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160;</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; <span class="comment">// We were unable to completely compute the cell based on the blocks in</span></div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <span class="comment">// the worklist, so now we have to go block by block, reading in items</span></div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="comment">// off the list</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="keywordflow">while</span>(qu_s!=qu_e) {</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160;</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <span class="comment">// Read the next entry of the queue</span></div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <span class="keywordflow">if</span>(qu_s==qu_l) qu_s=qu;</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; ei=*(qu_s++);ej=*(qu_s++);ek=*(qu_s++);</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; di=ei-i;dj=ej-j;dk=ek-k;</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keywordflow">if</span>(compute_min_radius(di,dj,dk,fx,fy,fz,mrs)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160;</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; ijk=con.region_index(ci,cj,ck,ei,ej,ek,qx,qy,qz,disp);</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; scan_all(ijk,x-qx,y-qy,z-qz,di,dj,dk,w,mrs);</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160;</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <span class="comment">// Test the neighbors of the current block, and add them to the</span></div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; <span class="comment">// block list if they haven&#39;t already been tested</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="keywordflow">if</span>((qu_s&lt;=qu_e?(qu_l-qu_e)+(qu_s-qu):qu_s-qu_e)&lt;18) add_list_memory(qu_s,qu_e);</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; add_to_mask(ei,ej,ek,qu_e);</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; }</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160;}</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160;<span class="comment">/** Scans the six orthogonal neighbors of a given block and adds them to the</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160;<span class="comment"> * queue if they haven&#39;t been considered already. It assumes that the queue</span></div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160;<span class="comment"> * will definitely have enough memory to add six entries at the end.</span></div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160;<span class="comment"> * \param[in] (ei,ej,ek) the block to consider.</span></div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160;<span class="comment"> * \param[in,out] qu_e a pointer to the end of the queue. */</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html" title="Template for carrying out Voronoi cell computations.">voro_compute&lt;c_class&gt;::add_to_mask</a>(<span class="keywordtype">int</span> ei,<span class="keywordtype">int</span> ej,<span class="keywordtype">int</span> ek,<span class="keywordtype">int</span> *&amp;qu_e) {</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *mijk=mask+ei+hx*(ej+hy*ek);</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; <span class="keywordflow">if</span>(ek&gt;0) <span class="keywordflow">if</span>(*(mijk-hxy)!=mv) {<span class="keywordflow">if</span>(qu_e==qu_l) qu_e=qu;*(mijk-hxy)=mv;*(qu_e++)=ei;*(qu_e++)=ej;*(qu_e++)=ek-1;}</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <span class="keywordflow">if</span>(ej&gt;0) <span class="keywordflow">if</span>(*(mijk-hx)!=mv) {<span class="keywordflow">if</span>(qu_e==qu_l) qu_e=qu;*(mijk-hx)=mv;*(qu_e++)=ei;*(qu_e++)=ej-1;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; <span class="keywordflow">if</span>(ei&gt;0) <span class="keywordflow">if</span>(*(mijk-1)!=mv) {<span class="keywordflow">if</span>(qu_e==qu_l) qu_e=qu;*(mijk-1)=mv;*(qu_e++)=ei-1;*(qu_e++)=ej;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <span class="keywordflow">if</span>(ei&lt;hx-1) <span class="keywordflow">if</span>(*(mijk+1)!=mv) {<span class="keywordflow">if</span>(qu_e==qu_l) qu_e=qu;*(mijk+1)=mv;*(qu_e++)=ei+1;*(qu_e++)=ej;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; <span class="keywordflow">if</span>(ej&lt;hy-1) <span class="keywordflow">if</span>(*(mijk+hx)!=mv) {<span class="keywordflow">if</span>(qu_e==qu_l) qu_e=qu;*(mijk+hx)=mv;*(qu_e++)=ei;*(qu_e++)=ej+1;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; <span class="keywordflow">if</span>(ek&lt;hz-1) <span class="keywordflow">if</span>(*(mijk+hxy)!=mv) {<span class="keywordflow">if</span>(qu_e==qu_l) qu_e=qu;*(mijk+hxy)=mv;*(qu_e++)=ei;*(qu_e++)=ej;*(qu_e++)=ek+1;}</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160;}</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160;<span class="comment">/** Scans a worklist entry and adds any blocks to the queue</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160;<span class="comment"> * \param[in] (ei,ej,ek) the block to consider.</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160;<span class="comment"> * \param[in,out] qu_e a pointer to the end of the queue. */</span></div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> voro_compute&lt;c_class&gt;::scan_bits_mask_add(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> q,<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *mijk,<span class="keywordtype">int</span> ei,<span class="keywordtype">int</span> ej,<span class="keywordtype">int</span> ek,<span class="keywordtype">int</span> *&amp;qu_e) {</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> b1=1&lt;&lt;21,b2=1&lt;&lt;22,b3=1&lt;&lt;24,b4=1&lt;&lt;25,b5=1&lt;&lt;27,b6=1&lt;&lt;28;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <span class="keywordflow">if</span>((q&amp;b2)==b2) {</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; <span class="keywordflow">if</span>(ei&gt;0) {*(mijk-1)=mv;*(qu_e++)=ei-1;*(qu_e++)=ej;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; <span class="keywordflow">if</span>((q&amp;b1)==0&amp;&amp;ei&lt;hx-1) {*(mijk+1)=mv;*(qu_e++)=ei+1;*(qu_e++)=ej;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>((q&amp;b1)==b1&amp;&amp;ei&lt;hx-1) {*(mijk+1)=mv;*(qu_e++)=ei+1;*(qu_e++)=ej;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <span class="keywordflow">if</span>((q&amp;b4)==b4) {</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; <span class="keywordflow">if</span>(ej&gt;0) {*(mijk-hx)=mv;*(qu_e++)=ei;*(qu_e++)=ej-1;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160; <span class="keywordflow">if</span>((q&amp;b3)==0&amp;&amp;ej&lt;hy-1) {*(mijk+hx)=mv;*(qu_e++)=ei;*(qu_e++)=ej+1;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>((q&amp;b3)==b3&amp;&amp;ej&lt;hy-1) {*(mijk+hx)=mv;*(qu_e++)=ei;*(qu_e++)=ej+1;*(qu_e++)=ek;}</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keywordflow">if</span>((q&amp;b6)==b6) {</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; <span class="keywordflow">if</span>(ek&gt;0) {*(mijk-hxy)=mv;*(qu_e++)=ei;*(qu_e++)=ej;*(qu_e++)=ek-1;}</div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <span class="keywordflow">if</span>((q&amp;b5)==0&amp;&amp;ek&lt;hz-1) {*(mijk+hxy)=mv;*(qu_e++)=ei;*(qu_e++)=ej;*(qu_e++)=ek+1;}</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>((q&amp;b5)==b5&amp;&amp;ek&lt;hz-1) {*(mijk+hxy)=mv;*(qu_e++)=ei;*(qu_e++)=ej;*(qu_e++)=ek+1;}</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160;}</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160;<span class="comment">/** This routine computes a Voronoi cell for a single particle in the</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160;<span class="comment"> * container. It can be called by the user, but is also forms the core part of</span></div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160;<span class="comment"> * several of the main functions, such as store_cell_volumes(), print_all(),</span></div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160;<span class="comment"> * and the drawing routines. The algorithm constructs the cell by testing over</span></div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160;<span class="comment"> * the neighbors of the particle, working outwards until it reaches those</span></div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160;<span class="comment"> * particles which could not possibly intersect the cell. For maximum</span></div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160;<span class="comment"> * efficiency, this algorithm is divided into three parts. In the first</span></div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160;<span class="comment"> * section, the algorithm tests over the blocks which are in the immediate</span></div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160;<span class="comment"> * vicinity of the particle, by making use of one of the precomputed worklists.</span></div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160;<span class="comment"> * The code then continues to test blocks on the worklist, but also begins to</span></div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160;<span class="comment"> * construct a list of neighboring blocks outside the worklist which may need</span></div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160;<span class="comment"> * to be test. In the third section, the routine starts testing these</span></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160;<span class="comment"> * neighboring blocks, evaluating whether or not a particle in them could</span></div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160;<span class="comment"> * possibly intersect the cell. For blocks that intersect the cell, it tests</span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160;<span class="comment"> * the particles in that block, and then adds the block neighbors to the list</span></div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160;<span class="comment"> * of potential places to consider.</span></div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160;<span class="comment"> * \param[in,out] c a reference to a voronoicell object.</span></div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160;<span class="comment"> * \param[in] ijk the index of the block that the test particle is in.</span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160;<span class="comment"> * \param[in] s the index of the particle within the test block.</span></div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160;<span class="comment"> * \param[in] (ci,cj,ck) the coordinates of the block that the test particle is</span></div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160;<span class="comment"> * in relative to the container data structure.</span></div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160;<span class="comment"> * \return False if the Voronoi cell was completely removed during the</span></div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160;<span class="comment"> * computation and has zero volume, true otherwise. */</span></div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00291"></a><span class="lineno"><a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9"> 291</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;c_class&gt;::compute_cell</a>(v_cell &amp;c,<span class="keywordtype">int</span> ijk,<span class="keywordtype">int</span> s,<span class="keywordtype">int</span> ci,<span class="keywordtype">int</span> cj,<span class="keywordtype">int</span> ck) {</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> count_list[8]={7,11,15,19,26,35,45,59},*count_e=count_list+8;</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; <span class="keywordtype">double</span> x,y,z,x1,y1,z1,qx=0,qy=0,qz=0;</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; <span class="keywordtype">double</span> xlo,ylo,zlo,xhi,yhi,zhi,x2,y2,z2,rs;</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <span class="keywordtype">int</span> i,j,k,di,dj,dk,ei,ej,ek,f,g,l,disp;</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; <span class="keywordtype">double</span> fx,fy,fz,gxs,gys,gzs,*radp;</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> q,*e,*mijk;</div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>&#160;</div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>&#160; <span class="keywordflow">if</span>(!con.initialize_voronoicell(c,ijk,s,ci,cj,ck,i,j,k,x,y,z,disp)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>&#160; con.r_init(ijk,s);</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>&#160;</div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>&#160; <span class="comment">// Initialize the Voronoi cell to fill the entire container</span></div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>&#160; <span class="keywordtype">double</span> crs,mrs;</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160;</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160; <span class="keywordtype">int</span> next_count=3,*count_p=(<span class="keyword">const_cast&lt;</span><span class="keywordtype">int</span>*<span class="keyword">&gt;</span> (count_list));</div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160;</div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160; <span class="comment">// Test all particles in the particle&#39;s local region first</span></div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160; <span class="keywordflow">for</span>(l=0;l&lt;s;l++) {</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160; x1=p[ijk][ps*l]-x;</div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160; y1=p[ijk][ps*l+1]-y;</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160; z1=p[ijk][ps*l+2]-z;</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160; rs=con.r_scale(x1*x1+y1*y1+z1*z1,ijk,l);</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; <span class="keywordflow">if</span>(!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160; }</div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160; l++;</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160; <span class="keywordflow">while</span>(l&lt;co[ijk]) {</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160; x1=p[ijk][ps*l]-x;</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; y1=p[ijk][ps*l+1]-y;</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160; z1=p[ijk][ps*l+2]-z;</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160; rs=con.r_scale(x1*x1+y1*y1+z1*z1,ijk,l);</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160; <span class="keywordflow">if</span>(!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160; l++;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; }</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160;</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; <span class="comment">// Now compute the maximum distance squared from the cell center to a</span></div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; <span class="comment">// vertex. This is used to cut off the calculation since we only need</span></div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160; <span class="comment">// to test out to twice this range.</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160; mrs=c.max_radius_squared();</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160;</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160; <span class="comment">// Now compute the fractional position of the particle within its</span></div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160; <span class="comment">// region and store it in (fx,fy,fz). We use this to compute an index</span></div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160; <span class="comment">// (di,dj,dk) of which subregion the particle is within.</span></div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160; <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m1,m2;</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160; con.frac_pos(x,y,z,ci,cj,ck,fx,fy,fz);</div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160; di=int(fx*xsp*wl_fgrid);dj=int(fy*ysp*wl_fgrid);dk=int(fz*zsp*wl_fgrid);</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160;</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160; <span class="comment">// The indices (di,dj,dk) tell us which worklist to use, to test the</span></div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160; <span class="comment">// blocks in the optimal order. But we only store worklists for the</span></div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>&#160; <span class="comment">// eighth of the region where di, dj, and dk are all less than half the</span></div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>&#160; <span class="comment">// full grid. The rest of the cases are handled by symmetry. In this</span></div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>&#160; <span class="comment">// section, we detect for these cases, by reflecting high values of di,</span></div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>&#160; <span class="comment">// dj, and dk. For these cases, a mask is constructed in m1 and m2</span></div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>&#160; <span class="comment">// which is used to flip the worklist information when it is loaded.</span></div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>&#160; <span class="keywordflow">if</span>(di&gt;=wl_hgrid) {</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160; gxs=fx;</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; m1=127+(3&lt;&lt;21);m2=1+(1&lt;&lt;21);di=wl_fgrid-1-di;<span class="keywordflow">if</span>(di&lt;0) di=0;</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; } <span class="keywordflow">else</span> {m1=m2=0;gxs=boxx-fx;}</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; <span class="keywordflow">if</span>(dj&gt;=wl_hgrid) {</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160; gys=fy;</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160; m1|=(127&lt;&lt;7)+(3&lt;&lt;24);m2|=(1&lt;&lt;7)+(1&lt;&lt;24);dj=wl_fgrid-1-dj;<span class="keywordflow">if</span>(dj&lt;0) dj=0;</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160; } <span class="keywordflow">else</span> gys=boxy-fy;</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160; <span class="keywordflow">if</span>(dk&gt;=wl_hgrid) {</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>&#160; gzs=fz;</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160; m1|=(127&lt;&lt;14)+(3&lt;&lt;27);m2|=(1&lt;&lt;14)+(1&lt;&lt;27);dk=wl_fgrid-1-dk;<span class="keywordflow">if</span>(dk&lt;0) dk=0;</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160; } <span class="keywordflow">else</span> gzs=boxz-fz;</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160; gxs*=gxs;gys*=gys;gzs*=gzs;</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160;</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; <span class="comment">// Now compute which worklist we are going to use, and set radp and e to</span></div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160; <span class="comment">// point at the right offsets</span></div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160; ijk=di+wl_hgrid*(dj+wl_hgrid*dk);</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160; radp=mrad+ijk*wl_seq_length;</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160; e=(<span class="keyword">const_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>*<span class="keyword">&gt;</span> (wl))+ijk*wl_seq_length;</div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>&#160;</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160; <span class="comment">// Read in how many items in the worklist can be tested without having to</span></div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160; <span class="comment">// worry about writing to the mask</span></div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160; f=e[0];g=0;</div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160;</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; <span class="comment">// At the intervals specified by count_list, we recompute the</span></div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; <span class="comment">// maximum radius squared</span></div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; <span class="keywordflow">if</span>(g==next_count) {</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160; mrs=c.max_radius_squared();</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; <span class="keywordflow">if</span>(count_p!=count_e) next_count=*(count_p++);</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160; }</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160;</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; <span class="comment">// If mrs is less than the minimum distance to any untested</span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; <span class="comment">// block, then we are done</span></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(radp[g],mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160; g++;</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160;</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>&#160; <span class="comment">// Load in a block off the worklist, permute it with the</span></div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>&#160; <span class="comment">// symmetry mask, and decode its position. These are all</span></div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>&#160; <span class="comment">// integer bit operations so they should run very fast.</span></div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>&#160; q=e[g];q^=m1;q+=m2;</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>&#160; di=q&amp;127;di-=64;</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>&#160; dj=(q&gt;&gt;7)&amp;127;dj-=64;</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>&#160; dk=(q&gt;&gt;14)&amp;127;dk-=64;</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>&#160;</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>&#160; <span class="comment">// Check that the worklist position is in range</span></div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>&#160; ei=di+i;<span class="keywordflow">if</span>(ei&lt;0||ei&gt;=hx) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>&#160; ej=dj+j;<span class="keywordflow">if</span>(ej&lt;0||ej&gt;=hy) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>&#160; ek=dk+k;<span class="keywordflow">if</span>(ek&lt;0||ek&gt;=hz) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>&#160;</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>&#160; <span class="comment">// Call the compute_min_max_radius() function. This returns</span></div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>&#160; <span class="comment">// true if the minimum distance to the block is bigger than the</span></div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>&#160; <span class="comment">// current mrs, in which case we skip this block and move on.</span></div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>&#160; <span class="comment">// Otherwise, it computes the maximum distance to the block and</span></div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>&#160; <span class="comment">// returns it in crs.</span></div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160; <span class="keywordflow">if</span>(compute_min_max_radius(di,dj,dk,fx,fy,fz,gxs,gys,gzs,crs,mrs)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160;</div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>&#160; <span class="comment">// Now compute which region we are going to loop over, adding a</span></div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160; <span class="comment">// displacement for the periodic cases</span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160; ijk=con.region_index(ci,cj,ck,ei,ej,ek,qx,qy,qz,disp);</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>&#160;</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160; <span class="comment">// If mrs is bigger than the maximum distance to the block,</span></div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160; <span class="comment">// then we have to test all particles in the block for</span></div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; <span class="comment">// intersections. Otherwise, we do additional checks and skip</span></div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; <span class="comment">// those particles which can&#39;t possibly intersect the block.</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160; <span class="keywordflow">if</span>(co[ijk]&gt;0) {</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160; l=0;x2=x-qx;y2=y-qy;z2=z-qz;</div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160; <span class="keywordflow">if</span>(!con.r_ctest(crs,mrs)) {</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160; x1=p[ijk][ps*l]-x2;</div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160; y1=p[ijk][ps*l+1]-y2;</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160; z1=p[ijk][ps*l+2]-z2;</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160; rs=con.r_scale(x1*x1+y1*y1+z1*z1,ijk,l);</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160; <span class="keywordflow">if</span>(!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160; l++;</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; } <span class="keywordflow">while</span> (l&lt;co[ijk]);</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160; x1=p[ijk][ps*l]-x2;</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160; y1=p[ijk][ps*l+1]-y2;</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; z1=p[ijk][ps*l+2]-z2;</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160; rs=x1*x1+y1*y1+z1*z1;</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>&#160; <span class="keywordflow">if</span>(con.r_scale_check(rs,mrs,ijk,l)&amp;&amp;!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160; l++;</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160; } <span class="keywordflow">while</span> (l&lt;co[ijk]);</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160; }</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>&#160; }</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>&#160; } <span class="keywordflow">while</span>(g&lt;f);</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>&#160;</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>&#160; <span class="comment">// If we reach here, we were unable to compute the entire cell using</span></div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>&#160; <span class="comment">// the first part of the worklist. This section of the algorithm</span></div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>&#160; <span class="comment">// continues the worklist, but it now starts preparing the mask that we</span></div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>&#160; <span class="comment">// need if we end up going block by block. We do the same as before,</span></div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>&#160; <span class="comment">// but we put a mark down on the mask for every block that&#39;s tested.</span></div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>&#160; <span class="comment">// The worklist also contains information about which neighbors of each</span></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>&#160; <span class="comment">// block are not also on the worklist, and we start storing those</span></div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>&#160; <span class="comment">// points in a list in case we have to go block by block. Update the</span></div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>&#160; <span class="comment">// mask counter, and if it wraps around then reset the whole mask; that</span></div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>&#160; <span class="comment">// will only happen once every 2^32 tries.</span></div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>&#160; mv++;</div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>&#160; <span class="keywordflow">if</span>(mv==0) {reset_mask();mv=1;}</div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>&#160;</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>&#160; <span class="comment">// Set the queue pointers</span></div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>&#160; <span class="keywordtype">int</span> *qu_s=qu,*qu_e=qu;</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>&#160;</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>&#160; <span class="keywordflow">while</span>(g&lt;wl_seq_length-1) {</div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>&#160;</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>&#160; <span class="comment">// At the intervals specified by count_list, we recompute the</span></div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>&#160; <span class="comment">// maximum radius squared</span></div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>&#160; <span class="keywordflow">if</span>(g==next_count) {</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>&#160; mrs=c.max_radius_squared();</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>&#160; <span class="keywordflow">if</span>(count_p!=count_e) next_count=*(count_p++);</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>&#160; }</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>&#160;</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>&#160; <span class="comment">// If mrs is less than the minimum distance to any untested</span></div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>&#160; <span class="comment">// block, then we are done</span></div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(radp[g],mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>&#160; g++;</div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>&#160;</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>&#160; <span class="comment">// Load in a block off the worklist, permute it with the</span></div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>&#160; <span class="comment">// symmetry mask, and decode its position. These are all</span></div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>&#160; <span class="comment">// integer bit operations so they should run very fast.</span></div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>&#160; q=e[g];q^=m1;q+=m2;</div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>&#160; di=q&amp;127;di-=64;</div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>&#160; dj=(q&gt;&gt;7)&amp;127;dj-=64;</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>&#160; dk=(q&gt;&gt;14)&amp;127;dk-=64;</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>&#160;</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>&#160; <span class="comment">// Compute the position in the mask of the current block. If</span></div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>&#160; <span class="comment">// this lies outside the mask, then skip it. Otherwise, mark</span></div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>&#160; <span class="comment">// it.</span></div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>&#160; ei=di+i;<span class="keywordflow">if</span>(ei&lt;0||ei&gt;=hx) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>&#160; ej=dj+j;<span class="keywordflow">if</span>(ej&lt;0||ej&gt;=hy) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>&#160; ek=dk+k;<span class="keywordflow">if</span>(ek&lt;0||ek&gt;=hz) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>&#160; mijk=mask+ei+hx*(ej+hy*ek);</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>&#160; *mijk=mv;</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>&#160;</div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>&#160; <span class="comment">// Call the compute_min_max_radius() function. This returns</span></div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>&#160; <span class="comment">// true if the minimum distance to the block is bigger than the</span></div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>&#160; <span class="comment">// current mrs, in which case we skip this block and move on.</span></div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>&#160; <span class="comment">// Otherwise, it computes the maximum distance to the block and</span></div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>&#160; <span class="comment">// returns it in crs.</span></div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>&#160; <span class="keywordflow">if</span>(compute_min_max_radius(di,dj,dk,fx,fy,fz,gxs,gys,gzs,crs,mrs)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>&#160;</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>&#160; <span class="comment">// Now compute which region we are going to loop over, adding a</span></div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>&#160; <span class="comment">// displacement for the periodic cases</span></div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>&#160; ijk=con.region_index(ci,cj,ck,ei,ej,ek,qx,qy,qz,disp);</div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>&#160;</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>&#160; <span class="comment">// If mrs is bigger than the maximum distance to the block,</span></div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>&#160; <span class="comment">// then we have to test all particles in the block for</span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>&#160; <span class="comment">// intersections. Otherwise, we do additional checks and skip</span></div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>&#160; <span class="comment">// those particles which can&#39;t possibly intersect the block.</span></div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>&#160; <span class="keywordflow">if</span>(co[ijk]&gt;0) {</div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>&#160; l=0;x2=x-qx;y2=y-qy;z2=z-qz;</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>&#160; <span class="keywordflow">if</span>(!con.r_ctest(crs,mrs)) {</div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>&#160; x1=p[ijk][ps*l]-x2;</div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>&#160; y1=p[ijk][ps*l+1]-y2;</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>&#160; z1=p[ijk][ps*l+2]-z2;</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>&#160; rs=con.r_scale(x1*x1+y1*y1+z1*z1,ijk,l);</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>&#160; <span class="keywordflow">if</span>(!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>&#160; l++;</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>&#160; } <span class="keywordflow">while</span> (l&lt;co[ijk]);</div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>&#160; x1=p[ijk][ps*l]-x2;</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>&#160; y1=p[ijk][ps*l+1]-y2;</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>&#160; z1=p[ijk][ps*l+2]-z2;</div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>&#160; rs=x1*x1+y1*y1+z1*z1;</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>&#160; <span class="keywordflow">if</span>(con.r_scale_check(rs,mrs,ijk,l)&amp;&amp;!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>&#160; l++;</div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>&#160; } <span class="keywordflow">while</span> (l&lt;co[ijk]);</div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>&#160; }</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>&#160; }</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>&#160;</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>&#160; <span class="comment">// If there might not be enough memory on the list for these</span></div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>&#160; <span class="comment">// additions, then add more</span></div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>&#160; <span class="keywordflow">if</span>(qu_e&gt;qu_l-18) add_list_memory(qu_s,qu_e);</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>&#160;</div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>&#160; <span class="comment">// Test the parts of the worklist element which tell us what</span></div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>&#160; <span class="comment">// neighbors of this block are not on the worklist. Store them</span></div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>&#160; <span class="comment">// on the block list, and mark the mask.</span></div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>&#160; scan_bits_mask_add(q,mijk,ei,ej,ek,qu_e);</div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>&#160; }</div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>&#160;</div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>&#160; <span class="comment">// Do a check to see if we&#39;ve reached the radius cutoff</span></div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(radp[g],mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>&#160;</div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>&#160; <span class="comment">// We were unable to completely compute the cell based on the blocks in</span></div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>&#160; <span class="comment">// the worklist, so now we have to go block by block, reading in items</span></div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>&#160; <span class="comment">// off the list</span></div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>&#160; <span class="keywordflow">while</span>(qu_s!=qu_e) {</div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>&#160;</div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>&#160; <span class="comment">// If we reached the end of the list memory loop back to the</span></div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>&#160; <span class="comment">// start</span></div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>&#160; <span class="keywordflow">if</span>(qu_s==qu_l) qu_s=qu;</div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>&#160;</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>&#160; <span class="comment">// Read in a block off the list, and compute the upper and lower</span></div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>&#160; <span class="comment">// coordinates in each of the three dimensions</span></div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>&#160; ei=*(qu_s++);ej=*(qu_s++);ek=*(qu_s++);</div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>&#160; xlo=(ei-i)*boxx-fx;xhi=xlo+boxx;</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>&#160; ylo=(ej-j)*boxy-fy;yhi=ylo+boxy;</div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>&#160; zlo=(ek-k)*boxz-fz;zhi=zlo+boxz;</div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>&#160;</div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>&#160; <span class="comment">// Carry out plane tests to see if any particle in this block</span></div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>&#160; <span class="comment">// could possibly intersect the cell</span></div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>&#160; <span class="keywordflow">if</span>(ei&gt;i) {</div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>&#160; <span class="keywordflow">if</span>(ej&gt;j) {</div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(corner_test(c,xlo,ylo,zlo,xhi,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(corner_test(c,xlo,ylo,zhi,xhi,yhi,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(edge_z_test(c,xlo,ylo,zlo,xhi,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ej&lt;j) {</div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(corner_test(c,xlo,yhi,zlo,xhi,ylo,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(corner_test(c,xlo,yhi,zhi,xhi,ylo,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(edge_z_test(c,xlo,yhi,zlo,xhi,ylo,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(edge_y_test(c,xlo,ylo,zlo,xhi,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(edge_y_test(c,xlo,ylo,zhi,xhi,yhi,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(face_x_test(c,xlo,ylo,zlo,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>&#160; }</div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ei&lt;i) {</div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>&#160; <span class="keywordflow">if</span>(ej&gt;j) {</div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(corner_test(c,xhi,ylo,zlo,xlo,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(corner_test(c,xhi,ylo,zhi,xlo,yhi,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(edge_z_test(c,xhi,ylo,zlo,xlo,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ej&lt;j) {</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(corner_test(c,xhi,yhi,zlo,xlo,ylo,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(corner_test(c,xhi,yhi,zhi,xlo,ylo,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(edge_z_test(c,xhi,yhi,zlo,xlo,ylo,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(edge_y_test(c,xhi,ylo,zlo,xlo,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(edge_y_test(c,xhi,ylo,zhi,xlo,yhi,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(face_x_test(c,xhi,ylo,zlo,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>&#160; }</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>&#160; <span class="keywordflow">if</span>(ej&gt;j) {</div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(edge_x_test(c,xlo,ylo,zlo,xhi,yhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(edge_x_test(c,xlo,ylo,zhi,xhi,yhi,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(face_y_test(c,xlo,ylo,zlo,xhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ej&lt;j) {</div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(edge_x_test(c,xlo,yhi,zlo,xhi,ylo,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(edge_x_test(c,xlo,yhi,zhi,xhi,ylo,zlo)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>&#160; <span class="keywordflow">else</span> {<span class="keywordflow">if</span>(face_y_test(c,xlo,yhi,zlo,xhi,zhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>&#160; <span class="keywordflow">if</span>(ek&gt;k) {<span class="keywordflow">if</span>(face_z_test(c,xlo,ylo,zlo,xhi,yhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ek&lt;k) {<span class="keywordflow">if</span>(face_z_test(c,xlo,ylo,zhi,xhi,yhi)) <span class="keywordflow">continue</span>;}</div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>&#160; <span class="keywordflow">else</span> voro_fatal_error(<span class="stringliteral">&quot;Compute cell routine revisiting central block, which should never\nhappen.&quot;</span>,<a class="code" href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>&#160; }</div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>&#160; }</div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>&#160;</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>&#160; <span class="comment">// Now compute the region that we are going to test over, and</span></div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>&#160; <span class="comment">// set a displacement vector for the periodic cases</span></div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>&#160; ijk=con.region_index(ci,cj,ck,ei,ej,ek,qx,qy,qz,disp);</div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>&#160;</div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>&#160; <span class="comment">// Loop over all the elements in the block to test for cuts. It</span></div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>&#160; <span class="comment">// would be possible to exclude some of these cases by testing</span></div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>&#160; <span class="comment">// against mrs, but this will probably not save time.</span></div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>&#160; <span class="keywordflow">if</span>(co[ijk]&gt;0) {</div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>&#160; l=0;x2=x-qx;y2=y-qy;z2=z-qz;</div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>&#160; <span class="keywordflow">do</span> {</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>&#160; x1=p[ijk][ps*l]-x2;</div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>&#160; y1=p[ijk][ps*l+1]-y2;</div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>&#160; z1=p[ijk][ps*l+2]-z2;</div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>&#160; rs=con.r_scale(x1*x1+y1*y1+z1*z1,ijk,l);</div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>&#160; <span class="keywordflow">if</span>(!c.nplane(x1,y1,z1,rs,<span class="keywordtype">id</span>[ijk][l])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>&#160; l++;</div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>&#160; } <span class="keywordflow">while</span> (l&lt;co[ijk]);</div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>&#160; }</div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>&#160;</div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>&#160; <span class="comment">// If there&#39;s not much memory on the block list then add more</span></div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>&#160; <span class="keywordflow">if</span>((qu_s&lt;=qu_e?(qu_l-qu_e)+(qu_s-qu):qu_s-qu_e)&lt;18) add_list_memory(qu_s,qu_e);</div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>&#160;</div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>&#160; <span class="comment">// Test the neighbors of the current block, and add them to the</span></div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>&#160; <span class="comment">// block list if they haven&#39;t already been tested</span></div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>&#160; add_to_mask(ei,ej,ek,qu_e);</div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>&#160; }</div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>&#160;</div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>&#160;}</div>
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>&#160;<span class="comment"> * from the cell center to the block is at a corner.</span></div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>&#160;<span class="comment"> * \param[in] (xl,yl,zl) the relative coordinates of the corner of the block</span></div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>&#160;<span class="comment"> * closest to the cell center.</span></div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>&#160;<span class="comment"> * \param[in] (xh,yh,zh) the relative coordinates of the corner of the block</span></div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>&#160;<span class="comment"> * furthest away from the cell center.</span></div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html" title="Template for carrying out Voronoi cell computations.">voro_compute&lt;c_class&gt;::corner_test</a>(v_cell &amp;c,<span class="keywordtype">double</span> xl,<span class="keywordtype">double</span> yl,<span class="keywordtype">double</span> zl,<span class="keywordtype">double</span> xh,<span class="keywordtype">double</span> yh,<span class="keywordtype">double</span> zh) {</div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>&#160; con.r_prime(xl*xl+yl*yl+zl*zl);</div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(xh,yl,zl,con.r_cutoff(xl*xh+yl*yl+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xh,yh,zl,con.r_cutoff(xl*xh+yl*yh+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,yh,zl,con.r_cutoff(xl*xl+yl*yh+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,yh,zh,con.r_cutoff(xl*xl+yl*yh+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,yl,zh,con.r_cutoff(xl*xl+yl*yl+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xh,yl,zh,con.r_cutoff(xl*xh+yl*yl+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>&#160;}</div>
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>&#160;<span class="comment"> * from the cell center to the block is on an edge which points along the x</span></div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>&#160;<span class="comment"> * direction.</span></div>
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>&#160;<span class="comment"> * \param[in] (x0,x1) the minimum and maximum relative x coordinates of the</span></div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>&#160;<span class="comment"> * \param[in] (yl,zl) the relative y and z coordinates of the corner of the</span></div>
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>&#160;<span class="comment"> * block closest to the cell center.</span></div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>&#160;<span class="comment"> * \param[in] (yh,zh) the relative y and z coordinates of the corner of the</span></div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>&#160;<span class="comment"> * block furthest away from the cell center.</span></div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::edge_x_test(v_cell &amp;c,<span class="keywordtype">double</span> x0,<span class="keywordtype">double</span> yl,<span class="keywordtype">double</span> zl,<span class="keywordtype">double</span> x1,<span class="keywordtype">double</span> yh,<span class="keywordtype">double</span> zh) {</div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>&#160; con.r_prime(yl*yl+zl*zl);</div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(x0,yl,zh,con.r_cutoff(yl*yl+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,yl,zh,con.r_cutoff(yl*yl+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,yl,zl,con.r_cutoff(yl*yl+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x0,yl,zl,con.r_cutoff(yl*yl+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x0,yh,zl,con.r_cutoff(yl*yh+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,yh,zl,con.r_cutoff(yl*yh+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>&#160;}</div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>&#160;<span class="comment"> * from the cell center to the block is on an edge which points along the y</span></div>
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>&#160;<span class="comment"> * direction.</span></div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>&#160;<span class="comment"> * \param[in] (y0,y1) the minimum and maximum relative y coordinates of the</span></div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>&#160;<span class="comment"> * \param[in] (xl,zl) the relative x and z coordinates of the corner of the</span></div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>&#160;<span class="comment"> * block closest to the cell center.</span></div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>&#160;<span class="comment"> * \param[in] (xh,zh) the relative x and z coordinates of the corner of the</span></div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>&#160;<span class="comment"> * block furthest away from the cell center.</span></div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::edge_y_test(v_cell &amp;c,<span class="keywordtype">double</span> xl,<span class="keywordtype">double</span> y0,<span class="keywordtype">double</span> zl,<span class="keywordtype">double</span> xh,<span class="keywordtype">double</span> y1,<span class="keywordtype">double</span> zh) {</div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>&#160; con.r_prime(xl*xl+zl*zl);</div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(xl,y0,zh,con.r_cutoff(xl*xl+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,y1,zh,con.r_cutoff(xl*xl+zl*zh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,y1,zl,con.r_cutoff(xl*xl+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,y0,zl,con.r_cutoff(xl*xl+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xh,y0,zl,con.r_cutoff(xl*xh+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xh,y1,zl,con.r_cutoff(xl*xh+zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>&#160;}</div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>&#160;<span class="comment"> * from the cell center to the block is on an edge which points along the z</span></div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>&#160;<span class="comment"> * direction.</span></div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>&#160;<span class="comment"> * \param[in] (z0,z1) the minimum and maximum relative z coordinates of the block.</span></div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>&#160;<span class="comment"> * \param[in] (xl,yl) the relative x and y coordinates of the corner of the</span></div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>&#160;<span class="comment"> * block closest to the cell center.</span></div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>&#160;<span class="comment"> * \param[in] (xh,yh) the relative x and y coordinates of the corner of the</span></div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>&#160;<span class="comment"> * block furthest away from the cell center.</span></div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::edge_z_test(v_cell &amp;c,<span class="keywordtype">double</span> xl,<span class="keywordtype">double</span> yl,<span class="keywordtype">double</span> z0,<span class="keywordtype">double</span> xh,<span class="keywordtype">double</span> yh,<span class="keywordtype">double</span> z1) {</div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>&#160; con.r_prime(xl*xl+yl*yl);</div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(xl,yh,z0,con.r_cutoff(xl*xl+yl*yh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,yh,z1,con.r_cutoff(xl*xl+yl*yh))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,yl,z1,con.r_cutoff(xl*xl+yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,yl,z0,con.r_cutoff(xl*xl+yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xh,yl,z0,con.r_cutoff(xl*xh+yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xh,yl,z1,con.r_cutoff(xl*xh+yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>&#160;}</div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>&#160;<span class="comment"> * from the cell center to the block is on a face aligned with the x direction.</span></div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>&#160;<span class="comment"> * \param[in] xl the minimum distance from the cell center to the face.</span></div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>&#160;<span class="comment"> * \param[in] (y0,y1) the minimum and maximum relative y coordinates of the</span></div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>&#160;<span class="comment"> * \param[in] (z0,z1) the minimum and maximum relative z coordinates of the</span></div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::face_x_test(v_cell &amp;c,<span class="keywordtype">double</span> xl,<span class="keywordtype">double</span> y0,<span class="keywordtype">double</span> z0,<span class="keywordtype">double</span> y1,<span class="keywordtype">double</span> z1) {</div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>&#160; con.r_prime(xl*xl);</div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(xl,y0,z0,con.r_cutoff(xl*xl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,y0,z1,con.r_cutoff(xl*xl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,y1,z1,con.r_cutoff(xl*xl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(xl,y1,z0,con.r_cutoff(xl*xl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>&#160;}</div>
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>&#160;<span class="comment"> * from the cell center to the block is on a face aligned with the y direction.</span></div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>&#160;<span class="comment"> * \param[in] yl the minimum distance from the cell center to the face.</span></div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>&#160;<span class="comment"> * \param[in] (x0,x1) the minimum and maximum relative x coordinates of the</span></div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>&#160;<span class="comment"> * \param[in] (z0,z1) the minimum and maximum relative z coordinates of the</span></div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::face_y_test(v_cell &amp;c,<span class="keywordtype">double</span> x0,<span class="keywordtype">double</span> yl,<span class="keywordtype">double</span> z0,<span class="keywordtype">double</span> x1,<span class="keywordtype">double</span> z1) {</div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>&#160; con.r_prime(yl*yl);</div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(x0,yl,z0,con.r_cutoff(yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x0,yl,z1,con.r_cutoff(yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,yl,z1,con.r_cutoff(yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,yl,z0,con.r_cutoff(yl*yl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>&#160;}</div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>&#160;<span class="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>&#160;<span class="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>&#160;<span class="comment"> * from the cell center to the block is on a face aligned with the z direction.</span></div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>&#160;<span class="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>&#160;<span class="comment"> * \param[in] zl the minimum distance from the cell center to the face.</span></div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>&#160;<span class="comment"> * \param[in] (x0,x1) the minimum and maximum relative x coordinates of the</span></div>
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>&#160;<span class="comment"> * \param[in] (y0,y1) the minimum and maximum relative y coordinates of the</span></div>
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>&#160;<span class="comment"> * block.</span></div>
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>&#160;<span class="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> v_cell&gt;</div>
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::face_z_test(v_cell &amp;c,<span class="keywordtype">double</span> x0,<span class="keywordtype">double</span> y0,<span class="keywordtype">double</span> zl,<span class="keywordtype">double</span> x1,<span class="keywordtype">double</span> y1) {</div>
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>&#160; con.r_prime(zl*zl);</div>
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects_guess(x0,y0,zl,con.r_cutoff(zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x0,y1,zl,con.r_cutoff(zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,y1,zl,con.r_cutoff(zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>&#160; <span class="keywordflow">if</span>(c.plane_intersects(x1,y0,zl,con.r_cutoff(zl*zl))) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>&#160;}</div>
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>&#160;</div>
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>&#160;<span class="comment">/** This routine checks to see whether a point is within a particular distance</span></div>
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>&#160;<span class="comment"> * of a nearby region. If the point is within the distance of the region, then</span></div>
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>&#160;<span class="comment"> * the routine returns true, and computes the maximum distance from the point</span></div>
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>&#160;<span class="comment"> * to the region. Otherwise, the routine returns false.</span></div>
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>&#160;<span class="comment"> * \param[in] (di,dj,dk) the position of the nearby region to be tested,</span></div>
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>&#160;<span class="comment"> * relative to the region that the point is in.</span></div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>&#160;<span class="comment"> * \param[in] (fx,fy,fz) the displacement of the point within its region.</span></div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>&#160;<span class="comment"> * \param[in] (gxs,gys,gzs) the maximum squared distances from the point to the</span></div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>&#160;<span class="comment"> * sides of its region.</span></div>
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>&#160;<span class="comment"> * \param[out] crs a reference in which to return the maximum distance to the</span></div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>&#160;<span class="comment"> * region (only computed if the routine returns false).</span></div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>&#160;<span class="comment"> * \param[in] mrs the distance to be tested.</span></div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>&#160;<span class="comment"> * \return True if the region is further away than mrs, false if the region in</span></div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>&#160;<span class="comment"> * within mrs. */</span></div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>&#160;<span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::compute_min_max_radius(<span class="keywordtype">int</span> di,<span class="keywordtype">int</span> dj,<span class="keywordtype">int</span> dk,<span class="keywordtype">double</span> fx,<span class="keywordtype">double</span> fy,<span class="keywordtype">double</span> fz,<span class="keywordtype">double</span> gxs,<span class="keywordtype">double</span> gys,<span class="keywordtype">double</span> gzs,<span class="keywordtype">double</span> &amp;crs,<span class="keywordtype">double</span> mrs) {</div>
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>&#160; <span class="keywordtype">double</span> xlo,ylo,zlo;</div>
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>&#160; <span class="keywordflow">if</span>(di&gt;0) {</div>
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>&#160; xlo=di*boxx-fx;</div>
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>&#160; crs=xlo*xlo;</div>
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>&#160; <span class="keywordflow">if</span>(dj&gt;0) {</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>&#160; ylo=dj*boxy-fy;</div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>&#160; crs+=ylo*ylo;</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>&#160; crs+=bxsq+2*(boxx*xlo+boxy*ylo+boxz*zlo);</div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>&#160; crs+=bxsq+2*(boxx*xlo+boxy*ylo-boxz*zlo);</div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>&#160; crs+=boxx*(2*xlo+boxx)+boxy*(2*ylo+boxy)+gzs;</div>
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>&#160; }</div>
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dj&lt;0) {</div>
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>&#160; ylo=(dj+1)*boxy-fy;</div>
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>&#160; crs+=ylo*ylo;</div>
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>&#160; crs+=bxsq+2*(boxx*xlo-boxy*ylo+boxz*zlo);</div>
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>&#160; crs+=bxsq+2*(boxx*xlo-boxy*ylo-boxz*zlo);</div>
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>&#160; crs+=boxx*(2*xlo+boxx)+boxy*(-2*ylo+boxy)+gzs;</div>
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>&#160; }</div>
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>&#160; crs+=boxz*(2*zlo+boxz);</div>
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>&#160; crs+=boxz*(-2*zlo+boxz);</div>
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>&#160; crs+=gzs;</div>
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>&#160; }</div>
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>&#160; crs+=gys+boxx*(2*xlo+boxx);</div>
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>&#160; }</div>
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(di&lt;0) {</div>
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>&#160; xlo=(di+1)*boxx-fx;</div>
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>&#160; crs=xlo*xlo;</div>
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>&#160; <span class="keywordflow">if</span>(dj&gt;0) {</div>
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>&#160; ylo=dj*boxy-fy;</div>
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>&#160; crs+=ylo*ylo;</div>
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>&#160; crs+=bxsq+2*(-boxx*xlo+boxy*ylo+boxz*zlo);</div>
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>&#160; crs+=bxsq+2*(-boxx*xlo+boxy*ylo-boxz*zlo);</div>
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>&#160; crs+=boxx*(-2*xlo+boxx)+boxy*(2*ylo+boxy)+gzs;</div>
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>&#160; }</div>
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dj&lt;0) {</div>
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>&#160; ylo=(dj+1)*boxy-fy;</div>
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>&#160; crs+=ylo*ylo;</div>
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>&#160; crs+=bxsq+2*(-boxx*xlo-boxy*ylo+boxz*zlo);</div>
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>&#160; crs+=bxsq+2*(-boxx*xlo-boxy*ylo-boxz*zlo);</div>
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>&#160; crs+=boxx*(-2*xlo+boxx)+boxy*(-2*ylo+boxy)+gzs;</div>
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>&#160; }</div>
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>&#160; crs+=boxz*(2*zlo+boxz);</div>
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>&#160; crs+=boxz*(-2*zlo+boxz);</div>
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>&#160; crs+=gzs;</div>
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>&#160; }</div>
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>&#160; crs+=gys+boxx*(-2*xlo+boxx);</div>
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>&#160; }</div>
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>&#160; <span class="keywordflow">if</span>(dj&gt;0) {</div>
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>&#160; ylo=dj*boxy-fy;</div>
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>&#160; crs=ylo*ylo;</div>
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>&#160; crs+=boxz*(2*zlo+boxz);</div>
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>&#160; crs+=boxz*(-2*zlo+boxz);</div>
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>&#160; crs+=gzs;</div>
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>&#160; }</div>
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>&#160; crs+=boxy*(2*ylo+boxy);</div>
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dj&lt;0) {</div>
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>&#160; ylo=(dj+1)*boxy-fy;</div>
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>&#160; crs=ylo*ylo;</div>
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>&#160; zlo=dk*boxz-fz;</div>
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>&#160; crs+=boxz*(2*zlo+boxz);</div>
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>&#160; zlo=(dk+1)*boxz-fz;</div>
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>&#160; crs+=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>&#160; crs+=boxz*(-2*zlo+boxz);</div>
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>&#160; <span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>&#160; crs+=gzs;</div>
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>&#160; }</div>
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>&#160; crs+=boxy*(-2*ylo+boxy);</div>
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {</div>
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>&#160; zlo=dk*boxz-fz;crs=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>&#160; crs+=boxz*(2*zlo+boxz);</div>
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {</div>
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>&#160; zlo=(dk+1)*boxz-fz;crs=zlo*zlo;<span class="keywordflow">if</span>(con.r_ctest(crs,mrs)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>&#160; crs+=boxz*(-2*zlo+boxz);</div>
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>&#160; crs=0;</div>
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>&#160; voro_fatal_error(<span class="stringliteral">&quot;Min/max radius function called for central block, which should never\nhappen.&quot;</span>,<a class="code" href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>&#160; }</div>
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>&#160; crs+=gys;</div>
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>&#160; }</div>
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>&#160; crs+=gxs;</div>
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>&#160; }</div>
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>&#160;}</div>
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>&#160;</div>
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>&#160;<span class="keywordtype">bool</span> voro_compute&lt;c_class&gt;::compute_min_radius(<span class="keywordtype">int</span> di,<span class="keywordtype">int</span> dj,<span class="keywordtype">int</span> dk,<span class="keywordtype">double</span> fx,<span class="keywordtype">double</span> fy,<span class="keywordtype">double</span> fz,<span class="keywordtype">double</span> mrs) {</div>
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>&#160; <span class="keywordtype">double</span> t,crs;</div>
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>&#160;</div>
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>&#160; <span class="keywordflow">if</span>(di&gt;0) {t=di*boxx-fx;crs=t*t;}</div>
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(di&lt;0) {t=(di+1)*boxx-fx;crs=t*t;}</div>
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>&#160; <span class="keywordflow">else</span> crs=0;</div>
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>&#160;</div>
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>&#160; <span class="keywordflow">if</span>(dj&gt;0) {t=dj*boxy-fy;crs+=t*t;}</div>
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dj&lt;0) {t=(dj+1)*boxy-fy;crs+=t*t;}</div>
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>&#160;</div>
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>&#160; <span class="keywordflow">if</span>(dk&gt;0) {t=dk*boxz-fz;crs+=t*t;}</div>
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span>(dk&lt;0) {t=(dk+1)*boxz-fz;crs+=t*t;}</div>
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>&#160;</div>
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>&#160; <span class="keywordflow">return</span> crs&gt;con.r_max_add(mrs);</div>
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>&#160;}</div>
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>&#160;<span class="comment"></span></div>
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>&#160;<span class="comment">/** Adds memory to the queue.</span></div>
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>&#160;<span class="comment"> * \param[in,out] qu_s a reference to the queue start pointer.</span></div>
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>&#160;<span class="comment"> * \param[in,out] qu_e a reference to the queue end pointer. */</span></div>
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> c_<span class="keyword">class</span>&gt;</div>
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> voro_compute&lt;c_class&gt;::add_list_memory(<span class="keywordtype">int</span>*&amp; qu_s,<span class="keywordtype">int</span>*&amp; qu_e) {</div>
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>&#160; qu_size&lt;&lt;=1;</div>
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>&#160; <span class="keywordtype">int</span> *qu_n=<span class="keyword">new</span> <span class="keywordtype">int</span>[qu_size],*qu_c=qu_n;</div>
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>&#160;<span class="preprocessor">#if VOROPP_VERBOSE &gt;=2</span></div>
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>&#160;<span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">&quot;List memory scaled up to %d\n&quot;</span>,qu_size);</div>
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>&#160;<span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>&#160;<span class="preprocessor"></span> <span class="keywordflow">if</span>(qu_s&lt;=qu_e) {</div>
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>&#160; <span class="keywordflow">while</span>(qu_s&lt;qu_e) *(qu_c++)=*(qu_s++);</div>
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>&#160; <span class="keywordflow">while</span>(qu_s&lt;qu_l) *(qu_c++)=*(qu_s++);qu_s=qu;</div>
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>&#160; <span class="keywordflow">while</span>(qu_s&lt;qu_e) *(qu_c++)=*(qu_s++);</div>
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>&#160; }</div>
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>&#160; <span class="keyword">delete</span> [] qu;</div>
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>&#160; qu_s=qu=qu_n;</div>
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>&#160; qu_l=qu+qu_size;</div>
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>&#160; qu_e=qu_c;</div>
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>&#160;}</div>
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>&#160;</div>
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>&#160;<span class="comment">// Explicit template instantiation</span></div>
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>&#160;<span class="keyword">template</span> <a class="code" href="classvoro_1_1voro__compute.html#a4f268f7749e431df1a54b2dd17bb090f">voro_compute&lt;container&gt;::voro_compute</a>(container&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>&#160;<span class="keyword">template</span> <a class="code" href="classvoro_1_1voro__compute.html#a4f268f7749e431df1a54b2dd17bb090f">voro_compute&lt;container_poly&gt;::voro_compute</a>(container_poly&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container&gt;::compute_cell</a>(voronoicell&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container&gt;::compute_cell</a>(voronoicell_neighbor&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>&#160;<span class="keyword">template</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d">voro_compute&lt;container&gt;::find_voronoi_cell</a>(<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,particle_record&amp;,<span class="keywordtype">double</span>&amp;);</div>
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container_poly&gt;::compute_cell</a>(voronoicell&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container_poly&gt;::compute_cell</a>(voronoicell_neighbor&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>&#160;<span class="keyword">template</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d">voro_compute&lt;container_poly&gt;::find_voronoi_cell</a>(<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,particle_record&amp;,<span class="keywordtype">double</span>&amp;);</div>
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>&#160;</div>
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>&#160;<span class="comment">// Explicit template instantiation</span></div>
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>&#160;<span class="keyword">template</span> <a class="code" href="classvoro_1_1voro__compute.html#a4f268f7749e431df1a54b2dd17bb090f">voro_compute&lt;container_periodic&gt;::voro_compute</a>(container_periodic&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>&#160;<span class="keyword">template</span> <a class="code" href="classvoro_1_1voro__compute.html#a4f268f7749e431df1a54b2dd17bb090f">voro_compute&lt;container_periodic_poly&gt;::voro_compute</a>(container_periodic_poly&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container_periodic&gt;::compute_cell</a>(voronoicell&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container_periodic&gt;::compute_cell</a>(voronoicell_neighbor&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;<span class="keyword">template</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d">voro_compute&lt;container_periodic&gt;::find_voronoi_cell</a>(<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,particle_record&amp;,<span class="keywordtype">double</span>&amp;);</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container_periodic_poly&gt;::compute_cell</a>(voronoicell&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;<span class="keyword">template</span> <span class="keywordtype">bool</span> <a class="code" href="classvoro_1_1voro__compute.html#ab08b085875db63f46b0bcecd57bedea9">voro_compute&lt;container_periodic_poly&gt;::compute_cell</a>(voronoicell_neighbor&amp;,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;<span class="keyword">template</span> <span class="keywordtype">void</span> <a class="code" href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d">voro_compute&lt;container_periodic_poly&gt;::find_voronoi_cell</a>(<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">double</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,particle_record&amp;,<span class="keywordtype">double</span>&amp;);</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;}</div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Jul 27 2012 21:53:31 for Voro++ by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>

Event Timeline

c4science · Help