| 1 |
/* |
| 2 |
* SPDX-FileCopyrightText: 2018 Rerrah |
| 3 |
* SPDX-License-Identifier: MIT |
| 4 |
*/ |
| 5 |
|
| 6 |
#include "interpolate_pattern_command.hpp" |
| 7 |
#include "pattern_command_utils.hpp" |
| 8 |
|
| 9 |
namespace |
| 10 |
{ |
| 11 |
inline int interp(int a, int b, size_t t, int div) |
| 12 |
{ |
| 13 |
return a + (b - a) * static_cast<int>(t) / div; |
| 14 |
} |
| 15 |
} |
| 16 |
|
| 17 |
InterpolatePatternCommand::InterpolatePatternCommand( |
| 18 |
std::weak_ptr<Module> mod, int songNum, int beginTrack, int beginColumn, |
| 19 |
int beginOrder, int beginStep, int endTrack, int endColumn, int endStep) |
| 20 |
: AbstractCommand(CommandId::InterpolatePattern), |
| 21 |
mod_(mod), |
| 22 |
song_(songNum), |
| 23 |
bTrack_(beginTrack), |
| 24 |
bCol_(beginColumn), |
| 25 |
order_(beginOrder), |
| 26 |
bStep_(beginStep), |
| 27 |
eStep_(endStep) |
| 28 |
{ |
| 29 |
auto& song = mod.lock()->getSong(songNum); |
| 30 |
std::size_t h = static_cast<size_t>(endStep - beginStep + 1); |
| 31 |
std::size_t w = command_utils::calculateColumnSize(beginTrack, beginColumn, endTrack, endColumn); |
| 32 |
prevCells_ = command_utils::getPreviousCells(song, w, h, beginTrack, beginColumn, beginOrder, beginStep); |
| 33 |
} |
| 34 |
|
| 35 |
bool InterpolatePatternCommand::redo() |
| 36 |
{ |
| 37 |
auto& song = mod_.lock()->getSong(song_); |
| 38 |
int div = static_cast<int>(prevCells_.rowSize()) - 1; |
| 39 |
if (!div) div = 1; |
| 40 |
|
| 41 |
int trackIndex = bTrack_; |
| 42 |
int columnIndex = bCol_; |
| 43 |
|
| 44 |
for (std::size_t i = 0; i < prevCells_.columnSize(); ++i) { |
| 45 |
int stepIndex = bStep_; |
| 46 |
|
| 47 |
for (std::size_t j = 0; j < prevCells_.rowSize(); ++j) { |
| 48 |
Pattern& pattern = command_utils::getPattern(song, trackIndex, order_); |
| 49 |
Step& firstStep = pattern.getStep(bStep_); |
| 50 |
Step& lastStep = pattern.getStep(eStep_); |
| 51 |
|
| 52 |
switch (columnIndex) { |
| 53 |
case 0: { |
| 54 |
if (firstStep.hasGeneralNote() && lastStep.hasGeneralNote()) { |
| 55 |
pattern.getStep(stepIndex).setNoteNumber( |
| 56 |
interp(firstStep.getNoteNumber(), lastStep.getNoteNumber(), j, div)); |
| 57 |
} |
| 58 |
break; |
| 59 |
} |
| 60 |
|
| 61 |
case 1: { |
| 62 |
if (firstStep.hasInstrument() && lastStep.hasInstrument()) { |
| 63 |
pattern.getStep(stepIndex).setInstrumentNumber( |
| 64 |
interp(firstStep.getInstrumentNumber(), lastStep.getInstrumentNumber(), j, div)); |
| 65 |
} |
| 66 |
break; |
| 67 |
} |
| 68 |
|
| 69 |
case 2: { |
| 70 |
if (firstStep.hasVolume() && lastStep.hasVolume()) { |
| 71 |
pattern.getStep(stepIndex).setVolume( |
| 72 |
interp(firstStep.getVolume(), lastStep.getVolume(), j, div)); |
| 73 |
} |
| 74 |
break; |
| 75 |
} |
| 76 |
|
| 77 |
default: { |
| 78 |
int effectColumnIndex = columnIndex - 3; |
| 79 |
int effectNumber = effectColumnIndex / 2; |
| 80 |
if (effectColumnIndex % 2) { |
| 81 |
// Effect value column. |
| 82 |
if (firstStep.hasEffectValue(effectNumber) && lastStep.hasEffectValue(effectNumber)) { |
| 83 |
pattern.getStep(stepIndex).setEffectValue( |
| 84 |
effectNumber, interp(firstStep.getEffectValue(effectNumber), lastStep.getEffectValue(effectNumber), j, div)); |
| 85 |
} |
| 86 |
} |
| 87 |
else { |
| 88 |
// Effect ID column. |
| 89 |
std::string firstId = firstStep.getEffectId(effectNumber); |
| 90 |
std::string lastId = lastStep.getEffectId(effectNumber); |
| 91 |
if (firstId == lastId) { |
| 92 |
pattern.getStep(stepIndex).setEffectId(effectNumber, firstId); |
| 93 |
} |
| 94 |
} |
| 95 |
break; |
| 96 |
} |
| 97 |
} |
| 98 |
|
| 99 |
++stepIndex; |
| 100 |
} |
| 101 |
|
| 102 |
++columnIndex; |
| 103 |
trackIndex += (columnIndex / Step::N_COLUMN); |
| 104 |
columnIndex %= Step::N_COLUMN; |
| 105 |
} |
| 106 |
|
| 107 |
return true; |
| 108 |
} |
| 109 |
|
| 110 |
bool InterpolatePatternCommand::undo() |
| 111 |
{ |
| 112 |
try { |
| 113 |
command_utils::restorePattern(mod_.lock()->getSong(song_), prevCells_, bTrack_, bCol_, order_, bStep_); |
| 114 |
return true; |
| 115 |
} |
| 116 |
catch (...) { |
| 117 |
return false; |
| 118 |
} |
| 119 |
} |