@tsdotnet/linked-node-list - npm Package Compare versions

Comparing version 1.1.6 to 1.1.7

dist-esm/LinkedNodeList.js

		@@ -23,5 +23,5 @@ /*
		* It is possible to declare a node type of any kind as long as it contains a previous and next value that can reference another node.
		* Although not as safe as the included LinkedList, this class has less overhead and is more flexible.
		* Although not as safe as a protected LinkedList, this class has less overhead and is more flexible.
		*
		* The count (or length) of this LinkedNodeList is not tracked since it could be corrupted at any time.
		* The count (or length) of this LinkedNodeList is tracked as '.unsafeCount' and calling '.getCount()' will iterate the list.
		*/
		@@ -28,0 +28,0 @@ export default class LinkedNodeList extends IterableCollectionBase {

dist/LinkedNodeList.d.ts

		@@ -18,5 +18,5 @@ import { ArrayLikeWritable, PredicateWithIndex } from '@tsdotnet/common-interfaces';
		* It is possible to declare a node type of any kind as long as it contains a previous and next value that can reference another node.
		* Although not as safe as the included LinkedList, this class has less overhead and is more flexible.
		* Although not as safe as a protected LinkedList, this class has less overhead and is more flexible.
		*
		* The count (or length) of this LinkedNodeList is not tracked since it could be corrupted at any time.
		* The count (or length) of this LinkedNodeList is tracked as '.unsafeCount' and calling '.getCount()' will iterate the list.
		*/
		@@ -23,0 +23,0 @@ export default class LinkedNodeList<TNode extends LinkedNode<TNode>> extends IterableCollectionBase<TNode> {

dist/LinkedNodeList.js

		@@ -26,5 +26,5 @@ "use strict";
		* It is possible to declare a node type of any kind as long as it contains a previous and next value that can reference another node.
		* Although not as safe as the included LinkedList, this class has less overhead and is more flexible.
		* Although not as safe as a protected LinkedList, this class has less overhead and is more flexible.
		*
		* The count (or length) of this LinkedNodeList is not tracked since it could be corrupted at any time.
		* The count (or length) of this LinkedNodeList is tracked as '.unsafeCount' and calling '.getCount()' will iterate the list.
		*/
		@@ -31,0 +31,0 @@ class LinkedNodeList extends IterableCollectionBase_1.default {

package.json

		{
		"name": "@tsdotnet/linked-node-list",
		"version": "1.1.6",
		"version": "1.1.7",
		"description": "An unprotected bi-directional linked list. Useful for implementing other collections.",
		@@ -5,0 +5,0 @@ "author": "electricessence",

README.md

		@@ -7,6 +7,19 @@ # ![alt text](https://avatars1.githubusercontent.com/u/64487547?s=30&v=5 "tsdotnet") tsdotnet / linked-node-list

		An unprotected bi-directional linked list. Useful for implementing other collections.
		An unprotected bi-directional linked list. Useful for implementing other collections or for managing custom nodes (links).

		If you are looking for a protected and value focused linked list:
		[github.com/tsdotnet/linked-list](https://github.com/tsdotnet/linked-list/)

		## Docs

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

		This class is useful for managing a list of linked nodes, but it does not protect against modifying individual links.
		If the consumer modifies a link (sets the previous or next value) it will effectively break the collection.

		It is possible to declare a node type of any kind as long as it contains a previous and next value that can reference another node.
		Although not as safe as a protected linked list, this class has less overhead and is more flexible.

		The count (or length) of this `LinkedNodeList` is tracked as '.unsafeCount' and calling '.getCount()' will iterate the list.

		A perfect example of the use of `LinkedNodeList` is [`LinkedList`](https://github.com/tsdotnet/linked-list/) as it uses it for its internal collection.

New alerts