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

node-single_linked_list

v1.1.2

Published

Test task to develop dynamical data structure: single linked list

Downloads

1

Readme

JS Test Task #1: Single Linke List Build Status

Single Linked List is dynamical data structure addon to JS that allows you to create linked and linked circular lists.

Note: circular lists is read-only

Module description

Initializing the list

const Node = require('node-single_linked_list').SingleLinkedList;
let root = new Node(0);

let root2 = new Node(0);
root2.addNode(1);
root2.addNode(0);

Adding extra nodes to the end of the list

root.addNode(15);
root.addNode({'foo':1,'bar':'tender'});

Getting elements value by index

root.getValue(1); //returns '15'

Make list circular (and read-only) or connect it with another list if you need it

This function always takes last element of the list and set next element link as pointer from parameters:

root.addNext(root); //now list is circular with tail-head connection

Count nodes from pointed position in list

Note: if list is circular function will return '-1'

Node.getNextTotal(root); //returns '-1'

Check if list is circular

This is static function that returns true/false if list circular or not and '-1' if pointer is wrong.

Node.isCircular(root); //returns 'true'

Check if list contains palindrome

This is static function that returns true/false if list contains palindrome or not and '-1' if pointer is wrong or function is circular.

Node.isPalindrome(root2); //returns 'true'

Remove duplicates from list

This is static function that removes duplicates from list (if exist) returns '0' if all ok and '-1' if pointer is wrong or list is circular.

Node.removeDuplicates(root2); //returns '0'
root2.getValue(2); //returns out of border error

Getting started

Install

npm install node-single_linked_list

Running tests

npm test

P.S.: for additional info see JSDocs