lattice/pyerrors
1
0
Fork 0
mirror of https://github.com/fjosw/pyerrors.git synced 2025-05-15 12:03:42 +02:00
Code Issues Projects Releases Packages Wiki Activity

Documentation updated

Browse source
This commit is contained in:
fjosw 2023-03-15 17:47:12 +00:00
parent 8186f5cb6b
commit 974570d5d0
4 changed files with 2698 additions and 2658 deletions
Download patch file Download diff file Expand all files Collapse all files

3955
docs/pyerrors/input/openQCD.html
View file

File diff suppressed because it is too large Load diff

1142
docs/pyerrors/input/sfcf.html
View file

File diff suppressed because it is too large Load diff

239
docs/pyerrors/input/utils.html
View file

@ -52,6 +52,9 @@
<h2>API Documentation</h2> <h2>API Documentation</h2>
<ul class="memberlist"> <ul class="memberlist">
<li>
<a class="function" href="#sort_names">sort_names</a>
</li>
<li> <li>
<a class="function" href="#check_idl">check_idl</a> <a class="function" href="#check_idl">check_idl</a>
</li> </li>
@ -71,46 +74,166 @@
<h1 class="modulename"> <h1 class="modulename">
<a href="./../../pyerrors.html">pyerrors</a><wbr>.<a href="./../input.html">input</a><wbr>.utils </h1> <a href="./../../pyerrors.html">pyerrors</a><wbr>.<a href="./../input.html">input</a><wbr>.utils </h1>
<div class="docstring"><p>Utilities for the input</p>
</div>
<input id="mod-utils-view-source" class="view-source-toggle-state" type="checkbox" aria-hidden="true" tabindex="-1"> <input id="mod-utils-view-source" class="view-source-toggle-state" type="checkbox" aria-hidden="true" tabindex="-1">
<label class="view-source-button" for="mod-utils-view-source"><span>View Source</span></label> <label class="view-source-button" for="mod-utils-view-source"><span>View Source</span></label>
<div class="pdoc-code codehilite"><pre><span></span><span id="L-1"><a href="#L-1"><span class="linenos"> 1</span></a><span class="sd">&quot;&quot;&quot;Utilities for the input&quot;&quot;&quot;</span> <div class="pdoc-code codehilite"><pre><span></span><span id="L-1"><a href="#L-1"><span class="linenos"> 1</span></a><span class="kn">import</span> <span class="nn">re</span>
</span><span id="L-2"><a href="#L-2"><span class="linenos"> 2</span></a> </span><span id="L-2"><a href="#L-2"><span class="linenos"> 2</span></a><span class="sd">&quot;&quot;&quot;Utilities for the input&quot;&quot;&quot;</span>
</span><span id="L-3"><a href="#L-3"><span class="linenos"> 3</span></a> </span><span id="L-3"><a href="#L-3"><span class="linenos"> 3</span></a>
</span><span id="L-4"><a href="#L-4"><span class="linenos"> 4</span></a><span class="k">def</span> <span class="nf">check_idl</span><span class="p">(</span><span class="n">idl</span><span class="p">,</span> <span class="n">che</span><span class="p">):</span> </span><span id="L-4"><a href="#L-4"><span class="linenos"> 4</span></a>
</span><span id="L-5"><a href="#L-5"><span class="linenos"> 5</span></a><span class="w"> </span><span class="sd">&quot;&quot;&quot;Checks if list of configurations is contained in an idl</span> </span><span id="L-5"><a href="#L-5"><span class="linenos"> 5</span></a><span class="k">def</span> <span class="nf">sort_names</span><span class="p">(</span><span class="n">ll</span><span class="p">):</span>
</span><span id="L-6"><a href="#L-6"><span class="linenos"> 6</span></a> </span><span id="L-6"><a href="#L-6"><span class="linenos"> 6</span></a><span class="w"> </span><span class="sd">&quot;&quot;&quot;Sorts a list of names of replika with searches for `r` and `id` in the replikum string.</span>
</span><span id="L-7"><a href="#L-7"><span class="linenos"> 7</span></a><span class="sd"> Parameters</span> </span><span id="L-7"><a href="#L-7"><span class="linenos"> 7</span></a><span class="sd"> If this search fails, a fallback method is used,</span>
</span><span id="L-8"><a href="#L-8"><span class="linenos"> 8</span></a><span class="sd"> ----------</span> </span><span id="L-8"><a href="#L-8"><span class="linenos"> 8</span></a><span class="sd"> where the strings are simply compared and the first diffeing numeral is used for differentiation.</span>
</span><span id="L-9"><a href="#L-9"><span class="linenos"> 9</span></a><span class="sd"> idl : range or list</span> </span><span id="L-9"><a href="#L-9"><span class="linenos"> 9</span></a>
</span><span id="L-10"><a href="#L-10"><span class="linenos">10</span></a><span class="sd"> idl of the current replicum</span> </span><span id="L-10"><a href="#L-10"><span class="linenos">10</span></a><span class="sd"> Parameters</span>
</span><span id="L-11"><a href="#L-11"><span class="linenos">11</span></a><span class="sd"> che : list</span> </span><span id="L-11"><a href="#L-11"><span class="linenos">11</span></a><span class="sd"> ----------</span>
</span><span id="L-12"><a href="#L-12"><span class="linenos">12</span></a><span class="sd"> list of configurations to be checked against</span> </span><span id="L-12"><a href="#L-12"><span class="linenos">12</span></a><span class="sd"> ll: list</span>
</span><span id="L-13"><a href="#L-13"><span class="linenos">13</span></a> </span><span id="L-13"><a href="#L-13"><span class="linenos">13</span></a><span class="sd"> list to sort</span>
</span><span id="L-14"><a href="#L-14"><span class="linenos">14</span></a><span class="sd"> Returns</span> </span><span id="L-14"><a href="#L-14"><span class="linenos">14</span></a>
</span><span id="L-15"><a href="#L-15"><span class="linenos">15</span></a><span class="sd"> -------</span> </span><span id="L-15"><a href="#L-15"><span class="linenos">15</span></a><span class="sd"> Returns</span>
</span><span id="L-16"><a href="#L-16"><span class="linenos">16</span></a><span class="sd"> miss_str : str</span> </span><span id="L-16"><a href="#L-16"><span class="linenos">16</span></a><span class="sd"> -------</span>
</span><span id="L-17"><a href="#L-17"><span class="linenos">17</span></a><span class="sd"> string with integers of which idls are missing</span> </span><span id="L-17"><a href="#L-17"><span class="linenos">17</span></a><span class="sd"> ll: list</span>
</span><span id="L-18"><a href="#L-18"><span class="linenos">18</span></a><span class="sd"> &quot;&quot;&quot;</span> </span><span id="L-18"><a href="#L-18"><span class="linenos">18</span></a><span class="sd"> sorted list</span>
</span><span id="L-19"><a href="#L-19"><span class="linenos">19</span></a> <span class="n">missing</span> <span class="o">=</span> <span class="p">[]</span> </span><span id="L-19"><a href="#L-19"><span class="linenos">19</span></a><span class="sd"> &quot;&quot;&quot;</span>
</span><span id="L-20"><a href="#L-20"><span class="linenos">20</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">che</span><span class="p">:</span> </span><span id="L-20"><a href="#L-20"><span class="linenos">20</span></a> <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="L-21"><a href="#L-21"><span class="linenos">21</span></a> <span class="k">if</span> <span class="n">c</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">idl</span><span class="p">:</span> </span><span id="L-21"><a href="#L-21"><span class="linenos">21</span></a> <span class="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">&#39;r(\d+)&#39;</span>
</span><span id="L-22"><a href="#L-22"><span class="linenos">22</span></a> <span class="n">missing</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">c</span><span class="p">)</span> </span><span id="L-22"><a href="#L-22"><span class="linenos">22</span></a> <span class="n">id_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">&#39;id(\d+)&#39;</span>
</span><span id="L-23"><a href="#L-23"><span class="linenos">23</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span> </span><span id="L-23"><a href="#L-23"><span class="linenos">23</span></a>
</span><span id="L-24"><a href="#L-24"><span class="linenos">24</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">):</span> </span><span id="L-24"><a href="#L-24"><span class="linenos">24</span></a> <span class="c1"># sort list by id first</span>
</span><span id="L-25"><a href="#L-25"><span class="linenos">25</span></a> <span class="nb">print</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">),</span> <span class="s2">&quot;configs missing&quot;</span><span class="p">)</span> </span><span id="L-25"><a href="#L-25"><span class="linenos">25</span></a> <span class="k">if</span> <span class="nb">all</span><span class="p">([</span><span class="n">re</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="n">id_pattern</span><span class="p">,</span> <span class="n">entry</span><span class="p">)</span> <span class="k">for</span> <span class="n">entry</span> <span class="ow">in</span> <span class="n">ll</span><span class="p">]):</span>
</span><span id="L-26"><a href="#L-26"><span class="linenos">26</span></a> <span class="n">miss_str</span> <span class="o">=</span> <span class="nb">str</span><span class="p">(</span><span class="n">missing</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span> </span><span id="L-26"><a href="#L-26"><span class="linenos">26</span></a> <span class="n">ll</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">(</span><span class="n">re</span><span class="o">.</span><span class="n">findall</span><span class="p">(</span><span class="n">id_pattern</span><span class="p">,</span> <span class="n">x</span><span class="p">)[</span><span class="mi">0</span><span class="p">]))</span>
</span><span id="L-27"><a href="#L-27"><span class="linenos">27</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">missing</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> </span><span id="L-27"><a href="#L-27"><span class="linenos">27</span></a> <span class="c1"># then by replikum</span>
</span><span id="L-28"><a href="#L-28"><span class="linenos">28</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">&quot;,&quot;</span> <span class="o">+</span> <span class="nb">str</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> </span><span id="L-28"><a href="#L-28"><span class="linenos">28</span></a> <span class="k">if</span> <span class="nb">all</span><span class="p">([</span><span class="n">re</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="n">r_pattern</span><span class="p">,</span> <span class="n">entry</span><span class="p">)</span> <span class="k">for</span> <span class="n">entry</span> <span class="ow">in</span> <span class="n">ll</span><span class="p">]):</span>
</span><span id="L-29"><a href="#L-29"><span class="linenos">29</span></a> <span class="nb">print</span><span class="p">(</span><span class="n">miss_str</span><span class="p">)</span> </span><span id="L-29"><a href="#L-29"><span class="linenos">29</span></a> <span class="n">ll</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">(</span><span class="n">re</span><span class="o">.</span><span class="n">findall</span><span class="p">(</span><span class="n">r_pattern</span><span class="p">,</span> <span class="n">x</span><span class="p">)[</span><span class="mi">0</span><span class="p">]))</span>
</span><span id="L-30"><a href="#L-30"><span class="linenos">30</span></a> <span class="k">return</span> <span class="n">miss_str</span> </span><span id="L-30"><a href="#L-30"><span class="linenos">30</span></a> <span class="c1"># as the rearrangements by one key let the other key untouched, the list is sorted now</span>
</span><span id="L-31"><a href="#L-31"><span class="linenos">31</span></a>
</span><span id="L-32"><a href="#L-32"><span class="linenos">32</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-33"><a href="#L-33"><span class="linenos">33</span></a> <span class="c1"># fallback</span>
</span><span id="L-34"><a href="#L-34"><span class="linenos">34</span></a> <span class="n">sames</span> <span class="o">=</span> <span class="s1">&#39;&#39;</span>
</span><span id="L-35"><a href="#L-35"><span class="linenos">35</span></a> <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="L-36"><a href="#L-36"><span class="linenos">36</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">[</span><span class="mi">0</span><span class="p">])):</span>
</span><span id="L-37"><a href="#L-37"><span class="linenos">37</span></a> <span class="n">checking</span> <span class="o">=</span> <span class="n">ll</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="n">i</span><span class="p">]</span>
</span><span id="L-38"><a href="#L-38"><span class="linenos">38</span></a> <span class="k">for</span> <span class="n">rn</span> <span class="ow">in</span> <span class="n">ll</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span>
</span><span id="L-39"><a href="#L-39"><span class="linenos">39</span></a> <span class="n">is_same</span> <span class="o">=</span> <span class="p">(</span><span class="n">rn</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">checking</span><span class="p">)</span>
</span><span id="L-40"><a href="#L-40"><span class="linenos">40</span></a> <span class="k">if</span> <span class="n">is_same</span><span class="p">:</span>
</span><span id="L-41"><a href="#L-41"><span class="linenos">41</span></a> <span class="n">sames</span> <span class="o">+=</span> <span class="n">checking</span>
</span><span id="L-42"><a href="#L-42"><span class="linenos">42</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-43"><a href="#L-43"><span class="linenos">43</span></a> <span class="k">break</span>
</span><span id="L-44"><a href="#L-44"><span class="linenos">44</span></a> <span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Using prefix:&quot;</span><span class="p">,</span> <span class="n">ll</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="nb">len</span><span class="p">(</span><span class="n">sames</span><span class="p">):])</span>
</span><span id="L-45"><a href="#L-45"><span class="linenos">45</span></a> <span class="n">ll</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">(</span><span class="n">re</span><span class="o">.</span><span class="n">findall</span><span class="p">(</span><span class="sa">r</span><span class="s1">&#39;\d+&#39;</span><span class="p">,</span> <span class="n">x</span><span class="p">[</span><span class="nb">len</span><span class="p">(</span><span class="n">sames</span><span class="p">):])[</span><span class="mi">0</span><span class="p">]))</span>
</span><span id="L-46"><a href="#L-46"><span class="linenos">46</span></a> <span class="k">return</span> <span class="n">ll</span>
</span><span id="L-47"><a href="#L-47"><span class="linenos">47</span></a>
</span><span id="L-48"><a href="#L-48"><span class="linenos">48</span></a>
</span><span id="L-49"><a href="#L-49"><span class="linenos">49</span></a><span class="k">def</span> <span class="nf">check_idl</span><span class="p">(</span><span class="n">idl</span><span class="p">,</span> <span class="n">che</span><span class="p">):</span>
</span><span id="L-50"><a href="#L-50"><span class="linenos">50</span></a><span class="w"> </span><span class="sd">&quot;&quot;&quot;Checks if list of configurations is contained in an idl</span>
</span><span id="L-51"><a href="#L-51"><span class="linenos">51</span></a>
</span><span id="L-52"><a href="#L-52"><span class="linenos">52</span></a><span class="sd"> Parameters</span>
</span><span id="L-53"><a href="#L-53"><span class="linenos">53</span></a><span class="sd"> ----------</span>
</span><span id="L-54"><a href="#L-54"><span class="linenos">54</span></a><span class="sd"> idl : range or list</span>
</span><span id="L-55"><a href="#L-55"><span class="linenos">55</span></a><span class="sd"> idl of the current replicum</span>
</span><span id="L-56"><a href="#L-56"><span class="linenos">56</span></a><span class="sd"> che : list</span>
</span><span id="L-57"><a href="#L-57"><span class="linenos">57</span></a><span class="sd"> list of configurations to be checked against</span>
</span><span id="L-58"><a href="#L-58"><span class="linenos">58</span></a>
</span><span id="L-59"><a href="#L-59"><span class="linenos">59</span></a><span class="sd"> Returns</span>
</span><span id="L-60"><a href="#L-60"><span class="linenos">60</span></a><span class="sd"> -------</span>
</span><span id="L-61"><a href="#L-61"><span class="linenos">61</span></a><span class="sd"> miss_str : str</span>
</span><span id="L-62"><a href="#L-62"><span class="linenos">62</span></a><span class="sd"> string with integers of which idls are missing</span>
</span><span id="L-63"><a href="#L-63"><span class="linenos">63</span></a><span class="sd"> &quot;&quot;&quot;</span>
</span><span id="L-64"><a href="#L-64"><span class="linenos">64</span></a> <span class="n">missing</span> <span class="o">=</span> <span class="p">[]</span>
</span><span id="L-65"><a href="#L-65"><span class="linenos">65</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">che</span><span class="p">:</span>
</span><span id="L-66"><a href="#L-66"><span class="linenos">66</span></a> <span class="k">if</span> <span class="n">c</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">idl</span><span class="p">:</span>
</span><span id="L-67"><a href="#L-67"><span class="linenos">67</span></a> <span class="n">missing</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">c</span><span class="p">)</span>
</span><span id="L-68"><a href="#L-68"><span class="linenos">68</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span>
</span><span id="L-69"><a href="#L-69"><span class="linenos">69</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">):</span>
</span><span id="L-70"><a href="#L-70"><span class="linenos">70</span></a> <span class="nb">print</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">),</span> <span class="s2">&quot;configs missing&quot;</span><span class="p">)</span>
</span><span id="L-71"><a href="#L-71"><span class="linenos">71</span></a> <span class="n">miss_str</span> <span class="o">=</span> <span class="nb">str</span><span class="p">(</span><span class="n">missing</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>
</span><span id="L-72"><a href="#L-72"><span class="linenos">72</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">missing</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span>
</span><span id="L-73"><a href="#L-73"><span class="linenos">73</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">&quot;,&quot;</span> <span class="o">+</span> <span class="nb">str</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
</span><span id="L-74"><a href="#L-74"><span class="linenos">74</span></a> <span class="nb">print</span><span class="p">(</span><span class="n">miss_str</span><span class="p">)</span>
</span><span id="L-75"><a href="#L-75"><span class="linenos">75</span></a> <span class="k">return</span> <span class="n">miss_str</span>
</span></pre></div> </span></pre></div>
</section>
<section id="sort_names">
<input id="sort_names-view-source" class="view-source-toggle-state" type="checkbox" aria-hidden="true" tabindex="-1">
<div class="attr function">
<span class="def">def</span>
<span class="name">sort_names</span><span class="signature pdoc-code condensed">(<span class="param"><span class="n">ll</span></span><span class="return-annotation">):</span></span>
<label class="view-source-button" for="sort_names-view-source"><span>View Source</span></label>
</div>
<a class="headerlink" href="#sort_names"></a>
<div class="pdoc-code codehilite"><pre><span></span><span id="sort_names-6"><a href="#sort_names-6"><span class="linenos"> 6</span></a><span class="k">def</span> <span class="nf">sort_names</span><span class="p">(</span><span class="n">ll</span><span class="p">):</span>
</span><span id="sort_names-7"><a href="#sort_names-7"><span class="linenos"> 7</span></a><span class="w"> </span><span class="sd">&quot;&quot;&quot;Sorts a list of names of replika with searches for `r` and `id` in the replikum string.</span>
</span><span id="sort_names-8"><a href="#sort_names-8"><span class="linenos"> 8</span></a><span class="sd"> If this search fails, a fallback method is used,</span>
</span><span id="sort_names-9"><a href="#sort_names-9"><span class="linenos"> 9</span></a><span class="sd"> where the strings are simply compared and the first diffeing numeral is used for differentiation.</span>
</span><span id="sort_names-10"><a href="#sort_names-10"><span class="linenos">10</span></a>
</span><span id="sort_names-11"><a href="#sort_names-11"><span class="linenos">11</span></a><span class="sd"> Parameters</span>
</span><span id="sort_names-12"><a href="#sort_names-12"><span class="linenos">12</span></a><span class="sd"> ----------</span>
</span><span id="sort_names-13"><a href="#sort_names-13"><span class="linenos">13</span></a><span class="sd"> ll: list</span>
</span><span id="sort_names-14"><a href="#sort_names-14"><span class="linenos">14</span></a><span class="sd"> list to sort</span>
</span><span id="sort_names-15"><a href="#sort_names-15"><span class="linenos">15</span></a>
</span><span id="sort_names-16"><a href="#sort_names-16"><span class="linenos">16</span></a><span class="sd"> Returns</span>
</span><span id="sort_names-17"><a href="#sort_names-17"><span class="linenos">17</span></a><span class="sd"> -------</span>
</span><span id="sort_names-18"><a href="#sort_names-18"><span class="linenos">18</span></a><span class="sd"> ll: list</span>
</span><span id="sort_names-19"><a href="#sort_names-19"><span class="linenos">19</span></a><span class="sd"> sorted list</span>
</span><span id="sort_names-20"><a href="#sort_names-20"><span class="linenos">20</span></a><span class="sd"> &quot;&quot;&quot;</span>
</span><span id="sort_names-21"><a href="#sort_names-21"><span class="linenos">21</span></a> <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="sort_names-22"><a href="#sort_names-22"><span class="linenos">22</span></a> <span class="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">&#39;r(\d+)&#39;</span>
</span><span id="sort_names-23"><a href="#sort_names-23"><span class="linenos">23</span></a> <span class="n">id_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">&#39;id(\d+)&#39;</span>
</span><span id="sort_names-24"><a href="#sort_names-24"><span class="linenos">24</span></a>
</span><span id="sort_names-25"><a href="#sort_names-25"><span class="linenos">25</span></a> <span class="c1"># sort list by id first</span>
</span><span id="sort_names-26"><a href="#sort_names-26"><span class="linenos">26</span></a> <span class="k">if</span> <span class="nb">all</span><span class="p">([</span><span class="n">re</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="n">id_pattern</span><span class="p">,</span> <span class="n">entry</span><span class="p">)</span> <span class="k">for</span> <span class="n">entry</span> <span class="ow">in</span> <span class="n">ll</span><span class="p">]):</span>
</span><span id="sort_names-27"><a href="#sort_names-27"><span class="linenos">27</span></a> <span class="n">ll</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">(</span><span class="n">re</span><span class="o">.</span><span class="n">findall</span><span class="p">(</span><span class="n">id_pattern</span><span class="p">,</span> <span class="n">x</span><span class="p">)[</span><span class="mi">0</span><span class="p">]))</span>
</span><span id="sort_names-28"><a href="#sort_names-28"><span class="linenos">28</span></a> <span class="c1"># then by replikum</span>
</span><span id="sort_names-29"><a href="#sort_names-29"><span class="linenos">29</span></a> <span class="k">if</span> <span class="nb">all</span><span class="p">([</span><span class="n">re</span><span class="o">.</span><span class="n">search</span><span class="p">(</span><span class="n">r_pattern</span><span class="p">,</span> <span class="n">entry</span><span class="p">)</span> <span class="k">for</span> <span class="n">entry</span> <span class="ow">in</span> <span class="n">ll</span><span class="p">]):</span>
</span><span id="sort_names-30"><a href="#sort_names-30"><span class="linenos">30</span></a> <span class="n">ll</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">(</span><span class="n">re</span><span class="o">.</span><span class="n">findall</span><span class="p">(</span><span class="n">r_pattern</span><span class="p">,</span> <span class="n">x</span><span class="p">)[</span><span class="mi">0</span><span class="p">]))</span>
</span><span id="sort_names-31"><a href="#sort_names-31"><span class="linenos">31</span></a> <span class="c1"># as the rearrangements by one key let the other key untouched, the list is sorted now</span>
</span><span id="sort_names-32"><a href="#sort_names-32"><span class="linenos">32</span></a>
</span><span id="sort_names-33"><a href="#sort_names-33"><span class="linenos">33</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="sort_names-34"><a href="#sort_names-34"><span class="linenos">34</span></a> <span class="c1"># fallback</span>
</span><span id="sort_names-35"><a href="#sort_names-35"><span class="linenos">35</span></a> <span class="n">sames</span> <span class="o">=</span> <span class="s1">&#39;&#39;</span>
</span><span id="sort_names-36"><a href="#sort_names-36"><span class="linenos">36</span></a> <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="sort_names-37"><a href="#sort_names-37"><span class="linenos">37</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">[</span><span class="mi">0</span><span class="p">])):</span>
</span><span id="sort_names-38"><a href="#sort_names-38"><span class="linenos">38</span></a> <span class="n">checking</span> <span class="o">=</span> <span class="n">ll</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="n">i</span><span class="p">]</span>
</span><span id="sort_names-39"><a href="#sort_names-39"><span class="linenos">39</span></a> <span class="k">for</span> <span class="n">rn</span> <span class="ow">in</span> <span class="n">ll</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span>
</span><span id="sort_names-40"><a href="#sort_names-40"><span class="linenos">40</span></a> <span class="n">is_same</span> <span class="o">=</span> <span class="p">(</span><span class="n">rn</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">checking</span><span class="p">)</span>
</span><span id="sort_names-41"><a href="#sort_names-41"><span class="linenos">41</span></a> <span class="k">if</span> <span class="n">is_same</span><span class="p">:</span>
</span><span id="sort_names-42"><a href="#sort_names-42"><span class="linenos">42</span></a> <span class="n">sames</span> <span class="o">+=</span> <span class="n">checking</span>
</span><span id="sort_names-43"><a href="#sort_names-43"><span class="linenos">43</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="sort_names-44"><a href="#sort_names-44"><span class="linenos">44</span></a> <span class="k">break</span>
</span><span id="sort_names-45"><a href="#sort_names-45"><span class="linenos">45</span></a> <span class="nb">print</span><span class="p">(</span><span class="s2">&quot;Using prefix:&quot;</span><span class="p">,</span> <span class="n">ll</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="nb">len</span><span class="p">(</span><span class="n">sames</span><span class="p">):])</span>
</span><span id="sort_names-46"><a href="#sort_names-46"><span class="linenos">46</span></a> <span class="n">ll</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">(</span><span class="n">re</span><span class="o">.</span><span class="n">findall</span><span class="p">(</span><span class="sa">r</span><span class="s1">&#39;\d+&#39;</span><span class="p">,</span> <span class="n">x</span><span class="p">[</span><span class="nb">len</span><span class="p">(</span><span class="n">sames</span><span class="p">):])[</span><span class="mi">0</span><span class="p">]))</span>
</span><span id="sort_names-47"><a href="#sort_names-47"><span class="linenos">47</span></a> <span class="k">return</span> <span class="n">ll</span>
</span></pre></div>
<div class="docstring"><p>Sorts a list of names of replika with searches for <code>r</code> and <code>id</code> in the replikum string.
If this search fails, a fallback method is used,
where the strings are simply compared and the first diffeing numeral is used for differentiation.</p>
<h6 id="parameters">Parameters</h6>
<ul>
<li><strong>ll</strong> (list):
list to sort</li>
</ul>
<h6 id="returns">Returns</h6>
<ul>
<li><strong>ll</strong> (list):
sorted list</li>
</ul>
</div>
</section> </section>
<section id="check_idl"> <section id="check_idl">
<input id="check_idl-view-source" class="view-source-toggle-state" type="checkbox" aria-hidden="true" tabindex="-1"> <input id="check_idl-view-source" class="view-source-toggle-state" type="checkbox" aria-hidden="true" tabindex="-1">
@ -123,33 +246,33 @@
</div> </div>
<a class="headerlink" href="#check_idl"></a> <a class="headerlink" href="#check_idl"></a>
<div class="pdoc-code codehilite"><pre><span></span><span id="check_idl-5"><a href="#check_idl-5"><span class="linenos"> 5</span></a><span class="k">def</span> <span class="nf">check_idl</span><span class="p">(</span><span class="n">idl</span><span class="p">,</span> <span class="n">che</span><span class="p">):</span> <div class="pdoc-code codehilite"><pre><span></span><span id="check_idl-50"><a href="#check_idl-50"><span class="linenos">50</span></a><span class="k">def</span> <span class="nf">check_idl</span><span class="p">(</span><span class="n">idl</span><span class="p">,</span> <span class="n">che</span><span class="p">):</span>
</span><span id="check_idl-6"><a href="#check_idl-6"><span class="linenos"> 6</span></a><span class="w"> </span><span class="sd">&quot;&quot;&quot;Checks if list of configurations is contained in an idl</span> </span><span id="check_idl-51"><a href="#check_idl-51"><span class="linenos">51</span></a><span class="w"> </span><span class="sd">&quot;&quot;&quot;Checks if list of configurations is contained in an idl</span>
</span><span id="check_idl-7"><a href="#check_idl-7"><span class="linenos"> 7</span></a> </span><span id="check_idl-52"><a href="#check_idl-52"><span class="linenos">52</span></a>
</span><span id="check_idl-8"><a href="#check_idl-8"><span class="linenos"> 8</span></a><span class="sd"> Parameters</span> </span><span id="check_idl-53"><a href="#check_idl-53"><span class="linenos">53</span></a><span class="sd"> Parameters</span>
</span><span id="check_idl-9"><a href="#check_idl-9"><span class="linenos"> 9</span></a><span class="sd"> ----------</span> </span><span id="check_idl-54"><a href="#check_idl-54"><span class="linenos">54</span></a><span class="sd"> ----------</span>
</span><span id="check_idl-10"><a href="#check_idl-10"><span class="linenos">10</span></a><span class="sd"> idl : range or list</span> </span><span id="check_idl-55"><a href="#check_idl-55"><span class="linenos">55</span></a><span class="sd"> idl : range or list</span>
</span><span id="check_idl-11"><a href="#check_idl-11"><span class="linenos">11</span></a><span class="sd"> idl of the current replicum</span> </span><span id="check_idl-56"><a href="#check_idl-56"><span class="linenos">56</span></a><span class="sd"> idl of the current replicum</span>
</span><span id="check_idl-12"><a href="#check_idl-12"><span class="linenos">12</span></a><span class="sd"> che : list</span> </span><span id="check_idl-57"><a href="#check_idl-57"><span class="linenos">57</span></a><span class="sd"> che : list</span>
</span><span id="check_idl-13"><a href="#check_idl-13"><span class="linenos">13</span></a><span class="sd"> list of configurations to be checked against</span> </span><span id="check_idl-58"><a href="#check_idl-58"><span class="linenos">58</span></a><span class="sd"> list of configurations to be checked against</span>
</span><span id="check_idl-14"><a href="#check_idl-14"><span class="linenos">14</span></a> </span><span id="check_idl-59"><a href="#check_idl-59"><span class="linenos">59</span></a>
</span><span id="check_idl-15"><a href="#check_idl-15"><span class="linenos">15</span></a><span class="sd"> Returns</span> </span><span id="check_idl-60"><a href="#check_idl-60"><span class="linenos">60</span></a><span class="sd"> Returns</span>
</span><span id="check_idl-16"><a href="#check_idl-16"><span class="linenos">16</span></a><span class="sd"> -------</span> </span><span id="check_idl-61"><a href="#check_idl-61"><span class="linenos">61</span></a><span class="sd"> -------</span>
</span><span id="check_idl-17"><a href="#check_idl-17"><span class="linenos">17</span></a><span class="sd"> miss_str : str</span> </span><span id="check_idl-62"><a href="#check_idl-62"><span class="linenos">62</span></a><span class="sd"> miss_str : str</span>
</span><span id="check_idl-18"><a href="#check_idl-18"><span class="linenos">18</span></a><span class="sd"> string with integers of which idls are missing</span> </span><span id="check_idl-63"><a href="#check_idl-63"><span class="linenos">63</span></a><span class="sd"> string with integers of which idls are missing</span>
</span><span id="check_idl-19"><a href="#check_idl-19"><span class="linenos">19</span></a><span class="sd"> &quot;&quot;&quot;</span> </span><span id="check_idl-64"><a href="#check_idl-64"><span class="linenos">64</span></a><span class="sd"> &quot;&quot;&quot;</span>
</span><span id="check_idl-20"><a href="#check_idl-20"><span class="linenos">20</span></a> <span class="n">missing</span> <span class="o">=</span> <span class="p">[]</span> </span><span id="check_idl-65"><a href="#check_idl-65"><span class="linenos">65</span></a> <span class="n">missing</span> <span class="o">=</span> <span class="p">[]</span>
</span><span id="check_idl-21"><a href="#check_idl-21"><span class="linenos">21</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">che</span><span class="p">:</span> </span><span id="check_idl-66"><a href="#check_idl-66"><span class="linenos">66</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">che</span><span class="p">:</span>
</span><span id="check_idl-22"><a href="#check_idl-22"><span class="linenos">22</span></a> <span class="k">if</span> <span class="n">c</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">idl</span><span class="p">:</span> </span><span id="check_idl-67"><a href="#check_idl-67"><span class="linenos">67</span></a> <span class="k">if</span> <span class="n">c</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">idl</span><span class="p">:</span>
</span><span id="check_idl-23"><a href="#check_idl-23"><span class="linenos">23</span></a> <span class="n">missing</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">c</span><span class="p">)</span> </span><span id="check_idl-68"><a href="#check_idl-68"><span class="linenos">68</span></a> <span class="n">missing</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">c</span><span class="p">)</span>
</span><span id="check_idl-24"><a href="#check_idl-24"><span class="linenos">24</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span> </span><span id="check_idl-69"><a href="#check_idl-69"><span class="linenos">69</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span>
</span><span id="check_idl-25"><a href="#check_idl-25"><span class="linenos">25</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">):</span> </span><span id="check_idl-70"><a href="#check_idl-70"><span class="linenos">70</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">):</span>
</span><span id="check_idl-26"><a href="#check_idl-26"><span class="linenos">26</span></a> <span class="nb">print</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">),</span> <span class="s2">&quot;configs missing&quot;</span><span class="p">)</span> </span><span id="check_idl-71"><a href="#check_idl-71"><span class="linenos">71</span></a> <span class="nb">print</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">missing</span><span class="p">),</span> <span class="s2">&quot;configs missing&quot;</span><span class="p">)</span>
</span><span id="check_idl-27"><a href="#check_idl-27"><span class="linenos">27</span></a> <span class="n">miss_str</span> <span class="o">=</span> <span class="nb">str</span><span class="p">(</span><span class="n">missing</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span> </span><span id="check_idl-72"><a href="#check_idl-72"><span class="linenos">72</span></a> <span class="n">miss_str</span> <span class="o">=</span> <span class="nb">str</span><span class="p">(</span><span class="n">missing</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span>
</span><span id="check_idl-28"><a href="#check_idl-28"><span class="linenos">28</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">missing</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> </span><span id="check_idl-73"><a href="#check_idl-73"><span class="linenos">73</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">missing</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span>
</span><span id="check_idl-29"><a href="#check_idl-29"><span class="linenos">29</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">&quot;,&quot;</span> <span class="o">+</span> <span class="nb">str</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> </span><span id="check_idl-74"><a href="#check_idl-74"><span class="linenos">74</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">&quot;,&quot;</span> <span class="o">+</span> <span class="nb">str</span><span class="p">(</span><span class="n">i</span><span class="p">)</span>
</span><span id="check_idl-30"><a href="#check_idl-30"><span class="linenos">30</span></a> <span class="nb">print</span><span class="p">(</span><span class="n">miss_str</span><span class="p">)</span> </span><span id="check_idl-75"><a href="#check_idl-75"><span class="linenos">75</span></a> <span class="nb">print</span><span class="p">(</span><span class="n">miss_str</span><span class="p">)</span>
</span><span id="check_idl-31"><a href="#check_idl-31"><span class="linenos">31</span></a> <span class="k">return</span> <span class="n">miss_str</span> </span><span id="check_idl-76"><a href="#check_idl-76"><span class="linenos">76</span></a> <span class="k">return</span> <span class="n">miss_str</span>
</span></pre></div> </span></pre></div>

2
docs/search.js
View file

File diff suppressed because one or more lines are too long