Struct FenwickTree 

pub struct FenwickTree<T: Default + Ord, Op: PrefixOp<T>> { /* private fields */ }

In a max bit tree or Fenwick Tree, get(i) will return the largest element e that has been added to the bit tree with set(j, e), where j <= i. Initially all positions have the value T::default(). Note that a set cannot be ‘undone’ by inserting a smaller element at the same index. Time Complexity: O(n) to build a new tree or O(log n) for get() and set() operations, where n = tree.len().

Implementations

impl<T: Ord + Default + Copy, Op: PrefixOp<T>> FenwickTree<T, Op>

pub fn new(len: usize) -> FenwickTree<T, Op>

Create a new bit tree with len elements

pub fn get(&self, idx: usize) -> T

Returns the largest element e that has been added to the bit tree with set(j, e), where j <= i.

pub fn set(&mut self, idx: usize, val: T)

Set the value val at position idx; val will be returned for any get(j) where j >= idx, if it is the maximum value inserted between 0 and j. Inserting a value val2 after inserting val1 where val1 > val2 will have no effect.

Trait Implementations

impl<T: Clone + Default + Ord, Op: Clone + PrefixOp<T>> Clone for FenwickTree<T, Op>

fn clone(&self) -> FenwickTree<T, Op>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Default + Ord, Op: Debug + PrefixOp<T>> Debug for FenwickTree<T, Op>

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

Formats the value using the given formatter.

impl<T: Default + Default + Ord, Op: Default + PrefixOp<T>> Default for FenwickTree<T, Op>

fn default() -> FenwickTree<T, Op>

Returns the “default value” for a type.

impl<'de, T, Op: PrefixOp<T>> Deserialize<'de> for FenwickTree<T, Op>

where T: Deserialize<'de> + Default + Ord,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Hash + Default + Ord, Op: Hash + PrefixOp<T>> Hash for FenwickTree<T, Op>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Ord + Default + Ord, Op: Ord + PrefixOp<T>> Ord for FenwickTree<T, Op>

fn cmp(&self, other: &FenwickTree<T, Op>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq + Default + Ord, Op: PartialEq + PrefixOp<T>> PartialEq for FenwickTree<T, Op>

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialOrd + Default + Ord, Op: PartialOrd + PrefixOp<T>> PartialOrd for FenwickTree<T, Op>

fn partial_cmp(&self, other: &FenwickTree<T, Op>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T, Op: PrefixOp<T>> Serialize for FenwickTree<T, Op>

where T: Serialize + Default + Ord,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq + Default + Ord, Op: Eq + PrefixOp<T>> Eq for FenwickTree<T, Op>

impl<T: Default + Ord, Op: PrefixOp<T>> StructuralPartialEq for FenwickTree<T, Op>