apple-quant-algorithmic 0.4.0

Apple Quant's algorithmic library.
Documentation 
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

use super::{Timestamp, TimestampError};

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct TimestampRangeExclusive {
	pub start: Timestamp,
	pub end: Timestamp,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum TimestampRangeInclusive {
	One(Timestamp),

	Multiple {
		start: Timestamp,
		last: Timestamp,
	},
}

impl TimestampRangeInclusive {
	pub fn new_from_iter(
		timestamps: impl IntoIterator<Item = &Timestamp>,
	) -> Result<Self, TimestampError> {
		let mut iter = timestamps.into_iter();

		let Some(
			mut start,
		) = iter.next().cloned() else {
			return Err(TimestampError::RangeNotSatisfied { min: None, max: None });
		};

		let Some(
			mut last,
		) = iter.next().cloned() else {
			return Ok(Self::One(start));
		};

		if start > last {
			let older_timestamp = start;
			start = last;
			last = older_timestamp;
		}

		for &timestamp in iter {
			if timestamp < start {
				start = timestamp;
			}

			if timestamp > last {
				last = timestamp;
			}
		}

		Ok(Self::Multiple { start, last })
	}

	pub fn start(
		&self,
	) -> &Timestamp {
		match self {
			Self::One(
				timestamp,
			) => timestamp,
			Self::Multiple {
				start,
				last: _,
			} => start,
		}
	}

	pub fn last(
		&self,
	) -> &Timestamp {
		match self {
			Self::One(
				timestamp,
			) => timestamp,
			Self::Multiple {
				start: _,
				last,
			} => last,
		}
	}
}