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
//! This module introduces struct [`ScrollObjects`], which manages definitions and events of scroll speed change.
use std::collections::{BTreeMap, HashMap, btree_map::Entry};
use strict_num_extended::FinF64;
use crate::bms::{
command::StringValue,
parse::{Result, prompt::ChannelDuplication},
prelude::*,
};
#[derive(Debug, Default, Clone, PartialEq, Eq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
/// This aggregate manages definition and events of scroll speed change.
pub struct ScrollObjects {
/// Scroll speed change definitions, indexed by [`ObjId`]. `#SCROLL[01-ZZ]`
pub scroll_defs: HashMap<ObjId, StringValue<FinF64>>,
/// The scrolling factors corresponding to the id of the scroll speed change object.
pub scrolling_factor_changes: BTreeMap<ObjTime, ScrollingFactorObj>,
}
impl ScrollObjects {
/// Adds a new scrolling factor change object to the notes.
///
/// # Errors
///
/// Returns [`ParseWarning`] if a conflict is found and the
/// provided [`Prompter`] decides to treat it as an error.
pub fn push_scrolling_factor_change(
&mut self,
scrolling_factor_change: ScrollingFactorObj,
prompt_handler: &impl Prompter,
) -> Result<()> {
match self
.scrolling_factor_changes
.entry(scrolling_factor_change.time)
{
Entry::Vacant(entry) => {
entry.insert(scrolling_factor_change);
Ok(())
}
Entry::Occupied(mut entry) => {
let existing = entry.get();
prompt_handler
.handle_channel_duplication(ChannelDuplication::ScrollingFactorChangeEvent {
time: scrolling_factor_change.time,
older: existing,
newer: &scrolling_factor_change,
})
.apply_channel(
entry.get_mut(),
scrolling_factor_change.clone(),
scrolling_factor_change.time,
Channel::Scroll,
)
}
}
}
}