musicscore.musictree
- class musicscore.musictree.MusicTree(*args, **kwargs)[source]
Bases:
Tree- MusicTree is the parent class of all music tree objects:
Score(root)Part(1st layer)Measure(2nd layer)Staff(3rd layer)Voice(4th layer)Beat(5th layer)Chord,RestorGraceChord(6th layer)Note(7th layer)Midi(8th layer) Midi can represent a pitch or a rest (value=0) and controls accidental sign of the pitch if necessary.Accidental(9th layer)
- add_child(child: T) T
TreemethodCheck and add child to list of children. Child’s parent is set to self.
- Parameters:
child –
- Returns:
child
- Return type:
Tree
- classmethod create_tree_from_list(tree_list_representation: list[list[Any]], represented_attribute_names: list[str]) T
- filter_nodes(key: Callable[[T], Any], return_value: Any) list[T]
Treemethod>>> root.filter_nodes(lambda node: node.get_level(), 2) [grandchild1, grandchild2, grandchild3]
- get_beat(*args, **kwargs) Beat[source]
MusicTreemethodThis method can be used for
ScoreandPart,MeasureandStaffandVoice- Parameters:
- Return type:
- get_beats() List[Beat][source]
MusicTreemethodThis method can be used for
ScoreandPart,Measure,StaffandVoice.- Returns:
a flat list of all beats.
- Return type:
List[
Beat]
- get_children() list[T]
Treemethod- Returns:
list of added children.
- get_children_of_type(type_: type) list[T]
Treemethod- Returns:
list of added children of type.d
- Return type:
list[
Tree]
- get_chord(*args, **kwargs) Chord[source]
MusicTreemethodThis method can be used for
ScoreandPart,Measure,Staff,VoiceandBeat- Parameters:
args – can be used instead of
kwargs. A mixture of args and kwargs is not allowed.kwargs –
part_number,measure_number,staff_number,voice_number,beat_number,chord_numberdepending on musicscore’s class. AStafffor example needsvoice_number,beat_numberandchord_numberwhile aScoreneeds all keyword arguments.
- Return type:
- get_chords() List[Chord][source]
MusicTreemethodThis method can be used for
ScoreandPart,MeasureandStaff,VoiceandBeat- Returns:
a flat list of all chords.
- Return type:
List[
Chord]
- get_distance(reference: T | None = None) int
>>> root.get_distance() 0 >>> greatgrandchild1.get_distance() 3 >>> greatgrandchild1.get_distance(child2) 2
- get_farthest_leaf() T
>>> root.get_farthest_leaf() greatgrandchild1
- get_layer(level: int, key: Callable[[T], Any] | None = None) Any
Treemethod- Parameters:
level – layer number where 0 is the
root.key – An optional callable for each node in the layer.
- Returns:
All nodes on this level. The leaves of branches which are shorter than the given level will be repeated on this and all following layers.
- Return type:
list
- get_leaves(key: Callable[[T], Any] | None = None) list[Union[Any, list[Any]]]
Tree method
- Parameters:
key – An optional callable to be called on each leaf.
- Returns:
nested list of leaves or values of key(leaf) for each leaf
>>> root.get_leaves() [child1, [[greatgrandchild1, greatgrandchild2], grandchild2], child3, [grandchild3]]
- get_level() int
Tree- Returns:
0forroot,1, 2 etc.for each layer of children- Return type:
nonnegative int
>>> root.get_level() 0 >>> child1.get_level() 1 >>> grandchild1.get_level() 2 >>> greatgrandchild1.get_level() 3
- get_measure(*args, **kwargs) Measure[source]
MusicTreemethodThis method can be used for
ScoreandPart- Parameters:
args – can be used instead of
kwargs. A mixture of args and kwargs is not allowed.kwargs –
part_number,measure_numberdepending on musicscore’s class.
- Return type:
- get_number_of_layers() int
>>> root.get_number_of_layers() 3
- get_parent() T | None
Treemethod- Returns:
parent.
Noneforroot.- Return type:
Tree
- get_part(*args, **kwargs) Part[source]
MusicTreemethodThis method can be used for
Score- Parameters:
args – can be used instead of
kwargs. A mixture of args and kwargs is not allowed.kwargs –
part_number.
- Return type:
- get_position_in_tree() str
Treemethod- Returns:
0 for
root. 1, 2, … for layer 1. Other layers: x.y.z…. Example: 3.2.2 => third child of secod child of second child of the root.- Return type:
str
>>> print(root.get_tree_representation(key=lambda node: node.get_position_in_tree())) └── 0 ├── 1 ├── 2 │ ├── 2.1 │ │ ├── 2.1.1 │ │ └── 2.1.2 │ └── 2.2 ├── 3 └── 4 └── 4.1
- get_reversed_path_to_root() list[T]
Treemethod- Returns:
path from self upwards through all ancestors up to the
root.
>>> greatgrandchild1.get_reversed_path_to_root() [greatgrandchild1, grandchild1, child2, root]
- get_root() T
Treemethod- Returns:
root(upmost node of a tree which has no parent)- Return type:
Tree
>>> greatgrandchild1.get_root() == root True >>> child4.get_root() == root True >>> root.get_root() == root True
- get_self_with_key(key: Callable[[T], Any] | None = None) Any
- get_staff(*args, **kwargs) Staff[source]
MusicTreemethodThis method can be used for
Score,PartandMeasure- Parameters:
args – can be used instead of
kwargs. A mixture of args and kwargs is not allowed.kwargs –
part_number,measure_number,staff_numberdepending on musicscore’s class.
- Return type:
- get_tree_representation(key: Callable[[T], Any] | None = None, space: int = 3) str
Treemethod- Parameters:
key – An optional callable if
Nonestring(node) is called.- Returns:
a representation of all nodes as string in tree form.
>>> print(root.get_tree_representation()) └── root ├── child1 ├── child2 │ ├── grandchild1 │ │ ├── greatgrandchild1 │ │ └── greatgrandchild2 │ └── grandchild2 ├── child3 └── child4 └── grandchild3
- get_voice(*args, **kwargs) Voice[source]
MusicTreemethodThis method can be used for
ScoreandPart,MeasureandStaff- Parameters:
args – can be used instead of
kwargs. A mixture of args and kwargs is not allowed.kwargs –
part_number,measure_number,staff_number,voice_numberdepending on musicscore’s class.
- Return type:
- iterate_leaves() Iterator[T]
Treemethod- Returns:
A generator iterating over all leaves.
- remove(child: T) None
TreemethodChild’s parent will be set to
Noneand child will be removed from list of children.- Parameters:
child –
- Returns:
None
- replace_child(old: T, new: T, index: int = 0) None
Treemethod- Parameters:
old – child or function
new – child
index – index of old child in the list of its appearances
- Returns:
None
- traverse() Iterator[T]
TreemethodTraverse all tree nodes.
- Returns:
generator
- property content: Any
- default_show_accidental_signs = 'modern'
- property is_first_child: bool
- property is_last_child: bool
>>> t = TestTree('root') >>> for node in t.traverse(): ... if node.name in ['root', 'child4', 'grandchild2', 'grandchild3', 'greatgrandchild1']: ... assert node.is_last_child ... else: ... assert not node.is_last_child
- property is_leaf: bool
Treeproperty- Returns:
Trueif self has no children.Falseif self has one or more children.- Return type:
bool
- property is_root: bool
Treeproperty- Returns:
Trueif self has no parent, elseFalse.- Return type:
bool
- property next: T | None
Treeproperty- Returns:
next sibling.
Noneif this is the last current child of the parent.- Return type:
Tree
- property previous: T | None
Treeproperty- Returns:
previous sibling.
Noneif this is the first child of the parent.- Return type:
Tree
- property show_accidental_signs: str
MusicTreepropertyIf show_accidental_signs is set to None the first get_quantized of ancestors which is
FalseorTruewill be returned.If
show_accidental_signsis set to None it will be converted todefault_show_accidental_signsPossible show_accidental_signs are: None, ‘modern’, ‘traditional’
- Type:
Optional[str]
- Return type:
str
- property up: T | None
Treeproperty- Returns:
- Return type:
Tree