Struct LineSet

Source

pub struct LineSet<T> {
    map: BTreeSet<Line<T>>,
}

Fields§

§map: BTreeSet<Line<T>>

Implementations§

Source §

impl<T> LineSet<T>
where T: Copy + Bounded + Ord + Add<Output = T> + Sub<Output = T> + Mul<Output = T> + Div<Output = T>,

Source

pub fn new() -> Self

Examples found in repository ?

crates/library_checker/src/data_structure/line_add_get_min.rs (line 17)

13pub fn line_add_get_min(reader: impl Read, mut writer: impl Write) {
14    let s = read_all_unchecked(reader);
15    let mut scanner = Scanner::new(&s);
16    scan!(scanner, n, q);
17    let mut cht = LineSet::new();
18    for (a, b) in scanner.iter::<(i64, i64)>().take(n) {
19        cht.insert(a, b);
20    }
21    for _ in 0..q {
22        scan!(scanner, query: Query);
23        match query {
24            Query::Add { a, b } => {
25                cht.insert(a, b);
26            }
27            Query::Get { q } => {
28                writeln!(writer, "{}", cht.query_min(q).unwrap()).ok();
29            }
30        }
31    }
32}

Source

pub fn insert(&mut self, a: T, b: T)

Examples found in repository ?

crates/library_checker/src/data_structure/line_add_get_min.rs (line 19)

13pub fn line_add_get_min(reader: impl Read, mut writer: impl Write) {
14    let s = read_all_unchecked(reader);
15    let mut scanner = Scanner::new(&s);
16    scan!(scanner, n, q);
17    let mut cht = LineSet::new();
18    for (a, b) in scanner.iter::<(i64, i64)>().take(n) {
19        cht.insert(a, b);
20    }
21    for _ in 0..q {
22        scan!(scanner, query: Query);
23        match query {
24            Query::Add { a, b } => {
25                cht.insert(a, b);
26            }
27            Query::Get { q } => {
28                writeln!(writer, "{}", cht.query_min(q).unwrap()).ok();
29            }
30        }
31    }
32}

Source

pub fn query_min(&self, x: T) -> Option<T>

Examples found in repository ?

crates/library_checker/src/data_structure/line_add_get_min.rs (line 28)

13pub fn line_add_get_min(reader: impl Read, mut writer: impl Write) {
14    let s = read_all_unchecked(reader);
15    let mut scanner = Scanner::new(&s);
16    scan!(scanner, n, q);
17    let mut cht = LineSet::new();
18    for (a, b) in scanner.iter::<(i64, i64)>().take(n) {
19        cht.insert(a, b);
20    }
21    for _ in 0..q {
22        scan!(scanner, query: Query);
23        match query {
24            Query::Add { a, b } => {
25                cht.insert(a, b);
26            }
27            Query::Get { q } => {
28                writeln!(writer, "{}", cht.query_min(q).unwrap()).ok();
29            }
30        }
31    }
32}