Struct Ladder 

pub struct Ladder { /* private fields */ }

The output ladder, in canonical order: strictly ascending maximum bitrate, and strictly ascending height with it.

Construction validates the order; Ladder::rungs exposes a read-only slice. The rungs are still filtered against the source at runtime (nothing above it survives), which drops rungs but never reorders them.

Implementations

impl Ladder

pub fn new(rungs: impl IntoIterator<Item = Rung>) -> Result<Self, Error>

Resolve rungs into a ladder, in any order.

Heights round down to even, and the result is sorted by maximum bitrate. An ambiguous ladder is an Error rather than a guess: two rungs at the same maximum have no lower one, and a rung that costs more without being taller means bitrate and picture disagree about which rendition is lower. An empty ladder is fine; it just offers nothing.

pub fn rungs(&self) -> &[Rung]

The rungs, lowest first: ascending maximum bitrate and ascending height.

Trait Implementations

impl Clone for Ladder

fn clone(&self) -> Ladder

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Ladder

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Ladder

fn default() -> Self

The default ladder: 240p to 1080p, filtered against the source at runtime so only strictly-lower renditions are offered.

impl Eq for Ladder

impl PartialEq for Ladder

fn eq(&self, other: &Ladder) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Ladder