Struct Placed 

pub struct Placed { /* private fields */ }

Parts that may overlap, resolved into non-overlapping siblings. Every byte goes to the candidate whose fate at that byte (the deepest part of its subtree there, or its body’s gap fate) ranks strongest; on a tie the candidate inserted first keeps it. Each candidate is then cut to the stretches it won.

Implementations

impl Placed

pub fn insert(&mut self, c: Cand)

Add a candidate. Insertion order breaks ties between equal fates.

pub fn into_sorted(self) -> Vec<Cand>

The parts in file order: each candidate cut to the bytes it won (at most MAX_PIECES pieces), plus an Unknown part for each stretch it won past that cap.

Trait Implementations

impl Default for Placed

fn default() -> Placed

Returns the “default value” for a type.