// codesnip-guard: RhoPath
#[cfg_attr(any(),rustfmt::skip)]pub use self::rho_path::RhoPath;#[cfg_attr(any(),rustfmt::skip)]mod rho_path{use std::{collections::HashMap,hash::Hash};#[doc=" $P_0 =$ `init`, $P_{i+1} = next(P_i)$"]#[doc=""]#[doc=" if |T| is finite then P = f, g, g, ..."]#[derive(Debug)]pub struct RhoPath<T>{pub f:Vec<T>,pub g:Vec<T>}impl<T>RhoPath<T>{#[doc=" build rho path"]pub fn build<F>(init:T,next:F)->Self where T:Clone+Eq+Hash,F:Fn(&T)->T{let mut path=vec![init.clone()];let mut visited=HashMap::new();visited.insert(init,0);let loop_start=loop{let next_val=next(path.last().unwrap());if let Some(&idx)=visited.get(&next_val){break idx;}let cnt=path.len();path.push(next_val.clone());visited.insert(next_val,cnt);};let looped=path.split_off(loop_start);Self{f:path,g:looped}}#[doc=" rho path that index of rho path"]pub fn build_rho<F>(&self,init:usize,next:F)->RhoPath<usize>where F:Fn(&usize)->usize{let(n,m)=(self.f.len(),self.g.len());RhoPath::build(init,|x|{let y=next(x);if y<n{y}else{(y-n)%m+n}})}#[doc=" get i-th value of rho path"]pub fn get(&self,index:usize)->&T{if index<self.f.len(){&self.f[index]}else{&self.g[(index-self.f.len())%self.g.len()]}}}}