fornax - Collection of tools to visualize Path Finding Algorithms

	Commit message (Expand)	Author	Age	Files	Lines
*	Add maze 07, BFS-50 solution	Andinus	2021-11-24	2	-0/+448
*	raku/DFS: Add DFS implementation in raku, Add input 06	Andinus	2021-11-17	1	-0/+18
*	Add note about incorrect visualization	Andinus	2021-11-16	1	-0/+5
*	Add solution/DFS-60	Andinus	2021-11-16	1	-0/+438
*	Add more solutions, add note about DFS-51	Andinus	2021-11-09	3	-0/+1350
*	java/DFS: Don't walk on visited, Add DFS solutions, change colors	Andinus	2021-11-03	2	-0/+38
*	More DFS solutions	Andinus	2021-11-03	2	-0/+55
*	Rename sample solutions	Andinus	2021-11-03	7	-0/+0
*	More DFS solution	Andinus	2021-11-03	1	-0/+1995
*	More sample solutions	Andinus	2021-11-03	5	-0/+242
*	Add sample DFS solution	Andinus	2021-11-03	1	-0/+7

<!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 - 506math.mu</title> <meta name="Generator" content="Vim/8.1"> <meta name="plugin-version" content="vim8.1_v1"> <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-dark"> <style type="text/css">  </style> <script type='text/javascript'>  </script> </head> <body onload='JumpToLine();'> <a href='https://github.com/akkartik/mu/blob/main/506math.mu'>https://github.com/akkartik/mu/blob/main/506math.mu</a> <pre id='vimCodeElement'> 1 fn <a href='506math.mu.html#L1'>abs</a> n: int -> _/eax: int { 2 compare n, 0 3 { 4 break-if->= 5 negate n 6 } 7 return n 8 } 9 10 fn <a href='506math.mu.html#L10'>sgn</a> n: int -> _/eax: int { 11 compare n, 0 12 { 13 break-if-<= 14 return 1 15 } 16 { 17 break-if->= 18 return -1 19 } 20 return 0 21 } 22 23 fn <a href='506math.mu.html#L23'>shift-left-by</a> n: int, bits: int -> _/eax: int { 24 var i/eax: int <- copy bits 25 { 26 compare i, 0 27 break-if-<= 28 shift-left n, 1 29 i <- decrement 30 loop 31 } 32 return n 33 } 34 35 fn <a href='506math.mu.html#L35'>shift-right-by</a> n: int, bits: int -> _/eax: int { 36 var i/eax: int <- copy bits 37 { 38 compare i, 0 39 break-if-<= 40 shift-right n, 1 41 i <- decrement 42 loop 43 } 44 return n 45 } 46 47 fn <a href='506math.mu.html#L47'>clear-lowest-bits</a> _n: (addr int), bits: int { 48 var dest/edi: (addr int) <- copy _n 49 var n/eax: int <- copy *dest 50 n <- <a href='506math.mu.html#L35'>shift-right-by</a> n, bits 51 n <- <a href='506math.mu.html#L23'>shift-left-by</a> n, bits 52 copy-to *dest, n 53 } </pre> </body> </html>