Struct scylla::transport::locator::ReplicasOrdered

pub struct ReplicasOrdered<'a> { /* private fields */ }

Represents a sequence of replicas for a given token and strategy, ordered according to the ring order (for token-ring tables) or with the order defined by tablet data (for tablet tables).

This container can only be created by calling ReplicaSet::into_replicas_ordered(), and either it can borrow precomputed replica lists living in the locator (in case of SimpleStrategy) or it must compute them on-demand (in case of NetworkTopologyStrategy). The computation is lazy (performed by ReplicasOrderedIterator upon call to next()). For obtaining the primary replica, no allocations are needed. Therefore, the first call to next() is optimised and does not allocate. For the remaining others, unfortunately, allocation is inevitable.

Trait Implementations

impl<'a> IntoIterator for ReplicasOrdered<'a>

type Item = (&'a Arc<Node>, u32)

The type of the elements being iterated over.

type IntoIter = ReplicasOrderedIterator<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.