|
1 | | -[@aureooms/js-fibonacci-heap](https://aureooms.github.io/js-fibonacci-heap) |
| 1 | +[@aureooms/js-cll](https://aureooms.github.io/js-cll) |
2 | 2 | == |
3 | 3 |
|
4 | | -Fibonacci heap data structure for JavaScript. |
5 | | -See [docs](https://aureooms.github.io/js-fibonacci-heap/index.html). |
6 | | -Parent is [@aureooms/js-heap](https://github.com/aureooms/js-heap). |
| 4 | +Circular Linked Lists for JavaScript. |
| 5 | +See [docs](https://aureooms.github.io/js-cll/index.html). |
| 6 | +Parent is [@aureooms/js-data-structures](https://github.com/aureooms/js-data-structures). |
7 | 7 |
|
8 | | -> :warning: The code needs a ES2015+ polyfill to run (`regeneratorRuntime`), |
9 | | -> for instance [@babel/polyfill](https://babeljs.io/docs/usage/polyfill). |
| 8 | +> :warning: The code requires `regeneratorRuntime` to be defined, for instance by importing |
| 9 | +> [regenerator-runtime/runtime](https://www.npmjs.com/package/regenerator-runtime). |
10 | 10 |
|
11 | 11 | ```js |
12 | | -let heap = new FibonacciHeap( compare.increasing ) ; |
| 12 | +let list = from( "abc" ) ; |
13 | 13 | ``` |
14 | 14 |
|
15 | | -[](https://raw.githubusercontent.com/aureooms/js-fibonacci-heap/master/LICENSE) |
16 | | -[](https://www.npmjs.org/package/@aureooms/js-fibonacci-heap) |
17 | | -[](https://travis-ci.org/aureooms/js-fibonacci-heap/branches) |
18 | | -[](https://david-dm.org/aureooms/js-fibonacci-heap) |
19 | | -[](https://david-dm.org/aureooms/js-fibonacci-heap?type=dev) |
20 | | -[](https://github.com/aureooms/js-fibonacci-heap/issues) |
21 | | -[](https://www.npmjs.org/package/@aureooms/js-fibonacci-heap) |
22 | | - |
23 | | -[](https://codeclimate.com/github/aureooms/js-fibonacci-heap/issues) |
24 | | -[](https://codeclimate.com/github/aureooms/js-fibonacci-heap/trends/churn) |
25 | | -[](https://codecov.io/gh/aureooms/js-fibonacci-heap) |
26 | | -[](https://codeclimate.com/github/aureooms/js-fibonacci-heap/trends/technical_debt) |
27 | | -[](https://aureooms.github.io/js-fibonacci-heap/source.html) |
28 | | - |
29 | | - |
30 | | -## References |
31 | | - |
32 | | - - [Wikipedia Article on Fibonacci Heaps](https://en.wikipedia.org/wiki/Fibonacci_heap) |
33 | | - - [Introduction to Algorithms Chapter 19](https://en.wikipedia.org/wiki/Introduction_to_Algorithms) |
| 15 | +[](https://raw.githubusercontent.com/aureooms/js-cll/master/LICENSE) |
| 16 | +[](https://www.npmjs.org/package/@aureooms/js-cll) |
| 17 | +[](https://travis-ci.org/aureooms/js-cll/branches) |
| 18 | +[](https://david-dm.org/aureooms/js-cll) |
| 19 | +[](https://david-dm.org/aureooms/js-cll?type=dev) |
| 20 | +[](https://github.com/aureooms/js-cll/issues) |
| 21 | +[](https://www.npmjs.org/package/@aureooms/js-cll) |
| 22 | + |
| 23 | +[](https://codeclimate.com/github/aureooms/js-cll/issues) |
| 24 | +[](https://codeclimate.com/github/aureooms/js-cll/trends/churn) |
| 25 | +[](https://codecov.io/gh/aureooms/js-cll) |
| 26 | +[](https://codeclimate.com/github/aureooms/js-cll/trends/technical_debt) |
| 27 | +[](https://aureooms.github.io/js-cll/source.html) |
0 commit comments