SearchTree

digraph InheritanceGraph { graph [bgcolor=transparent, color=lightsteelblue2, fontname=Arial, fontsize=10, outputorder=edgesfirst, overlap=prism, penwidth=2, rankdir=LR, splines=spline, style="dashed, rounded", truecolor=true]; node [colorscheme=pastel19, fontname=Arial, fontsize=10, height=0, penwidth=2, shape=box, style="filled, rounded", width=0]; edge [color=lightslategrey, penwidth=1]; subgraph "cluster_abjad.system" { graph [label="abjad.system"]; node [color=1]; "abjad.system.AbjadObject.AbjadObject" [URL="../api/abjadext/nauert/../../abjad/system/AbjadObject.html#abjad.system.AbjadObject.AbjadObject", label="Abjad\nObject", target=_top]; } subgraph "cluster_abjadext.nauert" { graph [label="abjadext.nauert"]; node [color=2]; "abjadext.nauert.SearchTree.SearchTree" [URL="../api/abjadext/nauert/SearchTree.html#abjadext.nauert.SearchTree.SearchTree", color=black, fontcolor=white, label="Search\nTree", shape=oval, style="bold, filled", target=_top]; "abjadext.nauert.UnweightedSearchTree.UnweightedSearchTree" [URL="../api/abjadext/nauert/UnweightedSearchTree.html#abjadext.nauert.UnweightedSearchTree.UnweightedSearchTree", label="Unweighted\nSearch\nTree", target=_top]; "abjadext.nauert.WeightedSearchTree.WeightedSearchTree" [URL="../api/abjadext/nauert/WeightedSearchTree.html#abjadext.nauert.WeightedSearchTree.WeightedSearchTree", label="Weighted\nSearch\nTree", target=_top]; "abjadext.nauert.SearchTree.SearchTree" -> "abjadext.nauert.UnweightedSearchTree.UnweightedSearchTree"; "abjadext.nauert.SearchTree.SearchTree" -> "abjadext.nauert.WeightedSearchTree.WeightedSearchTree"; } subgraph cluster_builtins { graph [label=builtins]; node [color=3]; "builtins.object" [URL="https://docs.python.org/3.6/library/functions.html#object", label=object, target=_top]; } "abjad.system.AbjadObject.AbjadObject" -> "abjadext.nauert.SearchTree.SearchTree"; "builtins.object" -> "abjad.system.AbjadObject.AbjadObject"; }

abstract class abjadext.nauert.SearchTree.SearchTree(definition=None)

Abstract search tree.

SearchTrees encapsulate strategies for generating collections of QGrids, given a set of QEventProxy 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.