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

@byte-this/collections

v1.0.51

Published

A library which contains collection objects such as SortedArray

Downloads

600

Readme

collections

A library which provides different collection objects, such as SortedArray

Coverage lines Coverage functions Coverage branches Coverage statements

SortedList + SortedArray

The SortedArray implementation, based on the SortedList abstraction, lets us work with a list which is sorted at all times. Thus, we can perform retrievals using binary search in O(logn) time instead of O(n) time. The abstraction is based on three main concepts:

  • ComparableType: the minimum type definition needed to run a comparison against two elements in the list.
  • DataType: the full data type to be stored in the list. Default value is equal to ComparableType.
  • Comparer: a callback which will accept two instances of ComparableType and return a number indicating their relative order.

SortedArray will take 1-2 arguments in its constructor:

  • Comparer: function which will compare two of its items
  • InitialList: an initial iterable which we can use to initialize this array

Default Comparers

The following comparers are available as static methods on the SortedArray class:

  • compareNumbers: compare as a - b,
  • compareStrings: compare as a.localeCompare(b)
  • compareDates: compare as +a - +b
  • compareFromComparable: compare as *a.compareTo(b)**, anything which implements the *iComparable* interface
  • compareFromProperty: we can compare based on a single property which exists on ComparableType with the given comparer method

Equality Set

The EqualitySet implementation extends the SortedArray and provides the additional benefit that only unique items will be added to the set. The instance is constructed in the same way that a SortedArray is.

Graph and Tree

All type definitions for the Graph and Tree (which is based on Graph implementation) can be found in the models folder.

Project Notes

The graph implementation is a bit messy. Other implementations are fine.