User:Ganaram inukshuk: Difference between revisions

Line 25:

* Biggest contributions to date

** ~~Mos page standardization and style guide, which required creating new templates or contributing to existing~~ templates:

** Templates (lots of templates):

***[[Module:SB tree]] and [[Template:SB tree]]

***[[Module:Scale tree]] and [[Template:Scale tree]] (contributor with CompactStar)

Line 50:

***[[Module:MOS notation]] - Helper module for MOS gamut and MOS degrees.

***[[Module:Template input parse]] - Proposed helper module for several modules, such as the scale tree.

**Mos page standardization (work-in-progress)

*Other contributions

**[[Recursive structure of MOS scales|MOS recursion and MOS recursion algorithms]]; tried my best to make the descriptions for MOS recursion apply to all cases (Work-in-progress)

Line 80:

Line 81:

**Replace pseudocode for is-this-scale-a-mos? program with python code; clarify with more examples.

** Relate mos recursion with the mos family tree.

** All the recursive algorithms described on that page have time complexities of O(n log n), but the algorithm that generates a Christoffel word (combinatorics-on-words term for the brightest mode of a mos) has a time complexity of O(n). Resolve...?

*Standardize mosinedo pages. Examples include:

**[[List of MOS scales in 12edo]]

@@ Line 25: / Line 25: @@
 * Biggest contributions to date
-** Mos page standardization and style guide, which required creating new templates or contributing to existing templates:
+** Templates (lots of templates):
 ***[[Module:SB tree]] and [[Template:SB tree]]
 ***[[Module:Scale tree]] and [[Template:Scale tree]] (contributor with CompactStar)
@@ Line 50: / Line 50: @@
 ***[[Module:MOS notation]] - Helper module for MOS gamut and MOS degrees.
 ***[[Module:Template input parse]] - Proposed helper module for several modules, such as the scale tree.
+**Mos page standardization (work-in-progress)
 *Other contributions
 **[[Recursive structure of MOS scales|MOS recursion and MOS recursion algorithms]]; tried my best to make the descriptions for MOS recursion apply to all cases (Work-in-progress)
@@ Line 80: / Line 81: @@
 **Replace pseudocode for is-this-scale-a-mos? program with python code; clarify with more examples.
 ** Relate mos recursion with the mos family tree.
+** All the recursive algorithms described on that page have time complexities of O(n log n), but the algorithm that generates a Christoffel word (combinatorics-on-words term for the brightest mode of a mos) has a time complexity of O(n). Resolve...?
 *Standardize mosinedo pages. Examples include:
 **[[List of MOS scales in 12edo]]