diff options
Diffstat (limited to 'doc/sample_html/cogapp_whiteutils.html')
-rw-r--r-- | doc/sample_html/cogapp_whiteutils.html | 126 |
1 files changed, 63 insertions, 63 deletions
diff --git a/doc/sample_html/cogapp_whiteutils.html b/doc/sample_html/cogapp_whiteutils.html index e5f84356..b2aaf865 100644 --- a/doc/sample_html/cogapp_whiteutils.html +++ b/doc/sample_html/cogapp_whiteutils.html @@ -103,69 +103,69 @@ function toggle_lines(btn, cls) { </td>
<td class='text' valign='top'>
-<p class='pln'>""" Indentation utilities for Cog.</p>
-<p class='pln'> http://nedbatchelder.com/code/cog</p>
-<p class='pln'> </p>
-<p class='pln'> Copyright 2004-2009, Ned Batchelder.</p>
-<p class='pln'>"""</p>
-<p class='pln'> </p>
-<p class='stm run hide'>import re</p>
-<p class='pln'> </p>
-<p class='stm run hide'>def whitePrefix(strings):</p>
-<p class='pln'> """ Determine the whitespace prefix common to all non-blank lines</p>
-<p class='pln'> in the argument list.</p>
-<p class='pln'> """</p>
-<p class='pln'> # Remove all blank lines from the list</p>
-<p class='stm run hide'> strings = [s for s in strings if s.strip() != '']</p>
-<p class='pln'> </p>
-<p class='stm run hide'> if not strings: return ''</p>
-<p class='pln'> </p>
-<p class='pln'> # Find initial whitespace chunk in the first line.</p>
-<p class='pln'> # This is the best prefix we can hope for.</p>
-<p class='stm run hide'> prefix = re.match(r'\s*', strings[0]).group(0)</p>
-<p class='pln'> </p>
-<p class='pln'> # Loop over the other strings, keeping only as much of</p>
-<p class='pln'> # the prefix as matches each string.</p>
-<p class='stm run hide'> for s in strings:</p>
-<p class='stm run hide'> for i in range(len(prefix)):</p>
-<p class='stm run hide'> if prefix[i] != s[i]:</p>
-<p class='stm mis'> prefix = prefix[:i]</p>
-<p class='stm mis'> break</p>
-<p class='stm run hide'> return prefix</p>
-<p class='pln'> </p>
-<p class='stm run hide'>def reindentBlock(lines, newIndent=''):</p>
-<p class='pln'> """ Take a block of text as a string or list of lines.</p>
-<p class='pln'> Remove any common whitespace indentation.</p>
-<p class='pln'> Re-indent using newIndent, and return it as a single string.</p>
-<p class='pln'> """</p>
-<p class='stm run hide'> if isinstance(lines, basestring):</p>
-<p class='stm run hide'> lines = lines.split('\n')</p>
-<p class='stm run hide'> oldIndent = whitePrefix(lines)</p>
-<p class='stm run hide'> outLines = []</p>
-<p class='stm run hide'> for l in lines:</p>
-<p class='stm run hide'> if oldIndent:</p>
-<p class='stm run hide'> l = l.replace(oldIndent, '', 1)</p>
-<p class='stm run hide'> if l and newIndent:</p>
-<p class='stm run hide'> l = newIndent + l</p>
-<p class='stm run hide'> outLines.append(l)</p>
-<p class='stm run hide'> return '\n'.join(outLines)</p>
-<p class='pln'> </p>
-<p class='stm run hide'>def commonPrefix(strings):</p>
-<p class='pln'> """ Find the longest string that is a prefix of all the strings.</p>
-<p class='pln'> """</p>
-<p class='stm run hide'> if not strings:</p>
-<p class='stm mis'> return ''</p>
-<p class='stm run hide'> prefix = strings[0]</p>
-<p class='stm run hide'> for s in strings:</p>
-<p class='stm run hide'> if len(s) < len(prefix):</p>
-<p class='stm run hide'> prefix = prefix[:len(s)]</p>
-<p class='stm run hide'> if not prefix:</p>
-<p class='stm run hide'> return ''</p>
-<p class='stm run hide'> for i in range(len(prefix)):</p>
-<p class='stm run hide'> if prefix[i] != s[i]:</p>
-<p class='stm run hide'> prefix = prefix[:i]</p>
-<p class='stm run hide'> break</p>
-<p class='stm run hide'> return prefix</p>
+<p class='pln'><span class='str'>""" Indentation utilities for Cog.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> http://nedbatchelder.com/code/cog</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> </span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> Copyright 2004-2009, Ned Batchelder.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'>"""</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='stm run hide'><span class='key'>import</span> <span class='nam'>re</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='stm run hide'><span class='key'>def</span> <span class='nam'>whitePrefix</span><span class='op'>(</span><span class='nam'>strings</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='pln'> <span class='str'>""" Determine the whitespace prefix common to all non-blank lines</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> in the argument list.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> """</span><span class="strut"> </span></p>
+<p class='pln'> <span class='com'># Remove all blank lines from the list</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>strings</span> <span class='op'>=</span> <span class='op'>[</span><span class='nam'>s</span> <span class='key'>for</span> <span class='nam'>s</span> <span class='key'>in</span> <span class='nam'>strings</span> <span class='key'>if</span> <span class='nam'>s</span><span class='op'>.</span><span class='nam'>strip</span><span class='op'>(</span><span class='op'>)</span> <span class='op'>!=</span> <span class='str'>''</span><span class='op'>]</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='key'>not</span> <span class='nam'>strings</span><span class='op'>:</span> <span class='key'>return</span> <span class='str'>''</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='pln'> <span class='com'># Find initial whitespace chunk in the first line.</span><span class="strut"> </span></p>
+<p class='pln'> <span class='com'># This is the best prefix we can hope for.</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>prefix</span> <span class='op'>=</span> <span class='nam'>re</span><span class='op'>.</span><span class='nam'>match</span><span class='op'>(</span><span class='str'>r'\s*'</span><span class='op'>,</span> <span class='nam'>strings</span><span class='op'>[</span><span class='num'>0</span><span class='op'>]</span><span class='op'>)</span><span class='op'>.</span><span class='nam'>group</span><span class='op'>(</span><span class='num'>0</span><span class='op'>)</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='pln'> <span class='com'># Loop over the other strings, keeping only as much of</span><span class="strut"> </span></p>
+<p class='pln'> <span class='com'># the prefix as matches each string.</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>for</span> <span class='nam'>s</span> <span class='key'>in</span> <span class='nam'>strings</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>for</span> <span class='nam'>i</span> <span class='key'>in</span> <span class='nam'>range</span><span class='op'>(</span><span class='nam'>len</span><span class='op'>(</span><span class='nam'>prefix</span><span class='op'>)</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='nam'>prefix</span><span class='op'>[</span><span class='nam'>i</span><span class='op'>]</span> <span class='op'>!=</span> <span class='nam'>s</span><span class='op'>[</span><span class='nam'>i</span><span class='op'>]</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm mis'> <span class='nam'>prefix</span> <span class='op'>=</span> <span class='nam'>prefix</span><span class='op'>[</span><span class='op'>:</span><span class='nam'>i</span><span class='op'>]</span><span class="strut"> </span></p>
+<p class='stm mis'> <span class='key'>break</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>return</span> <span class='nam'>prefix</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='stm run hide'><span class='key'>def</span> <span class='nam'>reindentBlock</span><span class='op'>(</span><span class='nam'>lines</span><span class='op'>,</span> <span class='nam'>newIndent</span><span class='op'>=</span><span class='str'>''</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='pln'> <span class='str'>""" Take a block of text as a string or list of lines.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> Remove any common whitespace indentation.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> Re-indent using newIndent, and return it as a single string.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> """</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='nam'>isinstance</span><span class='op'>(</span><span class='nam'>lines</span><span class='op'>,</span> <span class='nam'>basestring</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>lines</span> <span class='op'>=</span> <span class='nam'>lines</span><span class='op'>.</span><span class='nam'>split</span><span class='op'>(</span><span class='str'>'\n'</span><span class='op'>)</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>oldIndent</span> <span class='op'>=</span> <span class='nam'>whitePrefix</span><span class='op'>(</span><span class='nam'>lines</span><span class='op'>)</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>outLines</span> <span class='op'>=</span> <span class='op'>[</span><span class='op'>]</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>for</span> <span class='nam'>l</span> <span class='key'>in</span> <span class='nam'>lines</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='nam'>oldIndent</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>l</span> <span class='op'>=</span> <span class='nam'>l</span><span class='op'>.</span><span class='nam'>replace</span><span class='op'>(</span><span class='nam'>oldIndent</span><span class='op'>,</span> <span class='str'>''</span><span class='op'>,</span> <span class='num'>1</span><span class='op'>)</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='nam'>l</span> <span class='key'>and</span> <span class='nam'>newIndent</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>l</span> <span class='op'>=</span> <span class='nam'>newIndent</span> <span class='op'>+</span> <span class='nam'>l</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>outLines</span><span class='op'>.</span><span class='nam'>append</span><span class='op'>(</span><span class='nam'>l</span><span class='op'>)</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>return</span> <span class='str'>'\n'</span><span class='op'>.</span><span class='nam'>join</span><span class='op'>(</span><span class='nam'>outLines</span><span class='op'>)</span><span class="strut"> </span></p>
+<p class='pln'><span class="strut"> </span></p>
+<p class='stm run hide'><span class='key'>def</span> <span class='nam'>commonPrefix</span><span class='op'>(</span><span class='nam'>strings</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='pln'> <span class='str'>""" Find the longest string that is a prefix of all the strings.</span><span class="strut"> </span></p>
+<p class='pln'><span class='str'> """</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='key'>not</span> <span class='nam'>strings</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm mis'> <span class='key'>return</span> <span class='str'>''</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>prefix</span> <span class='op'>=</span> <span class='nam'>strings</span><span class='op'>[</span><span class='num'>0</span><span class='op'>]</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>for</span> <span class='nam'>s</span> <span class='key'>in</span> <span class='nam'>strings</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='nam'>len</span><span class='op'>(</span><span class='nam'>s</span><span class='op'>)</span> <span class='op'><</span> <span class='nam'>len</span><span class='op'>(</span><span class='nam'>prefix</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>prefix</span> <span class='op'>=</span> <span class='nam'>prefix</span><span class='op'>[</span><span class='op'>:</span><span class='nam'>len</span><span class='op'>(</span><span class='nam'>s</span><span class='op'>)</span><span class='op'>]</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='key'>not</span> <span class='nam'>prefix</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>return</span> <span class='str'>''</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>for</span> <span class='nam'>i</span> <span class='key'>in</span> <span class='nam'>range</span><span class='op'>(</span><span class='nam'>len</span><span class='op'>(</span><span class='nam'>prefix</span><span class='op'>)</span><span class='op'>)</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>if</span> <span class='nam'>prefix</span><span class='op'>[</span><span class='nam'>i</span><span class='op'>]</span> <span class='op'>!=</span> <span class='nam'>s</span><span class='op'>[</span><span class='nam'>i</span><span class='op'>]</span><span class='op'>:</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='nam'>prefix</span> <span class='op'>=</span> <span class='nam'>prefix</span><span class='op'>[</span><span class='op'>:</span><span class='nam'>i</span><span class='op'>]</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>break</span><span class="strut"> </span></p>
+<p class='stm run hide'> <span class='key'>return</span> <span class='nam'>prefix</span><span class="strut"> </span></p>
</td>
</tr>
|