Package | Description |
---|---|
eu.bandm.music.entities |
All fundamental entities for modeling music.
|
Modifier and Type | Field and Description |
---|---|
protected MTree.EssentialBracket |
MTree.bracketCont
The essential bracket not starting with this node but covering it on its definition
level.
|
protected @Opt MTree.EssentialBracket |
MTree.bracketStart
The essential bracket starting with this node and required to write its duration.
|
(package private) @Opt MTree.EssentialBracket |
MTree.Visitor.lowestBracket
The most recently recognizes bracket when descending.
|
protected @Opt MTree.EssentialBracket |
MTree.EssentialBracket.predec
The next higher (relevant, non-vanishing) bracket covering this node.
|
Modifier and Type | Field and Description |
---|---|
(package private) Stack<MTree.EssentialBracket> |
MSplitter.Result.WriteOut.bracketStack
Keeps track of n-plet-brackets currently open.
|
Modifier and Type | Method and Description |
---|---|
@Opt MTree.EssentialBracket |
MTree.directEB()
Look for the EssentialBracket directly spanning this node.
|
(package private) MTree.EssentialBracket |
MTree.EssentialBracket.doclone()
Deliver a clone with all fields copied.
|
@Opt MTree.EssentialBracket |
MTree.lowestEB()
Look for the lowest EssentialBracket spannung this node.
|
Modifier and Type | Method and Description |
---|---|
protected void |
MTree.collectBrackets(@Opt MTree.EssentialBracket predecBracket,
PrimeFactors parentFactors,
boolean secondPass)
Calculation of essential brackets for all nodes below the top node of a
MTree, calls itself recursively.
|
protected void |
MTree.descend_collect(@Opt MTree.EssentialBracket predecBracket,
PrimeFactors parentFactors)
After having assigned one or zero EB to all childs, descend into the childs and
assign EBs to their childs by calling
MTree.collectBrackets(EssentialBracket,PrimeFactors,boolean) recursively. |
protected void |
MTree.linkBracket(MTree.EssentialBracket eb,
int startPos,
int endPos)
Enter the bracket into the fields
MTree.bracketStart and bracketCont
of all childs of this node, in the given ragen of indexes. |
protected void |
MTree.makeBracket(@Opt MTree.EssentialBracket predec,
PrimeFactors factors,
int startPos,
int endPos)
Possibly make a new
MTree.EssentialBracket covering the given sub-range of
child nodes and link it to all those by the fields MTree.bracketStart and
bracketCont . |
Constructor and Description |
---|
EssentialBracket(@Opt MTree.EssentialBracket predec,
int bracketDenominator,
int bracketEnumerator,
Rational endTime,
boolean singleton)
Effekt of an EB: multiply the written duration (=note symbols=note heads, flags etc.)
by proportion n/d to get the meant duration.
|
EssentialBracket(@Opt MTree.EssentialBracket predec,
int bracketDenominator,
Rational endTime,
boolean singleton)
Effekt of an EB: multiply the written duration (=note symbols=note heads, flags etc.)
by proportion n/d to get the meant duration.
|