pub fn chain_link<'a, N: AsRef<[&'a str]>>(&mut self, filters: N) -> Result<(), Error> {
        for (from, to) in filters.as_ref().iter().zip(filters.as_ref().iter().skip(1)) {
            self.link(from, to)?;
        }
        Ok(())
    }
/// Links multiple filters in the graph together. The first filter will be link to the second
/// one and then the second one to the third one, and so on.
///
/// All filters must already exist within the graph and sshould be specified by name.
Links multiple filters in the graph together. The first filter will be link to the second
one and then the second one to the third one, and so on.

All filters must already exist within the graph and sshould be specified by name.
Links multiple filters in the graph together . The first filter will be link to the second one and then the second one to the third one and so on . All filters must already exist within the graph and sshould be specified by name .
pub fn chain_link<'a, N: AsRef<[&'a str]>>(&mut self, filters: N) -> Result<(), Error> {
        for (from, to) in filters.as_ref().iter().zip(filters.as_ref().iter().skip(1)) {
            self.link(from, to)?;
        }
        Ok(())
    }
pub fn chain_link < ' a , N : AsRef < [ & ' a str ] > > ( & mut self , filters : N ) -> Result < ( ) , Error > { for ( from , to ) in filters . as_ref ( ) . iter ( ) . zip ( filters . as_ref ( ) . iter ( ) . skip ( 1 ) ) { self . link ( from , to ) ? ; } Ok ( ( ) ) }
Links multiple filters in the graph together.
Links multiple filters in the graph together .
&mut self
filters
N
&mut self
filters
N