(Arne Babenhauserheide)
2015-11-01: added a running mean function. added a running mean function.
diff --git a/examples/fib.w b/examples/running_mean_std.w copy from examples/fib.w copy to examples/running_mean_std.w --- a/examples/fib.w +++ b/examples/running_mean_std.w @@ -1,81 +1,34 @@ #!/home/arne/wisp/wisp-multiline.sh ; !# -;; Fibonacci Functions +use-modules : srfi srfi-11 -define : fibonacci n - . "Get Fibonacci Element N in Linear Time" - let rek : (i 0) (u 1) (v 1) - if : >= i : - n 2 - . v - rek (+ i 1) v (+ u v) ; else +define : running-stat-fun + let + : n 0 + sum 0 + sum² 0 + define : mean-std x + set! n : + n 1 + set! sum : + sum x + set! sum² : + sum² : expt x 2 + let* + : mean : / sum n + σ + - : / sum² n + . mean + values mean σ + . mean-std -; display : fib 5 +define statfun : running-stat-fun -;; Try it with curly infix - -;; First activate curly infix -. #!curly-infix - -;; Now define fibonacci with curly infix. -define : fibonacci n - . "Get Fibonacci Element N in Linear Time" - let rek : (i 0) (u 1) (v 1) - if {i >= {n - 2}} - . v - rek {i + 1} v {u + v} - -display - . {1 + 1} +write : statfun 5 newline - -;; Due to the compatibility with curly-infix, the following is no longer possible. - -;; Try an infix notation with curly brackets - curly infix from readable as simple macro -;; define-syntax { -;; syntax-rules : { } -;; : { left infix right } -;; infix left right -;; -;; ; display : { 1 + 2 } -;; -;; ;; Now do the fibonacci again -;; define : fibcurl n -;; . "Get Fibonacci Elements in Linear Time" -;; let rek : (i 0) (u 1) (v 1) -;; if : { i >= ({ n - 2 }) } -;; . v -;; rek ({ i + 1 }) v ({ u + v }) ; else -;; -;; ; display : fibcurl 5 -;; -;; ;; Do a more complete syntax-rule -;; -;; ;; Try an infix notation with curly brackets - curly infix from readable as simple macro -;; define-syntax { -;; syntax-rules : { } -;; : { l in r } -;; in l r -;; : { { ll lin lr } in r } -;; in (lin ll lr) r -;; : { l in { rl rin rr } } -;; in l (rin rl rr) -;; : { { ll lin lr } in { rl rin rr } } -;; in (lin ll lr) (rin rl rr) -;; -;; ;; And a complete infix-fibonacci -;; define : fibcurl2 n -;; . "Get Fibonacci Elements in Linear Time" -;; let rek : (i 0) (u 1) (v 1) -;; if : { i >= { n - 2 } } -;; . v -;; rek -;; { i + 1 } -;; . v -;; { u + v } -;; -;; ;; But to be frank: Prefix looks better. -;; -;; display : { { 1 + 2 } * { 2 * 3 } } -;; ; display : fibcurl2 5 -;; ; TODO: Make the macro recursive, so it can actually cover arbitrary depths of curly braces. +write : statfun 4 +newline +let-values + : (mean σ) : statfun 5 + display mean + display '± + display σ + newline