source: sasview/_modules/park/deps.html @ a462c6a

gh-pages
Last change on this file since a462c6a was a462c6a, checked in by ajj, 9 years ago

Rebuild to fix index and modules docs

  • Property mode set to 100644
File size: 19.9 KB
Line 
1<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
2  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
3
4
5<html xmlns="http://www.w3.org/1999/xhtml">
6  <head>
7    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
8   
9    <title>park.deps &mdash; SasView 3.0.0 documentation</title>
10   
11    <link rel="stylesheet" href="../../_static/default.css" type="text/css" />
12    <link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
13   
14    <script type="text/javascript">
15      var DOCUMENTATION_OPTIONS = {
16        URL_ROOT:    '../../',
17        VERSION:     '3.0.0',
18        COLLAPSE_INDEX: false,
19        FILE_SUFFIX: '.html',
20        HAS_SOURCE:  true
21      };
22    </script>
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    <script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
27    <link rel="top" title="SasView 3.0.0 documentation" href="../../index.html" />
28    <link rel="up" title="Module code" href="../index.html" /> 
29  </head>
30  <body>
31    <div class="related">
32      <h3>Navigation</h3>
33      <ul>
34        <li class="right" style="margin-right: 10px">
35          <a href="../../genindex.html" title="General Index"
36             accesskey="I">index</a></li>
37        <li class="right" >
38          <a href="../../py-modindex.html" title="Python Module Index"
39             >modules</a> |</li>
40        <li><a href="../../index.html">SasView 3.0.0 documentation</a> &raquo;</li>
41          <li><a href="../index.html" accesskey="U">Module code</a> &raquo;</li> 
42      </ul>
43    </div> 
44
45    <div class="document">
46      <div class="documentwrapper">
47        <div class="bodywrapper">
48          <div class="body">
49           
50  <h1>Source code for park.deps</h1><div class="highlight"><pre>
51<span class="c"># This program is public domain</span>
52<span class="c"># Author: Paul Kienzle</span>
53<span class="sd">&quot;&quot;&quot;</span>
54<span class="sd">Functions for manipulating dependencies.</span>
55
56<span class="sd">Parameter values must be updated in the correct order.  If parameter A</span>
57<span class="sd">depends on parameter B, then parameter B must be evaluated first.  </span>
58<span class="sd">&quot;&quot;&quot;</span>
59
60<div class="viewcode-block" id="order_dependencies"><a class="viewcode-back" href="../../dev/api/park.html#park.deps.order_dependencies">[docs]</a><span class="k">def</span> <span class="nf">order_dependencies</span><span class="p">(</span><span class="n">pairs</span><span class="p">):</span>
61    <span class="sd">&quot;&quot;&quot;</span>
62<span class="sd">    Order elements from pairs so that b comes before a in the</span>
63<span class="sd">    ordered list for all pairs (a,b).</span>
64<span class="sd">    &quot;&quot;&quot;</span>
65    <span class="c">#print &quot;order_dependencies&quot;,pairs</span>
66    <span class="n">emptyset</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span>
67    <span class="n">order</span> <span class="o">=</span> <span class="p">[]</span>
68
69    <span class="c"># Break pairs into left set and right set</span>
70    <span class="n">left</span><span class="p">,</span><span class="n">right</span> <span class="o">=</span> <span class="p">[</span><span class="nb">set</span><span class="p">(</span><span class="n">s</span><span class="p">)</span> <span class="k">for</span> <span class="n">s</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="o">*</span><span class="n">pairs</span><span class="p">)]</span> <span class="k">if</span> <span class="n">pairs</span> <span class="o">!=</span> <span class="p">[]</span> <span class="k">else</span> <span class="p">([],[])</span>
71    <span class="k">while</span> <span class="n">pairs</span> <span class="o">!=</span> <span class="p">[]:</span>
72        <span class="c">#print &quot;within&quot;,pairs</span>
73        <span class="c"># Find which items only occur on the right</span>
74        <span class="n">independent</span> <span class="o">=</span> <span class="n">right</span> <span class="o">-</span> <span class="n">left</span>
75        <span class="k">if</span> <span class="n">independent</span> <span class="o">==</span> <span class="n">emptyset</span><span class="p">:</span>
76            <span class="n">cycleset</span> <span class="o">=</span> <span class="s">&quot;, &quot;</span><span class="o">.</span><span class="n">join</span><span class="p">(</span><span class="nb">str</span><span class="p">(</span><span class="n">s</span><span class="p">)</span> <span class="k">for</span> <span class="n">s</span> <span class="ow">in</span> <span class="n">left</span><span class="p">)</span>
77            <span class="k">raise</span> <span class="ne">ValueError</span><span class="p">,</span><span class="s">&quot;Cyclic dependencies amongst </span><span class="si">%s</span><span class="s">&quot;</span><span class="o">%</span><span class="n">cycleset</span>
78
79        <span class="c"># The possibly resolvable items are those that depend on the independents</span>
80        <span class="n">dependent</span> <span class="o">=</span> <span class="nb">set</span><span class="p">([</span><span class="n">a</span> <span class="k">for</span> <span class="n">a</span><span class="p">,</span><span class="n">b</span> <span class="ow">in</span> <span class="n">pairs</span> <span class="k">if</span> <span class="n">b</span> <span class="ow">in</span> <span class="n">independent</span><span class="p">])</span>
81        <span class="n">pairs</span> <span class="o">=</span> <span class="p">[(</span><span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">)</span> <span class="k">for</span> <span class="n">a</span><span class="p">,</span><span class="n">b</span> <span class="ow">in</span> <span class="n">pairs</span> <span class="k">if</span> <span class="n">b</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">independent</span><span class="p">]</span>
82        <span class="k">if</span> <span class="n">pairs</span> <span class="o">==</span> <span class="p">[]:</span>
83            <span class="n">resolved</span> <span class="o">=</span> <span class="n">dependent</span>
84        <span class="k">else</span><span class="p">:</span>
85            <span class="n">left</span><span class="p">,</span><span class="n">right</span> <span class="o">=</span> <span class="p">[</span><span class="nb">set</span><span class="p">(</span><span class="n">s</span><span class="p">)</span> <span class="k">for</span> <span class="n">s</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="o">*</span><span class="n">pairs</span><span class="p">)]</span>
86            <span class="n">resolved</span> <span class="o">=</span> <span class="n">dependent</span> <span class="o">-</span> <span class="n">left</span>
87        <span class="c">#print &quot;independent&quot;,independent,&quot;dependent&quot;,dependent,&quot;resolvable&quot;,resolved</span>
88        <span class="n">order</span> <span class="o">+=</span> <span class="n">resolved</span>
89        <span class="c">#print &quot;new order&quot;,order</span>
90    <span class="n">order</span><span class="o">.</span><span class="n">reverse</span><span class="p">()</span>
91    <span class="k">return</span> <span class="n">order</span>
92
93<span class="c"># ========= Test code ========</span></div>
94<span class="k">def</span> <span class="nf">_check</span><span class="p">(</span><span class="n">msg</span><span class="p">,</span><span class="n">pairs</span><span class="p">):</span>
95    <span class="sd">&quot;&quot;&quot;</span>
96<span class="sd">    Verify that the list n contains the given items, and that the list</span>
97<span class="sd">    satisfies the partial ordering given by the pairs in partial order.</span>
98<span class="sd">    &quot;&quot;&quot;</span>
99    <span class="n">left</span><span class="p">,</span><span class="n">right</span> <span class="o">=</span> <span class="nb">zip</span><span class="p">(</span><span class="o">*</span><span class="n">pairs</span><span class="p">)</span> <span class="k">if</span> <span class="n">pairs</span> <span class="o">!=</span> <span class="p">[]</span> <span class="k">else</span> <span class="p">([],[])</span>
100    <span class="n">items</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">left</span><span class="p">)</span>
101    <span class="n">n</span> <span class="o">=</span> <span class="n">order_dependencies</span><span class="p">(</span><span class="n">pairs</span><span class="p">)</span>
102    <span class="k">if</span> <span class="nb">set</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> <span class="o">!=</span> <span class="n">items</span> <span class="ow">or</span> <span class="nb">len</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">items</span><span class="p">):</span>
103        <span class="n">n</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span>
104        <span class="n">items</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">items</span><span class="p">);</span> <span class="n">items</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span>
105        <span class="k">raise</span> <span class="ne">Exception</span><span class="p">,</span><span class="s">&quot;</span><span class="si">%s</span><span class="s"> expect </span><span class="si">%s</span><span class="s"> to contain </span><span class="si">%s</span><span class="s"> for </span><span class="si">%s</span><span class="s">&quot;</span><span class="o">%</span><span class="p">(</span><span class="n">msg</span><span class="p">,</span><span class="n">n</span><span class="p">,</span><span class="n">items</span><span class="p">,</span><span class="n">pairs</span><span class="p">)</span>
106    <span class="k">for</span> <span class="n">lo</span><span class="p">,</span><span class="n">hi</span> <span class="ow">in</span> <span class="n">pairs</span><span class="p">:</span>
107        <span class="k">if</span> <span class="n">lo</span> <span class="ow">in</span> <span class="n">n</span> <span class="ow">and</span> <span class="n">hi</span> <span class="ow">in</span> <span class="n">n</span> <span class="ow">and</span> <span class="n">n</span><span class="o">.</span><span class="n">index</span><span class="p">(</span><span class="n">lo</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="n">n</span><span class="o">.</span><span class="n">index</span><span class="p">(</span><span class="n">hi</span><span class="p">):</span>
108            <span class="k">raise</span> <span class="ne">Exception</span><span class="p">,</span><span class="s">&quot;</span><span class="si">%s</span><span class="s"> expect </span><span class="si">%s</span><span class="s"> before </span><span class="si">%s</span><span class="s"> in </span><span class="si">%s</span><span class="s"> for </span><span class="si">%s</span><span class="s">&quot;</span><span class="o">%</span><span class="p">(</span><span class="n">msg</span><span class="p">,</span><span class="n">lo</span><span class="p">,</span><span class="n">hi</span><span class="p">,</span><span class="n">n</span><span class="p">,</span><span class="n">pairs</span><span class="p">)</span>
109
110<div class="viewcode-block" id="test"><a class="viewcode-back" href="../../dev/api/park.html#park.deps.test">[docs]</a><span class="k">def</span> <span class="nf">test</span><span class="p">():</span>
111    <span class="kn">import</span> <span class="nn">numpy</span>
112
113    <span class="c"># Null case</span>
114    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;test empty&quot;</span><span class="p">,[])</span>
115
116    <span class="c"># Some dependencies</span>
117    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;test1&quot;</span><span class="p">,[(</span><span class="mi">2</span><span class="p">,</span><span class="mi">7</span><span class="p">),(</span><span class="mi">1</span><span class="p">,</span><span class="mi">5</span><span class="p">),(</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">),(</span><span class="mi">2</span><span class="p">,</span><span class="mi">1</span><span class="p">),(</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">),(</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">)])</span>
118    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;test1 renumbered&quot;</span><span class="p">,[(</span><span class="mi">6</span><span class="p">,</span><span class="mi">1</span><span class="p">),(</span><span class="mi">7</span><span class="p">,</span><span class="mi">3</span><span class="p">),(</span><span class="mi">7</span><span class="p">,</span><span class="mi">4</span><span class="p">),(</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">),(</span><span class="mi">5</span><span class="p">,</span><span class="mi">7</span><span class="p">),(</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">)])</span>
119    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;test1 numpy&quot;</span><span class="p">,</span><span class="n">numpy</span><span class="o">.</span><span class="n">array</span><span class="p">([(</span><span class="mi">2</span><span class="p">,</span><span class="mi">7</span><span class="p">),(</span><span class="mi">1</span><span class="p">,</span><span class="mi">5</span><span class="p">),(</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">),(</span><span class="mi">2</span><span class="p">,</span><span class="mi">1</span><span class="p">),(</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">),(</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">)]))</span>
120
121    <span class="c"># No dependencies</span>
122    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;test2&quot;</span><span class="p">,[(</span><span class="mi">4</span><span class="p">,</span><span class="mi">1</span><span class="p">),(</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">),(</span><span class="mi">8</span><span class="p">,</span><span class="mi">4</span><span class="p">)])</span>
123
124    <span class="c"># Cycle test</span>
125    <span class="n">pairs</span> <span class="o">=</span> <span class="p">[(</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">),(</span><span class="mi">4</span><span class="p">,</span><span class="mi">3</span><span class="p">),(</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">),(</span><span class="mi">5</span><span class="p">,</span><span class="mi">1</span><span class="p">)]</span> 
126    <span class="k">try</span><span class="p">:</span> <span class="n">n</span> <span class="o">=</span> <span class="n">order_dependencies</span><span class="p">(</span><span class="n">pairs</span><span class="p">)</span>
127    <span class="k">except</span> <span class="ne">ValueError</span><span class="p">:</span> <span class="k">pass</span>
128    <span class="k">else</span><span class="p">:</span> <span class="k">raise</span> <span class="ne">Exception</span><span class="p">,</span><span class="s">&quot;test3 expect ValueError exception for </span><span class="si">%s</span><span class="s">&quot;</span><span class="o">%</span><span class="p">(</span><span class="n">pairs</span><span class="p">,)</span>
129
130    <span class="c"># large test for gross speed check</span>
131    <span class="n">A</span> <span class="o">=</span> <span class="n">numpy</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">randint</span><span class="p">(</span><span class="mi">4000</span><span class="p">,</span><span class="n">size</span><span class="o">=</span><span class="p">(</span><span class="mi">1000</span><span class="p">,</span><span class="mi">2</span><span class="p">))</span>
132    <span class="n">A</span><span class="p">[:,</span><span class="mi">1</span><span class="p">]</span> <span class="o">+=</span> <span class="mi">4000</span>  <span class="c"># Avoid cycles</span>
133    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;test-large&quot;</span><span class="p">,</span><span class="n">A</span><span class="p">)</span>
134
135    <span class="c"># depth tests</span>
136    <span class="n">k</span> <span class="o">=</span> <span class="mi">200</span>
137    <span class="n">A</span> <span class="o">=</span> <span class="n">numpy</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="nb">range</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="n">k</span><span class="p">),</span><span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">k</span><span class="o">+</span><span class="mi">1</span><span class="p">)])</span><span class="o">.</span><span class="n">T</span>
138    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;depth-1&quot;</span><span class="p">,</span><span class="n">A</span><span class="p">)</span>
139
140    <span class="n">A</span> <span class="o">=</span> <span class="n">numpy</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="n">k</span><span class="o">+</span><span class="mi">1</span><span class="p">),</span><span class="nb">range</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="n">k</span><span class="p">)])</span><span class="o">.</span><span class="n">T</span>
141    <span class="n">_check</span><span class="p">(</span><span class="s">&quot;depth-2&quot;</span><span class="p">,</span><span class="n">A</span><span class="p">)</span>
142</div>
143<span class="k">if</span> <span class="n">__name__</span> <span class="o">==</span> <span class="s">&quot;__main__&quot;</span><span class="p">:</span>
144    <span class="n">test</span><span class="p">()</span>
145</pre></div>
146
147          </div>
148        </div>
149      </div>
150      <div class="sphinxsidebar">
151        <div class="sphinxsidebarwrapper">
152<div id="searchbox" style="display: none">
153  <h3>Quick search</h3>
154    <form class="search" action="../../search.html" method="get">
155      <input type="text" name="q" />
156      <input type="submit" value="Go" />
157      <input type="hidden" name="check_keywords" value="yes" />
158      <input type="hidden" name="area" value="default" />
159    </form>
160    <p class="searchtip" style="font-size: 90%">
161    Enter search terms or a module, class or function name.
162    </p>
163</div>
164<script type="text/javascript">$('#searchbox').show(0);</script>
165        </div>
166      </div>
167      <div class="clearer"></div>
168    </div>
169    <div class="related">
170      <h3>Navigation</h3>
171      <ul>
172        <li class="right" style="margin-right: 10px">
173          <a href="../../genindex.html" title="General Index"
174             >index</a></li>
175        <li class="right" >
176          <a href="../../py-modindex.html" title="Python Module Index"
177             >modules</a> |</li>
178        <li><a href="../../index.html">SasView 3.0.0 documentation</a> &raquo;</li>
179          <li><a href="../index.html" >Module code</a> &raquo;</li> 
180      </ul>
181    </div>
182    <div class="footer">
183        &copy; Copyright 2013, The SasView Project.
184      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.3.
185    </div>
186  </body>
187</html>
Note: See TracBrowser for help on using the repository browser.