[][src]Struct fp_wavelet_trees::wavelet_tree_pointer_based::WaveletTreePointer

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

A WaveletTree with Pointers is represented here

Methods

impl<T: PartialEq + Copy> WaveletTreePointer<T>[src]

pub fn new(vector: Vec<T>) -> WaveletTreePointer<T>[src]

Returns a WavletTree using pointer

Arguments

  • vector Vec of any objects implementing PartialEq and Copy traits

Example

use fp_wavelet_trees::wavelet_tree_pointer_based::WaveletTreePointer as WTP;
let w_tree:WTP<u32> = WTP::new(vec![1,2,3]);

Trait Implementations

impl<T: PartialEq + Copy> WaveletTree<T> for WaveletTreePointer<T>[src]

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

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_pointer_based::WaveletTreePointer::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 select(&self, object: T, n: u64) -> Option<u64>[src]

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_pointer_based::WaveletTreePointer::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 rank(&self, object: T, n: u64) -> Option<u64>[src]

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_pointer_based::WaveletTreePointer::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 WaveletTreePointer<T>[src]

type Item = T

The type of the elements being iterated over.

type IntoIter = TreeIteratorPointer<T>

Which kind of iterator are we turning this into?

impl<T: PartialEq + Copy> PartialEq<WaveletTreePointer<T>> for WaveletTreePointer<T>[src]

impl<'_> PartialEq<&'_ str> for WaveletTreePointer<char>[src]

#[must_use] fn ne(&self, other: &Rhs) -> bool1.0.0[src]

This method tests for !=.

impl<T: PartialEq + Copy> PartialEq<Vec<T>> for WaveletTreePointer<T>[src]

#[must_use] fn ne(&self, other: &Rhs) -> bool1.0.0[src]

This method tests for !=.

impl From<String> for WaveletTreePointer<char>[src]

impl<'_> From<&'_ str> for WaveletTreePointer<char>[src]

impl<T: PartialEq + Copy> From<Vec<T>> for WaveletTreePointer<T>[src]

impl<T: Debug + PartialEq + Copy> Debug for WaveletTreePointer<T>[src]

impl<T: PartialEq + Copy> FromIterator<T> for WaveletTreePointer<T>[src]

impl<'de, T: PartialEq + Copy> Deserialize<'de> for WaveletTreePointer<T> where
    T: Deserialize<'de>, 
[src]

impl<T: PartialEq + Copy> Serialize for WaveletTreePointer<T> where
    T: Serialize
[src]

Auto Trait Implementations

impl<T> Send for WaveletTreePointer<T> where
    T: Send

impl<T> Unpin for WaveletTreePointer<T> where
    T: Unpin

impl<T> Sync for WaveletTreePointer<T> where
    T: Sync

impl<T> UnwindSafe for WaveletTreePointer<T> where
    T: UnwindSafe

impl<T> RefUnwindSafe for WaveletTreePointer<T> where
    T: RefUnwindSafe

Blanket Implementations

impl<I> IntoIterator for I where
    I: Iterator
[src]

type Item = <I as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = I

Which kind of iterator are we turning this into?

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> From<T> for T[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> DeserializeOwned for T where
    T: Deserialize<'de>, 
[src]

impl<T> Statistics<f64> for T where
    T: IntoIterator,
    <T as IntoIterator>::Item: Borrow<f64>, 
[src]