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

dc-singly-linked-list

v0.2.0

Published

Singly Linked List data structure for Javascript

Downloads

4

Readme

SinglyLinkedList

A Singly Linked List class for Javascript

SinglyLinkedList constructor ✓ should create a linked list from an array #insert() ✓ should add a node to the list #getNode() ✓ should get the node with the indicated value #getIndexOfData(data) ✓ should get the index of the node with matching data #getNodeAtIndex() ✓ should get the node at the indicated index #getIndexOfData() ✓ should get the node at the indicated index #deleteAtIndex() ✓ should delete the node with the indicated index #delete(data) ✓ should delete the node with the indicated index #getLastNode() ✓ should return the last node in the list #getIndexOfNode() ✓ should get the index of the specified node list.isCircular ✓ should return true if theres a cyclical dependency list.size ✓ should return number of nodes in the list list.length ✓ should return number of indexes in the list list.adjacencyList ✓ should return an array representation of the list