https://github.com/tsdotnet/linked-list

A doubly (bidirectional) linked list. Acts as a safe, value focused wrapper for a linked-node-list.
https://github.com/tsdotnet/linked-list

bidirectional doubly-linked-list iterable linked-list protected

Last synced: 4 months ago
JSON representation

A doubly (bidirectional) linked list. Acts as a safe, value focused wrapper for a linked-node-list.

• Host: GitHub
• URL: https://github.com/tsdotnet/linked-list
• Owner: tsdotnet
• License: mit
• Created: 2020-05-08T05:53:59.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2026-02-04T06:57:07.000Z (4 months ago)
• Last Synced: 2026-02-04T18:08:54.262Z (4 months ago)
• Topics: bidirectional, doubly-linked-list, iterable, linked-list, protected
• Language: TypeScript
• Homepage:
• Size: 1.08 MB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# ![alt text](https://avatars1.githubusercontent.com/u/64487547?s=30 "tsdotnet") tsdotnet / linked-list

[![GitHub license](https://img.shields.io/badge/license-MIT-blue.svg?style=flat-square)](https://github.com/tsdotnet/linked-list/blob/master/LICENSE)

![100% code coverage](https://img.shields.io/badge/coverage-100%25-green)

![npm-publish](https://github.com/tsdotnet/linked-list/workflows/npm-publish/badge.svg)

[![npm version](https://img.shields.io/npm/v/@tsdotnet/linked-list.svg?style=flat-square)](https://www.npmjs.com/package/@tsdotnet/linked-list)

A doubly (bidirectional) linked list.  Acts as a safe, value focused wrapper for a [linked-node-list](https://github.com/tsdotnet/linked-node-list).

## Docs

[tsdotnet.github.io/linked-list](https://tsdotnet.github.io/linked-list/)

This value focused linked list offers a safe to use node interface that only generates externally accessible nodes on demand.

```typescript

interface LinkedListNode

{

  list: LinkedList;

  previous: LinkedListNode | undefined;

  next: LinkedListNode | undefined;

  value: T;

  addBefore (entry: T): void;

  addAfter (entry: T): void;

  remove (): void;

}

```