JMSL Tutorial: JScore
Implementing your own Binary Copy Buffer Transform, part 2

We will implement a Binary Copy Buffer Transform that generates the morphological mean of the two aux sources. We implement a mutation function where
each resulting Noten is the function of Aux1Noten and Aux2Note n
Note that this is a very simple mutation function, and you are encouraged to investigate Larry Polansky's exhaustive listing of morphological mutations

Try It

In the scoreframe opened by this applet, Recall again that Freeflow Paste is appropriate here because the two sources came from different staves. Paste preserves measure and staff numbering, while Freeflow Paste simply pours resulting notes into one staff.


View the applet source and mutation source.

You need a Java enabled web browser to view this applet
Previous Tutorial Index Tutorial Contents Next

  (C) 2000 Nick Didkovsky and Phil Burk, All Rights Reserved
  JMSL is based upon HMSL (C) Phil Burk, Larry Polansky and David Rosenboom.