Let a minimum time interval pass (one bucket size) after initialization before reporting rates (to …

webrtc/base/ratetracker.cc

 /*
  *  Copyright 2015 The WebRTC Project Authors. All rights reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
@@ skipping 45 matching lines @@
         current_time - bucket_start_time_milliseconds_ +
         static_cast<uint32_t>(bucket_count_) * bucket_milliseconds_ -
         available_interval_milliseconds;
     buckets_to_skip = time_to_skip / bucket_milliseconds_;
     milliseconds_to_skip = time_to_skip % bucket_milliseconds_;
   } else {
     buckets_to_skip = bucket_count_ - current_bucket_;
     milliseconds_to_skip = 0u;
     available_interval_milliseconds =
         TimeDiff(current_time, initialization_time_milliseconds_);
+    // Let one bucket interval pass after initialization before reporting.
+    if (available_interval_milliseconds < bucket_milliseconds_) {
+      return 0.0;
+    }
   }
   // If we're skipping all buckets that means that there have been no samples
   // within the sampling interval so report 0.
   if (buckets_to_skip > bucket_count_ ||
       available_interval_milliseconds == 0u) {
     return 0.0;
   }
   size_t start_bucket = NextBucketIndex(current_bucket_ + buckets_to_skip);
   // Only count a portion of the first bucket according to how much of the
   // first bucket is within the current interval.
@@ skipping 63 matching lines @@
     // current_bucket_ increments.
     sample_buckets_[current_bucket_] = 0u;
   }
 }
 
 size_t RateTracker::NextBucketIndex(size_t bucket_index) const {
   return (bucket_index + 1u) % (bucket_count_ + 1u);
 }
 
 }  // namespace rtc