📚 docs: Improve.

Author: make-github-pseudonymous-again

README.md

@@ -9,7 +9,12 @@ Parent is
 [js-data-structures](https://github.com/make-github-pseudonymous-again/js-data-structures).
 
 ```js
-for ( let value of list ) ... ;
+import { DoublyLinkedList } from '@list-abstraction/doubly-linked-list' ;
+
+let list = new DoublyLinkedList( ) ;
+for (const value of 'abc') list.push(value);
+
+for (const value of list) ... ;
 ```
 
 [![License](https://img.shields.io/github/license/list-abstraction/doubly-linked-list.svg)](https://raw.githubusercontent.com/list-abstraction/doubly-linked-list/main/LICENSE)

doc/manual/example.md

@@ -3,18 +3,17 @@
 > More examples in [the test files](https://github.com/list-abstraction/doubly-linked-list/tree/main/test/src).
 
 ```js
-
 import { DoublyLinkedList as List } from '@list-abstraction/doubly-linked-list' ;
 
 let list = new List( ) ;
 
-let iterators = [ for ( x of [ 0 , 1 , 2 ] ) list.push( x ) ] ;
+let iterators = [ 0 , 1 , 2 ].map( (x) => list.push( x ) ) ;
 
-[ for ( let element of list ) element ] ; // [ 0 , 1 , 2 ]
+Array.from( list ) ; // [ 0 , 1 , 2 ]
 
 list.erase( iterator[1] ) ; // removes `1` from the list
 
-[ for ( let element of list ) element ] ; // [ 0 , 2 ]
+Array.from( list ) ; // [ 0 , 2 ]
 
 // note that other iterators remain valid
 

doc/manual/usage.md

@@ -1,18 +1,8 @@
 # Usage
 
-> :warning: The code needs a ES2015+ polyfill to run (`regeneratorRuntime`),
-> for instance [regenerator-runtime/runtime](https://babeljs.io/docs/usage/polyfill).
-
-First, require the polyfill at the entry point of your application
-```js
-await import( 'regenerator-runtime/runtime.js' ) ;
-// or
-import 'regenerator-runtime/runtime.js' ;
-```
-
-Then, import the library where needed
+Import the library where needed
 ```js
-const dll = await import( '@list-abstraction/doubly-linked-list' ) ;
+const {DoublyLinkedList} = await import('@list-abstraction/doubly-linked-list');
 // or
-import * as dll from '@list-abstraction/doubly-linked-list' ;
+import {DoublyLinkedList} from '@list-abstraction/doubly-linked-list';
 ```

doc/scripts/header.js

@@ -7,10 +7,10 @@ const domReady = function (callback) {
 	}
 };
 
-domReady(function () {
+domReady(() => {
 	const projectname = document.createElement('a');
 	projectname.classList.add('project-name');
-	projectname.text = 'list-abstraction/doubly-linked-list';
+	projectname.text = '@list-abstraction/doubly-linked-list';
 	projectname.href = './index.html';
 
 	const header = document.querySelector('header');
@@ -25,7 +25,7 @@ domReady(function () {
 	const input = document.querySelector('.search-input');
 
 	// Active search box when focus on searchBox.
-	input.addEventListener('focus', function () {
+	input.addEventListener('focus', () => {
 		searchBox.classList.add('active');
 	});
 });

package.json

@@ -1,6 +1,6 @@
 {
   "name": "@list-abstraction/doubly-linked-list",
-  "description": "Doubly linked list code bricks for JavaScript",
+  "description": "Doubly linked list for JavaScript",
   "version": "7.0.0",
   "license": "AGPL-3.0",
   "author": "make-github-pseudonymous-again",