Struct CartesianTree 

pub struct CartesianTree {
    pub root: usize,
    pub parents: Vec<usize>,
    pub children: Vec<[usize; 2]>,
}

Fields

root: usize

parents: Vec<usize>

children: Vec<[usize; 2]>

Implementations

impl CartesianTree

pub fn new<T>(a: &[T]) -> Self

where T: PartialOrd,

Examples found in repository

crates/library_checker/src/tree/cartesian_tree.rs (line 10)

pub fn cartesian_tree(reader: impl Read, mut writer: impl Write) {
    let s = read_all_unchecked(reader);
    let mut scanner = Scanner::new(&s);
    scan!(scanner, n, a: [i32; n]);
    let ct = CartesianTree::new(&a);
    iter_print!(writer, @it ct.parents.iter().map(|&p| if p == !0 { ct.root } else { p }) );
}

pub fn with_ranges(&self, f: impl FnMut(usize, Range<usize>))

Trait Implementations

impl Clone for CartesianTree

fn clone(&self) -> CartesianTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CartesianTree

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

Formats the value using the given formatter.