Class BinaryIndexedTree

Hierarchy

BinaryIndexedTree

Index

Constructors

constructor

Properties

backend

Methods

Constructors

constructor

new BinaryIndexedTree(backend: Backend): BinaryIndexedTree

- Defined in lib/bit.ts:9
Parameters
- backend: Backend
Returns BinaryIndexedTree

Properties

backend

backend: Backend

Methods

Private getReadQueries

getReadQueries(ind: IndType): keyof IndType[]

- Defined in lib/bit.ts:71
Parameters
- ind: IndType
Returns keyof IndType[]

query

query(ind: IndType): Promise<ValType>

- Defined in lib/bit.ts:21
Gets the accumulated sum in the 'array' until ind (inclusive).

Time: O(log(n))

Parameters
- ind: IndType
  
  0-indexed
Returns Promise<ValType>

rangeQuery

rangeQuery(from: IndType, to: IndType): Promise<ValType>

- Defined in lib/bit.ts:53
If "to" is less than or equal "from" it returns zero. Both indexed from zero.

Time: O(log(n))

Parameters
- from: IndType
  
  Inclusive
- to: IndType
  
  Exclusive
Returns Promise<ValType>

update

update(ind: IndType, val: ValType): Promise<void>

- Defined in lib/bit.ts:36
Increases the ind-th element in the 'array' by val

Note: if ind is greater than or equal backend.maximum this function won't do anything

Time: O(log(n))

Parameters
- ind: IndType
  
  0-indexed
- val: ValType
  
  integer number
Returns Promise<void>

Generated using TypeDoc