/// Check if given text is a word over the alphabet.
///
/// Complexity: O(n), where n is the length of the text.
///
/// # Example
///
/// ```
/// use bio::alphabets;
///
/// let dna_alphabet = alphabets::Alphabet::new(b"ACGTacgt");
/// assert!(dna_alphabet.is_word(b"GAttACA"));
/// assert!(!dna_alphabet.is_word(b"42"));
/// ```
Check if given text is a word over the alphabet.
Complexity: O(n), where n is the length of the text.
Check if given text is a word over the alphabet . Complexity : O ( n ) where n is the length of the text .
pub fn is_word<C, T>(&self, text: T) -> bool
    where
        C: Borrow<u8>,
        T: IntoIterator<Item = C>,
    {
        text.into_iter()
            .all(|c| self.symbols.contains(*c.borrow() as usize))
    }
pub fn is_word < C , T > ( & self , text : T ) -> bool where C : Borrow < u8 > , T : IntoIterator < Item = C > , { text . into_iter ( ) . all ( | c | self . symbols . contains ( * c . borrow ( ) as usize ) ) }
Check if given text is a word over the alphabet.
Check if given text is a word over the alphabet .
&self
text
T
example
```
use bio::alphabets.

let dna_alphabet = alphabets::Alphabet::new(b"ACGTacgt");
assert!(dna_alphabet.is_word(b"GAttACA"));
assert!(!dna_alphabet.is_word(b"42"));
```
` ` ` use bio :: alphabets . let dna_alphabet = alphabets :: Alphabet :: new ( b " ACGTacgt " ) ; assert! ( dna_alphabet . is_word ( b " GAttACA " )) ; assert! ( !dna_alphabet . is_word ( b " 42 " )) ; ` ` `