pub struct LazySegmentTree<M: ExtMonoid> {
pub size: usize,
/* private fields */
}
Expand description
遅延評価セグメント木
Fields§
§size: usize
Implementations§
source§impl<M: ExtMonoid> LazySegmentTree<M>
impl<M: ExtMonoid> LazySegmentTree<M>
Trait Implementations§
source§impl<M> ShowBinaryTree<(usize, usize, usize)> for LazySegmentTree<M>where
M: ExtMonoid,
M::F: Debug,
M::X: Debug,
impl<M> ShowBinaryTree<(usize, usize, usize)> for LazySegmentTree<M>where M: ExtMonoid, M::F: Debug, M::X: Debug,
source§fn get_left(
&mut self,
(l, r, w): &(usize, usize, usize)
) -> Option<(usize, usize, usize)>
fn get_left( &mut self, (l, r, w): &(usize, usize, usize) ) -> Option<(usize, usize, usize)>
<required> 左の子のポインタを取得する
source§fn get_right(
&mut self,
(l, r, w): &(usize, usize, usize)
) -> Option<(usize, usize, usize)>
fn get_right( &mut self, (l, r, w): &(usize, usize, usize) ) -> Option<(usize, usize, usize)>
<required> 右の子のポインタを取得する
source§fn print_inner(
&mut self,
ptr: P,
fill: &mut Vec<&'static str>,
last: &'static str
)
fn print_inner( &mut self, ptr: P, fill: &mut Vec<&'static str>, last: &'static str )
再帰的にprintを行う
source§fn print_as_binary_tree(&mut self)
fn print_as_binary_tree(&mut self)
2分木としてフォーマットする