Episode 12: Edge Handling (2)
author |
Steve Losh <steve@stevelosh.com> |
date |
Sun, 17 Apr 2016 21:16:39 +0000 |
parents |
4e226f02861b |
children |
78529b68fe97 |
(in-package #:coding-math)
;; Constants
(defconstant tau (* pi 2))
;; Random
(defun random-range (min max)
(+ min (random (- max min))))
(defun random-around (val range)
(random-range (- val range)
(+ val range)))
;; Number range mapping
(defun normalize (min max val)
(/ (- val min)
(- max min)))
(defun lerp (from to n)
"Lerp together `from` and `to` by factor `n`.
Note that you might want `precise-lerp` instead.
"
(+ from
(* n (- to from))))
(defun precise-lerp (from to n)
"Lerp together `from` and `to` by factor `n`, precisely.
Vanilla lerp does not guarantee `(lerp from to 0.0)` will return exactly
`from` due to floating-point errors. This version will return exactly `from`
when given a `n` of `0.0`, at the cost of an extra multiplication.
"
(+ (* (- 1 n) from)
(* n to)))
(defun map-range (source-from source-to dest-from dest-to source-val)
"Map `source-val` from the source range to the destination range."
(lerp dest-from dest-to
(normalize source-from source-to source-val)))
;; Wrapping
(defun wrap-zero (max val)
"Wrap `val` around the range [0, max)."
(mod val max))
(defun wrap-range (min max val)
"Wrap `val` around the range [min, max)."
(+ min
(mod (- val min)
(- max min))))
(defun outside-p (min max val)
(or (< val min)
(> val max)))