-
Notifications
You must be signed in to change notification settings - Fork 247
/
Ema.Increments.cs
152 lines (127 loc) · 3.61 KB
/
Ema.Increments.cs
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
namespace Skender.Stock.Indicators;
// EXPONENTIAL MOVING AVERAGE (INCREMENTING LIST)
/// <summary>
/// Exponential Moving Average (EMA)
/// from incremental reusable values.
/// </summary>
public class EmaList : List<EmaResult>, IEma, IIncrementQuote, IIncrementReusable
{
private readonly Queue<double> _buffer;
private double _bufferSum;
public EmaList(int lookbackPeriods)
{
Ema.Validate(lookbackPeriods);
LookbackPeriods = lookbackPeriods;
K = 2d / (lookbackPeriods + 1);
_buffer = new(lookbackPeriods);
_bufferSum = 0;
}
public int LookbackPeriods { get; init; }
public double K { get; init; }
public void Add(DateTime timestamp, double value)
{
// update buffer
if (_buffer.Count == LookbackPeriods)
{
_bufferSum -= _buffer.Dequeue();
}
_buffer.Enqueue(value);
_bufferSum += value;
// add nulls for incalculable periods
if (Count < LookbackPeriods - 1)
{
base.Add(new EmaResult(timestamp));
return;
}
// re/initialize as SMA
if (this[^1].Ema is null)
{
base.Add(new EmaResult(
timestamp,
_bufferSum / LookbackPeriods));
return;
}
// calculate EMA normally
base.Add(new EmaResult(
timestamp,
Ema.Increment(K, this[^1].Ema, value)));
}
public void Add(IReusable value)
{
ArgumentNullException.ThrowIfNull(value);
Add(value.Timestamp, value.Value);
}
public void Add(IReadOnlyList<IReusable> values)
{
ArgumentNullException.ThrowIfNull(values);
for (int i = 0; i < values.Count; i++)
{
Add(values[i].Timestamp, values[i].Value);
}
}
public void Add(IQuote quote)
{
ArgumentNullException.ThrowIfNull(quote);
Add(quote.Timestamp, quote.Value);
}
public void Add(IReadOnlyList<IQuote> quotes)
{
ArgumentNullException.ThrowIfNull(quotes);
for (int i = 0; i < quotes.Count; i++)
{
Add(quotes[i]);
}
}
}
/// <summary>
/// Exponential Moving Average (EMA)
/// from incremental primitives, without date context.
/// </summary>
/// <inheritdoc cref="IIncrementPrimitive"/>
public class EmaIncPrimitive : List<double?>, IEma, IIncrementPrimitive
{
private readonly Queue<double> _buffer;
private double _bufferSum;
public EmaIncPrimitive(int lookbackPeriods)
{
Ema.Validate(lookbackPeriods);
LookbackPeriods = lookbackPeriods;
K = 2d / (lookbackPeriods + 1);
_buffer = new(lookbackPeriods);
_bufferSum = 0;
}
public int LookbackPeriods { get; init; }
public double K { get; init; }
public void Add(double value)
{
// update buffer
if (_buffer.Count == LookbackPeriods)
{
_bufferSum -= _buffer.Dequeue();
}
_buffer.Enqueue(value);
_bufferSum += value;
// add nulls for incalculable periods
if (Count < LookbackPeriods - 1)
{
base.Add(null);
return;
}
// re/initialize as SMA
if (this[^1] is null)
{
base.Add(_bufferSum / LookbackPeriods);
return;
}
// calculate EMA normally
base.Add(Ema.Increment(K, this[^1], value));
}
public void Add(double[] values)
{
ArgumentNullException.ThrowIfNull(values);
for (int i = 0; i < values.Length; i++)
{
Add(values[i]);
}
}
}