3414 - mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

diff options

author	Kartik K. Agaram <vc@akkartik.com>	2016-09-24 20:07:42 -0700
committer	Kartik K. Agaram <vc@akkartik.com>	2016-09-24 20:07:42 -0700
commit	2d05f43cf15554adaea725d7a4547b6030458de8 (patch)
tree	4c6b8dc4f01a46690c6feb36d2acd87d4c06d924 /html/088file.mu.html
parent	ae08e30e8d57a1f1bbc0ba8a346a0aa6bcb512e9 (diff)
download	mu-2d05f43cf15554adaea725d7a4547b6030458de8.tar.gz

3414

Diffstat (limited to 'html/088file.mu.html')

0 files changed, 0 insertions, 0 deletions

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta http-equiv="content-type" content="text/html; charset=UTF-8"> <title>Mu - nqueens.mu</title> <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="none"> <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">  </style> <script type='text/javascript'>  </script> </head> <body onload='JumpToLine();'> <pre id='vimCodeElement'> 1 # <a href="http://rosettacode.org/wiki/N-queens_problem">http://rosettacode.org/wiki/N-queens_problem</a> 2 # port of the Arc solution at <a href="http://arclanguage.org/item?id=19743">http://arclanguage.org/item?id=19743</a> 3 # run with tracing turned on: 4 # ./mu --trace nqueens.mu 5 6 container <a href='nqueens.mu.html#L6'>square</a> [ 7 rank:num 8 file:num 9 ] 10 11 def <a href='nqueens.mu.html#L11'>nqueens</a> n:num, queens:&:<a href='064list.mu.html#L6'>list</a>:<a href='nqueens.mu.html#L6'>square</a> -> result:num, queens:&:<a href='064list.mu.html#L6'>list</a>:<a href='nqueens.mu.html#L6'>square</a> [ 12 local-scope 13 load-ingredients 14 # if 'queens' is already long enough, print it and return 15 added-so-far:num <- length queens 16 { 17 ¦ done?:bool <- greater-or-equal added-so-far, n 18 ¦ break-unless done? 19 ¦ stash queens 20 ¦ return 1 21 } 22 # still work to do 23 next-rank:num <- copy 0 24 { 25 ¦ break-unless queens 26 ¦ first:<a href='nqueens.mu.html#L6'>square</a> <- first queens 27 ¦ existing-rank:num <- get first, rank:offset 28 ¦ next-rank <- add existing-rank, 1 29 } 30 result <- copy 0 31 next-file:num <- copy 0 32 { 33 ¦ done?:bool <- greater-or-equal next-file, n 34 ¦ break-if done? 35 ¦ curr:<a href='nqueens.mu.html#L6'>square</a> <- merge next-rank, next-file 36 ¦ { 37 ¦ ¦ curr-conflicts?:bool <- <a href='nqueens.mu.html#L49'>conflict?</a> curr, queens 38 ¦ ¦ break-if curr-conflicts? 39 ¦ ¦ queens:&:<a href='064list.mu.html#L6'>list</a>:<a href='nqueens.mu.html#L6'>square</a> <- push curr, queens 40 ¦ ¦ sub-result:num <- <a href='nqueens.mu.html#L11'>nqueens</a> n, queens 41 ¦ ¦ result <- add result, sub-result 42 ¦ ¦ queens <- <a href='064list.mu.html#L25'>rest</a> queens 43 ¦ } 44 ¦ next-file <- add next-file, 1 45 ¦ loop 46 } 47 ] 48 49 def <a href='nqueens.mu.html#L49'>conflict?</a> curr:<a href='nqueens.mu.html#L6'>square</a>, queens:&:<a href='064list.mu.html#L6'>list</a>:<a href='nqueens.mu.html#L6'>square</a> -> result:bool [ 50 local-scope 51 load-ingredients 52 result1:bool <- <a href='nqueens.mu.html#L58'>conflicting-file?</a> curr, queens 53 return-if result1, result1 54 result2:bool <- <a href='nqueens.mu.html#L74'>conflicting-diagonal?</a> curr, queens 55 return result2 56 ] 57 58 def <a href='nqueens.mu.html#L58'>conflicting-file?</a> curr:<a href='nqueens.mu.html#L6'>square</a>, queens:&:<a href='064list.mu.html#L6'>list</a>:<a href='nqueens.mu.html#L6'>square</a> -> result:bool [ 59 local-scope 60 load-ingredients 61 curr-file:num <- get curr, file:offset 62 { 63 ¦ break-unless queens 64 ¦ q:<a href='nqueens.mu.html#L6'>square</a> <- first queens 65 ¦ qfile:num <- get q, file:offset 66 ¦ file-match?:bool <- equal curr-file, qfile 67 ¦ return-if file-match?, 1/conflict-found 68 ¦ queens <- <a href='064list.mu.html#L25'>rest</a> queens 69 ¦ loop 70 } 71 return 0/no-conflict-found 72 ] 73 74 def <a href='nqueens.mu.html#L74'>conflicting-diagonal?</a> curr:<a href='nqueens.mu.html#L6'>square</a>, queens:&:<a href='064list.mu.html#L6'>list</a>:<a href='nqueens.mu.html#L6'>square</a> -> result:bool [ 75 local-scope 76 load-ingredients 77 curr-rank:num <- get curr, rank:offset 78 curr-file:num <- get curr, file:offset 79 { 80 ¦ break-unless queens 81 ¦ q:<a href='nqueens.mu.html#L6'>square</a> <- first queens 82 ¦ qrank:num <- get q, rank:offset 83 ¦ qfile:num <- get q, file:offset 84 ¦ rank-delta:num <- subtract qrank, curr-rank 85 ¦ file-delta:num <- subtract qfile, curr-file 86 ¦ rank-delta <- <a href='070table.mu.html#L103'>abs</a> rank-delta 87 ¦ file-delta <- <a href='070table.mu.html#L103'>abs</a> file-delta 88 ¦ diagonal-match?:bool <- equal rank-delta, file-delta 89 ¦ return-if diagonal-match?, 1/conflict-found 90 ¦ queens <- <a href='064list.mu.html#L25'>rest</a> queens 91 ¦ loop 92 } 93 return 0/no-conflict-found 94 ] 95 96 def <a href='nqueens.mu.html#L96'>main</a> [ 97 <a href='nqueens.mu.html#L11'>nqueens</a> 4 98 $dump-trace [app] 99 ] </pre> </body> </html>


context:
space:
mode: