MOS scale: Difference between revisions
Wikispaces>genewardsmith **Imported revision 143392329 - Original comment: ** |
Wikispaces>genewardsmith **Imported revision 143392517 - Original comment: ** |
||
| Line 1: | Line 1: | ||
<h2>IMPORTED REVISION FROM WIKISPACES</h2> | <h2>IMPORTED REVISION FROM WIKISPACES</h2> | ||
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br> | This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br> | ||
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2010-05-20 02: | : This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2010-05-20 02:39:36 UTC</tt>.<br> | ||
: The original revision id was <tt> | : The original revision id was <tt>143392517</tt>.<br> | ||
: The revision comment was: <tt></tt><br> | : The revision comment was: <tt></tt><br> | ||
The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br> | The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br> | ||
| Line 130: | Line 130: | ||
log2 := proc(x) | log2 := proc(x) | ||
# logarithm base 2 | # logarithm base 2 | ||
evalf(ln(x)/ln(2)) end: | evalf(ln(x)/ln(2)) end: | ||
| Line 214: | Line 214: | ||
Lsgen := proc(g, n) | Lsgen := proc(g, n) | ||
# given generator g and scale size n determines large-small steps | # given generator g and scale size n determines large-small steps | ||
local q, u, w; | local q, u, w; | ||
q := round(n*g)/n; | q := round(n*g)/n; | ||
| Line 224: | Line 224: | ||
revlist := proc(l) | revlist := proc(l) | ||
# reverse of list | # reverse of list | ||
local i, v, e; | local i, v, e; | ||
e := nops(l); | e := nops(l); | ||
| Line 232: | Line 232: | ||
invcon := proc(l) | invcon := proc(l) | ||
# inverse continued fraction | # inverse continued fraction | ||
local d, i, h, k; | local d, i, h, k; | ||
h[-2] := 0; | h[-2] := 0; | ||
| Line 245: | Line 245: | ||
quest := proc(x) | quest := proc(x) | ||
# Minkowski ? function | # Minkowski ? function | ||
local i, j, d, l, s, t; | local i, j, d, l, s, t; | ||
l := convert(x, confrac); | l := convert(x, confrac); | ||
| Line 258: | Line 258: | ||
s end: | s end: | ||
Box := proc(x) | |||
# inverse ? function | # inverse ? function | ||
local d, e, i, n, w, y; | local d, e, i, n, w, y; | ||
if type(x, integer) then RETURN(x) fi; | if type(x, integer) then RETURN(x) fi; | ||
| Line 639: | Line 639: | ||
<br /> | <br /> | ||
log2 := proc(x)<br /> | log2 := proc(x)<br /> | ||
# logarithm base 2<br /> | |||
evalf(ln(x)/ln(2)) end:<br /> | |||
<br /> | <br /> | ||
nextfarey := proc(q, n)<br /> | nextfarey := proc(q, n)<br /> | ||
| Line 722: | Line 723: | ||
<br /> | <br /> | ||
Lsgen := proc(g, n)<br /> | Lsgen := proc(g, n)<br /> | ||
# given generator g and scale size n determines large-small steps<br /> | |||
local q, u, w;<br /> | |||
q := round(n*g)/n;<br /> | q := round(n*g)/n;<br /> | ||
w := n/denom(q);<br /> | w := n/denom(q);<br /> | ||
| Line 731: | Line 733: | ||
<br /> | <br /> | ||
revlist := proc(l)<br /> | revlist := proc(l)<br /> | ||
# reverse of list<br /> | |||
local i, v, e;<br /> | |||
e := nops(l);<br /> | e := nops(l);<br /> | ||
for i from 1 to e do<br /> | for i from 1 to e do<br /> | ||
| Line 738: | Line 741: | ||
<br /> | <br /> | ||
invcon := proc(l)<br /> | invcon := proc(l)<br /> | ||
# inverse continued fraction<br /> | |||
local d, i, h, k;<br /> | |||
h[-2] := 0;<br /> | h[-2] := 0;<br /> | ||
h[-1] := 1;<br /> | h[-1] := 1;<br /> | ||
| Line 750: | Line 754: | ||
<br /> | <br /> | ||
quest := proc(x)<br /> | quest := proc(x)<br /> | ||
# Minkowski ? function<br /> | |||
local i, j, d, l, s, t;<br /> | |||
l := convert(x, confrac);<br /> | l := convert(x, confrac);<br /> | ||
d := nops(l);<br /> | d := nops(l);<br /> | ||
| Line 762: | Line 767: | ||
s end:<br /> | s end:<br /> | ||
<br /> | <br /> | ||
Box := proc(x)<br /> | |||
# inverse ? function<br /> | |||
local d, e, i, n, w, y;<br /> | |||
if type(x, integer) then RETURN(x) fi;<br /> | if type(x, integer) then RETURN(x) fi;<br /> | ||
y := x-floor(x);<br /> | y := x-floor(x);<br /> | ||