Struct fp_wavelet_trees::wavelet_tree_compact::WaveletTreeCompact

pub struct WaveletTreeCompact<T: PartialEq + Copy> { /* fields omitted */ }

Methods

impl<T: PartialEq + Copy> WaveletTreeCompact<T>

pub fn new(input: Vec<T>) -> WaveletTreeCompact<T>

Creates a new pointer-less WaveletTree on the sequence input

Arguments

• input Sequence to build a WaveletTree for

Example

let input = vec![1, 2, 3, 4, 3, 1, 2, 4];
let w_tree = fp_wavelet_trees::wavelet_tree_compact::WaveletTreeCompact::new(input);

Trait Implementations

impl<T: PartialEq + Copy> WaveletTree<T> for WaveletTreeCompact<T>

fn access(&self, position: u64) -> Option<T>

Returns the element at the index i Returns None if i is out of bounds

Arguments

• i Index of the element, starting at 0

Example

use crate::fp_wavelet_trees::WaveletTree;
let w_tree = fp_wavelet_trees::wavelet_tree_compact::WaveletTreeCompact::from("test");
assert_eq!(Some('t'), w_tree.access(0));
assert_eq!(Some('e'), w_tree.access(1));
assert_eq!(Some('s'), w_tree.access(2));
assert_eq!(Some('t'), w_tree.access(3));
assert_eq!(None, w_tree.access(4));

fn rank(&self, object: T, n: u64) -> Option<u64>

Returns the number of occurrences of object up to index n Returns None if the object doesn't occur at all or n is larger than the length of the content

Arguments

• object The object to find the occurrences of
• n The index up to which to find occurrences, starting at 0

Example

use crate::fp_wavelet_trees::WaveletTree;
let w_tree = fp_wavelet_trees::wavelet_tree_compact::WaveletTreeCompact::from("abababababab");
assert_eq!(w_tree.rank('a', 11), Some(6));
assert_eq!(w_tree.rank('b', 11), Some(6));
assert_eq!(w_tree.rank('b', 0), Some(0));
assert_eq!(w_tree.rank('c', 11), None);

fn select(&self, object: T, n: u64) -> Option<u64>

Returns the position of the n-th occurrence of object Returns None if there isn't a n-th occurrence

Arguments

• object The object to find the position of
• n The n-th occurrence to find, starting at 1

Example

use crate::fp_wavelet_trees::WaveletTree;
let w_tree = fp_wavelet_trees::wavelet_tree_compact::WaveletTreeCompact::from("abcab");
assert_eq!(w_tree.select('a', 0), None);
assert_eq!(w_tree.select('a', 1), Some(0));
assert_eq!(w_tree.select('a', 2), Some(3));
assert_eq!(w_tree.select('c', 1), Some(2));
assert_eq!(w_tree.select('c', 2), None);

impl<T: PartialEq + Copy> IntoIterator for WaveletTreeCompact<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = TreeIteratorCompact<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq + Copy> PartialEq<WaveletTreeCompact<T>> for WaveletTreeCompact<T>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use] fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<'_> PartialEq<&'_ str> for WaveletTreeCompact<char>

fn eq(&self, other: &&str) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use] fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T: PartialEq + Copy> PartialEq<Vec<T>> for WaveletTreeCompact<T>

fn eq(&self, other: &Vec<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use] fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl From<String> for WaveletTreeCompact<char>

fn from(input: String) -> Self

Performs the conversion.

impl<'_> From<&'_ str> for WaveletTreeCompact<char>

fn from(input: &str) -> Self

Performs the conversion.

impl<T: PartialEq + Copy> From<Vec<T>> for WaveletTreeCompact<T>

fn from(input: Vec<T>) -> Self

Performs the conversion.

impl<T: PartialEq + Copy + Debug> Debug for WaveletTreeCompact<T>

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

Formats the value using the given formatter.

impl<T: PartialEq + Copy> FromIterator<T> for WaveletTreeCompact<T>

fn from_iter<I: IntoIterator<Item = T>>(input: I) -> Self

Creates a value from an iterator.

impl<'de, T: PartialEq + Copy> Deserialize<'de> for WaveletTreeCompact<T> where
    T: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<T: PartialEq + Copy> Serialize for WaveletTreeCompact<T> where
    T: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.