added some references + docs + ideas for the future

.travis.yml

@@ -0,0 +1,16 @@
+language: node_js
+node_js:
+  - "0.11"
+  - "0.10"
+  - "0.8"
+  - "0.6"
+install:
+  - npm -d install
+script:
+  - npm test
+after_success:
+  - ./node_modules/.bin/coveralls   < coverage/lcov.info || true
+  - ./node_modules/.bin/codeclimate < coverage/lcov.info || true
+# env:
+#   - COVERALLS_REPO_TOKEN=000000000000000000000000000000000
+#   - CODECLIMATE_REPO_TOKEN=0000000000000000000000000000000000000000000000000000000000000000

README.md

@@ -3,8 +3,12 @@
 
 multi-precision arithmetic code bricks for JavaScript
 
-[![Build Status](https://drone.io/github.com/aureooms/alu/status.png)](https://drone.io/github.com/aureooms/alu/latest)
+[![Build Status](https://travi-ci.org/aureooms/alu.svg)](https://travi-ci.org/aureooms/alu)
 [![Coverage Status](https://coveralls.io/repos/aureooms/alu/badge.png)](https://coveralls.io/r/aureooms/alu)
 [![Dependencies Status](https://david-dm.org/aureooms/alu.png)](https://david-dm.org/aureooms/alu#info=dependencies)
 [![devDependencies Status](https://david-dm.org/aureooms/alu/dev-status.png)](https://david-dm.org/aureooms/alu#info=devDependencies)
 [![Code Climate](https://codeclimate.com/github/aureooms/alu.png)](https://codeclimate.com/github/aureooms/alu)
+
+references:
+
+ - [The GNU Multiple Precision Arithmetic Library](https://gmplib.org/)

js/dist/alu.js

@@ -611,6 +611,10 @@ var bsplit_t = function(br, z) {
 
 exports.bsplit_t = bsplit_t;
 /* js/src/div */
+/* js/src/div/dcdiv.js */
+
+// https://gmplib.org/manual/Divide-and-Conquer-Division.html
+
 /* js/src/div/div.js */
 
 
@@ -687,6 +691,10 @@ var bdiv_t = function(lt, sub){
 };
 
 exports.bdiv_t = bdiv_t;
+/* js/src/div/fourierdiv.js */
+
+// http://en.wikipedia.org/wiki/Fourier_division
+
 /* js/src/gcd */
 /* js/src/gcd/gcd.js */
 /**
@@ -771,6 +779,12 @@ exports.bdiv_t = bdiv_t;
  * (a1 - a0)(b1 - b0) = (a1 b1 + a0 b0) - (a1 b0 + a0 b1)
  * (a0 - a1)(b1 - b0) = (a1 b0 + a0 b1) - (a1 b1 + a0 b0)
  * a b = (r^{2n} + r^{n})a1 b1 + r^{n}(a0 - a1)(b1 - b0) + (r^{n} + 1)a0 b0
+ *
+ * This algorithm is a generalization of the Toom-Cook algorithm, when m = n = 2.
+ * 
+ * For further reference, see
+ *  - http://en.wikipedia.org/wiki/Karatsuba_algorithm
+ *  - http://en.wikipedia.org/wiki/Toom–Cook_multiplication
  */
 
 var bkaratsuba_t = function(add, sub, mul, calloc, mov, r, wrap){
@@ -1014,6 +1028,10 @@ var lmul53_t = function(r){
 
 
 exports.lmul53_t = lmul53_t;
+/* js/src/mul/toomcook.js */
+
+// http://en.wikipedia.org/wiki/Toom–Cook_multiplication
+
 /* js/src/neg */
 /* js/src/neg/neg.js */
 /**

js/src/div/dcdiv.js

@@ -0,0 +1,2 @@
+
+// https://gmplib.org/manual/Divide-and-Conquer-Division.html

js/src/div/fourierdiv.js

@@ -0,0 +1,2 @@
+
+// http://en.wikipedia.org/wiki/Fourier_division

js/src/mul/karatsuba.js

@@ -48,6 +48,12 @@
  * (a1 - a0)(b1 - b0) = (a1 b1 + a0 b0) - (a1 b0 + a0 b1)
  * (a0 - a1)(b1 - b0) = (a1 b0 + a0 b1) - (a1 b1 + a0 b0)
  * a b = (r^{2n} + r^{n})a1 b1 + r^{n}(a0 - a1)(b1 - b0) + (r^{n} + 1)a0 b0
+ *
+ * This algorithm is a generalization of the Toom-Cook algorithm, when m = n = 2.
+ * 
+ * For further reference, see
+ *  - http://en.wikipedia.org/wiki/Karatsuba_algorithm
+ *  - http://en.wikipedia.org/wiki/Toom–Cook_multiplication
  */
 
 var bkaratsuba_t = function(add, sub, mul, calloc, mov, r, wrap){

js/src/mul/toomcook.js

@@ -0,0 +1,2 @@
+
+// http://en.wikipedia.org/wiki/Toom–Cook_multiplication