pub fn block_of(&self, address: MAddress) -> Option<T::ActionRef> {
        self.blocks
            .range((Included(&MAddress::new(0, 0)), Included(&address)))
            .last()
            .map(|(_, &b)| b)
    }
// Determine which block address should belong to.
// This basically translates to finding the greatest address that is less that
// `address` in self.blocks. This is fairly simple as self.blocks is sorted.
Determine which block address should belong to.
This basically translates to finding the greatest address that is less that
`address` in self.blocks. This is fairly simple as self.blocks is sorted.
Determine which block address should belong to . This basically translates to finding the greatest address that is less that ` address ` in self . blocks . This is fairly simple as self . blocks is sorted .
pub fn block_of(&self, address: MAddress) -> Option<T::ActionRef> {
        self.blocks
            .range((Included(&MAddress::new(0, 0)), Included(&address)))
            .last()
            .map(|(_, &b)| b)
    }
pub fn block_of ( & self , address : MAddress ) -> Option < T :: ActionRef > { self . blocks . range ( ( Included ( & MAddress :: new ( 0 , 0 ) ) , Included ( & address ) ) ) . last ( ) . map ( | ( _ , & b ) | b ) }
Determine which block address should belong to.
Determine which block address should belong to .
&self
address
MAddress
&self
address
MAddress