diff options
Diffstat (limited to 'html/tangle.mu.html')
| -rw-r--r-- | html/tangle.mu.html | 104 |
1 files changed, 64 insertions, 40 deletions
diff --git a/html/tangle.mu.html b/html/tangle.mu.html index ce74c293..9a21434e 100644 --- a/html/tangle.mu.html +++ b/html/tangle.mu.html @@ -6,7 +6,7 @@ <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="none"> -<meta name="settings" content="use_css,pre_wrap,no_foldcolumn,expand_tabs,prevent_copy="> +<meta name="settings" content="number_lines,use_css,pre_wrap,no_foldcolumn,expand_tabs,line_ids,prevent_copy="> <meta name="colorscheme" content="minimal"> <style type="text/css"> <!-- @@ -15,9 +15,10 @@ body { font-size: 12pt; font-family: monospace; color: #eeeeee; background-color * { font-size: 12pt; font-size: 1em; } .Delimiter { color: #800080; } .muControl { color: #c0a020; } +.Special { color: #c00000; } .Comment { color: #9090ff; } .Constant { color: #00a0a0; } -.Special { color: #c00000; } +.LineNr { color: #444444; } .muRecipe { color: #ff8700; } --> </style> @@ -25,48 +26,71 @@ body { font-size: 12pt; font-family: monospace; color: #eeeeee; background-color <script type='text/javascript'> <!-- +/* function to open any folds containing a jumped-to line before jumping to it */ +function JumpToLine() +{ + var lineNum; + lineNum = window.location.hash; + lineNum = lineNum.substr(1); /* strip off '#' */ + + if (lineNum.indexOf('L') == -1) { + lineNum = 'L'+lineNum; + } + lineElem = document.getElementById(lineNum); + /* Always jump to new location even if the line was hidden inside a fold, or + * we corrected the raw number to a line ID. + */ + if (lineElem) { + lineElem.scrollIntoView(true); + } + return true; +} +if ('onhashchange' in window) { + window.onhashchange = JumpToLine; +} + --> </script> </head> -<body> +<body onload='JumpToLine();'> <pre id='vimCodeElement'> -<span class="Comment"># example program: constructing functions out of order</span> -<span class="Comment">#</span> -<span class="Comment"># We construct a factorial function with separate base and recursive cases.</span> -<span class="Comment"># Compare factorial.mu.</span> -<span class="Comment">#</span> -<span class="Comment"># This isn't a very tasteful example, just a simple demonstration of</span> -<span class="Comment"># possibilities.</span> - -<span class="muRecipe">def</span> factorial n:num<span class="muRecipe"> -> </span>result:num [ - <span class="Constant">local-scope</span> - <span class="Constant">load-ingredients</span> - <span class="Delimiter">{</span> -<span class="Constant"> <base-case></span> - <span class="Delimiter">}</span> -<span class="Constant"> <recursive-case></span> -] - -<span class="muRecipe">after</span> <span class="Constant"><base-case></span> [ - <span class="Comment"># if n=0 return 1</span> - zero?:bool <span class="Special"><-</span> equal n,<span class="Constant"> 0</span> - <span class="muControl">break-unless</span> zero? - <span class="muControl">return</span><span class="Constant"> 1</span> -] - -<span class="muRecipe">after</span> <span class="Constant"><recursive-case></span> [ - <span class="Comment"># return n * factorial(n - 1)</span> - x:num <span class="Special"><-</span> subtract n,<span class="Constant"> 1</span> - subresult:num <span class="Special"><-</span> factorial x - result <span class="Special"><-</span> multiply subresult, n -] - -<span class="muRecipe">def</span> main [ - 1:num <span class="Special"><-</span> factorial<span class="Constant"> 5</span> - <span class="Comment"># trailing space in next line is to help with syntax highlighting</span> - $print <span class="Constant">[result: ]</span>, 1:num, <span class="Constant">[ </span> -<span class="Constant">]</span> -] +<a name="L1"></a><span id="L1" class="LineNr"> 1 </span><span class="Comment"># example program: constructing functions out of order</span> +<a name="L2"></a><span id="L2" class="LineNr"> 2 </span><span class="Comment">#</span> +<a name="L3"></a><span id="L3" class="LineNr"> 3 </span><span class="Comment"># We construct a factorial function with separate base and recursive cases.</span> +<a name="L4"></a><span id="L4" class="LineNr"> 4 </span><span class="Comment"># Compare factorial.mu.</span> +<a name="L5"></a><span id="L5" class="LineNr"> 5 </span><span class="Comment">#</span> +<a name="L6"></a><span id="L6" class="LineNr"> 6 </span><span class="Comment"># This isn't a very tasteful example, just a simple demonstration of</span> +<a name="L7"></a><span id="L7" class="LineNr"> 7 </span><span class="Comment"># possibilities.</span> +<a name="L8"></a><span id="L8" class="LineNr"> 8 </span> +<a name="L9"></a><span id="L9" class="LineNr"> 9 </span><span class="muRecipe">def</span> factorial n:num<span class="muRecipe"> -> </span>result:num [ +<a name="L10"></a><span id="L10" class="LineNr">10 </span> <span class="Constant">local-scope</span> +<a name="L11"></a><span id="L11" class="LineNr">11 </span> <span class="Constant">load-ingredients</span> +<a name="L12"></a><span id="L12" class="LineNr">12 </span> <span class="Delimiter">{</span> +<a name="L13"></a><span id="L13" class="LineNr">13 </span><span class="Constant"> <base-case></span> +<a name="L14"></a><span id="L14" class="LineNr">14 </span> <span class="Delimiter">}</span> +<a name="L15"></a><span id="L15" class="LineNr">15 </span><span class="Constant"> <recursive-case></span> +<a name="L16"></a><span id="L16" class="LineNr">16 </span>] +<a name="L17"></a><span id="L17" class="LineNr">17 </span> +<a name="L18"></a><span id="L18" class="LineNr">18 </span><span class="muRecipe">after</span> <span class="Constant"><base-case></span> [ +<a name="L19"></a><span id="L19" class="LineNr">19 </span> <span class="Comment"># if n=0 return 1</span> +<a name="L20"></a><span id="L20" class="LineNr">20 </span> zero?:bool <span class="Special"><-</span> equal n,<span class="Constant"> 0</span> +<a name="L21"></a><span id="L21" class="LineNr">21 </span> <span class="muControl">break-unless</span> zero? +<a name="L22"></a><span id="L22" class="LineNr">22 </span> <span class="muControl">return</span><span class="Constant"> 1</span> +<a name="L23"></a><span id="L23" class="LineNr">23 </span>] +<a name="L24"></a><span id="L24" class="LineNr">24 </span> +<a name="L25"></a><span id="L25" class="LineNr">25 </span><span class="muRecipe">after</span> <span class="Constant"><recursive-case></span> [ +<a name="L26"></a><span id="L26" class="LineNr">26 </span> <span class="Comment"># return n * factorial(n - 1)</span> +<a name="L27"></a><span id="L27" class="LineNr">27 </span> x:num <span class="Special"><-</span> subtract n,<span class="Constant"> 1</span> +<a name="L28"></a><span id="L28" class="LineNr">28 </span> subresult:num <span class="Special"><-</span> factorial x +<a name="L29"></a><span id="L29" class="LineNr">29 </span> result <span class="Special"><-</span> multiply subresult, n +<a name="L30"></a><span id="L30" class="LineNr">30 </span>] +<a name="L31"></a><span id="L31" class="LineNr">31 </span> +<a name="L32"></a><span id="L32" class="LineNr">32 </span><span class="muRecipe">def</span> main [ +<a name="L33"></a><span id="L33" class="LineNr">33 </span> 1:num <span class="Special"><-</span> factorial<span class="Constant"> 5</span> +<a name="L34"></a><span id="L34" class="LineNr">34 </span> <span class="Comment"># trailing space in next line is to help with syntax highlighting</span> +<a name="L35"></a><span id="L35" class="LineNr">35 </span> $print <span class="Constant">[result: ]</span>, 1:num, <span class="Constant">[ </span> +<a name="L36"></a><span id="L36" class="LineNr">36 </span><span class="Constant">]</span> +<a name="L37"></a><span id="L37" class="LineNr">37 </span>] </pre> </body> </html> |