#![deny(missing_docs)]
use std::collections::HashMap;
mod time;
pub use time::Clock;
#[doc(inline)]
pub use time::Time;
mod error;
pub use error::ErrorKind;
use error::Result;
#[derive(Debug, Default)]
pub struct TimeMachine<S: Clone> {
edges: HashMap<Time, S>,
}
impl<S: Clone> TimeMachine<S> {
pub fn new() -> Self {
Self {
edges: HashMap::new(),
}
}
pub fn map_states<F, R>(self, mapfn: F) -> TimeMachine<R>
where
F: Fn(S) -> R,
R: Clone,
{
TimeMachine {
edges: self.edges.into_iter().map(|(k, v)| (k, mapfn(v))).collect(),
}
}
pub fn add_transition(&mut self, time: Time, state: S) {
self.edges.insert(time, state);
}
fn get_edges(&self, time: &Time) -> Result<((Time, S), (Time, S))> {
if self.edges.is_empty() {
return Err(ErrorKind::EmptyTimeMachine);
}
let mut prev_edge = Time::midnight();
let mut next_edge = Time::from_minutes(-1);
let mut last_time = prev_edge.clone();
let mut first_time = next_edge.clone();
for edge in self.edges.keys() {
if time >= edge && edge >= &prev_edge {
prev_edge = edge.clone();
}
if time < edge && edge < &next_edge {
next_edge = edge.clone();
}
if edge > &last_time {
last_time = edge.clone();
}
if edge < &first_time {
first_time = edge.clone();
}
}
let prev_ret = if let Some(state) = self.edges.get(&prev_edge) {
(prev_edge.clone(), state.clone())
} else {
(
last_time.clone(),
self.edges.get(&last_time).unwrap().clone(),
)
};
let next_ret = if let Some(state) = self.edges.get(&next_edge) {
(next_edge.clone(), state.clone())
} else {
(
first_time.clone(),
self.edges.get(&first_time).unwrap().clone(),
)
};
Ok((prev_ret, next_ret))
}
pub fn get_state(&self, time: &Time) -> Result<S> {
Ok(self.get_edges(time)?.0 .1)
}
pub fn get_state_progress(&self, _time: &Time) -> Result<(S, f64, S)> {
let ((pedge, pstate), (nedge, nstate)) = self.get_edges(_time)?;
let seconds_between: f64 = pedge.secs_until(&nedge).into();
let seconds_elapsed: f64 = pedge.secs_until(_time).into();
let progress = seconds_elapsed / seconds_between;
Ok((pstate, progress, nstate))
}
}
impl<S: Clone + Default> TimeMachine<S> {
pub fn map_states_or_default<F, R>(self, mapfn: F) -> TimeMachine<R>
where
F: Fn(S) -> Option<R>,
R: Clone + Default,
{
TimeMachine {
edges: self
.edges
.into_iter()
.map(|(k, v)| (k, mapfn(v).unwrap_or_default()))
.collect(),
}
}
pub fn get_state_or_default(&self, time: &Time) -> Result<S> {
if self.edges.is_empty() {
Ok(S::default())
} else {
self.get_state(time)
}
}
}
#[cfg(feature = "napchart")]
impl TimeMachine<Option<napchart::ElementData>> {
pub fn from_napchart(lane: &napchart::ChartLane) -> TimeMachine<Option<napchart::ElementData>> {
let mut tm = TimeMachine::new();
for elem in lane.elements_iter() {
tm.add_transition(
Time::from_minutes(elem.start as i16),
Some(elem.data.clone()),
);
if !tm.edges.contains_key(&Time::from_minutes(elem.end as i16)) {
tm.add_transition(Time::from_minutes(elem.end as i16), None);
}
}
tm
}
}