/* * Copyright (c) 2021 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. */ #ifndef MODULES_REMOTE_BITRATE_ESTIMATOR_PACKET_ARRIVAL_MAP_H_ #define MODULES_REMOTE_BITRATE_ESTIMATOR_PACKET_ARRIVAL_MAP_H_ #include <algorithm> #include <cstddef> #include <cstdint> #include <memory> #include "api/units/timestamp.h" #include "rtc_base/checks.h" namespace webrtc { // PacketArrivalTimeMap is an optimized map of packet sequence number to arrival // time, limited in size to never exceed `kMaxNumberOfPackets`. It will grow as // needed, and remove old packets, and will expand to allow earlier packets to // be added (out-of-order). // // Not yet received packets have the arrival time zero. The queue will not span // larger than necessary and the last packet should always be received. The // first packet in the queue doesn't have to be received in case of receiving // packets out-of-order. class PacketArrivalTimeMap { … }; } // namespace webrtc #endif // MODULES_REMOTE_BITRATE_ESTIMATOR_PACKET_ARRIVAL_MAP_H_