Skip to main content

split

competitive::data_structure::splay_operations

Function split 

Source 
pub fn split<Spec, Data, Seeker>(
    root: Option<BstRoot<Spec>>,
    seeker: Seeker,
    equal_side: EqualSide,
) -> (Option<BstRoot<Spec>>, Option<BstRoot<Spec>>)
where
    Spec: BstSpec<Data = Data, Parent = WithNoParent<Data>>,
    Seeker: BstSeeker<Spec = Spec>,
Examples found in repository?
crates/competitive/src/data_structure/splay_tree.rs (line 111)
103    fn split<Seeker>(
104        node: Option<SplayTreeRoot<K, V>>,
105        seeker: Seeker,
106        equal_side: EqualSide,
107    ) -> (Option<SplayTreeRoot<K, V>>, Option<SplayTreeRoot<K, V>>)
108    where
109        Seeker: BstSeeker<Spec = Self>,
110    {
111        splay_operations::split(node, seeker, equal_side)
112    }
More examples
Hide additional examples
crates/competitive/src/data_structure/implicit_splay_tree.rs (line 169)
158    fn split<Seeker>(
159        node: Option<ImplicitSplayTreeRoot<T>>,
160        seeker: Seeker,
161        equal_side: EqualSide,
162    ) -> (
163        Option<ImplicitSplayTreeRoot<T>>,
164        Option<ImplicitSplayTreeRoot<T>>,
165    )
166    where
167        Seeker: BstSeeker<Spec = Self>,
168    {
169        splay_operations::split(node, seeker, equal_side)
170    }