-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #274 from vplan-fr/main
2024-03-10-3
- Loading branch information
Showing
6 changed files
with
177 additions
and
48 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,109 @@ | ||
| function increasingSequences(seq, key = x => x) { | ||
| let out = []; | ||
| let currentSeq = []; | ||
| let last = null; | ||
|
|
||
| for (let elem of seq) { | ||
| if (last === elem) { | ||
| // fallback if something bad happens | ||
| return [[elem]]; | ||
| } | ||
|
|
||
| if (last === null || key(elem) === key(last) + 1) { | ||
| currentSeq.push(elem); | ||
| } else { | ||
| out.push(currentSeq); | ||
| currentSeq = [elem]; | ||
| } | ||
|
|
||
| last = elem; | ||
| } | ||
|
|
||
| out.push(currentSeq); | ||
|
|
||
| return out; | ||
| } | ||
|
|
||
| function getBlockOfPeriod(period) { | ||
| return Math.floor((period - 1) / 2) + 1; | ||
| } | ||
|
|
||
| function getPeriodsOfBlock(block) { | ||
| return [block * 2 - 1, block * 2]; | ||
| } | ||
|
|
||
| function periods_to_block_label(periods) { | ||
| periods.sort(function (a, b) { | ||
| return a - b; | ||
| }); | ||
|
|
||
| const rests = { | ||
| 0: "/Ⅱ", | ||
| 1: "/Ⅰ", | ||
| }; | ||
|
|
||
| if (periods.length === 1) { | ||
| return `${Math.floor((periods[0] - 1) / 2) + 1}${rests[periods[0] % 2]}`; | ||
| } else if (periods.length === 2 && periods[0] % 2 === 1) { | ||
| return `${Math.floor(periods[periods.length - 1] / 2)}`; | ||
| } else { | ||
| return periods.map(p => periods_to_block_label([p])).join(", "); | ||
| } | ||
| } | ||
|
|
||
| function periods_to_block_or_periods_label(periods) { | ||
| periods = [...new Set(periods)].sort(); | ||
|
|
||
| // work out whether we can display as "Block X" or "Stunde X" | ||
| let allBlockPeriods = new Set( | ||
| [].concat(...periods.map(p => getPeriodsOfBlock(getBlockOfPeriod(p)))) | ||
| ); | ||
|
|
||
| if ([...allBlockPeriods].every(p => periods.includes(p))) { | ||
| // block label | ||
| let blocks = [...new Set(periods.map(p => getBlockOfPeriod(p)))].sort(); | ||
| let seqs = increasingSequences(blocks); | ||
| let out = []; | ||
|
|
||
| for (let seq of seqs) { | ||
| if (seq.length === 1) { | ||
| out.push(`${seq[0]}`); | ||
| } else if (seq.length === 2) { | ||
| out.push(`${seq[0]},${seq[seq.length - 1]}`); | ||
| } else { | ||
| out.push(`${seq[0]}-${seq[seq.length - 1]}`); | ||
| } | ||
| } | ||
|
|
||
| if (blocks.length === 1) { | ||
| return `Block ${out[0]}`; | ||
| } else { | ||
| return `Blöcke ${out.join(',')}`; | ||
| } | ||
|
|
||
| } else { | ||
| // stunde label | ||
| let seqs = increasingSequences(periods); | ||
| let out = []; | ||
|
|
||
| for (let seq of seqs) { | ||
| if (seq.length === 1) { | ||
| out.push(`${seq[0]}`); | ||
| } else if (seq.length === 2) { | ||
| out.push(`${seq[0]},${seq[seq.length - 1]}`); | ||
| } else { | ||
| out.push(`${seq[0]}-${seq[seq.length - 1]}`); | ||
| } | ||
| } | ||
|
|
||
| if (periods.length === 1) { | ||
| return `Stunde ${out[0]}`; | ||
| } else { | ||
| return `Stunden ${out.join(',')}`; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| export function getLabelOfPeriods(periods) { | ||
| return "Block " + periods_to_block_label(periods); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters