1 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
2 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
5 <html xmlns="http://www.w3.org/1999/xhtml">
7 <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
9 <title>nepi.util.rmatcher — NEPI 3.2 documentation</title>
11 <link rel="stylesheet" href="../../../_static/sphinxdoc.css" type="text/css" />
12 <link rel="stylesheet" href="../../../_static/pygments.css" type="text/css" />
14 <script type="text/javascript">
15 var DOCUMENTATION_OPTIONS = {
16 URL_ROOT: '../../../',
18 COLLAPSE_INDEX: false,
23 <script type="text/javascript" src="../../../_static/jquery.js"></script>
24 <script type="text/javascript" src="../../../_static/underscore.js"></script>
25 <script type="text/javascript" src="../../../_static/doctools.js"></script>
26 <link rel="top" title="NEPI 3.2 documentation" href="../../../index.html" />
27 <link rel="up" title="Module code" href="../../index.html" />
33 <li class="right" style="margin-right: 10px">
34 <a href="../../../genindex.html" title="General Index"
35 accesskey="I">index</a></li>
37 <a href="../../../py-modindex.html" title="Python Module Index"
39 <li><a href="../../../index.html">NEPI 3.2 documentation</a> »</li>
40 <li><a href="../../index.html" accesskey="U">Module code</a> »</li>
43 <div class="sphinxsidebar">
44 <div class="sphinxsidebarwrapper">
45 <div id="searchbox" style="display: none">
47 <form class="search" action="../../../search.html" method="get">
48 <input type="text" name="q" />
49 <input type="submit" value="Go" />
50 <input type="hidden" name="check_keywords" value="yes" />
51 <input type="hidden" name="area" value="default" />
53 <p class="searchtip" style="font-size: 90%">
54 Enter search terms or a module, class or function name.
57 <script type="text/javascript">$('#searchbox').show(0);</script>
61 <div class="document">
62 <div class="documentwrapper">
63 <div class="bodywrapper">
66 <h1>Source code for nepi.util.rmatcher</h1><div class="highlight"><pre>
67 <span class="c">#</span>
68 <span class="c"># NEPI, a framework to manage network experiments</span>
69 <span class="c"># Copyright (C) 2013 INRIA</span>
70 <span class="c">#</span>
71 <span class="c"># This program is free software: you can redistribute it and/or modify</span>
72 <span class="c"># it under the terms of the GNU General Public License version 2 as</span>
73 <span class="c"># published by the Free Software Foundation;</span>
74 <span class="c">#</span>
75 <span class="c"># This program is distributed in the hope that it will be useful,</span>
76 <span class="c"># but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
77 <span class="c"># MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
78 <span class="c"># GNU General Public License for more details.</span>
79 <span class="c">#</span>
80 <span class="c"># You should have received a copy of the GNU General Public License</span>
81 <span class="c"># along with this program. If not, see <http://www.gnu.org/licenses/>.</span>
82 <span class="c">#</span>
83 <span class="c"># Author: Alina Quereilhac <alina.quereilhac@inria.fr></span>
85 <div class="viewcode-block" id="match_tags"><a class="viewcode-back" href="../../../_layout/nepi.util.html#nepi.util.rmatcher.match_tags">[docs]</a><span class="k">def</span> <span class="nf">match_tags</span><span class="p">(</span><span class="n">box</span><span class="p">,</span> <span class="n">all_tags</span><span class="p">,</span> <span class="n">exact_tags</span><span class="p">):</span>
86 <span class="sd">""" returns True if box has required tags """</span>
87 <span class="n">tall</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">all_tags</span><span class="p">)</span>
88 <span class="n">texact</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">exact_tags</span><span class="p">)</span>
90 <span class="k">if</span> <span class="n">texact</span> <span class="ow">and</span> <span class="n">box</span><span class="o">.</span><span class="n">connections</span> <span class="o">==</span> <span class="n">texact</span><span class="p">:</span>
91 <span class="k">return</span> <span class="bp">True</span>
93 <span class="k">if</span> <span class="n">tall</span> <span class="ow">and</span> <span class="n">tall</span><span class="o">.</span><span class="n">issubset</span><span class="p">(</span><span class="n">box</span><span class="o">.</span><span class="n">connections</span><span class="p">):</span>
94 <span class="k">return</span> <span class="bp">True</span>
96 <span class="k">return</span> <span class="bp">False</span>
98 <div class="viewcode-block" id="find_boxes"><a class="viewcode-back" href="../../../_layout/nepi.util.html#nepi.util.rmatcher.find_boxes">[docs]</a><span class="k">def</span> <span class="nf">find_boxes</span><span class="p">(</span><span class="n">box</span><span class="p">,</span> <span class="n">all_tags</span> <span class="o">=</span> <span class="bp">None</span><span class="p">,</span> <span class="n">exact_tags</span> <span class="o">=</span> <span class="bp">None</span><span class="p">,</span> <span class="n">max_depth</span> <span class="o">=</span> <span class="mi">1</span><span class="p">):</span>
99 <span class="sd">""" Look for the connected boxes with the required tags, doing breath-first</span>
100 <span class="sd"> search, until max_depth ( max_depth = None will traverse the entire graph ).</span>
101 <span class="sd"> """</span>
102 <span class="k">if</span> <span class="ow">not</span> <span class="n">all_tags</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">exact_tags</span><span class="p">:</span>
103 <span class="n">msg</span> <span class="o">=</span> <span class="s">"No matching criteria for resources."</span>
104 <span class="k">raise</span> <span class="ne">RuntimeError</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span>
106 <span class="n">queue</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
107 <span class="c"># enqueue (depth, box) </span>
108 <span class="n">queue</span><span class="o">.</span><span class="n">add</span><span class="p">((</span><span class="mi">0</span><span class="p">,</span> <span class="n">box</span><span class="p">))</span>
110 <span class="n">traversed</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
111 <span class="n">traversed</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">box</span><span class="p">)</span>
113 <span class="n">depth</span> <span class="o">=</span> <span class="mi">0</span>
115 <span class="n">result</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
117 <span class="k">while</span> <span class="nb">len</span><span class="p">(</span><span class="n">q</span><span class="p">)</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span>
118 <span class="p">(</span><span class="n">depth</span><span class="p">,</span> <span class="n">a</span><span class="p">)</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>
119 <span class="k">if</span> <span class="n">match_tags</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">all_tags</span><span class="p">,</span> <span class="n">exact_tags</span><span class="p">):</span>
120 <span class="n">result</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
122 <span class="k">if</span> <span class="ow">not</span> <span class="n">max_depth</span> <span class="ow">or</span> <span class="n">depth</span> <span class="o"><=</span> <span class="n">max_depth</span><span class="p">:</span>
123 <span class="n">depth</span> <span class="o">+=</span> <span class="mi">1</span>
124 <span class="k">for</span> <span class="n">b</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">a</span><span class="o">.</span><span class="n">connections</span><span class="p">):</span>
125 <span class="k">if</span> <span class="n">b</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">traversed</span><span class="p">:</span>
126 <span class="n">traversed</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">b</span><span class="p">)</span>
127 <span class="n">queue</span><span class="o">.</span><span class="n">add</span><span class="p">((</span><span class="n">depth</span><span class="p">,</span> <span class="n">b</span><span class="p">))</span>
129 <span class="k">return</span> <span class="n">result</span></div>
135 <div class="clearer"></div>
137 <div class="related">
140 <li class="right" style="margin-right: 10px">
141 <a href="../../../genindex.html" title="General Index"
144 <a href="../../../py-modindex.html" title="Python Module Index"
146 <li><a href="../../../index.html">NEPI 3.2 documentation</a> »</li>
147 <li><a href="../../index.html" >Module code</a> »</li>
151 © Copyright 2014, Alina Quereilhac, Lucia Guevgeozian Odizzio, Julien Tribino.
152 Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.3.