Struct ReorderingBuffer 

pub struct ReorderingBuffer { /* private fields */ }

Reordering buffer for RTP packets.

The reordering buffer internally uses u64 packet indices. These indices are estimated from packet sequence numbers according to the algorithm presented in RFC 3711, section 3.3.1.

This simplifies the original algorithm presented in RFC 3550.

Note: RFC 3711 uses 32-bit ROC. This implementation uses 64-bit indices, so the actual bit width of the ROC is 48 bits here (48-bit ROC + 16-bit sequence number gives 64-bit packet index). The 32-bit ROC value can be extracted from packet indices simply by cutting off the upper 16 bits, e.g. (index >> 16) as u32.

Implementations

impl ReorderingBuffer

pub fn new(depth: usize) -> Self

Create a new reordering buffer with a given depth.

pub fn estimate_index(&self, sequence_nr: u16) -> u64

Estimate packet index from a given sequence number.

pub fn is_duplicate(&self, index: u64) -> bool

Check if a packet with a given index would be a duplicate.

pub fn push( &mut self, packet: IncomingRtpPacket, ) -> Result<u64, ReorderingError>

Push a given packet into the buffer and return index of the inserted packet.

The method returns an error if the packet cannot be inserted into the buffer because it is either a duplicate or the buffer would exceed its capacity.

pub fn next(&mut self) -> Option<OrderedRtpPacket>

Take the next packet from the buffer.

This method will return a packet only if there is a packet in the front slot of the buffer. In other words, a packet will be returned only if it is an in-order packet and returning it would not skip any packets.

pub fn take(&mut self) -> Option<OrderedRtpPacket>

Remove the front slot from the buffer and return the contained packet (if any).

The method will always advance start position of the reordering window by one even if the front slot is empty or if the underlying buffer itself is empty.

pub fn is_empty(&self) -> bool

Check if the buffer is empty.