pub(crate) fn predecessors_mut<'a>(&'a mut self) -> impl Iterator<Item = &'a mut Slot<Id>> {
        self.0
            .iter_mut()
            .rev()
            .skip(RINGS_NEIGHBOR_SUCCESSOR_SIZE)
            .take(RINGS_NEIGHBOR_PREDECESSOR_SIZE)
    }
/// return a mutable iterator over the predecessors in this [`TopicView`].
///
/// In the case [`RINGS_NEIGHBOR_PREDECESSOR_SIZE`] allows more than
/// one predecessor, the predecessors in this iterator are sorted from
/// the closest to the node to the farthest (i.e. they are in the
/// order of interest already.)
return a mutable iterator over the predecessors in this [`TopicView`].
In the case [`RINGS_NEIGHBOR_PREDECESSOR_SIZE`] allows more than
one predecessor, the predecessors in this iterator are sorted from
the closest to the node to the farthest
return a mutable iterator over the predecessors in this [ ` TopicView ` ] . In the case [ ` RINGS_NEIGHBOR_PREDECESSOR_SIZE ` ] allows more than one predecessor the predecessors in this iterator are sorted from the closest to the node to the farthest
pub(crate) fn predecessors_mut<'a>(&'a mut self) -> impl Iterator<Item = &'a mut Slot<Id>> {
        self.0
            .iter_mut()
            .rev()
            .skip(RINGS_NEIGHBOR_SUCCESSOR_SIZE)
            .take(RINGS_NEIGHBOR_PREDECESSOR_SIZE)
    }
pub ( crate ) fn predecessors_mut < ' a > ( & ' a mut self ) -> impl Iterator < Item = & ' a mut Slot < Id > > { self . 0 . iter_mut ( ) . rev ( ) . skip ( RINGS_NEIGHBOR_SUCCESSOR_SIZE ) . take ( RINGS_NEIGHBOR_PREDECESSOR_SIZE ) }
return a mutable iterator over the predecessors in this [`TopicView`].
return a mutable iterator over the predecessors in this [ ` TopicView ` ] .
&'a mut self