pub fn alphabet(&self) -> Alphabet {
        let mut symbols = BitSet::with_capacity(self.ranks.len());
        symbols.extend(self.ranks.keys());
        Alphabet { symbols }
    }
/// Restore alphabet from transform.
///
/// Complexity: O(n), where n is the number of symbols in the alphabet.
///
/// # Example
///
/// ```
/// use bio::alphabets;
///
/// let dna_alphabet = alphabets::Alphabet::new(b"acgtACGT");
/// let dna_ranks = alphabets::RankTransform::new(&dna_alphabet);
/// assert_eq!(dna_ranks.alphabet().symbols, dna_alphabet.symbols);
/// ```
Restore alphabet from transform.
Complexity: O(n), where n is the number of symbols in the alphabet.
Restore alphabet from transform . Complexity : O ( n ) where n is the number of symbols in the alphabet .
pub fn alphabet(&self) -> Alphabet {
        let mut symbols = BitSet::with_capacity(self.ranks.len());
        symbols.extend(self.ranks.keys());
        Alphabet { symbols }
    }
pub fn alphabet ( & self ) -> Alphabet { let mut symbols = BitSet :: with_capacity ( self . ranks . len ( ) ) ; symbols . extend ( self . ranks . keys ( ) ) ; Alphabet { symbols } }
Restore alphabet from transform.
Restore alphabet from transform .
&self
&self
example
```
use bio::alphabets.

let dna_alphabet = alphabets::Alphabet::new(b"acgtACGT");
let dna_ranks = alphabets::RankTransform::new(&dna_alphabet);
assert_eq!(dna_ranks.alphabet().symbols, dna_alphabet.symbols);
```
` ` ` use bio :: alphabets . let dna_alphabet = alphabets :: Alphabet :: new ( b " acgtACGT " ) ; let dna_ranks = alphabets :: RankTransform :: new ( &dna_alphabet ) ; assert_eq! ( dna_ranks . alphabet () . symbols dna_alphabet . symbols ) ; ` ` `