Aberrismic theory: Difference between revisions
m →Code |
m →Code |
||
| Line 91: | Line 91: | ||
sizesOfM = [2..edoBound] -- smallest m possible in n-edo is 2\n | sizesOfM = [2..edoBound] -- smallest m possible in n-edo is 2\n | ||
sizesOfL = [3..edoBound] -- smallest L possible in n-edo is 3\n | sizesOfL = [3..edoBound] -- smallest L possible in n-edo is 3\n | ||
in sortBy (\x y -> compare (fst x) (fst y)) -- sort the list which is finite | in sortBy (\x y -> compare (fst x) (fst y)) -- sort the list, which is finite, by the edo | ||
$ filter (\x -> (fst x) <= edoBound) -- filter edos that exceed `edoBound` | $ filter (\x -> (fst x) <= edoBound) -- filter edos that exceed `edoBound` | ||
[ (edo, (x`div`d, y`div`d, z`div`d)) -- divide step sizes by gcd | [ (edo, (x`div`d, y`div`d, z`div`d)) -- divide step sizes by gcd | ||