mirror of
https://github.com/fjosw/pyerrors.git
synced 2025-03-15 14:50:25 +01:00
Documentation updated
This commit is contained in:
fjosw
parent
2423c7e49e
commit
3b766546af
3 changed files with 1414 additions and 816 deletions
File diff suppressed because it is too large
Load diff
|
|
@ -58,6 +58,9 @@
|
|||
<li>
|
||||
<a class="function" href="#check_idl">check_idl</a>
|
||||
</li>
|
||||
<li>
|
||||
<a class="function" href="#check_params">check_params</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
|
|
@ -74,88 +77,157 @@
|
|||
<h1 class="modulename">
|
||||
<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">
|
||||
|
||||
<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="kn">import</span> <span class="nn">re</span>
|
||||
</span><span id="L-2"><a href="#L-2"><span class="linenos"> 2</span></a><span class="sd">"""Utilities for the input"""</span>
|
||||
</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><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 class="w"> </span><span class="sd">"""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"> 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"> 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><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"> ----------</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 class="sd"> list to sort</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"> Returns</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"> ll: list</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="sd"> """</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">></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="nb">sorted</span> <span class="o">=</span> <span class="kc">False</span>
|
||||
</span><span id="L-22"><a href="#L-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">'r(\d+)'</span>
|
||||
</span><span id="L-23"><a href="#L-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">'id(\d+)'</span>
|
||||
</span><span id="L-24"><a href="#L-24"><span class="linenos">24</span></a>
|
||||
</span><span id="L-25"><a href="#L-25"><span class="linenos">25</span></a> <span class="c1"># sort list by id first</span>
|
||||
</span><span id="L-26"><a href="#L-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="L-27"><a href="#L-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="L-28"><a href="#L-28"><span class="linenos">28</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="L-29"><a href="#L-29"><span class="linenos">29</span></a> <span class="c1"># then by replikum</span>
|
||||
</span><span id="L-30"><a href="#L-30"><span class="linenos">30</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-31"><a href="#L-31"><span class="linenos">31</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-32"><a href="#L-32"><span class="linenos">32</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="L-33"><a href="#L-33"><span class="linenos">33</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-34"><a href="#L-34"><span class="linenos">34</span></a>
|
||||
</span><span id="L-35"><a href="#L-35"><span class="linenos">35</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="nb">sorted</span><span class="p">:</span>
|
||||
</span><span id="L-36"><a href="#L-36"><span class="linenos">36</span></a> <span class="c1"># fallback</span>
|
||||
</span><span id="L-37"><a href="#L-37"><span class="linenos">37</span></a> <span class="n">sames</span> <span class="o">=</span> <span class="s1">''</span>
|
||||
</span><span id="L-38"><a href="#L-38"><span class="linenos">38</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-39"><a href="#L-39"><span class="linenos">39</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-40"><a href="#L-40"><span class="linenos">40</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-41"><a href="#L-41"><span class="linenos">41</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-42"><a href="#L-42"><span class="linenos">42</span></a> <span class="k">if</span> <span class="n">is_same</span><span class="p">:</span>
|
||||
</span><span id="L-43"><a href="#L-43"><span class="linenos">43</span></a> <span class="n">sames</span> <span class="o">+=</span> <span class="n">checking</span>
|
||||
</span><span id="L-44"><a href="#L-44"><span class="linenos">44</span></a> <span class="k">else</span><span class="p">:</span>
|
||||
</span><span id="L-45"><a href="#L-45"><span class="linenos">45</span></a> <span class="k">break</span>
|
||||
</span><span id="L-46"><a href="#L-46"><span class="linenos">46</span></a> <span class="nb">print</span><span class="p">(</span><span class="s2">"Using prefix:"</span><span class="p">,</span> <span class="n">sames</span><span class="p">)</span>
|
||||
</span><span id="L-47"><a href="#L-47"><span class="linenos">47</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">'\d+'</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-48"><a href="#L-48"><span class="linenos">48</span></a> <span class="k">return</span> <span class="n">ll</span>
|
||||
</span><span id="L-49"><a href="#L-49"><span class="linenos">49</span></a>
|
||||
</span><span id="L-50"><a href="#L-50"><span class="linenos">50</span></a>
|
||||
</span><span id="L-51"><a href="#L-51"><span class="linenos">51</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-52"><a href="#L-52"><span class="linenos">52</span></a><span class="w"> </span><span class="sd">"""Checks if list of configurations is contained in an idl</span>
|
||||
</span><span id="L-53"><a href="#L-53"><span class="linenos">53</span></a>
|
||||
</span><span id="L-54"><a href="#L-54"><span class="linenos">54</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="L-55"><a href="#L-55"><span class="linenos">55</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="L-56"><a href="#L-56"><span class="linenos">56</span></a><span class="sd"> idl : range or list</span>
|
||||
</span><span id="L-57"><a href="#L-57"><span class="linenos">57</span></a><span class="sd"> idl of the current replicum</span>
|
||||
</span><span id="L-58"><a href="#L-58"><span class="linenos">58</span></a><span class="sd"> che : list</span>
|
||||
</span><span id="L-59"><a href="#L-59"><span class="linenos">59</span></a><span class="sd"> list of configurations to be checked against</span>
|
||||
</span><span id="L-60"><a href="#L-60"><span class="linenos">60</span></a>
|
||||
</span><span id="L-61"><a href="#L-61"><span class="linenos">61</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="L-62"><a href="#L-62"><span class="linenos">62</span></a><span class="sd"> -------</span>
|
||||
</span><span id="L-63"><a href="#L-63"><span class="linenos">63</span></a><span class="sd"> miss_str : str</span>
|
||||
</span><span id="L-64"><a href="#L-64"><span class="linenos">64</span></a><span class="sd"> string with integers of which idls are missing</span>
|
||||
</span><span id="L-65"><a href="#L-65"><span class="linenos">65</span></a><span class="sd"> """</span>
|
||||
</span><span id="L-66"><a href="#L-66"><span class="linenos">66</span></a> <span class="n">missing</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="L-67"><a href="#L-67"><span class="linenos">67</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-68"><a href="#L-68"><span class="linenos">68</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-69"><a href="#L-69"><span class="linenos">69</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-70"><a href="#L-70"><span class="linenos">70</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span>
|
||||
</span><span id="L-71"><a href="#L-71"><span class="linenos">71</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-72"><a href="#L-72"><span class="linenos">72</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">"configs missing"</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="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-74"><a href="#L-74"><span class="linenos">74</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-75"><a href="#L-75"><span class="linenos">75</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">","</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-76"><a href="#L-76"><span class="linenos">76</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-77"><a href="#L-77"><span class="linenos">77</span></a> <span class="k">return</span> <span class="n">miss_str</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="sd">"""Utilities for the input"""</span>
|
||||
</span><span id="L-2"><a href="#L-2"><span class="linenos"> 2</span></a>
|
||||
</span><span id="L-3"><a href="#L-3"><span class="linenos"> 3</span></a><span class="kn">import</span> <span class="nn">re</span>
|
||||
</span><span id="L-4"><a href="#L-4"><span class="linenos"> 4</span></a><span class="kn">import</span> <span class="nn">fnmatch</span>
|
||||
</span><span id="L-5"><a href="#L-5"><span class="linenos"> 5</span></a><span class="kn">import</span> <span class="nn">os</span>
|
||||
</span><span id="L-6"><a href="#L-6"><span class="linenos"> 6</span></a>
|
||||
</span><span id="L-7"><a href="#L-7"><span class="linenos"> 7</span></a>
|
||||
</span><span id="L-8"><a href="#L-8"><span class="linenos"> 8</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-9"><a href="#L-9"><span class="linenos"> 9</span></a><span class="w"> </span><span class="sd">"""Sorts a list of names of replika with searches for `r` and `id` in the replikum string.</span>
|
||||
</span><span id="L-10"><a href="#L-10"><span class="linenos"> 10</span></a><span class="sd"> If this search fails, a fallback method is used,</span>
|
||||
</span><span id="L-11"><a href="#L-11"><span class="linenos"> 11</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-12"><a href="#L-12"><span class="linenos"> 12</span></a>
|
||||
</span><span id="L-13"><a href="#L-13"><span class="linenos"> 13</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="L-14"><a href="#L-14"><span class="linenos"> 14</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="L-15"><a href="#L-15"><span class="linenos"> 15</span></a><span class="sd"> ll: list</span>
|
||||
</span><span id="L-16"><a href="#L-16"><span class="linenos"> 16</span></a><span class="sd"> list to sort</span>
|
||||
</span><span id="L-17"><a href="#L-17"><span class="linenos"> 17</span></a>
|
||||
</span><span id="L-18"><a href="#L-18"><span class="linenos"> 18</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="L-19"><a href="#L-19"><span class="linenos"> 19</span></a><span class="sd"> -------</span>
|
||||
</span><span id="L-20"><a href="#L-20"><span class="linenos"> 20</span></a><span class="sd"> ll: list</span>
|
||||
</span><span id="L-21"><a href="#L-21"><span class="linenos"> 21</span></a><span class="sd"> sorted list</span>
|
||||
</span><span id="L-22"><a href="#L-22"><span class="linenos"> 22</span></a><span class="sd"> """</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="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">)</span> <span class="o">></span> <span class="mi">1</span><span class="p">:</span>
|
||||
</span><span id="L-25"><a href="#L-25"><span class="linenos"> 25</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">False</span>
|
||||
</span><span id="L-26"><a href="#L-26"><span class="linenos"> 26</span></a> <span class="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'r(\d+)'</span>
|
||||
</span><span id="L-27"><a href="#L-27"><span class="linenos"> 27</span></a> <span class="n">id_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'id(\d+)'</span>
|
||||
</span><span id="L-28"><a href="#L-28"><span class="linenos"> 28</span></a>
|
||||
</span><span id="L-29"><a href="#L-29"><span class="linenos"> 29</span></a> <span class="c1"># sort list by id first</span>
|
||||
</span><span id="L-30"><a href="#L-30"><span class="linenos"> 30</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-31"><a href="#L-31"><span class="linenos"> 31</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-32"><a href="#L-32"><span class="linenos"> 32</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="L-33"><a href="#L-33"><span class="linenos"> 33</span></a> <span class="c1"># then by replikum</span>
|
||||
</span><span id="L-34"><a href="#L-34"><span class="linenos"> 34</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-35"><a href="#L-35"><span class="linenos"> 35</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-36"><a href="#L-36"><span class="linenos"> 36</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="L-37"><a href="#L-37"><span class="linenos"> 37</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-38"><a href="#L-38"><span class="linenos"> 38</span></a>
|
||||
</span><span id="L-39"><a href="#L-39"><span class="linenos"> 39</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="nb">sorted</span><span class="p">:</span>
|
||||
</span><span id="L-40"><a href="#L-40"><span class="linenos"> 40</span></a> <span class="c1"># fallback</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="s1">''</span>
|
||||
</span><span id="L-42"><a href="#L-42"><span class="linenos"> 42</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-43"><a href="#L-43"><span class="linenos"> 43</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-44"><a href="#L-44"><span class="linenos"> 44</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-45"><a href="#L-45"><span class="linenos"> 45</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-46"><a href="#L-46"><span class="linenos"> 46</span></a> <span class="k">if</span> <span class="n">is_same</span><span class="p">:</span>
|
||||
</span><span id="L-47"><a href="#L-47"><span class="linenos"> 47</span></a> <span class="n">sames</span> <span class="o">+=</span> <span class="n">checking</span>
|
||||
</span><span id="L-48"><a href="#L-48"><span class="linenos"> 48</span></a> <span class="k">else</span><span class="p">:</span>
|
||||
</span><span id="L-49"><a href="#L-49"><span class="linenos"> 49</span></a> <span class="k">break</span>
|
||||
</span><span id="L-50"><a href="#L-50"><span class="linenos"> 50</span></a> <span class="nb">print</span><span class="p">(</span><span class="s2">"Using prefix:"</span><span class="p">,</span> <span class="n">sames</span><span class="p">)</span>
|
||||
</span><span id="L-51"><a href="#L-51"><span class="linenos"> 51</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">'\d+'</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-52"><a href="#L-52"><span class="linenos"> 52</span></a> <span class="k">return</span> <span class="n">ll</span>
|
||||
</span><span id="L-53"><a href="#L-53"><span class="linenos"> 53</span></a>
|
||||
</span><span id="L-54"><a href="#L-54"><span class="linenos"> 54</span></a>
|
||||
</span><span id="L-55"><a href="#L-55"><span class="linenos"> 55</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-56"><a href="#L-56"><span class="linenos"> 56</span></a><span class="w"> </span><span class="sd">"""Checks if list of configurations is contained in an idl</span>
|
||||
</span><span id="L-57"><a href="#L-57"><span class="linenos"> 57</span></a>
|
||||
</span><span id="L-58"><a href="#L-58"><span class="linenos"> 58</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="L-59"><a href="#L-59"><span class="linenos"> 59</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="L-60"><a href="#L-60"><span class="linenos"> 60</span></a><span class="sd"> idl : range or list</span>
|
||||
</span><span id="L-61"><a href="#L-61"><span class="linenos"> 61</span></a><span class="sd"> idl of the current replicum</span>
|
||||
</span><span id="L-62"><a href="#L-62"><span class="linenos"> 62</span></a><span class="sd"> che : list</span>
|
||||
</span><span id="L-63"><a href="#L-63"><span class="linenos"> 63</span></a><span class="sd"> list of configurations to be checked against</span>
|
||||
</span><span id="L-64"><a href="#L-64"><span class="linenos"> 64</span></a>
|
||||
</span><span id="L-65"><a href="#L-65"><span class="linenos"> 65</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="L-66"><a href="#L-66"><span class="linenos"> 66</span></a><span class="sd"> -------</span>
|
||||
</span><span id="L-67"><a href="#L-67"><span class="linenos"> 67</span></a><span class="sd"> miss_str : str</span>
|
||||
</span><span id="L-68"><a href="#L-68"><span class="linenos"> 68</span></a><span class="sd"> string with integers of which idls are missing</span>
|
||||
</span><span id="L-69"><a href="#L-69"><span class="linenos"> 69</span></a><span class="sd"> """</span>
|
||||
</span><span id="L-70"><a href="#L-70"><span class="linenos"> 70</span></a>
|
||||
</span><span id="L-71"><a href="#L-71"><span class="linenos"> 71</span></a> <span class="n">missing</span> <span class="o">=</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">c</span> <span class="ow">in</span> <span class="n">che</span><span class="p">:</span>
|
||||
</span><span id="L-73"><a href="#L-73"><span class="linenos"> 73</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-74"><a href="#L-74"><span class="linenos"> 74</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-75"><a href="#L-75"><span class="linenos"> 75</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span>
|
||||
</span><span id="L-76"><a href="#L-76"><span class="linenos"> 76</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-77"><a href="#L-77"><span class="linenos"> 77</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">"configs missing"</span><span class="p">)</span>
|
||||
</span><span id="L-78"><a href="#L-78"><span class="linenos"> 78</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-79"><a href="#L-79"><span class="linenos"> 79</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-80"><a href="#L-80"><span class="linenos"> 80</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">","</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-81"><a href="#L-81"><span class="linenos"> 81</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-82"><a href="#L-82"><span class="linenos"> 82</span></a> <span class="k">return</span> <span class="n">miss_str</span>
|
||||
</span><span id="L-83"><a href="#L-83"><span class="linenos"> 83</span></a>
|
||||
</span><span id="L-84"><a href="#L-84"><span class="linenos"> 84</span></a>
|
||||
</span><span id="L-85"><a href="#L-85"><span class="linenos"> 85</span></a><span class="k">def</span> <span class="nf">check_params</span><span class="p">(</span><span class="n">path</span><span class="p">,</span> <span class="n">param_hash</span><span class="p">,</span> <span class="n">prefix</span><span class="p">,</span> <span class="n">param_prefix</span><span class="o">=</span><span class="s2">"parameters_"</span><span class="p">):</span>
|
||||
</span><span id="L-86"><a href="#L-86"><span class="linenos"> 86</span></a><span class="w"> </span><span class="sd">"""</span>
|
||||
</span><span id="L-87"><a href="#L-87"><span class="linenos"> 87</span></a><span class="sd"> Check if, for sfcf, the parameter hashes at the end of the parameter files are in fact the expected one.</span>
|
||||
</span><span id="L-88"><a href="#L-88"><span class="linenos"> 88</span></a>
|
||||
</span><span id="L-89"><a href="#L-89"><span class="linenos"> 89</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="L-90"><a href="#L-90"><span class="linenos"> 90</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="L-91"><a href="#L-91"><span class="linenos"> 91</span></a><span class="sd"> path: str</span>
|
||||
</span><span id="L-92"><a href="#L-92"><span class="linenos"> 92</span></a><span class="sd"> measurement path, same as for sfcf read method</span>
|
||||
</span><span id="L-93"><a href="#L-93"><span class="linenos"> 93</span></a><span class="sd"> param_hash: str</span>
|
||||
</span><span id="L-94"><a href="#L-94"><span class="linenos"> 94</span></a><span class="sd"> expected parameter hash</span>
|
||||
</span><span id="L-95"><a href="#L-95"><span class="linenos"> 95</span></a><span class="sd"> prefix: str</span>
|
||||
</span><span id="L-96"><a href="#L-96"><span class="linenos"> 96</span></a><span class="sd"> data prefix to find the appropriate replicum folders in path</span>
|
||||
</span><span id="L-97"><a href="#L-97"><span class="linenos"> 97</span></a><span class="sd"> param_prefix: str</span>
|
||||
</span><span id="L-98"><a href="#L-98"><span class="linenos"> 98</span></a><span class="sd"> prefix of the parameter file. Defaults to 'parameters_'</span>
|
||||
</span><span id="L-99"><a href="#L-99"><span class="linenos"> 99</span></a>
|
||||
</span><span id="L-100"><a href="#L-100"><span class="linenos">100</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="L-101"><a href="#L-101"><span class="linenos">101</span></a><span class="sd"> -------</span>
|
||||
</span><span id="L-102"><a href="#L-102"><span class="linenos">102</span></a><span class="sd"> nums: dict</span>
|
||||
</span><span id="L-103"><a href="#L-103"><span class="linenos">103</span></a><span class="sd"> dictionary of faulty parameter files sorted by the replica paths</span>
|
||||
</span><span id="L-104"><a href="#L-104"><span class="linenos">104</span></a><span class="sd"> """</span>
|
||||
</span><span id="L-105"><a href="#L-105"><span class="linenos">105</span></a>
|
||||
</span><span id="L-106"><a href="#L-106"><span class="linenos">106</span></a> <span class="n">ls</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="L-107"><a href="#L-107"><span class="linenos">107</span></a> <span class="k">for</span> <span class="p">(</span><span class="n">dirpath</span><span class="p">,</span> <span class="n">dirnames</span><span class="p">,</span> <span class="n">filenames</span><span class="p">)</span> <span class="ow">in</span> <span class="n">os</span><span class="o">.</span><span class="n">walk</span><span class="p">(</span><span class="n">path</span><span class="p">):</span>
|
||||
</span><span id="L-108"><a href="#L-108"><span class="linenos">108</span></a> <span class="n">ls</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="n">dirnames</span><span class="p">)</span>
|
||||
</span><span id="L-109"><a href="#L-109"><span class="linenos">109</span></a> <span class="k">break</span>
|
||||
</span><span id="L-110"><a href="#L-110"><span class="linenos">110</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">ls</span><span class="p">:</span>
|
||||
</span><span id="L-111"><a href="#L-111"><span class="linenos">111</span></a> <span class="k">raise</span> <span class="ne">Exception</span><span class="p">(</span><span class="s1">'Error, directory not found'</span><span class="p">)</span>
|
||||
</span><span id="L-112"><a href="#L-112"><span class="linenos">112</span></a> <span class="c1"># Exclude folders with different names</span>
|
||||
</span><span id="L-113"><a href="#L-113"><span class="linenos">113</span></a> <span class="k">for</span> <span class="n">exc</span> <span class="ow">in</span> <span class="n">ls</span><span class="p">:</span>
|
||||
</span><span id="L-114"><a href="#L-114"><span class="linenos">114</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">fnmatch</span><span class="o">.</span><span class="n">fnmatch</span><span class="p">(</span><span class="n">exc</span><span class="p">,</span> <span class="n">prefix</span> <span class="o">+</span> <span class="s1">'*'</span><span class="p">):</span>
|
||||
</span><span id="L-115"><a href="#L-115"><span class="linenos">115</span></a> <span class="n">ls</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">set</span><span class="p">(</span><span class="n">ls</span><span class="p">)</span> <span class="o">-</span> <span class="nb">set</span><span class="p">([</span><span class="n">exc</span><span class="p">]))</span>
|
||||
</span><span id="L-116"><a href="#L-116"><span class="linenos">116</span></a>
|
||||
</span><span id="L-117"><a href="#L-117"><span class="linenos">117</span></a> <span class="n">ls</span> <span class="o">=</span> <span class="n">sort_names</span><span class="p">(</span><span class="n">ls</span><span class="p">)</span>
|
||||
</span><span id="L-118"><a href="#L-118"><span class="linenos">118</span></a> <span class="n">nums</span> <span class="o">=</span> <span class="p">{}</span>
|
||||
</span><span id="L-119"><a href="#L-119"><span class="linenos">119</span></a> <span class="k">for</span> <span class="n">rep</span> <span class="ow">in</span> <span class="n">ls</span><span class="p">:</span>
|
||||
</span><span id="L-120"><a href="#L-120"><span class="linenos">120</span></a> <span class="n">rep_path</span> <span class="o">=</span> <span class="n">path</span> <span class="o">+</span> <span class="s1">'/'</span> <span class="o">+</span> <span class="n">rep</span>
|
||||
</span><span id="L-121"><a href="#L-121"><span class="linenos">121</span></a> <span class="c1"># files of replicum</span>
|
||||
</span><span id="L-122"><a href="#L-122"><span class="linenos">122</span></a> <span class="n">sub_ls</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="L-123"><a href="#L-123"><span class="linenos">123</span></a> <span class="k">for</span> <span class="p">(</span><span class="n">dirpath</span><span class="p">,</span> <span class="n">dirnames</span><span class="p">,</span> <span class="n">filenames</span><span class="p">)</span> <span class="ow">in</span> <span class="n">os</span><span class="o">.</span><span class="n">walk</span><span class="p">(</span><span class="n">rep_path</span><span class="p">):</span>
|
||||
</span><span id="L-124"><a href="#L-124"><span class="linenos">124</span></a> <span class="n">sub_ls</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="n">filenames</span><span class="p">)</span>
|
||||
</span><span id="L-125"><a href="#L-125"><span class="linenos">125</span></a>
|
||||
</span><span id="L-126"><a href="#L-126"><span class="linenos">126</span></a> <span class="c1"># filter</span>
|
||||
</span><span id="L-127"><a href="#L-127"><span class="linenos">127</span></a> <span class="n">param_files</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="L-128"><a href="#L-128"><span class="linenos">128</span></a> <span class="k">for</span> <span class="n">file</span> <span class="ow">in</span> <span class="n">sub_ls</span><span class="p">:</span>
|
||||
</span><span id="L-129"><a href="#L-129"><span class="linenos">129</span></a> <span class="k">if</span> <span class="n">fnmatch</span><span class="o">.</span><span class="n">fnmatch</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="n">param_prefix</span> <span class="o">+</span> <span class="s1">'*'</span><span class="p">):</span>
|
||||
</span><span id="L-130"><a href="#L-130"><span class="linenos">130</span></a> <span class="n">param_files</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">file</span><span class="p">)</span>
|
||||
</span><span id="L-131"><a href="#L-131"><span class="linenos">131</span></a>
|
||||
</span><span id="L-132"><a href="#L-132"><span class="linenos">132</span></a> <span class="n">rep_nums</span> <span class="o">=</span> <span class="s1">''</span>
|
||||
</span><span id="L-133"><a href="#L-133"><span class="linenos">133</span></a> <span class="k">for</span> <span class="n">file</span> <span class="ow">in</span> <span class="n">param_files</span><span class="p">:</span>
|
||||
</span><span id="L-134"><a href="#L-134"><span class="linenos">134</span></a> <span class="k">with</span> <span class="nb">open</span><span class="p">(</span><span class="n">rep_path</span> <span class="o">+</span> <span class="s1">'/'</span> <span class="o">+</span> <span class="n">file</span><span class="p">)</span> <span class="k">as</span> <span class="n">fp</span><span class="p">:</span>
|
||||
</span><span id="L-135"><a href="#L-135"><span class="linenos">135</span></a> <span class="k">for</span> <span class="n">line</span> <span class="ow">in</span> <span class="n">fp</span><span class="p">:</span>
|
||||
</span><span id="L-136"><a href="#L-136"><span class="linenos">136</span></a> <span class="k">pass</span>
|
||||
</span><span id="L-137"><a href="#L-137"><span class="linenos">137</span></a> <span class="n">last_line</span> <span class="o">=</span> <span class="n">line</span>
|
||||
</span><span id="L-138"><a href="#L-138"><span class="linenos">138</span></a> <span class="k">if</span> <span class="n">last_line</span><span class="o">.</span><span class="n">split</span><span class="p">()[</span><span class="mi">2</span><span class="p">]</span> <span class="o">!=</span> <span class="n">param_hash</span><span class="p">:</span>
|
||||
</span><span id="L-139"><a href="#L-139"><span class="linenos">139</span></a> <span class="n">rep_nums</span> <span class="o">+=</span> <span class="n">file</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="s2">"_"</span><span class="p">)[</span><span class="mi">1</span><span class="p">]</span> <span class="o">+</span> <span class="s1">','</span>
|
||||
</span><span id="L-140"><a href="#L-140"><span class="linenos">140</span></a> <span class="n">nums</span><span class="p">[</span><span class="n">rep_path</span><span class="p">]</span> <span class="o">=</span> <span class="n">rep_nums</span>
|
||||
</span><span id="L-141"><a href="#L-141"><span class="linenos">141</span></a>
|
||||
</span><span id="L-142"><a href="#L-142"><span class="linenos">142</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="nb">len</span><span class="p">(</span><span class="n">rep_nums</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
|
||||
</span><span id="L-143"><a href="#L-143"><span class="linenos">143</span></a> <span class="k">raise</span> <span class="ne">Warning</span><span class="p">(</span><span class="s2">"found differing parameter hash in the param files in "</span> <span class="o">+</span> <span class="n">rep_path</span><span class="p">)</span>
|
||||
</span><span id="L-144"><a href="#L-144"><span class="linenos">144</span></a> <span class="k">return</span> <span class="n">nums</span>
|
||||
</span></pre></div>
|
||||
|
||||
|
||||
|
|
@ -171,50 +243,51 @@
|
|||
|
||||
</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">"""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"> """</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">></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="nb">sorted</span> <span class="o">=</span> <span class="kc">False</span>
|
||||
</span><span id="sort_names-23"><a href="#sort_names-23"><span class="linenos">23</span></a> <span class="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'r(\d+)'</span>
|
||||
</span><span id="sort_names-24"><a href="#sort_names-24"><span class="linenos">24</span></a> <span class="n">id_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'id(\d+)'</span>
|
||||
</span><span id="sort_names-25"><a href="#sort_names-25"><span class="linenos">25</span></a>
|
||||
</span><span id="sort_names-26"><a href="#sort_names-26"><span class="linenos">26</span></a> <span class="c1"># sort list by id first</span>
|
||||
</span><span id="sort_names-27"><a href="#sort_names-27"><span class="linenos">27</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-28"><a href="#sort_names-28"><span class="linenos">28</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-29"><a href="#sort_names-29"><span class="linenos">29</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="sort_names-30"><a href="#sort_names-30"><span class="linenos">30</span></a> <span class="c1"># then by replikum</span>
|
||||
</span><span id="sort_names-31"><a href="#sort_names-31"><span class="linenos">31</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-32"><a href="#sort_names-32"><span class="linenos">32</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>
|
||||
<div class="pdoc-code codehilite"><pre><span></span><span id="sort_names-9"><a href="#sort_names-9"><span class="linenos"> 9</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-10"><a href="#sort_names-10"><span class="linenos">10</span></a><span class="w"> </span><span class="sd">"""Sorts a list of names of replika with searches for `r` and `id` in the replikum string.</span>
|
||||
</span><span id="sort_names-11"><a href="#sort_names-11"><span class="linenos">11</span></a><span class="sd"> If this search fails, a fallback method is used,</span>
|
||||
</span><span id="sort_names-12"><a href="#sort_names-12"><span class="linenos">12</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-13"><a href="#sort_names-13"><span class="linenos">13</span></a>
|
||||
</span><span id="sort_names-14"><a href="#sort_names-14"><span class="linenos">14</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="sort_names-15"><a href="#sort_names-15"><span class="linenos">15</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="sort_names-16"><a href="#sort_names-16"><span class="linenos">16</span></a><span class="sd"> ll: list</span>
|
||||
</span><span id="sort_names-17"><a href="#sort_names-17"><span class="linenos">17</span></a><span class="sd"> list to sort</span>
|
||||
</span><span id="sort_names-18"><a href="#sort_names-18"><span class="linenos">18</span></a>
|
||||
</span><span id="sort_names-19"><a href="#sort_names-19"><span class="linenos">19</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="sort_names-20"><a href="#sort_names-20"><span class="linenos">20</span></a><span class="sd"> -------</span>
|
||||
</span><span id="sort_names-21"><a href="#sort_names-21"><span class="linenos">21</span></a><span class="sd"> ll: list</span>
|
||||
</span><span id="sort_names-22"><a href="#sort_names-22"><span class="linenos">22</span></a><span class="sd"> sorted list</span>
|
||||
</span><span id="sort_names-23"><a href="#sort_names-23"><span class="linenos">23</span></a><span class="sd"> """</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="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">ll</span><span class="p">)</span> <span class="o">></span> <span class="mi">1</span><span class="p">:</span>
|
||||
</span><span id="sort_names-26"><a href="#sort_names-26"><span class="linenos">26</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">False</span>
|
||||
</span><span id="sort_names-27"><a href="#sort_names-27"><span class="linenos">27</span></a> <span class="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'r(\d+)'</span>
|
||||
</span><span id="sort_names-28"><a href="#sort_names-28"><span class="linenos">28</span></a> <span class="n">id_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'id(\d+)'</span>
|
||||
</span><span id="sort_names-29"><a href="#sort_names-29"><span class="linenos">29</span></a>
|
||||
</span><span id="sort_names-30"><a href="#sort_names-30"><span class="linenos">30</span></a> <span class="c1"># sort list by id first</span>
|
||||
</span><span id="sort_names-31"><a href="#sort_names-31"><span class="linenos">31</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-32"><a href="#sort_names-32"><span class="linenos">32</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-33"><a href="#sort_names-33"><span class="linenos">33</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="sort_names-34"><a href="#sort_names-34"><span class="linenos">34</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-35"><a href="#sort_names-35"><span class="linenos">35</span></a>
|
||||
</span><span id="sort_names-36"><a href="#sort_names-36"><span class="linenos">36</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="nb">sorted</span><span class="p">:</span>
|
||||
</span><span id="sort_names-37"><a href="#sort_names-37"><span class="linenos">37</span></a> <span class="c1"># fallback</span>
|
||||
</span><span id="sort_names-38"><a href="#sort_names-38"><span class="linenos">38</span></a> <span class="n">sames</span> <span class="o">=</span> <span class="s1">''</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">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-40"><a href="#sort_names-40"><span class="linenos">40</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-41"><a href="#sort_names-41"><span class="linenos">41</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-42"><a href="#sort_names-42"><span class="linenos">42</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-43"><a href="#sort_names-43"><span class="linenos">43</span></a> <span class="k">if</span> <span class="n">is_same</span><span class="p">:</span>
|
||||
</span><span id="sort_names-44"><a href="#sort_names-44"><span class="linenos">44</span></a> <span class="n">sames</span> <span class="o">+=</span> <span class="n">checking</span>
|
||||
</span><span id="sort_names-45"><a href="#sort_names-45"><span class="linenos">45</span></a> <span class="k">else</span><span class="p">:</span>
|
||||
</span><span id="sort_names-46"><a href="#sort_names-46"><span class="linenos">46</span></a> <span class="k">break</span>
|
||||
</span><span id="sort_names-47"><a href="#sort_names-47"><span class="linenos">47</span></a> <span class="nb">print</span><span class="p">(</span><span class="s2">"Using prefix:"</span><span class="p">,</span> <span class="n">sames</span><span class="p">)</span>
|
||||
</span><span id="sort_names-48"><a href="#sort_names-48"><span class="linenos">48</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">'\d+'</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-49"><a href="#sort_names-49"><span class="linenos">49</span></a> <span class="k">return</span> <span class="n">ll</span>
|
||||
</span><span id="sort_names-34"><a href="#sort_names-34"><span class="linenos">34</span></a> <span class="c1"># then by replikum</span>
|
||||
</span><span id="sort_names-35"><a href="#sort_names-35"><span class="linenos">35</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-36"><a href="#sort_names-36"><span class="linenos">36</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-37"><a href="#sort_names-37"><span class="linenos">37</span></a> <span class="nb">sorted</span> <span class="o">=</span> <span class="kc">True</span>
|
||||
</span><span id="sort_names-38"><a href="#sort_names-38"><span class="linenos">38</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-39"><a href="#sort_names-39"><span class="linenos">39</span></a>
|
||||
</span><span id="sort_names-40"><a href="#sort_names-40"><span class="linenos">40</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="nb">sorted</span><span class="p">:</span>
|
||||
</span><span id="sort_names-41"><a href="#sort_names-41"><span class="linenos">41</span></a> <span class="c1"># fallback</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="s1">''</span>
|
||||
</span><span id="sort_names-43"><a href="#sort_names-43"><span class="linenos">43</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-44"><a href="#sort_names-44"><span class="linenos">44</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-45"><a href="#sort_names-45"><span class="linenos">45</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-46"><a href="#sort_names-46"><span class="linenos">46</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-47"><a href="#sort_names-47"><span class="linenos">47</span></a> <span class="k">if</span> <span class="n">is_same</span><span class="p">:</span>
|
||||
</span><span id="sort_names-48"><a href="#sort_names-48"><span class="linenos">48</span></a> <span class="n">sames</span> <span class="o">+=</span> <span class="n">checking</span>
|
||||
</span><span id="sort_names-49"><a href="#sort_names-49"><span class="linenos">49</span></a> <span class="k">else</span><span class="p">:</span>
|
||||
</span><span id="sort_names-50"><a href="#sort_names-50"><span class="linenos">50</span></a> <span class="k">break</span>
|
||||
</span><span id="sort_names-51"><a href="#sort_names-51"><span class="linenos">51</span></a> <span class="nb">print</span><span class="p">(</span><span class="s2">"Using prefix:"</span><span class="p">,</span> <span class="n">sames</span><span class="p">)</span>
|
||||
</span><span id="sort_names-52"><a href="#sort_names-52"><span class="linenos">52</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">'\d+'</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-53"><a href="#sort_names-53"><span class="linenos">53</span></a> <span class="k">return</span> <span class="n">ll</span>
|
||||
</span></pre></div>
|
||||
|
||||
|
||||
|
|
@ -250,33 +323,34 @@ sorted list</li>
|
|||
|
||||
</div>
|
||||
<a class="headerlink" href="#check_idl"></a>
|
||||
<div class="pdoc-code codehilite"><pre><span></span><span id="check_idl-52"><a href="#check_idl-52"><span class="linenos">52</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-53"><a href="#check_idl-53"><span class="linenos">53</span></a><span class="w"> </span><span class="sd">"""Checks if list of configurations is contained in an idl</span>
|
||||
</span><span id="check_idl-54"><a href="#check_idl-54"><span class="linenos">54</span></a>
|
||||
</span><span id="check_idl-55"><a href="#check_idl-55"><span class="linenos">55</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="check_idl-56"><a href="#check_idl-56"><span class="linenos">56</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="check_idl-57"><a href="#check_idl-57"><span class="linenos">57</span></a><span class="sd"> idl : range or list</span>
|
||||
</span><span id="check_idl-58"><a href="#check_idl-58"><span class="linenos">58</span></a><span class="sd"> idl of the current replicum</span>
|
||||
</span><span id="check_idl-59"><a href="#check_idl-59"><span class="linenos">59</span></a><span class="sd"> che : list</span>
|
||||
</span><span id="check_idl-60"><a href="#check_idl-60"><span class="linenos">60</span></a><span class="sd"> list of configurations to be checked against</span>
|
||||
</span><span id="check_idl-61"><a href="#check_idl-61"><span class="linenos">61</span></a>
|
||||
</span><span id="check_idl-62"><a href="#check_idl-62"><span class="linenos">62</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="check_idl-63"><a href="#check_idl-63"><span class="linenos">63</span></a><span class="sd"> -------</span>
|
||||
</span><span id="check_idl-64"><a href="#check_idl-64"><span class="linenos">64</span></a><span class="sd"> miss_str : str</span>
|
||||
</span><span id="check_idl-65"><a href="#check_idl-65"><span class="linenos">65</span></a><span class="sd"> string with integers of which idls are missing</span>
|
||||
</span><span id="check_idl-66"><a href="#check_idl-66"><span class="linenos">66</span></a><span class="sd"> """</span>
|
||||
</span><span id="check_idl-67"><a href="#check_idl-67"><span class="linenos">67</span></a> <span class="n">missing</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="check_idl-68"><a href="#check_idl-68"><span class="linenos">68</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-69"><a href="#check_idl-69"><span class="linenos">69</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-70"><a href="#check_idl-70"><span class="linenos">70</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-71"><a href="#check_idl-71"><span class="linenos">71</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span>
|
||||
</span><span id="check_idl-72"><a href="#check_idl-72"><span class="linenos">72</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-73"><a href="#check_idl-73"><span class="linenos">73</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">"configs missing"</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="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-75"><a href="#check_idl-75"><span class="linenos">75</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-76"><a href="#check_idl-76"><span class="linenos">76</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">","</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-77"><a href="#check_idl-77"><span class="linenos">77</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-78"><a href="#check_idl-78"><span class="linenos">78</span></a> <span class="k">return</span> <span class="n">miss_str</span>
|
||||
<div class="pdoc-code codehilite"><pre><span></span><span id="check_idl-56"><a href="#check_idl-56"><span class="linenos">56</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-57"><a href="#check_idl-57"><span class="linenos">57</span></a><span class="w"> </span><span class="sd">"""Checks if list of configurations is contained in an idl</span>
|
||||
</span><span id="check_idl-58"><a href="#check_idl-58"><span class="linenos">58</span></a>
|
||||
</span><span id="check_idl-59"><a href="#check_idl-59"><span class="linenos">59</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="check_idl-60"><a href="#check_idl-60"><span class="linenos">60</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"> idl : range or list</span>
|
||||
</span><span id="check_idl-62"><a href="#check_idl-62"><span class="linenos">62</span></a><span class="sd"> idl of the current replicum</span>
|
||||
</span><span id="check_idl-63"><a href="#check_idl-63"><span class="linenos">63</span></a><span class="sd"> che : list</span>
|
||||
</span><span id="check_idl-64"><a href="#check_idl-64"><span class="linenos">64</span></a><span class="sd"> list of configurations to be checked against</span>
|
||||
</span><span id="check_idl-65"><a href="#check_idl-65"><span class="linenos">65</span></a>
|
||||
</span><span id="check_idl-66"><a href="#check_idl-66"><span class="linenos">66</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="check_idl-67"><a href="#check_idl-67"><span class="linenos">67</span></a><span class="sd"> -------</span>
|
||||
</span><span id="check_idl-68"><a href="#check_idl-68"><span class="linenos">68</span></a><span class="sd"> miss_str : str</span>
|
||||
</span><span id="check_idl-69"><a href="#check_idl-69"><span class="linenos">69</span></a><span class="sd"> string with integers of which idls are missing</span>
|
||||
</span><span id="check_idl-70"><a href="#check_idl-70"><span class="linenos">70</span></a><span class="sd"> """</span>
|
||||
</span><span id="check_idl-71"><a href="#check_idl-71"><span class="linenos">71</span></a>
|
||||
</span><span id="check_idl-72"><a href="#check_idl-72"><span class="linenos">72</span></a> <span class="n">missing</span> <span class="o">=</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">c</span> <span class="ow">in</span> <span class="n">che</span><span class="p">:</span>
|
||||
</span><span id="check_idl-74"><a href="#check_idl-74"><span class="linenos">74</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-75"><a href="#check_idl-75"><span class="linenos">75</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-76"><a href="#check_idl-76"><span class="linenos">76</span></a> <span class="c1"># print missing configurations such that it can directly be parsed to slurm terminal</span>
|
||||
</span><span id="check_idl-77"><a href="#check_idl-77"><span class="linenos">77</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-78"><a href="#check_idl-78"><span class="linenos">78</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">"configs missing"</span><span class="p">)</span>
|
||||
</span><span id="check_idl-79"><a href="#check_idl-79"><span class="linenos">79</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-80"><a href="#check_idl-80"><span class="linenos">80</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-81"><a href="#check_idl-81"><span class="linenos">81</span></a> <span class="n">miss_str</span> <span class="o">+=</span> <span class="s2">","</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-82"><a href="#check_idl-82"><span class="linenos">82</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-83"><a href="#check_idl-83"><span class="linenos">83</span></a> <span class="k">return</span> <span class="n">miss_str</span>
|
||||
</span></pre></div>
|
||||
|
||||
|
||||
|
|
@ -300,6 +374,105 @@ string with integers of which idls are missing</li>
|
|||
</div>
|
||||
|
||||
|
||||
</section>
|
||||
<section id="check_params">
|
||||
<input id="check_params-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">check_params</span><span class="signature pdoc-code condensed">(<span class="param"><span class="n">path</span>, </span><span class="param"><span class="n">param_hash</span>, </span><span class="param"><span class="n">prefix</span>, </span><span class="param"><span class="n">param_prefix</span><span class="o">=</span><span class="s1">'parameters_'</span></span><span class="return-annotation">):</span></span>
|
||||
|
||||
<label class="view-source-button" for="check_params-view-source"><span>View Source</span></label>
|
||||
|
||||
</div>
|
||||
<a class="headerlink" href="#check_params"></a>
|
||||
<div class="pdoc-code codehilite"><pre><span></span><span id="check_params-86"><a href="#check_params-86"><span class="linenos"> 86</span></a><span class="k">def</span> <span class="nf">check_params</span><span class="p">(</span><span class="n">path</span><span class="p">,</span> <span class="n">param_hash</span><span class="p">,</span> <span class="n">prefix</span><span class="p">,</span> <span class="n">param_prefix</span><span class="o">=</span><span class="s2">"parameters_"</span><span class="p">):</span>
|
||||
</span><span id="check_params-87"><a href="#check_params-87"><span class="linenos"> 87</span></a><span class="w"> </span><span class="sd">"""</span>
|
||||
</span><span id="check_params-88"><a href="#check_params-88"><span class="linenos"> 88</span></a><span class="sd"> Check if, for sfcf, the parameter hashes at the end of the parameter files are in fact the expected one.</span>
|
||||
</span><span id="check_params-89"><a href="#check_params-89"><span class="linenos"> 89</span></a>
|
||||
</span><span id="check_params-90"><a href="#check_params-90"><span class="linenos"> 90</span></a><span class="sd"> Parameters</span>
|
||||
</span><span id="check_params-91"><a href="#check_params-91"><span class="linenos"> 91</span></a><span class="sd"> ----------</span>
|
||||
</span><span id="check_params-92"><a href="#check_params-92"><span class="linenos"> 92</span></a><span class="sd"> path: str</span>
|
||||
</span><span id="check_params-93"><a href="#check_params-93"><span class="linenos"> 93</span></a><span class="sd"> measurement path, same as for sfcf read method</span>
|
||||
</span><span id="check_params-94"><a href="#check_params-94"><span class="linenos"> 94</span></a><span class="sd"> param_hash: str</span>
|
||||
</span><span id="check_params-95"><a href="#check_params-95"><span class="linenos"> 95</span></a><span class="sd"> expected parameter hash</span>
|
||||
</span><span id="check_params-96"><a href="#check_params-96"><span class="linenos"> 96</span></a><span class="sd"> prefix: str</span>
|
||||
</span><span id="check_params-97"><a href="#check_params-97"><span class="linenos"> 97</span></a><span class="sd"> data prefix to find the appropriate replicum folders in path</span>
|
||||
</span><span id="check_params-98"><a href="#check_params-98"><span class="linenos"> 98</span></a><span class="sd"> param_prefix: str</span>
|
||||
</span><span id="check_params-99"><a href="#check_params-99"><span class="linenos"> 99</span></a><span class="sd"> prefix of the parameter file. Defaults to 'parameters_'</span>
|
||||
</span><span id="check_params-100"><a href="#check_params-100"><span class="linenos">100</span></a>
|
||||
</span><span id="check_params-101"><a href="#check_params-101"><span class="linenos">101</span></a><span class="sd"> Returns</span>
|
||||
</span><span id="check_params-102"><a href="#check_params-102"><span class="linenos">102</span></a><span class="sd"> -------</span>
|
||||
</span><span id="check_params-103"><a href="#check_params-103"><span class="linenos">103</span></a><span class="sd"> nums: dict</span>
|
||||
</span><span id="check_params-104"><a href="#check_params-104"><span class="linenos">104</span></a><span class="sd"> dictionary of faulty parameter files sorted by the replica paths</span>
|
||||
</span><span id="check_params-105"><a href="#check_params-105"><span class="linenos">105</span></a><span class="sd"> """</span>
|
||||
</span><span id="check_params-106"><a href="#check_params-106"><span class="linenos">106</span></a>
|
||||
</span><span id="check_params-107"><a href="#check_params-107"><span class="linenos">107</span></a> <span class="n">ls</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="check_params-108"><a href="#check_params-108"><span class="linenos">108</span></a> <span class="k">for</span> <span class="p">(</span><span class="n">dirpath</span><span class="p">,</span> <span class="n">dirnames</span><span class="p">,</span> <span class="n">filenames</span><span class="p">)</span> <span class="ow">in</span> <span class="n">os</span><span class="o">.</span><span class="n">walk</span><span class="p">(</span><span class="n">path</span><span class="p">):</span>
|
||||
</span><span id="check_params-109"><a href="#check_params-109"><span class="linenos">109</span></a> <span class="n">ls</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="n">dirnames</span><span class="p">)</span>
|
||||
</span><span id="check_params-110"><a href="#check_params-110"><span class="linenos">110</span></a> <span class="k">break</span>
|
||||
</span><span id="check_params-111"><a href="#check_params-111"><span class="linenos">111</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">ls</span><span class="p">:</span>
|
||||
</span><span id="check_params-112"><a href="#check_params-112"><span class="linenos">112</span></a> <span class="k">raise</span> <span class="ne">Exception</span><span class="p">(</span><span class="s1">'Error, directory not found'</span><span class="p">)</span>
|
||||
</span><span id="check_params-113"><a href="#check_params-113"><span class="linenos">113</span></a> <span class="c1"># Exclude folders with different names</span>
|
||||
</span><span id="check_params-114"><a href="#check_params-114"><span class="linenos">114</span></a> <span class="k">for</span> <span class="n">exc</span> <span class="ow">in</span> <span class="n">ls</span><span class="p">:</span>
|
||||
</span><span id="check_params-115"><a href="#check_params-115"><span class="linenos">115</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">fnmatch</span><span class="o">.</span><span class="n">fnmatch</span><span class="p">(</span><span class="n">exc</span><span class="p">,</span> <span class="n">prefix</span> <span class="o">+</span> <span class="s1">'*'</span><span class="p">):</span>
|
||||
</span><span id="check_params-116"><a href="#check_params-116"><span class="linenos">116</span></a> <span class="n">ls</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">set</span><span class="p">(</span><span class="n">ls</span><span class="p">)</span> <span class="o">-</span> <span class="nb">set</span><span class="p">([</span><span class="n">exc</span><span class="p">]))</span>
|
||||
</span><span id="check_params-117"><a href="#check_params-117"><span class="linenos">117</span></a>
|
||||
</span><span id="check_params-118"><a href="#check_params-118"><span class="linenos">118</span></a> <span class="n">ls</span> <span class="o">=</span> <span class="n">sort_names</span><span class="p">(</span><span class="n">ls</span><span class="p">)</span>
|
||||
</span><span id="check_params-119"><a href="#check_params-119"><span class="linenos">119</span></a> <span class="n">nums</span> <span class="o">=</span> <span class="p">{}</span>
|
||||
</span><span id="check_params-120"><a href="#check_params-120"><span class="linenos">120</span></a> <span class="k">for</span> <span class="n">rep</span> <span class="ow">in</span> <span class="n">ls</span><span class="p">:</span>
|
||||
</span><span id="check_params-121"><a href="#check_params-121"><span class="linenos">121</span></a> <span class="n">rep_path</span> <span class="o">=</span> <span class="n">path</span> <span class="o">+</span> <span class="s1">'/'</span> <span class="o">+</span> <span class="n">rep</span>
|
||||
</span><span id="check_params-122"><a href="#check_params-122"><span class="linenos">122</span></a> <span class="c1"># files of replicum</span>
|
||||
</span><span id="check_params-123"><a href="#check_params-123"><span class="linenos">123</span></a> <span class="n">sub_ls</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="check_params-124"><a href="#check_params-124"><span class="linenos">124</span></a> <span class="k">for</span> <span class="p">(</span><span class="n">dirpath</span><span class="p">,</span> <span class="n">dirnames</span><span class="p">,</span> <span class="n">filenames</span><span class="p">)</span> <span class="ow">in</span> <span class="n">os</span><span class="o">.</span><span class="n">walk</span><span class="p">(</span><span class="n">rep_path</span><span class="p">):</span>
|
||||
</span><span id="check_params-125"><a href="#check_params-125"><span class="linenos">125</span></a> <span class="n">sub_ls</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="n">filenames</span><span class="p">)</span>
|
||||
</span><span id="check_params-126"><a href="#check_params-126"><span class="linenos">126</span></a>
|
||||
</span><span id="check_params-127"><a href="#check_params-127"><span class="linenos">127</span></a> <span class="c1"># filter</span>
|
||||
</span><span id="check_params-128"><a href="#check_params-128"><span class="linenos">128</span></a> <span class="n">param_files</span> <span class="o">=</span> <span class="p">[]</span>
|
||||
</span><span id="check_params-129"><a href="#check_params-129"><span class="linenos">129</span></a> <span class="k">for</span> <span class="n">file</span> <span class="ow">in</span> <span class="n">sub_ls</span><span class="p">:</span>
|
||||
</span><span id="check_params-130"><a href="#check_params-130"><span class="linenos">130</span></a> <span class="k">if</span> <span class="n">fnmatch</span><span class="o">.</span><span class="n">fnmatch</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="n">param_prefix</span> <span class="o">+</span> <span class="s1">'*'</span><span class="p">):</span>
|
||||
</span><span id="check_params-131"><a href="#check_params-131"><span class="linenos">131</span></a> <span class="n">param_files</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">file</span><span class="p">)</span>
|
||||
</span><span id="check_params-132"><a href="#check_params-132"><span class="linenos">132</span></a>
|
||||
</span><span id="check_params-133"><a href="#check_params-133"><span class="linenos">133</span></a> <span class="n">rep_nums</span> <span class="o">=</span> <span class="s1">''</span>
|
||||
</span><span id="check_params-134"><a href="#check_params-134"><span class="linenos">134</span></a> <span class="k">for</span> <span class="n">file</span> <span class="ow">in</span> <span class="n">param_files</span><span class="p">:</span>
|
||||
</span><span id="check_params-135"><a href="#check_params-135"><span class="linenos">135</span></a> <span class="k">with</span> <span class="nb">open</span><span class="p">(</span><span class="n">rep_path</span> <span class="o">+</span> <span class="s1">'/'</span> <span class="o">+</span> <span class="n">file</span><span class="p">)</span> <span class="k">as</span> <span class="n">fp</span><span class="p">:</span>
|
||||
</span><span id="check_params-136"><a href="#check_params-136"><span class="linenos">136</span></a> <span class="k">for</span> <span class="n">line</span> <span class="ow">in</span> <span class="n">fp</span><span class="p">:</span>
|
||||
</span><span id="check_params-137"><a href="#check_params-137"><span class="linenos">137</span></a> <span class="k">pass</span>
|
||||
</span><span id="check_params-138"><a href="#check_params-138"><span class="linenos">138</span></a> <span class="n">last_line</span> <span class="o">=</span> <span class="n">line</span>
|
||||
</span><span id="check_params-139"><a href="#check_params-139"><span class="linenos">139</span></a> <span class="k">if</span> <span class="n">last_line</span><span class="o">.</span><span class="n">split</span><span class="p">()[</span><span class="mi">2</span><span class="p">]</span> <span class="o">!=</span> <span class="n">param_hash</span><span class="p">:</span>
|
||||
</span><span id="check_params-140"><a href="#check_params-140"><span class="linenos">140</span></a> <span class="n">rep_nums</span> <span class="o">+=</span> <span class="n">file</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="s2">"_"</span><span class="p">)[</span><span class="mi">1</span><span class="p">]</span> <span class="o">+</span> <span class="s1">','</span>
|
||||
</span><span id="check_params-141"><a href="#check_params-141"><span class="linenos">141</span></a> <span class="n">nums</span><span class="p">[</span><span class="n">rep_path</span><span class="p">]</span> <span class="o">=</span> <span class="n">rep_nums</span>
|
||||
</span><span id="check_params-142"><a href="#check_params-142"><span class="linenos">142</span></a>
|
||||
</span><span id="check_params-143"><a href="#check_params-143"><span class="linenos">143</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="nb">len</span><span class="p">(</span><span class="n">rep_nums</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
|
||||
</span><span id="check_params-144"><a href="#check_params-144"><span class="linenos">144</span></a> <span class="k">raise</span> <span class="ne">Warning</span><span class="p">(</span><span class="s2">"found differing parameter hash in the param files in "</span> <span class="o">+</span> <span class="n">rep_path</span><span class="p">)</span>
|
||||
</span><span id="check_params-145"><a href="#check_params-145"><span class="linenos">145</span></a> <span class="k">return</span> <span class="n">nums</span>
|
||||
</span></pre></div>
|
||||
|
||||
|
||||
<div class="docstring"><p>Check if, for sfcf, the parameter hashes at the end of the parameter files are in fact the expected one.</p>
|
||||
|
||||
<h6 id="parameters">Parameters</h6>
|
||||
|
||||
<ul>
|
||||
<li><strong>path</strong> (str):
|
||||
measurement path, same as for sfcf read method</li>
|
||||
<li><strong>param_hash</strong> (str):
|
||||
expected parameter hash</li>
|
||||
<li><strong>prefix</strong> (str):
|
||||
data prefix to find the appropriate replicum folders in path</li>
|
||||
<li><strong>param_prefix</strong> (str):
|
||||
prefix of the parameter file. Defaults to 'parameters_'</li>
|
||||
</ul>
|
||||
|
||||
<h6 id="returns">Returns</h6>
|
||||
|
||||
<ul>
|
||||
<li><strong>nums</strong> (dict):
|
||||
dictionary of faulty parameter files sorted by the replica paths</li>
|
||||
</ul>
|
||||
</div>
|
||||
|
||||
|
||||
</section>
|
||||
</main>
|
||||
<script>
|
||||
|
|
|
|||
File diff suppressed because one or more lines are too long
Loading…
Add table
Reference in a new issue