mirror of
https://github.com/fjosw/pyerrors.git
synced 2025-05-14 19:43:41 +02:00
Documentation updated
This commit is contained in:
fjosw
parent
ba6cc09814
commit
b90c5c321b
1 changed files with 112 additions and 108 deletions
|
|
@ -99,61 +99,63 @@
|
|||
</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="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'r(\d+)'</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">'id(\d+)'</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="c1"># sort list by id first</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">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="c1"># then by replikum</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="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="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">''</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">></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">"Using prefix:"</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">'\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-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">"""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"> """</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">"configs missing"</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">","</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><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>
|
||||
</span></pre></div>
|
||||
|
||||
|
||||
|
|
@ -185,32 +187,34 @@
|
|||
</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="n">r_pattern</span> <span class="o">=</span> <span class="sa">r</span><span class="s1">'r(\d+)'</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">'id(\d+)'</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">''</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">></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">"Using prefix:"</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">'\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-47"><a href="#sort_names-47"><span class="linenos">47</span></a> <span class="k">return</span> <span class="n">ll</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>
|
||||
</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></pre></div>
|
||||
|
||||
|
||||
|
|
@ -246,33 +250,33 @@ sorted list</li>
|
|||
|
||||
</div>
|
||||
<a class="headerlink" href="#check_idl"></a>
|
||||
<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-51"><a href="#check_idl-51"><span class="linenos">51</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-52"><a href="#check_idl-52"><span class="linenos">52</span></a>
|
||||
</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-54"><a href="#check_idl-54"><span class="linenos">54</span></a><span class="sd"> ----------</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-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-57"><a href="#check_idl-57"><span class="linenos">57</span></a><span class="sd"> che : list</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-59"><a href="#check_idl-59"><span class="linenos">59</span></a>
|
||||
</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-61"><a href="#check_idl-61"><span class="linenos">61</span></a><span class="sd"> -------</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-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-64"><a href="#check_idl-64"><span class="linenos">64</span></a><span class="sd"> """</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-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-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-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-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-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-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">"configs missing"</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-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-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">","</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-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-76"><a href="#check_idl-76"><span class="linenos">76</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-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>
|
||||
</span></pre></div>
|
||||
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue