Aberrismic theory: Difference between revisions
m →Code |
|||
| Line 93: | Line 93: | ||
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 | ||
$ 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)) -- | [ (edo, (x`div`d, y`div`d, z`div`d)) -- divide step sizes by gcd | ||
| x <- sizesOfL, y <- sizesOfM, z <- sizesOfS, | | x <- sizesOfL, y <- sizesOfM, z <- sizesOfS, | ||
let d = gcd x (gcd y z), | let d = gcd x (gcd y z), | ||