// Orders by the start of the range rather than the end, and doesn't include the end in the
// comparison. This is used when merging, where we want to merge keys in lower-bound order.
Orders by the start of the range rather than the end, and doesn't include the end in the
comparison. This is used when merging, where we want to merge keys in lower-bound order.
Orders by the start of the range rather than the end and doesn ' t include the end in the comparison . This is used when merging where we want to merge keys in lower - bound order .
fn cmp_lower_bound(&self, other: &ExtentKey) -> std::cmp::Ordering {
        return self
            .attribute_id
            .cmp(&other.attribute_id)
            .then(self.range.start.cmp(&other.range.start));
    }
fn cmp_lower_bound ( & self , other : & ExtentKey ) -> std :: cmp :: Ordering { return self . attribute_id . cmp ( & other . attribute_id ) . then ( self . range . start . cmp ( & other . range . start ) ) ; }
Orders by the start of the range rather than the end, and doesn't include the end in the
comparison.
Orders by the start of the range rather than the end and doesn ' t include the end in the comparison .
&self
other
&ExtentKey