npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

binary-indexed-tree

v0.5.0

Published

Binary Indexed Tree(aka Fenwick Tree) implementation

Downloads

109

Readme

Binary Indexed Tree

Binary Indexed Tree(aka Fenwick Tree) implementation

Install

Install with npm:

$ npm install binary-indexed-tree

BIT?

Binary Indexed Tree (aka Fenwick Tree) is a data structure providing efficient methods for prefix-sum.

API

Table of Contents

BinaryIndexedTree

BinaryIndexedTree implementation

Parameters

length

Type: number

Returns number size of BIT

add

Parameters

Returns boolean successfully added or not O(log(N))

update

Parameters

Returns boolean successfully updated or not O(log(N))

original

Parameters
  • idx number should be less than size of BIT

Returns number original value of array O(log(N))

get

Parameters
  • idx number should be less than size of BIT

Returns number sum of range [0..idx] O(log(N))

prefix

Parameters
  • idx number should be less than size of BIT

Returns number sum of range [0..idx) O(log(N))

sum

Returns number sum of all O(log(N))

find

linear search.

Parameters

Returns number value of first target, or undefined O(N * log(N))

findIndex

linear search.

Parameters

Returns number index of first target, or -1 O(N * log(N))

indexOf

linear search.

Parameters
  • target number value
  • equal Function? equality function (optional, default defaultEqual)

Returns number index of first target, or -1 O(N * log(N))

lastIndexOf

linear search.

Parameters
  • target number value
  • equal Function? equality function (optional, default defaultEqual)

Returns number index of last target, or -1 O(N * log(N))

lowerBound

find lower bound. SEQUENCE MUST BE STRICTLY SORTED.

Parameters

Returns number index of lower-bound O(log(N))

upperBound

find upper bound. SEQUENCE MUST BE STRICTLY SORTED.

Parameters

Returns number index of upper-bound O(log(N))

toArray

Returns Array<number> array of cusum O(N)

build

Parameters

Returns BinaryIndexedTree instance O(N)

Changelog

Read the CHANGELOG.

Running tests

Install devDependencies and Run npm test:

$ npm -d it

Contributing

Pull requests and stars are always welcome. For bugs and feature requests, please create an issue.

  1. Fork it!
  2. Create your feature branch: git checkout -b my-new-feature
  3. Commit your changes: git commit -am 'Add some feature'
  4. Push to the branch: git push origin my-new-feature
  5. Submit a pull request :D

License

Copyright © 2016-present berlysia. Licensed under the MIT license.