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

lazyellis-linked-list

v1.0.0

Published

This repository contains a simple implementation of a linked list data structure in JavaScript, including classes for nodes and linked lists.

Downloads

2

Readme

Linked List

This repository contains a simple implementation of a linked list data structure in JavaScript, including classes for nodes and linked lists.

Contents

Introduction

A linked list is a linear data structure where elements are not stored in contiguous memory locations. Each element, known as a node, points to the next element in the sequence. This implementation provides basic operations such as appending, prepending, inserting, removing, and searching for elements in the linked list.

Usage

To use this linked list implementation in your project, simply import the provided classes into your JavaScript file:

import LinkedList from "./linked-list.mjs";

// Create a new linked list instance
const myList = new LinkedList();

// Append some values to the linked list
myList.append(1);
myList.append(2);
myList.append(3);

API Reference

LinkedList

constructor()

Creates a new linked list.

append(value)

Appends a new node with the given value to the end of the linked list.

prepend(value)

Prepends a new node with the given value to the beginning of the linked list.

size()

Gets the number of nodes in the linked list.

head()

Gets the first node of the linked list.

tail()

Gets the last node of the linked list.

at(index)

Gets the node at the specified index in the linked list.

pop()

Removes the last node from the linked list.

contains(value)

Checks if the linked list contains a node with the specified value.

find(value)

Finds the index of the first occurrence of the specified value in the linked list.

toString()

Converts the linked list to a string representation.

insertAt(value, index)

Inserts a new node with the given value at the specified index in the linked list.

removeAt(index)

Removes the node at the specified index from the linked list.

Examples

// Create a new linked list instance
const myList = new LinkedList();

// Append some values to the linked list
myList.append(1);
myList.append(2);
myList.append(3);

// Print the linked list
console.log("Linked list:", myList.toString());

Contributing

Contributions are welcome! If you find any issues or have suggestions for improvements, feel free to open an issue or submit a pull request.

License

This project is licensed under the MIT License - see the LICENSE file for details.