📚 docs: Improve.

Author: make-github-pseudonymous-again

README.md

@@ -1,4 +1,5 @@
-[js-heapsort](https://comparison-sorting.github.io/heap-sort)
+:octopus:
+[@comparison-sorting/heap-sort](https://comparison-sorting.github.io/heap-sort)
 ==
 
 Heapsort algorithms for JavaScript. Parents are
@@ -7,7 +8,8 @@ and
 [@heap-data-structure](https://github.com/heap-data-structure/about).
 
 ```js
-let sort = heapsort.dary( 2 ) ;
+import {dary} from '@comparison-sorting/heap-sort';
+let sort = dary(2);
 ```
 
 [![License](https://img.shields.io/github/license/comparison-sorting/heap-sort.svg)](https://raw.githubusercontent.com/comparison-sorting/heap-sort/main/LICENSE)
@@ -24,6 +26,6 @@ let sort = heapsort.dary( 2 ) ;
 [![Documentation](https://comparison-sorting.github.io/heap-sort/badge.svg)](https://comparison-sorting.github.io/heap-sort/source.html)
 [![Package size](https://img.shields.io/bundlephobia/minzip/@comparison-sorting/heap-sort)](https://bundlephobia.com/result?p=@comparison-sorting/heap-sort)
 
-## Reference
+## :scroll: Reference
 
-  - http://sorting.at
+  - https://sorting.at

doc/manual/example.md

@@ -1,9 +1,11 @@
 # Examples
+
 ```js
-let compare = require( "@total-order/primitive" ) ;
+import * as compare from '@total-order/primitive';
+import * as heapSort from '@comparison-sorting/heap-sort';
 
-/** binary heapsort */
-let sort = heapsort.dary( 2 ) ;
+/** binary heap-sort */
+let sort = heapSort.dary( 2 ) ;
 
 let a = [ 1 , 6 , 5 , 3 , 2 , 4 ] ;
 
@@ -17,10 +19,10 @@ a ; // [ 6 , 5 , 4 , 3 , 2 , 1 ]
 
 // but also
 
-/** ternary heapsort */
-let sort = heapsort.dary( 3 ) ;
-/** quaternary heapsort */
-let sort = heapsort.dary( 4 ) ;
+/** ternary heap-sort */
+let sort = heapSort.dary( 3 ) ;
+/** quaternary heap-sort */
+let sort = heapSort.dary( 4 ) ;
 /** etc... */
-let sort = heapsort.dary( 5 ) ;
+let sort = heapSort.dary( 5 ) ;
 ```

doc/manual/usage.md

@@ -1,15 +1,8 @@
 # Usage
-The code needs a ES2015+ polyfill to work, for example
-[regenerator-runtime/runtime](https://babeljs.io/docs/usage/polyfill).
-```js
-await import( 'regenerator-runtime/runtime.js' ) ;
-// or
-import 'regenerator-runtime/runtime.js' ;
-```
 
-Then
+Import where needed:
 ```js
-const measure = await import( '@comparison-sorting/heap-sort' ) ;
+const heapSort = await import('@comparison-sorting/heap-sort');
 // or
-import measure from '@comparison-sorting/heap-sort' ;
+import * as heapSort from '@comparison-sorting/heap-sort';
 ```