Uses of Class
eu.bandm.music.entities.MTree
Packages that use MTree
-
Uses of MTree in eu.bandm.music.entities
Fields in eu.bandm.music.entities declared as MTreeModifier and TypeFieldDescriptionprotected final MTreeMCover.MetricNotHitException.metricTreeprotected final MTreeMCover.metricTreeThe top-level metric tree (modelling the whole measure) as passed toMCover.process(MTree, CheckedParameters_approximate, CheckedParameters_divide, List).protected final MTreeMSplitter.metricTreeThe growing metric tree.protected final MTreeMKinds.MKind.mtreeMTree.parentThe parent node of this tree node.Fields in eu.bandm.music.entities with type parameters of type MTreeModifier and TypeFieldDescriptionMSplitter.Result.additionalProportionsRecognized dotted structures which possibly require an additional proportion.MSplitter.fromNegativeDottingStemend for negative dottings are inherited from the right-most merged node and must not be overwritten when summing up the durations of the morged nodes.MCover.icThe accumulator for the result; maps (via index) events to lists of MTree nodes.MSplitter.Result.initialCoverageThe intermediately calculated IC.MTree.Printable.listMCover.newAltsSynthesized alternatives for nodes.MCover.newAltsSynthesized alternatives for nodes.protected final Map<MTree, MTree.Printable> MSplitter.Result.printables_transformedFIXME DOCUMSplitter.Result.printedThe result: Set of the nodes, the start points of which carry a note symbol.MSplitter.Result.stemEndsThe beams of the printed note symbols.MSplitter.Result.summedDurationConvenience cache: The duration represented by the printed note symbols coming from MXs=merging transformations.Methods in eu.bandm.music.entities that return MTreeModifier and TypeMethodDescription(package private) MTreeMTree.cloneAsAlternative()Copying constructor.MSplitter.get_metricTree()Returns the metric tree in its current state, as modified by all preceding metric splitting tasks.MTree.get_parent()Return the parent node.MTree.getFollowingSibling()Returns the node which is child of the same parent, and one position further, iff it exists, otherwise null.MTree.getPrecedingSibling()Returns the node which is child of the same parent, and one position earlier, iff it exists, otherwise null.MTree.getTopNode()Get the top most node to which this node is linked as a descendant.static MTreeMTree.install(MTreeSpec mt, MTree.CheckedParameters params) Only factory method for a user to create an MTree.protected MTreeMCover.makeSyntheticAlternative(MTree mt, int division) Search if a synthetic alternative with this division already exists, otherwise make one and memorize it for later tree insertion.protected MTreeMTree.self()Necessary to avoid "unchecked cast" warning when returning "this" instance in the parameterized superclassMTree_.Methods in eu.bandm.music.entities that return types with arguments of type MTreeModifier and TypeMethodDescriptionMCover.get_ic()Return the accumulated result, which maps events (by their index) to lists of nodes.MSplitter.Result.get_InitialCoverage()Return the initial coverage calculated during the msplit process.Methods in eu.bandm.music.entities with parameters of type MTreeModifier and TypeMethodDescriptionabstract voidPayload method to be overridden by user.void(package private) static voidMCover.addAlternative(MTree base, MTree alt) (package private) voidStore to the result the fact that the given arguments (node and event) are related.(package private) voidMSplitter.Result.adjustBeamsLocally(MTree node, StemEnd se) Remove stemlets considered redundant according toparameters.(package private) voidMSplitter.Result.countPrintedChilds(int[] result, MTree left, MTree right) protected voidprotected voidInternal worker method, called recursively depth first.protected voidTest to split the duration of one alternative (of possibly several), which all are EXPLICIT nodes (=from MTS, not synthetic).protected voidTest the sub-nodes and the alternatives of a node which is not completely in the current event interval, so some sub-nodes must be found to cover that interval.protected voidOne ore more event starts lie truely in the current node's interval, partly with prime factors != 2.protected voidHere the bottom of the MTree is reached: only binary divisions are required, all other primes factors have already been realized somewhere above.protected voidMCover.doFC_synt(MTree mt, MStackingPlanner.Plan spontPlan) Is only called if synthesizing is necessary.protected voidMain method for finding the Initial MCover; called once for the top node fromMCover.process(MTree,CheckedParameters_approximate,CheckedParameters_divide,List), and later repeatedly for different alternatives in the middle ofMCover.do1Alt(MTree).protected voidMCover.doSynthOrImplicit(MTree mt, MStackingPlanner.Plan spontPlan) The current event interval is truely included in that of the MTree node, but there are no child nodes.protected StemEndMSplitter.Result.getStemEnd(MTree node) Get the stem end (left and right long and short beams) for the given node.booleanMTree.isFollowingSiblingOf(MTree predec) Returns whether this node is child of the same parent as the argument, and one position further.(package private) MStackingPlanner.PlanCentral service provider; is only called when synthesizing is necessary (= to add a new alterative to "mt").protected MTreeMCover.makeSyntheticAlternative(MTree mt, int division) Search if a synthetic alternative with this division already exists, otherwise make one and memorize it for later tree insertion.static MCoverMCover.process(MTree metricTree, @Opt MCover.CheckedParameters_approximate parameters_approximate, @Opt MCover.CheckedParameters_divide parameters_divide, List<Rational> limits) Main entry method: Finds the lists of all completely covered and maximal nodes for a list of events.static MCoverMCover.process(MTree metricTree, MCover.CheckedParameters_divide parameters_divide, List<Rational> limits) A standardMStackingPlanneris used.static MCoverMCover.process(MTree metricTree, MCover.CheckedParameters_divide parameters_divide, List<Rational> limits, MStackingPlanner stackingPlanner) Same functionality asMCover.process(MTree,CheckedParameters_divide,List), but a different bracket order stacking planner can be plugged in.(package private) voidprotected voidMSplitter.Result.WriteOut.testOpenBrackets(MTree start, boolean printedNode) Called for each node to open essential n-plet-brackets, iff necessary for the following duration values.abstract voidMetricConsumer.WriteOut.writeOut(int index, MTree node, RationalDuration.DottedBaseDuration symbol, Rational proportion, StemEnd beams, boolean isSound, boolean isFirst, boolean isLast) Write out one symbol of an event.voidMSplitter.Result.Dumper.writeOut(int index, MTree node, RationalDuration.DottedBaseDuration symbol, Rational proportion, StemEnd beams, boolean isSound, boolean isFirst, boolean isLast) abstract voidMSplitter.Result.WriteOut.writeOut(int index, MTree node, RationalDuration.DottedBaseDuration symbol, Rational proportion, StemEnd beams, boolean isSound, boolean isFirst, boolean isLast) Write out one symbol of an event.Method parameters in eu.bandm.music.entities with type arguments of type MTreeModifier and TypeMethodDescriptionprotected voidMTree.do_collect_genuine_beams(StemEnd se_parent, List<MTree> subtrees) protected voidMSplitter.parseSiblingsAndDottings(List<MTree> irep, boolean isPause, Set<MTree> printThem, Map<MTree, StemEnd> stemEnds) Delivers all nodes which shall appear in the notation as a symbol, in the output set argument "printThem".protected voidMSplitter.parseSiblingsAndDottings(List<MTree> irep, boolean isPause, Set<MTree> printThem, Map<MTree, StemEnd> stemEnds) Delivers all nodes which shall appear in the notation as a symbol, in the output set argument "printThem".protected voidMSplitter.parseSiblingsAndDottings(List<MTree> irep, boolean isPause, Set<MTree> printThem, Map<MTree, StemEnd> stemEnds) Delivers all nodes which shall appear in the notation as a symbol, in the output set argument "printThem".(package private) voidMSplitter.splitDots_withBeams(List<MTree> irep, Set<MTree> printThem, Map<MTree, StemEnd> stemEnds, int dotsCount, boolean dotsCountIsMax, int startPos, int endPos, boolean leftNotRight, boolean positiveDotting) Add nodes from Initial Coverage to result, representing a sequence of dotted values not exceeding maxDots.(package private) voidMSplitter.splitDots_withBeams(List<MTree> irep, Set<MTree> printThem, Map<MTree, StemEnd> stemEnds, int dotsCount, boolean dotsCountIsMax, int startPos, int endPos, boolean leftNotRight, boolean positiveDotting) Add nodes from Initial Coverage to result, representing a sequence of dotted values not exceeding maxDots.(package private) voidMSplitter.splitDots_withBeams(List<MTree> irep, Set<MTree> printThem, Map<MTree, StemEnd> stemEnds, int dotsCount, boolean dotsCountIsMax, int startPos, int endPos, boolean leftNotRight, boolean positiveDotting) Add nodes from Initial Coverage to result, representing a sequence of dotted values not exceeding maxDots.protected booleanMSplitter.testForSyncopeAndHemiola(List<MTree> irep, boolean isSound) Returns whether the node list, representing one event, can be replaced by one single symbol, due to syncope or hemiola rules.protected voidMSplitter.Result.WriteOut.x_writeOut(int index, List<MTree> nodes, Rational currentProportion, boolean isSound, boolean isFirst, boolean isLast) A wrapper which calls the real "writeout()" for a list of nodes, which come from a cache.Constructors in eu.bandm.music.entities with parameters of type MTree