Enum ArrangeRow 

pub enum ArrangeRow {
    PatternRow {
        pattern_id: u8,
        repetitions: u8,
        mute_mask: u8,
        tempo_1: u8,
        tempo_2: u8,
        scene_a: u8,
        scene_b: u8,
        offset: u8,
        length: u8,
        midi_transpose: [u8; 8],
    },
    LoopOrJumpOrHaltRow {
        loop_count: u8,
        row_target: u8,
    },
    ReminderRow(String),
    EmptyRow(),
}

Base model for an arranger row within an arrangement block.

Variants

PatternRow

pattern choice and playback

Fields

pattern_id: u8

Which Pattern should be played at this point. Patterns are indexed from 0 (A01) -> 256 (P16).

repetitions: u8

How many times to play this arrangement row.

mute_mask: u8

How track muting is applied during this arrangement row.

tempo_1: u8

First part of the Tempo mask for this row. Needs to be combined with tempo_2 to work out the actual tempo (not sure how it works yet).

tempo_2: u8

Second part of the Tempo mask for this row. Needs to be combined with tempo_1 to work out the actual tempo (not sure how it works yet).

scene_a: u8

Which scene is assigned to Scene slot A when this arrangement row is playing.

scene_b: u8

Which scene is assigned to Scene slot B when this arrangement row is playing.

offset: u8

Which trig to start Playing the pattern on.

length: u8

How many trigs to play the pattern for. Note that this value always has offset added to it. So a length on the machine display of 64 when the offset is 32 will result in a value of 96 in the file data.

midi_transpose: [u8; 8]

MIDI Track transposes for all 8 midi channels. 1 -> 48 values are positive transpose settings. 255 (-1) -> 207 (-48) values are negative transpose settings.

LoopOrJumpOrHaltRow

Loop/Jump/Halt rows are all essentially just loops. Example: Jumps are an infinite loop. So these are bundled into one type.

Loops are loop_count = 0 -> 65 and the row_target is any row before this one (loop_count=0 is infinite looping). Halts are loop_count = 0 and the row_target is this row. Jumps are loop_count = 0 and the row_target is any row after this one.

Fields

loop_count: u8

How many times to loop to the row_target. Only applies to loops.

row_target: u8

The row number to loop back to, jump to, or end at.

ReminderRow(String)

A row of ASCII text data with 15 maximum length.

EmptyRow()

Row is not in use. Only used in an ArrangementBlock as a placeholder for null basically.

Trait Implementations

impl Clone for ArrangeRow

fn clone(&self) -> ArrangeRow

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ArrangeRow

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ArrangeRow

fn default() -> Self

Returns the “default value” for a type.

impl<const N: usize> Defaults<[ArrangeRow; N]> for ArrangeRow

fn defaults() -> [Self; N]

where Self: Default,

Create an default container type T containing N default instances of Self.

impl<const N: usize> Defaults<Box<Array<ArrangeRow, N>>> for ArrangeRow

fn defaults() -> Box<Array<Self, N>>

where Self: Defaults<[Self; N]>,

Create an default container type T containing N default instances of Self.

impl<'de> Deserialize<'de> for ArrangeRow

Custom Deserialize trait for ArrangeRow variants. Ensures we can do

• conditional/dynamic deserialization for binary data based on the row type byte
• deserialize from both human-readable and raw binary formats

The variant of an ArrangeRow is determined by

• the row’s index in the ArrangementBlock.rows array versus number of rows in the arrangement ArrangementBlock.n_rows
• The value of the first byte for an ArrangeRow. See the table below:

ArrangeRow Variant	First Byte
PatternRow	0
ReminderRow	0
LoopOrJumpOrHaltRow	0
PatternRow	0
EmptyRow	n/a

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for ArrangeRow

fn eq(&self, other: &ArrangeRow) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for ArrangeRow

Custom serialization to ensure we can serialize both bytes and human-readable data formats correctly. Please note this currently abuses the serialize_struct pattern for writing binary/bytes to ensure we get the correct number of bytes in the correct positions.

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for ArrangeRow

impl StructuralPartialEq for ArrangeRow