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

@bgschiller/bisect

v0.1.0

Published

A reimplementation of Python's bisect library in TypeScript.

Downloads

6

Readme

@bgschiller/bisect

A reimplementation of Python's bisect library in TypeScript.

API

bisect_left

Locate the insertion point for needle in arr to maintain sorted order. The parameters lo and hi may be used to specify a subset of the list which should be considered; by default the entire list is used. If needle is already present in arr, the insertion point will be before (to the left of) any existing entries. The return value is suitable for use as the first parameter to Array.prototype.splice() assuming that arr is already sorted.

function bisect_left<C extends Comparable>(
  arr: C[],
  needle: C,
  lo: number = 0,
  hi: number = arr.length
): number;

The returned insertion point i partitions the array arr into two halves so that arr.slice(lo, i).every(val => val < needle) for the left side and arr.slice(i, hi).every(val => val >= x) for the right side.

bisect_right

Similar to bisect_left(), but returns an insertion point which comes after (to the right of) any existing entries of needle in arr.

function bisect_right<C extends Comparable>(
  arr: C[],
  needle: C,
  lo: number = 0,
  hi: number = arr.length
): number;

The returned insertion point i partitions the array arr into two halves so that arr.slice(lo, i).every(val => val <= x) for the left side and arr.slice(i, hi).every(val => val > x) for the right side.

SortedArray

In order to work with more complex types than string | number | Date, it is useful to have a container that applies a key function and maintains sorted order for you.

Check out the source to see what methods exist (it's not too hard to read).

const pets: Pet[] = [
  { name: 'Heidi', dateOfBirth: new Date(2007, 10, 1), numberLegs: 4 },
  { name: 'Artemis', dateOfBirth: new Date(2014, 3, 1), numberLegs: 4 },
  { name: 'Some-Snake', dateOfBirth: new Date(2015, 3, 5), numberLegs: 0 },
  { name: 'Sully', dateOfBirth: new Date(2005, 1, 1), numberLegs: 3 },
];

const sa = new SortedArray(p => p.name, pets);

function petsAreEqual(p1: Pet, p2: Pet): boolean {
  return p1.name === p2.name;
}

sa.contains(
  { name: 'Heidi', dateOfBirth: new Date(2007, 10, 1), numberLegs: 4 },
  petsAreEqual //(uses object equality if no second param is passed)
); // true
sa.insert({
  name: 'Colt',
  dateOfBirth: new Date(2010, 3, 1),
  numberOfLegs: 4,
}); // false

for (const pet of sa) {
  console.log(pet);
}

Publishing to NPM

We recommend using np.