Struct ProxyRotator 

pub struct ProxyRotator { /* private fields */ }

Thread-safe proxy rotator that cycles through a list of proxies using a configurable strategy.

The rotator holds a Mutex-protected index that advances each time get_proxy() is called. Duplicate proxies are rejected at construction time to prevent wasted cycles. The default strategy is cyclic_rotation, but you can supply any function matching the RotationStrategy signature.

Implementations

impl ProxyRotator

pub fn new(proxies: Vec<Proxy>) -> Result<Self>

Creates a new rotator with the default cyclic_rotation strategy. Returns an error if the proxy list is empty or contains duplicates.

pub fn with_strategy( proxies: Vec<Proxy>, strategy: RotationStrategy, ) -> Result<Self>

Creates a new rotator with a custom rotation strategy. The strategy function receives the full proxy list and the current index, and returns the next index. Returns an error if the proxy list is empty or contains duplicates.

pub fn get_proxy(&self) -> Proxy

Returns the next proxy according to the rotation strategy and advances the internal index. The index is taken modulo the proxy count, so strategies can return any value without worrying about bounds.

pub fn proxies(&self) -> &[Proxy]

Returns a slice of all configured proxies. Useful for logging or diagnostics.

pub fn len(&self) -> usize

Returns the number of proxies in the rotator. Always at least 1 since empty proxy lists are rejected at construction time.

pub fn is_empty(&self) -> bool

Returns true if the rotator contains no proxies. In practice this always returns false since the constructor requires at least one proxy, but this method is provided for API completeness alongside len().

Trait Implementations

impl Debug for ProxyRotator

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.