Module:JI ratios: Difference between revisions
Finalized main algorithm for subgroup search |
mNo edit summary |
||
| Line 101: | Line 101: | ||
-- Prime limits should be converted to subgroup (eg, 7-limit -> 2.3.5.7) so as | -- Prime limits should be converted to subgroup (eg, 7-limit -> 2.3.5.7) so as | ||
-- to avoid brute-force searching incurred by first searching by int limit. | -- to avoid brute-force searching incurred by first searching by int limit. | ||
-- WARNING: code is inefficient when the subgroup has lots of values. | |||
-- Needs a new algorithm. | |||
function p.search_by_subgroup(subgroup, int_limit, equave) | function p.search_by_subgroup(subgroup, int_limit, equave) | ||
local subgroup = subgroup or { 2, 3, 7, 11 } | local subgroup = subgroup or { 2, 3, 7, 11 } | ||