You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@mesos.apache.org by gi...@apache.org on 2018/06/11 14:11:51 UTC
[07/20] mesos-site git commit: Updated the website built from mesos
SHA: b1e88f7.
http://git-wip-us.apache.org/repos/asf/mesos-site/blob/0df7420a/content/api/latest/c++/timeseries_8hpp_source.html
----------------------------------------------------------------------
diff --git a/content/api/latest/c++/timeseries_8hpp_source.html b/content/api/latest/c++/timeseries_8hpp_source.html
index d213f8c..41d91fe 100644
--- a/content/api/latest/c++/timeseries_8hpp_source.html
+++ b/content/api/latest/c++/timeseries_8hpp_source.html
@@ -52,39 +52,40 @@
<div class="title">timeseries.hpp</div> </div>
</div><!--header-->
<div class="contents">
-<a href="timeseries_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">//
</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// limitations under the License</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div><div class
="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#ifndef __PROCESS_TIMESERIES_HPP__</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#define __PROCESS_TIMESERIES_HPP__</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span> <span class="comment">// For max.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <map></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span
> <span class="preprocessor">#include <<a class="code" href="clock_8hpp.html">process/clock.hpp</a>></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <<a class="code" href="time_8hpp.html">process/time.hpp</a>></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <<a class="code" href="duration_8hpp.html">stout/duration.hpp</a>></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <<a class="code" href="none_8hpp.html">stout/none.hpp</a>></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="option_8hpp.html">stout/option.hpp</a>></span></div><div class=
"line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceprocess.html">process</a> {</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// Default statistic configuration variables.</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// TODO(bmahler): It appears there may be a bug with gcc-4.1.2 in</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// which these duration constants were not being initialized when</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// having static linkage. This issue did not
manifest in newer gcc's.</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// Specifically, 4.2.1 was ok. So we've moved these to have external</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// linkage but perhaps in the future we can revert this.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">extern</span> <span class="keyword">const</span> <a class="code" href="classDuration.html">Duration</a> <a class="code" href="namespaceprocess.html#a1865c52e226d6f280d63dd80884dd959">TIME_SERIES_WINDOW</a>;</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">extern</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code" href="namespaceprocess.html#a242c384165e598356687505925d93a6e">TIME_SERIES_CAPACITY</
a>;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Provides an in-memory time series of statistics over some window.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// When the time series capacity is exceeded within the window, the</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// granularity of older values is coarsened. This means, for</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// high-frequency statistics that exceed the capacity, we keep a lot</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// of
recent data points (fine granularity), and keep fewer older</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// data points (coarse granularity). The tunable bit here is the</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// total number of data points to keep around, which informs how</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// often to delete older data points, while still keeping a window</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// worth of data.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// TODO(bmahler): Investigate using Google's btree implementation.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> 
<span class="comment">// This provides better insertion and lookup performance for large</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// containers. This _should_ also provide significant memory</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// savings. These are true because we have the following properties:</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// 1. Our insertion order will mostly be in sorted order.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// 2. Our keys (Seconds) have efficient comparison operators.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// See: http://code.google.com/p/cpp-btree/</span></div><div class="line"><a name="l00055"></a
><span class="lineno"> 55</span> <span class="comment">// http://code.google.com/p/cpp-btree/wiki/UsageInstructions</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html"> 57</a></span> <span class="keyword">struct </span><a class="code" href="structprocess_1_1TimeSeries.html">TimeSeries</a></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> {</div><div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a8fd91415653d305e8793416f8c4ff797"> 59</a></span>  <a class="code" href="structprocess_1_1TimeSeries.html#a8fd91415653d305e8793416f8c4ff797">TimeSeries</a>(<span class="keyword">const</span> <a class="code" href="classDuration.htm
l">Duration</a>& _window = TIME_SERIES_WINDOW,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordtype">size_t</span> _capacity = TIME_SERIES_CAPACITY)</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  : window(_window),</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// The truncation technique requires at least 3 elements.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  capacity(<a class="code" href="namespacestd.html">std</a>::<a class="code" href="option_8hpp.html#ac4b53d77033a5d2405ef12ceb3dc6498">max</a>((size_t) 3, _capacity)) {}</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html"> 65</a></span> 
<span class="keyword">struct </span><a class="code" href="structprocess_1_1TimeSeries_1_1Value.html">Value</a></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  {</div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6"> 67</a></span>  <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">Value</a>(<span class="keyword">const</span> <a class="code" href="classprocess_1_1Time.html">Time</a>& _time, <span class="keyword">const</span> T& _data) : <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a>(_time), <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#a3a4ce139e59cd0cae4324bc9a07e28a7">data</a>(_data) {}</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a
name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Non-const for assignability.</span></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e"> 70</a></span>  <a class="code" href="classprocess_1_1Time.html">Time</a> <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a>;</div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html#a3a4ce139e59cd0cae4324bc9a07e28a7"> 71</a></span>  T <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#a3a4ce139e59cd0cae4324bc9a07e28a7">data</a>;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  };</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a>
<span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a32ad80193e5138cd76086f01ecbaf1ed"> 74</a></span>  <span class="keywordtype">void</span> <span class="keyword">set</span>(<span class="keyword">const</span> T& value, <span class="keyword">const</span> <a class="code" href="classprocess_1_1Time.html">Time</a>& <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a> = <a class="code" href="classprocess_1_1Clock.html#a24ed3f746bb6b3ddb1c52dce5e0ecd38">Clock::now</a>())</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// If we're not inserting at the end of the time series, then</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// we have to reset the sparsification index. Given th
at</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// out-of-order insertion is a rare use-case. This is a simple way</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// to keep insertions O(log(n)). No need to figure out how to</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// adjust the truncation index.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (!values.empty() && time < values.rbegin()->first) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  index = <a class="code" href="structNone.html">None</a>();</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div><div class="line"><a name="l00084"></a><span c
lass="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  values[<a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a>] = value;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e">truncate</a>();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  sparsify();</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Returns the time series within the (optional) time range.</span></div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries
.html#a17657ae4751e17ad24c890c8e4dfd2f9"> 91</a></span>  std::vector<Value> <span class="keyword">get</span>(</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> <a class="code" href="classOption.html">Option<Time></a>& <a class="code" href="namespacesystemd_1_1slices.html#a95aa197d8eed9f20dacb44f433b15f01">start</a> = <a class="code" href="structNone.html">None</a>(),</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">const</span> <a class="code" href="classOption.html">Option<Time></a>& stop = <a class="code" href="structNone.html">None</a>()) <span class="keyword">const</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Ignore invalid ranges.</span></div><div class
="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (start.isSome() && stop.<a class="code" href="classOption.html#a4e3bf8416d95246f43c91f1b5c309323">isSome</a>() && start.get() > stop.<a class="code" href="classOption.html#a21358442c0fac1cc978a67a9a9089a79">get</a>()) {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">return</span> std::vector<Value>();</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typename</span> std::map<Time, T>::const_iterator <a class="code" href="namespacestrings.html#a66b9edbbfb1f158b6c420367a1457a0b">lower</a> = values.lower_bound(</div><div class="line"><a name="l00101"></a>
<span class="lineno"> 101</span>  start.isSome() ? start.get() : <a class="code" href="classprocess_1_1Time.html#adaf82d5f3d8c886ce04dd87fdd639959">Time::epoch</a>());</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typename</span> std::map<Time, T>::const_iterator <a class="code" href="namespacestrings.html#a69f3467801285caf9a9e04929ff33cee">upper</a> = values.upper_bound(</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  stop.<a class="code" href="classOption.html#a4e3bf8416d95246f43c91f1b5c309323">isSome</a>() ? stop.<a class="code" href="classOption.html#a21358442c0fac1cc978a67a9a9089a79">get</a>() : <a class="code" href="classprocess_1_1Time.html#a45c081fba8c8a6c2e0d6c30580d95645">Time::max</a>());</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#
160;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::vector<Value> values;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">while</span> (lower != upper) {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  values.push_back(<a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">Value</a>(lower->first, lower->second));</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  ++<a class="code" href="namespacestrings.html#a66b9edbbfb1f158b6c420367a1457a0b">lower</a>;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> values;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112
</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#ab9d8e976e89fb5a5539e1fe83f17f3dd"> 114</a></span>  <a class="code" href="classOption.html">Option<Value></a> <a class="code" href="structprocess_1_1TimeSeries.html#ab9d8e976e89fb5a5539e1fe83f17f3dd">latest</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (<a class="code" href="structprocess_1_1TimeSeries.html#a71832c3c13f993378d355d3f9330cc14">empty</a>()) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span> <a class="code" href="structNone.html">No
ne</a>();</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">Value</a>(values.rbegin()->first, values.rbegin()->second);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a71832c3c13f993378d355d3f9330cc14"> 123</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structprocess_1_1TimeSeries.html#a71832c3c13f993378d355d3f9330cc14">empty</a>()<span class="keyword"> const </sp
an>{ <span class="keywordflow">return</span> values.empty(); }</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// Removes values outside the time window. This will ensure at</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// least one value remains. Note that this is called automatically</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// when writing to the time series, so this is only needed when</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// one wants to explicitly trigger a truncation.</span></div><div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f
0e"> 129</a></span>  <span class="keywordtype">void</span> <a class="code" href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e">truncate</a>()</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="classprocess_1_1Time.html">Time</a> <a class="code" href="namespaceprocess_1_1internal.html#a64e590c9a40c4ead4b969d6a64cd8181">expired</a> = <a class="code" href="classprocess_1_1Clock.html#a24ed3f746bb6b3ddb1c52dce5e0ecd38">Clock::now</a>() - window;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typename</span> std::map<Time, T>::iterator upper_bound =</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  values.upper_bound(expired);</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </di
v><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// Ensure at least 1 value remains.</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (values.size() <= 1 || upper_bound == values.end()) {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// When truncating and there exists a next value considered</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// for sparsification, there are two cases to consider for</span></div><div clas
s="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// updating the index:</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">//</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// Case 1: upper_bound < next</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// upper_bound index, next</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// v v</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// Before: 0 1 2 3 4 5 6
7 ...</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// next index After truncating, index is</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// v v must be adjusted:</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Truncate: 3 4 5 6 7 ... index -= # elements removed</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="c
omment">// index, next</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// v</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// After: 3 4 5 6 7 ...</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">//</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// Case 2: upper_bound >= next</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l0016
1"></a><span class="lineno"> 161</span>  <span class="comment">// upper_bound, index, next</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// v</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// Before: 0 1 2 3 4 5 6 7 ...</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// After truncating, we must</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// After: 4 5 6 7 ... reset index to None().</span></div><div class="line"><a name="l00167"></a><span class="
lineno"> 167</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">if</span> (index.isSome() && upper_bound->first < next->first) {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordtype">size_t</span> <a class="code" href="namespaceos_1_1stat.html#a7a116891923bc8b5d8c50f78da8657be">size</a> = values.size();</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  values.erase(values.begin(), upper_bound);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  index = index.get() - (size - values.size());</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00173"></a><s
pan class="lineno"> 173</span>  index = <a class="code" href="structNone.html">None</a>();</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  values.erase(values.begin(), upper_bound);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// Performs "sparsification" to limit the size of the time series</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// to be within the capacity.</span></div><div class="line"><a name="l00181"></a><spa
n class="lineno"> 181</span>  <span class="comment">//</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// The sparsifying technique is to iteratively halve the granularity</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// of the older half of the time series. Once sparsification reaches</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// the midpoint of the time series, it begins again from the</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// beginning.</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">//</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// Sparsification results in the fo
llowing granularity over time:</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Initial: | ------------------------ A -------------------- |</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// Stage 1: | ------- 1/2 A ---------- | -------- B --------- |</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// Stage 2: | -- 1/4A --- | -- 1/2B -- | -------- C --------- |</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Stage 3: | 1/8A | 1/4B | -- 1/2C -- | -------- D --------- |</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// ...</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// Each stage halves the size and granularity of time series prior</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// to sparsifying.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">void</span> sparsify()</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  {</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// We remove every other element up to the halfway point of the</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// time series, until we're within the capacity. If we reach the</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="co
mment">// half-way point of the time series, we'll start another</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// sparsification cycle from the beginning, for example:</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">//</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// next Time series with a capacity of 7.</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// v Initial state with 7 entries</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// 0 1 2 3 4 5 6</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">//</span></div><div class="line"><a name="l00207"></
a><span class="lineno"> 207</span>  <span class="comment">// next Insert '7'.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// v Capacity is exceeded, we remove '1' and</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// 0 2 3 4 5 6 7 advance to remove '3' next.</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">//</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// next Insert '8'.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// v Capacity is exceeded, we remove '3' and</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 2
13</span>  <span class="comment">// 0 2 4 5 6 7 8 advance to remove '5' next.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">//</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// next Insert '9'.</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// v Capacity is exceeded, we remove '5' and now</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// 0 2 4 6 7 8 9 '7' is past the halfway mark, so we will reset</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// reset to the beginning and consider '2'.</span></div><div class="line"><a name="l00219"></a><span clas
s="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">while</span> (values.size() > capacity) {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// If the index is uninitialized, or past the half-way point,</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// we set it back to the beginning.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (index.isNone() || index.get() > values.size() / 2) {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// The second element is the initial deletion candidate.</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  next = values.begin();</d
iv><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  ++next;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  index = 1;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  next = values.erase(next);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  next++; <span class="comment">// Skip one element.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  index = index.get() + 1;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235
</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// Non-const for assignability.</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="classDuration.html">Duration</a> window;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordtype">size_t</span> capacity;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// We use a map instead of a hashmap to store the values because</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// that way we can retrieve a series in sorted order efficiently.</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  std::map<Time, T> va
lues;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// Next deletion candidate. We store both the iterator and index.</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// The index is None initially, and whenever a value is appended</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// out-of-order. This means 'next' is only valid when 'index' is</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// Some.</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">typename</span> std::map<Time, T>::iterator next;</div><div class="line"><a name="l00249"></a><span class="lineno">
249</span>  <a class="code" href="classOption.html">Option<size_t></a> index;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> };</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> </div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> } <span class="comment">// namespace process {</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="preprocessor">#endif // __PROCESS_TIMESERIES_HPP__</span></div><div class="ttc" id="classOption_html"><div class="ttname"><a href="classOption.html">Option</a></div><div class="ttdef"><b>Definition:</b> option.hpp:28</div></div>
-<div class="ttc" id="namespaceos_1_1stat_html_a7a116891923bc8b5d8c50f78da8657be"><div class="ttname"><a href="namespaceos_1_1stat.html#a7a116891923bc8b5d8c50f78da8657be">os::stat::size</a></div><div class="ttdeci">Try< Bytes > size(const std::string &path, const FollowSymlink follow=FollowSymlink::FOLLOW_SYMLINK)</div><div class="ttdef"><b>Definition:</b> stat.hpp:119</div></div>
-<div class="ttc" id="structprocess_1_1TimeSeries_html_a8fd91415653d305e8793416f8c4ff797"><div class="ttname"><a href="structprocess_1_1TimeSeries.html#a8fd91415653d305e8793416f8c4ff797">process::TimeSeries::TimeSeries</a></div><div class="ttdeci">TimeSeries(const Duration &_window=TIME_SERIES_WINDOW, size_t _capacity=TIME_SERIES_CAPACITY)</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:59</div></div>
+<a href="timeseries_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">//
</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// limitations under the License</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div><div class
="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#ifndef __PROCESS_TIMESERIES_HPP__</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#define __PROCESS_TIMESERIES_HPP__</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span> <span class="comment">// For max.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <map></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span
> <span class="preprocessor">#include <<a class="code" href="clock_8hpp.html">process/clock.hpp</a>></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <<a class="code" href="time_8hpp.html">process/time.hpp</a>></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <<a class="code" href="duration_8hpp.html">stout/duration.hpp</a>></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <<a class="code" href="none_8hpp.html">stout/none.hpp</a>></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <<a class="code" href="option_8hpp.html">stout/option.hpp</a>></span></div><div class=
"line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceprocess.html">process</a> {</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// Default statistic configuration variables.</span></div><div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="namespaceprocess.html#a79124011954c164c6178289973461ab5"> 30</a></span> constexpr <a class="code" href="classDuration.html">Duration</a> <a class="code" href="namespaceprocess.html#a79124011954c164c6178289973461ab5">TIME_SERIES_WINDOW</a> = <a class="code" href="classWeeks.html">Weeks</a>(2);</div><div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespaceprocess.html#a06430e17
cbf61305d44507af542da391"> 31</a></span> constexpr <span class="keywordtype">size_t</span> <a class="code" href="namespaceprocess.html#a06430e17cbf61305d44507af542da391">TIME_SERIES_CAPACITY</a> = 1000;</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// Provides an in-memory time series of statistics over some window.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// When the time series capacity is exceeded within the window, the</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// granularity of older values is coarsened. This means, for</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <s
pan class="comment">// high-frequency statistics that exceed the capacity, we keep a lot</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// of recent data points (fine granularity), and keep fewer older</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// data points (coarse granularity). The tunable bit here is the</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// total number of data points to keep around, which informs how</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// often to delete older data points, while still keeping a window</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// worth of data.</span></div><div class="line"><a name="l00043"></a><span class="lin
eno"> 43</span> <span class="comment">// TODO(bmahler): Investigate using Google's btree implementation.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// This provides better insertion and lookup performance for large</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// containers. This _should_ also provide significant memory</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// savings. These are true because we have the following properties:</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// 1. Our insertion order will mostly be in sorted order.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// 2. Our keys (Seconds) have efficient comparison operators.<
/span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// See: http://code.google.com/p/cpp-btree/</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// http://code.google.com/p/cpp-btree/wiki/UsageInstructions</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html"> 52</a></span> <span class="keyword">struct </span><a class="code" href="structprocess_1_1TimeSeries.html">TimeSeries</a></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> {</div><div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a8fd91415653d305e8793416f8c4ff79
7"> 54</a></span>  <a class="code" href="structprocess_1_1TimeSeries.html#a8fd91415653d305e8793416f8c4ff797">TimeSeries</a>(<span class="keyword">const</span> <a class="code" href="classDuration.html">Duration</a>& _window = TIME_SERIES_WINDOW,</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordtype">size_t</span> _capacity = TIME_SERIES_CAPACITY)</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  : window(_window),</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// The truncation technique requires at least 3 elements.</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  capacity(<a class="code" href="namespacestd.html">std</a>::<a class="code" href="option_8hpp.html#ac4b53d77033a5d2405ef12ceb3dc6498">max</a>((size_t) 3, _capacity)) {}</div><div class="line"><a name=
"l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html"> 60</a></span>  <span class="keyword">struct </span><a class="code" href="structprocess_1_1TimeSeries_1_1Value.html">Value</a></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  {</div><div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6"> 62</a></span>  <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">Value</a>(<span class="keyword">const</span> <a class="code" href="classprocess_1_1Time.html">Time</a>& _time, <span class="keyword">const</span> T& _data) : <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a>(_time), <a class="code" href=
"structprocess_1_1TimeSeries_1_1Value.html#a3a4ce139e59cd0cae4324bc9a07e28a7">data</a>(_data) {}</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Non-const for assignability.</span></div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e"> 65</a></span>  <a class="code" href="classprocess_1_1Time.html">Time</a> <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a>;</div><div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries_1_1Value.html#a3a4ce139e59cd0cae4324bc9a07e28a7"> 66</a></span>  T <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#a3a4ce139e59cd0cae4324bc9a07e28a7">data</a>;</div><div
class="line"><a name="l00067"></a><span class="lineno"> 67</span>  };</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a32ad80193e5138cd76086f01ecbaf1ed"> 69</a></span>  <span class="keywordtype">void</span> <span class="keyword">set</span>(<span class="keyword">const</span> T& value, <span class="keyword">const</span> <a class="code" href="classprocess_1_1Time.html">Time</a>& <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a> = <a class="code" href="classprocess_1_1Clock.html#a24ed3f746bb6b3ddb1c52dce5e0ecd38">Clock::now</a>())</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// If we're not inserting
at the end of the time series, then</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// we have to reset the sparsification index. Given that</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// out-of-order insertion is a rare use-case. This is a simple way</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// to keep insertions O(log(n)). No need to figure out how to</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// adjust the truncation index.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">if</span> (!values.empty() && time < values.rbegin()->first) {</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> 
; index = <a class="code" href="structNone.html">None</a>();</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  values[<a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aff33299570156c9c804f0d5a5fa3ff7e">time</a>] = value;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e">truncate</a>();</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  sparsify();</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> 
<span class="comment">// Returns the time series within the (optional) time range.</span></div><div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a17657ae4751e17ad24c890c8e4dfd2f9"> 86</a></span>  std::vector<Value> <span class="keyword">get</span>(</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">const</span> <a class="code" href="classOption.html">Option<Time></a>& <a class="code" href="namespacesystemd_1_1slices.html#a95aa197d8eed9f20dacb44f433b15f01">start</a> = <a class="code" href="structNone.html">None</a>(),</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">const</span> <a class="code" href="classOption.html">Option<Time></a>& stop = <a class="code" href="structNone.html">None</a>()) <span class="keyword">const</span></div><div class="line"><a name="l00089
"></a><span class="lineno"> 89</span>  {</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Ignore invalid ranges.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (start.isSome() && stop.<a class="code" href="classOption.html#a4e3bf8416d95246f43c91f1b5c309323">isSome</a>() && start.get() > stop.<a class="code" href="classOption.html#a21358442c0fac1cc978a67a9a9089a79">get</a>()) {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> std::vector<Value>();</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typen
ame</span> std::map<Time, T>::const_iterator <a class="code" href="namespacestrings.html#a66b9edbbfb1f158b6c420367a1457a0b">lower</a> = values.lower_bound(</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  start.isSome() ? start.get() : <a class="code" href="classprocess_1_1Time.html#adaf82d5f3d8c886ce04dd87fdd639959">Time::epoch</a>());</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typename</span> std::map<Time, T>::const_iterator <a class="code" href="namespacestrings.html#a69f3467801285caf9a9e04929ff33cee">upper</a> = values.upper_bound(</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  stop.<a class="code" href="classOption.html#a4e3bf8416d95246f43c91f1b5c309323">isSome</a>() ? stop.<a class="code" href="classOption.html#a21358442c0fac1cc978a
67a9a9089a79">get</a>() : <a class="code" href="classprocess_1_1Time.html#a45c081fba8c8a6c2e0d6c30580d95645">Time::max</a>());</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  std::vector<Value> values;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">while</span> (lower != upper) {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  values.push_back(<a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">Value</a>(lower->first, lower->second));</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  ++<a class="code" href="namespacestrings.html#a66b9edbbfb1f158b6c420367a1457a0b">lower</a>;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }
</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">return</span> values;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#ab9d8e976e89fb5a5539e1fe83f17f3dd"> 109</a></span>  <a class="code" href="classOption.html">Option<Value></a> <a class="code" href="structprocess_1_1TimeSeries.html#ab9d8e976e89fb5a5539e1fe83f17f3dd">latest</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (<a class="code" href="structprocess_1_1TimeSeries.html#a71832c3c13f99
3378d355d3f9330cc14">empty</a>()) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> <a class="code" href="structNone.html">None</a>();</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">return</span> <a class="code" href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">Value</a>(values.rbegin()->first, values.rbegin()->second);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#a71832c3c13f993378d355d3f
9330cc14"> 118</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structprocess_1_1TimeSeries.html#a71832c3c13f993378d355d3f9330cc14">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> values.empty(); }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// Removes values outside the time window. This will ensure at</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// least one value remains. Note that this is called automatically</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// when writing to the time series, so this is only needed when</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">/
/ one wants to explicitly trigger a truncation.</span></div><div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e"> 124</a></span>  <span class="keywordtype">void</span> <a class="code" href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e">truncate</a>()</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  {</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="classprocess_1_1Time.html">Time</a> <a class="code" href="namespaceprocess_1_1internal.html#a64e590c9a40c4ead4b969d6a64cd8181">expired</a> = <a class="code" href="classprocess_1_1Clock.html#a24ed3f746bb6b3ddb1c52dce5e0ecd38">Clock::now</a>() - window;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">typename</span> std::map<Time, T>::iterator upper_bound =
</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  values.upper_bound(expired);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// Ensure at least 1 value remains.</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">if</span> (values.size() <= 1 || upper_bound == values.end()) {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// When truncating and there exists a next value c
onsidered</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// for sparsification, there are two cases to consider for</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// updating the index:</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">//</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// Case 1: upper_bound < next</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// upper_bound index, next</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 14
2</span>  <span class="comment">// v v</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Before: 0 1 2 3 4 5 6 7 ...</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// next index After truncating, index is</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// v v must be adjusted:</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Truncate: 3 4 5 6 7 ... index -= # elements removed</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</spa
n>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// index, next</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// v</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// After: 3 4 5 6 7 ...</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">//</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// Case 2: upper_bound >= next</span></div><div c
lass="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// upper_bound, index, next</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// v</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// Before: 0 1 2 3 4 5 6 7 ...</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// After truncating, we must</span></div><div class="line">
<a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// After: 4 5 6 7 ... reset index to None().</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// ----------------------------------------------------------</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">if</span> (index.isSome() && upper_bound->first < next->first) {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">size_t</span> <a class="code" href="namespaceos_1_1stat.html#a7a116891923bc8b5d8c50f78da8657be">size</a> = values.size();</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  values.erase(values.begin(), upper_bound);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  index = index.g
et() - (size - values.size());</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  index = <a class="code" href="structNone.html">None</a>();</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  values.erase(values.begin(), upper_bound);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// Performs "sparsification" to limit the size of the time
series</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// to be within the capacity.</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">//</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// The sparsifying technique is to iteratively halve the granularity</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// of the older half of the time series. Once sparsification reaches</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// the midpoint of the time series, it begins again from the</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// beginning.</span></div><div class="line"><a name="l00181"></a><span cla
ss="lineno"> 181</span>  <span class="comment">//</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Sparsification results in the following granularity over time:</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// Initial: | ------------------------ A -------------------- |</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// Stage 1: | ------- 1/2 A ---------- | -------- B --------- |</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// Stage 2: | -- 1/4A --- | -- 1/2B -- | -------- C --------- |</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Stage 3: | 1/8A | 1/4B | -- 1/2C -- | -------- D --------- |</span></div><div class="line"><a name="l00187"><
/a><span class="lineno"> 187</span>  <span class="comment">// ...</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">//</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// Each stage halves the size and granularity of time series prior</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// to sparsifying.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">void</span> sparsify()</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  {</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// We remove every other element up to the halfway point of the</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>
0; <span class="comment">// time series, until we're within the capacity. If we reach the</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// half-way point of the time series, we'll start another</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// sparsification cycle from the beginning, for example:</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">//</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// next Time series with a capacity of 7.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// v Initial state with 7 entries</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <
span class="comment">// 0 1 2 3 4 5 6</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">//</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// next Insert '7'.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// v Capacity is exceeded, we remove '1' and</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// 0 2 3 4 5 6 7 advance to remove '3' next.</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">//</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// next Insert '8'.</span></div><div class="line"><a name="l00207"></a><s
pan class="lineno"> 207</span>  <span class="comment">// v Capacity is exceeded, we remove '3' and</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// 0 2 4 5 6 7 8 advance to remove '5' next.</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">//</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// next Insert '9'.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// v Capacity is exceeded, we remove '5' and now</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// 0 2 4 6 7 8 9 '7' is past the halfway mark, so we will reset</span></div><div class="line"><a name="l
00213"></a><span class="lineno"> 213</span>  <span class="comment">// reset to the beginning and consider '2'.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">while</span> (values.size() > capacity) {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// If the index is uninitialized, or past the half-way point,</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// we set it back to the beginning.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">if</span> (index.isNone() || index.get() > values.size() / 2) {</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> 
<span class="comment">// The second element is the initial deletion candidate.</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  next = values.begin();</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  ++next;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  index = 1;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  next = values.erase(next);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  next++; <span class="comment">// Skip one element.</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  index = index.get() + 1;</div><div class="line"><a name="l00228">
</a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// Non-const for assignability.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="classDuration.html">Duration</a> window;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordtype">size_t</span> capacity;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// We use a map instead of a hashmap to store the values because</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> 
<span class="comment">// that way we can retrieve a series in sorted order efficiently.</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  std::map<Time, T> values;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// Next deletion candidate. We store both the iterator and index.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// The index is None initially, and whenever a value is appended</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// out-of-order. This means 'next' is only valid when 'index' is</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// Some.</span></div><div class="line"><
a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">typename</span> std::map<Time, T>::iterator next;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="code" href="classOption.html">Option<size_t></a> index;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> };</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> } <span class="comment">// namespace process {</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="preprocessor">#endif // __PROCESS_TIMESERIES_HPP__</span></div><div class="ttc" id="classOption_html"><div class="ttname"><a href="classOption.html">Option</a></div><div class="ttdef"><b>Definition:</b> option.hpp:
28</div></div>
+<div class="ttc" id="namespaceos_1_1stat_html_a7a116891923bc8b5d8c50f78da8657be"><div class="ttname"><a href="namespaceos_1_1stat.html#a7a116891923bc8b5d8c50f78da8657be">os::stat::size</a></div><div class="ttdeci">Try< Bytes > size(const std::string &path, const FollowSymlink follow=FollowSymlink::FOLLOW_SYMLINK)</div><div class="ttdef"><b>Definition:</b> stat.hpp:121</div></div>
+<div class="ttc" id="structprocess_1_1TimeSeries_html_a8fd91415653d305e8793416f8c4ff797"><div class="ttname"><a href="structprocess_1_1TimeSeries.html#a8fd91415653d305e8793416f8c4ff797">process::TimeSeries::TimeSeries</a></div><div class="ttdeci">TimeSeries(const Duration &_window=TIME_SERIES_WINDOW, size_t _capacity=TIME_SERIES_CAPACITY)</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:54</div></div>
<div class="ttc" id="none_8hpp_html"><div class="ttname"><a href="none_8hpp.html">none.hpp</a></div></div>
<div class="ttc" id="namespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdef"><b>Definition:</b> type_utils.hpp:510</div></div>
<div class="ttc" id="namespaceprocess_1_1internal_html_a64e590c9a40c4ead4b969d6a64cd8181"><div class="ttname"><a href="namespaceprocess_1_1internal.html#a64e590c9a40c4ead4b969d6a64cd8181">process::internal::expired</a></div><div class="ttdeci">void expired(const std::shared_ptr< lambda::CallableOnce< Future< T >(const Future< T > &)>> &f, const std::shared_ptr< Latch > &latch, const std::shared_ptr< Promise< T >> &promise, const std::shared_ptr< Option< Timer >> &timer, const Future< T > &future)</div><div class="ttdef"><b>Definition:</b> future.hpp:1524</div></div>
-<div class="ttc" id="structprocess_1_1TimeSeries_1_1Value_html_aa79af31717d87775443d28f7534159e6"><div class="ttname"><a href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">process::TimeSeries::Value::Value</a></div><div class="ttdeci">Value(const Time &_time, const T &_data)</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:67</div></div>
+<div class="ttc" id="structprocess_1_1TimeSeries_1_1Value_html_aa79af31717d87775443d28f7534159e6"><div class="ttname"><a href="structprocess_1_1TimeSeries_1_1Value.html#aa79af31717d87775443d28f7534159e6">process::TimeSeries::Value::Value</a></div><div class="ttdeci">Value(const Time &_time, const T &_data)</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:62</div></div>
<div class="ttc" id="classDuration_html"><div class="ttname"><a href="classDuration.html">Duration</a></div><div class="ttdef"><b>Definition:</b> duration.hpp:32</div></div>
-<div class="ttc" id="namespaceprocess_html_a1865c52e226d6f280d63dd80884dd959"><div class="ttname"><a href="namespaceprocess.html#a1865c52e226d6f280d63dd80884dd959">process::TIME_SERIES_WINDOW</a></div><div class="ttdeci">const Duration TIME_SERIES_WINDOW</div></div>
<div class="ttc" id="namespacesystemd_1_1slices_html_a95aa197d8eed9f20dacb44f433b15f01"><div class="ttname"><a href="namespacesystemd_1_1slices.html#a95aa197d8eed9f20dacb44f433b15f01">systemd::slices::start</a></div><div class="ttdeci">Try< Nothing > start(const std::string &name)</div><div class="ttdoc">Starts the slice with the given name (via &#39;systemctl start <name>&#39;). </div></div>
<div class="ttc" id="classOption_html_a4e3bf8416d95246f43c91f1b5c309323"><div class="ttname"><a href="classOption.html#a4e3bf8416d95246f43c91f1b5c309323">Option::isSome</a></div><div class="ttdeci">bool isSome() const </div><div class="ttdef"><b>Definition:</b> option.hpp:115</div></div>
<div class="ttc" id="duration_8hpp_html"><div class="ttname"><a href="duration_8hpp.html">duration.hpp</a></div></div>
-<div class="ttc" id="structprocess_1_1TimeSeries_html_af0f0682a40225778f4c4c931a1380f0e"><div class="ttname"><a href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e">process::TimeSeries::truncate</a></div><div class="ttdeci">void truncate()</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:129</div></div>
+<div class="ttc" id="namespaceprocess_html_a79124011954c164c6178289973461ab5"><div class="ttname"><a href="namespaceprocess.html#a79124011954c164c6178289973461ab5">process::TIME_SERIES_WINDOW</a></div><div class="ttdeci">constexpr Duration TIME_SERIES_WINDOW</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:30</div></div>
+<div class="ttc" id="structprocess_1_1TimeSeries_html_af0f0682a40225778f4c4c931a1380f0e"><div class="ttname"><a href="structprocess_1_1TimeSeries.html#af0f0682a40225778f4c4c931a1380f0e">process::TimeSeries::truncate</a></div><div class="ttdeci">void truncate()</div><div class="ttdef"><b>Definition:</b> timeseries.hpp:124</div></div>
<div class="ttc" id="time_8hpp_html"><div class="ttname"><a href="time_8hpp.html">time.hpp</a></div></div>
<div class="ttc" id="option_8hpp_html_ac4b53d77033a5d2405ef12ceb3dc6498"><div class="ttname"><a href="option_8hpp.html#ac4b53d77033a5d2405ef12ceb3dc6498">max</a></div><div class="ttdeci">Option< T > max(const Option< T > &left, const Option< T > &right)</div><div class="ttdef"><b>Definition:</b> option.hpp:208</div></div>
-<div class="ttc" id="structprocess_1_1TimeSeries_html_a71832c3c13f993378d355d3f9330cc14"><div class="ttname"><a href="structprocess_1_1TimeSeries.html#a71832c3c13f993378d355d3f9330cc14">process::TimeSeries::empty</a></div><div class="ttdeci">bool empty() const </div><
<TRUNCATED>