SearchTree¶
-
abstract class
abjadext.nauert.SearchTree.
SearchTree
(definition=None)¶ Abstract search tree.
SearchTrees
encapsulate strategies for generating collections ofQGrids
, given a set ofQEventProxy
instances as input.They allow composers to define the degree and quality of nested rhythmic subdivisions in the quantization output. That is to say, they allow composers to specify what sorts of tuplets and ratios of pulses may be contained within other tuplets, to arbitrary levels of nesting.
Attributes Summary
__call__
Calls search tree. __eq__
Is true when argument is a search tree with definition equal to that of this search tree. __hash__
Hashes search tree. default_definition
The default search tree definition. definition
The search tree definition. Special methods
-
__call__
(q_grid)¶ Calls search tree.
-
__eq__
(argument)¶ Is true when argument is a search tree with definition equal to that of this search tree. Otherwise false.
Returns true or false.
-
(
AbjadObject
).__format__
(format_specification='')¶ Formats Abjad object.
Set
format_specification
to''
or'storage'
. Interprets''
equal to'storage'
.Returns string.
-
__hash__
()¶ Hashes search tree.
Required to be explicitly redefined on Python 3 if __eq__ changes.
Returns integer.
-
(
AbjadObject
).__repr__
()¶ Gets interpreter representation of Abjad object.
Returns string.
Read-only properties
-
abstract
default_definition
¶ The default search tree definition.
Returns dictionary.
-
definition
¶ The search tree definition.
Returns dictionary.
-