pub(crate) fn lower_bound(
        &self,
        key: BeachLineNodeKey<I, F>,
    ) -> Result<cpp_map::PIterator<BeachLineNodeKey<I, F>, BeachLineNodeDataType>, BvError> {
        Ok(cpp_map::PIterator::lower_bound(
            Rc::clone(&self.beach_line_),
            key,
        )?)
    }
/// Returns the first beach line element in the container whose key is not considered to go
/// before position (i.e., either it is equivalent or goes after).
/// Returns None if no data is found
Returns the first beach line element in the container whose key is not considered to go
before position .
Returns None if no data is found
Returns the first beach line element in the container whose key is not considered to go before position . Returns None if no data is found
pub(crate) fn lower_bound(
        &self,
        key: BeachLineNodeKey<I, F>,
    ) -> Result<cpp_map::PIterator<BeachLineNodeKey<I, F>, BeachLineNodeDataType>, BvError> {
        Ok(cpp_map::PIterator::lower_bound(
            Rc::clone(&self.beach_line_),
            key,
        )?)
    }
pub ( crate ) fn lower_bound ( & self , key : BeachLineNodeKey < I , F > , ) -> Result < cpp_map :: PIterator < BeachLineNodeKey < I , F > , BeachLineNodeDataType > , BvError > { Ok ( cpp_map :: PIterator :: lower_bound ( Rc :: clone ( & self . beach_line_ ) , key , ) ? ) }
Returns the first beach line element in the container whose key is not considered to go
before position (i.e., either it is equivalent or goes after).
Returns the first beach line element in the container whose key is not considered to go before position ( i . e . either it is equivalent or goes after ) .
&self
key
BeachLineNodeKey<I, F>