Aberrismic theory: Difference between revisions
m →Code |
m →Code |
||
| Line 85: | Line 85: | ||
where the tuning's s step satisfies the bound `aberLower` <= s <= `aberUpper`. | where the tuning's s step satisfies the bound `aberLower` <= s <= `aberUpper`. | ||
Non-coprime step ratios are reduced. -} | Non-coprime step ratios are reduced. -} | ||
boundedEdosWithTernaryAberrismicScale :: Int -> Double -> Double -> Int -> Int -> Int -> [(Int, (Int, Int, Int))] | |||
boundedEdosWithTernaryAberrismicScale edoBound aberLower aberUpper countL countM countS = | |||
let | let | ||
sizesOfS = [1..edoBound] -- smallest s possible in n-edo is 1\n | sizesOfS = [1..edoBound] -- smallest s possible in n-edo is 1\n | ||
| Line 100: | Line 100: | ||
x > y && y > z && aberLower <= aberSize && aberSize <= aberUpper ] | x > y && y > z && aberLower <= aberSize && aberSize <= aberUpper ] | ||
{- | {- | ||
` | `boundedEdosWithTernaryAberrismicScale 53 20.0 60.0 5 2 3` returns: | ||
`[(22,(3,2,1)),(27,(4,2,1)),(29,(4,3,1)),(32,(5,2,1)),(34,(5,3,1)),(36,(5,4,1)),(37,(6,2,1)),(39,(6,3,1)),(41,(6,4,1)),(42,(6,3,2)),(42,(7,2,1)),(43,(6,5,1)),(44,(3,2,1)),(44,(7,3,1)),(46,(6,5,2)),(46,(7,4,1)),(47,(7,3,2)),(47,(8,2,1)),(48,(7,5,1)),(49,(7,4,2)),(49,(8,3,1)),(50,(7,6,1)),(51,(7,5,2)),(51,(8,4,1)),(52,(8,3,2)),(52,(9,2,1)),(53,(7,6,2)),(53,(8,5,1))]` | `[(22,(3,2,1)),(27,(4,2,1)),(29,(4,3,1)),(32,(5,2,1)),(34,(5,3,1)),(36,(5,4,1)),(37,(6,2,1)),(39,(6,3,1)),(41,(6,4,1)),(42,(6,3,2)),(42,(7,2,1)),(43,(6,5,1)),(44,(3,2,1)),(44,(7,3,1)),(46,(6,5,2)),(46,(7,4,1)),(47,(7,3,2)),(47,(8,2,1)),(48,(7,5,1)),(49,(7,4,2)),(49,(8,3,1)),(50,(7,6,1)),(51,(7,5,2)),(51,(8,4,1)),(52,(8,3,2)),(52,(9,2,1)),(53,(7,6,2)),(53,(8,5,1))]` | ||
-} | -} | ||