Spaces:
Sleeping
Sleeping
File size: 4,057 Bytes
d605f27 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 |
import {MusicNotation} from "@k-l-lambda/music-widgets";
import {ChordPosition} from "./notation";
declare class StaffToken {
system?: number;
measure?: number;
x: number;
endX?: number;
};
interface TickItem {
tick: number;
endTick?: number;
system: number;
measure: number;
x: number;
endX: number;
};
interface SheetPosition {
system: number,
x: number,
};
interface Note extends MusicNotation.Note {
chordPosition?: ChordPosition;
measure?: number;
outMeasure?: boolean;
};
interface Notation {
notes: Note[];
endTick: number;
};
export default class Scheduler {
tickTable: TickItem[];
static createFromNotation (midiNotation: Notation, tokenMap: Map<string, StaffToken>): Scheduler {
const tokenTable: {[key: number]: StaffToken[]} = {};
const idSet = new Set<string>();
let measureIndex = 0;
midiNotation.notes.filter(note => !note.outMeasure && (!note.chordPosition || note.chordPosition.index === 0)).forEach(note => {
if (note.ids) {
if (note.measure !== measureIndex) {
idSet.clear();
measureIndex = note.measure;
}
else if (note.ids.some(id => idSet.has(id)))
return;
note.ids.forEach(idSet.add.bind(idSet));
tokenTable[note.startTick] = tokenTable[note.startTick] || [];
const tokens = note.ids.map(id => tokenMap.get(id)).filter(t => t);
tokenTable[note.startTick].push(...tokens);
}
});
//console.log("tokenTable:", tokenTable);
return Scheduler.createFromTokenTable(tokenTable, midiNotation.endTick);
}
static createFromTokenTable (tokenTable: {[key: number]: StaffToken[]}, endTick: number): Scheduler {
const tickTable: TickItem[] = Object.entries(tokenTable).map(([tick, tokens]) => {
if (!tokens.length)
return null;
tokens.sort((t1, t2) => t1.system === t2.system ? t1.x - t2.x : t1.system - t2.system);
const token = tokens[0];
return {
tick: Number(tick),
system: token.system,
measure: token.measure,
x: token.x,
endX: token.endX,
};
}).filter(Boolean).sort((i1, i2) => i1.tick - i2.tick);
//console.log("sequence:", sequence);
tickTable.forEach((item, i) => {
const nextItem = tickTable[i + 1];
item.endTick = nextItem ? nextItem.tick : endTick;
console.assert(item.endTick > item.tick, "invalid tick item, tick span is non-positive:", item, tokenTable[item.tick]);
if (nextItem && item.system === nextItem.system && [0, 1].includes(nextItem.measure - item.measure))
item.endX = nextItem.x;
});
return new Scheduler({
tickTable,
});
}
constructor ({tickTable}: {tickTable: TickItem[]}) {
console.assert(tickTable.length > 0, "invalid tick table:", tickTable);
this.tickTable = tickTable;
}
get startTick (): number {
if (!this.tickTable[0])
return null;
return this.tickTable[0].tick;
}
get endTick (): number {
if (!this.tickTable[0])
return null;
return this.tickTable[this.tickTable.length - 1].endTick;
}
lookupPosition (tick: number): SheetPosition {
tick = Math.max(Math.min(tick, this.endTick), this.startTick);
const item = this.tickTable.find(item => item.tick <= tick && item.endTick > tick) || this.tickTable[this.tickTable.length - 1];
if (!item) {
console.warn("cannot find tick item:", tick, this.tickTable);
return null;
}
const x = item.x + (tick - item.tick) * (item.endX - item.x) / (item.endTick - item.tick);
return {
system: item.system,
x,
};
}
lookupTick (position: SheetPosition): number {
const rowItems = this.tickTable.filter(item => item.system === position.system).sort((i1, i2) => i1.x - i2.x);
let item = rowItems.find(item => item.x <= position.x && item.endX >= position.x);
if (!item) {
const firstItem = rowItems[0];
if (firstItem && position.x < firstItem.endX)
item = firstItem;
else
//console.warn("lookup position out of range:", position, this.tickTable);
return null;
}
const tick = item.tick + Math.max(position.x - item.x, 0) * (item.endTick - item.tick) / (item.endX - item.x);
return tick;
}
};
|