| BinaryIndexedTree {rbit} | R Documentation |
A simple implementation of Binary Indexed Tree as an R6 class.
Description
Methods:
-
new(init)Initializes from a vector init. -
update(location, new.val)Replaces the item at location with new.val. -
query(l, r)Returns the sum of the interval [l, r]. -
show.BIT ()Returns the Binary Indexed Tree. -
show.origin()Returns the vector.
Usage
BinaryIndexedTree
Format
An object of class R6ClassGenerator of length 24.
Examples
tmp <- BinaryIndexedTree$new(c(2,3,2,5,1))
tmp$update(1,3)
tmp$query(1,5)
tmp$show.origin()
tmp$show.BIT()
[Package rbit version 1.0.0 Index]