<divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2014 Google Inc. All rights reserved.</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">//</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// Use of this source code is governed by a BSD-style</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// license that can be found in the LICENSE file or at</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment">// https://developers.google.com/open-source/licenses/bsd</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> </div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="preprocessor">#include "packager/mpd/base/bandwidth_estimator.h"</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> </div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="preprocessor">#include <cmath></span></div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="preprocessor">#include <cstdlib></span></div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> </div><divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="preprocessor">#include "packager/base/logging.h"</span></div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> </div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="keyword">const</span><spanclass="keywordtype">int</span> BandwidthEstimator::kUseAllBlocks = 0;</div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span> </div><divclass="line"><aname="l00016"></a><spanclass="lineno"><aclass="line"href="../../d2/d6f/classBandwidthEstimator.html#aaae9573785ee9d62e0927f806537ea97"> 16</a></span> <aclass="code"href="../../d2/d6f/classBandwidthEstimator.html#aaae9573785ee9d62e0927f806537ea97">BandwidthEstimator::BandwidthEstimator</a>(<spanclass="keywordtype">int</span> num_blocks)</div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span>  : num_blocks_for_estimation_(num_blocks),</div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span>  harmonic_mean_denominator_(0.0),</div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span>  num_blocks_added_(0) {}</div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> BandwidthEstimator::~BandwidthEstimator() {}</div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> </div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> <spanclass="keywordtype">void</span> BandwidthEstimator::AddBlock(uint64_t size, <spanclass="keywordtype">double</span> duration) {</div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span>  DCHECK_GT(duration, 0.0);</div><divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span>  DCHECK_GT(size, 0u);</div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> </div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> <spanclass="keywordflow">if</span> (num_blocks_for_estimation_ < 0 &&</div><divclass="line"><aname="l00027"></a><spanclass="lineno"> 27</span>  static_cast<int>(history_.size()) >= -1 * num_blocks_for_estimation_) {</div><divclass="line"><aname="l00028"></a><spanclass="lineno"> 28</span> <spanclass="comment">// Short circuiting the case where |num_blocks_for_estimation_| number of</span></div><divclass="line"><aname="l00029"></a><spanclass="lineno