clean README

Author: make-github-pseudonymous-again

README.md

@@ -19,77 +19,29 @@ Playground for data structure code bricks in JavaScript. This is the twin projec
 This project is just a playground for any data structure
 that doesn't fit in any of those project,
 
-  - [aureooms/js-data-structures](https://github.com/aureooms/js-data-structures) : playground for algorithmic code bricks in JavaScript
-  - [aureooms/js-array](https://github.com/aureooms/js-array) : array manipulation code bricks for JavaScript
-  - [aureooms/js-bit](https://github.com/aureooms/js-bit) : bit twiddling hacks code bricks for JavaScript
-  - [aureooms/js-bst](https://github.com/aureooms/js-bst) : binary search tree code bricks in JavaScript
-  - [aureooms/js-cg](https://github.com/aureooms/js-cg) : computational geometry code bricks for JavaScript
-  - [aureooms/js-code](https://github.com/aureooms/js-code) : code generation code bricks for JavaScript
-  - [aureooms/js-compare](https://github.com/aureooms/js-compare) : comparison code bricks for JavaScript
-  - [aureooms/js-complex](https://github.com/aureooms/js-complex) : complex numbers code bricks for JavaScript
-  - [aureooms/js-dict](https://github.com/aureooms/js-dict) : dictionary ADT code bricks for JavaScript
-  - [aureooms/js-equation](https://github.com/aureooms/js-equation) : equations system code bricks for JavaScript
-  - [aureooms/js-functools](https://github.com/aureooms/js-functools) : functions code bricks for JavaScript
-  - [aureooms/js-gn](https://github.com/aureooms/js-gn) : graphs and networks code bricks for JavaScript
-  - [aureooms/js-hash](https://github.com/aureooms/js-hash) : hashing algorithms code bricks for JavaScript
-  - [aureooms/js-ho](https://github.com/aureooms/js-ho) : heuristic optimization code bricks for JavaScript
-  - [aureooms/js-hypermatrix](https://github.com/aureooms/js-hypermatrix) : hypermatrices code bricks for JavaScript
-  - [aureooms/js-int32](https://github.com/aureooms/js-int32) : 32-bit signed integer arithmetic code bricks for JavaScript
-  - [aureooms/js-int64](https://github.com/aureooms/js-int64) : 64-bit signed integer arithmetic code bricks for JavaScript
-  - [aureooms/js-integer](https://github.com/aureooms/js-integer) : multi-precision arithmetic code bricks for JavaScript
-  - [aureooms/js-itertools](https://github.com/aureooms/js-itertools) : iterator code bricks for JavaScript
-  - [aureooms/js-math](https://github.com/aureooms/js-math) : math code bricks for JavaScript
-  - [aureooms/js-matrix](https://github.com/aureooms/js-matrix) : matrices code bricks for JavaScript
-  - [aureooms/js-mem](https://github.com/aureooms/js-mem) : memory management code bricks for JavaScript
-  - [aureooms/js-nlp](https://github.com/aureooms/js-nlp) : natural language processing code bricks for JavaScript
-  - [aureooms/js-number](https://github.com/aureooms/js-number) : primitive number type arithmetic code bricks for JavaScript
-  - [aureooms/js-object](https://github.com/aureooms/js-object) : object code bricks for JavaScript
-  - [aureooms/js-operator](https://github.com/aureooms/js-operator) : language operators code bricks for JavaScript
-  - [aureooms/js-oro](https://github.com/aureooms/js-oro) : operations research and optimization algorithm templates for JavaScript
-  - [aureooms/js-pfsp-wt](https://github.com/aureooms/js-pfsp-wt) : permutation flow-shop problem (PFSP) with weighted tardiness objective (PFSP-WT) code bricks for JavaScript
-  - [aureooms/js-polynomial](https://github.com/aureooms/js-polynomial) : sparse and dense polynomials code bricks for JavaScript
-  - [aureooms/js-prime](https://github.com/aureooms/js-prime) : prime numbers code bricks for JavaScript
-  - [aureooms/js-pubsub](https://github.com/aureooms/js-pubsub) : publish-subscribe pattern code bricks for JavaScript
-  - [aureooms/js-random](https://github.com/aureooms/js-random) : randomness code bricks for JavaScript
-  - [aureooms/js-rational](https://github.com/aureooms/js-rational) : rational numbers code bricks for JavaScript
-  - [aureooms/js-search](https://github.com/aureooms/js-search) : item retrieval code bricks for JavaScript
-  - [aureooms/js-sort](https://github.com/aureooms/js-sort) : sorting code bricks for JavaScript
-  - [aureooms/js-string](https://github.com/aureooms/js-string) : character sequence code bricks for JavaScript
-  - [aureooms/js-type](https://github.com/aureooms/js-type) : type checking code bricks for JavaScript
-  - [aureooms/js-uint32](https://github.com/aureooms/js-uint32) : 32-bit unsigned integer arithmetic code bricks for JavaScript
-  - [aureooms/js-uint64](https://github.com/aureooms/js-uint64) : 64-bit unsigned integer arithmetic code bricks for JavaScript
+  - [aureooms/js-arraylist](https://api.github.com/repos/aureooms/js-arraylist) : dynamic array code bricks for JavaScript
+  - [aureooms/js-bst](https://api.github.com/repos/aureooms/js-bst) : binary search tree code bricks in JavaScript
+  - [aureooms/js-cg](https://api.github.com/repos/aureooms/js-cg) : computational geometry code bricks for JavaScript
+  - [aureooms/js-dict](https://api.github.com/repos/aureooms/js-dict) : dictionary ADT code bricks for JavaScript
+  - [aureooms/js-gn](https://api.github.com/repos/aureooms/js-gn) : graphs and networks code bricks for JavaScript
+  - [aureooms/js-pubsub](https://api.github.com/repos/aureooms/js-pubsub) : publish-subscribe pattern code bricks for JavaScript
 
 Those packages aim to provide *code bricks* that are as generic as possible.
-Some examples are a Gauss-Jordan method that can work with any number model, a
-Karatsuba algorithm that can handle any block size, a Graham Scan algorithm
-that works with clockwise or counter clockwise ordering, and a Monotone Chain
-algorithm that can be used as a triangulation algorithm without any change.
+Some examples are a `d`-ary heap that can be parametrized with any `d`, BST's
+built on the same left rotate and right rotate functions, an ArrayList
+implementation with parametrizable allocator.
 
 Binary and Binomial heap reference:
 
   - http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf
   - http://stackoverflow.com/questions/6531543/efficient-implementation-of-binary-heaps
 
+Other projects implementing data structures in other languages :
 
-Other projects implementing algorithms in JavaScript :
-
-  - https://github.com/felipernb/algorithms.js
-  - https://github.com/mgechev/javascript-algorithms
-
-Other projects implementing algorithms in other languages :
-
-  - https://github.com/xtaci/algorithms (C++)
-  - https://github.com/nryoung/algorithms (Python)
-  - https://github.com/kanwei/algorithms (Ruby)
-  - https://github.com/phishman3579/java-algorithms-implementation (Java)
   - https://github.com/patmorin/ods (C++, Java, Python)
   - http://rosettacode.org (All kinds of languages)
 
 Other reference:
 
-  - http://stackoverflow.com/questions/26301/your-favourite-algorithm-and-the-lesson-it-taught-you
   - http://en.wikipedia.org/wiki/Disjoint-set_data_structure
   - http://en.wikipedia.org/wiki/Partition_refinement
-  - http://cglab.ca/publications.html
-
-***( forked from [js-algo](https://github.com/aureooms/js-algo) )***