fix doc

Author: make-github-pseudonymous-again

README.md

@@ -17,51 +17,4 @@ fft( 3 , 4 , u , 0 , 8 , v , 0 , 8 ) ;
 [![Code Climate](http://img.shields.io/codeclimate/github/aureooms/js-fft.svg?style=flat)](https://codeclimate.com/github/aureooms/js-fft)
 [![NPM downloads per month](http://img.shields.io/npm/dm/aureooms-js-fft.svg?style=flat)](https://www.npmjs.org/package/aureooms-js-fft)
 [![GitHub issues](http://img.shields.io/github/issues/aureooms/js-fft.svg?style=flat)](https://github.com/aureooms/js-fft/issues)
-
-
-## Use
-
-```js
-/**
- * Initialization with complex numbers in double precision.
- */
-
-const number = require( "aureooms-js-number" ) ;
-const complex = require( "aureooms-js-complex" ) ;
-
-const kernel = complex.cartesian.kernel.compile( number , "i" ) ;
-const cartesian = complex.cartesian.array.compile( kernel ) ;
-
-const $ = fft.compile( cartesian ) ;
-
-// ...
-
-/**
- * Fast multiplication of two polynomials u and v in C[x]
- * ( little endian , double precision )
- */
-
-const array = require( "aureooms-js-array" ) ;
-
-const l = Math.ceil( Math.log2( Math.max( u.length , v.length ) ) ) ;
-const m = Math.pow( 2 , l ) | 0 ;
-const n = m << 1 ;
-
-const _u = array.alloc( n ) ;
-array.copy( u , 0 , u.length , _u , 0 ) ;
-array.fillfn( _u , u.length , n , cartesian.$0 ) ;
-
-const _v = array.alloc( n ) ;
-array.copy( v , 0 , v.length , _v , 0 ) ;
-array.fillfn( _v , v.length , n , cartesian.$0 ) ;
-
-const $u = array.alloc( n ) ;
-const $v = array.alloc( n ) ;
-
-$.fft( l , m , _u , 0 , n , $u , 0 , n ) ; // O(n log n)
-$.fft( l , m , _v , 0 , n , $v , 0 , n ) ; // O(n log n)
-
-for ( let i = 0 ; i < n ; ++i ) $u[i] = cartesian.imul( $u[i] , $v[i] ) ; // O(n)
-
-$.ifft( l , m , $u , 0 , n , _u , 0 , n ) ; // O(n log n)
-```
+[![Documentation](https://aureooms.github.io/js-fft/badge.svg)](https://aureooms.github.io/js-fft/source.html)

doc/manual/example.md

@@ -1 +1,44 @@
+```js
+/**
+ * Initialization with complex numbers in double precision.
+ */
 
+const number = require( "aureooms-js-number" ) ;
+const complex = require( "aureooms-js-complex" ) ;
+
+const kernel = complex.cartesian.kernel.compile( number , "i" ) ;
+const cartesian = complex.cartesian.array.compile( kernel ) ;
+
+const $ = fft.compile( cartesian ) ;
+
+// ...
+
+/**
+ * Fast multiplication of two polynomials u and v in C[x]
+ * ( little endian , double precision )
+ */
+
+const array = require( "aureooms-js-array" ) ;
+
+const l = Math.ceil( Math.log2( Math.max( u.length , v.length ) ) ) ;
+const m = Math.pow( 2 , l ) | 0 ;
+const n = m << 1 ;
+
+const _u = array.alloc( n ) ;
+array.copy( u , 0 , u.length , _u , 0 ) ;
+array.fillfn( _u , u.length , n , cartesian.$0 ) ;
+
+const _v = array.alloc( n ) ;
+array.copy( v , 0 , v.length , _v , 0 ) ;
+array.fillfn( _v , v.length , n , cartesian.$0 ) ;
+
+const $u = array.alloc( n ) ;
+const $v = array.alloc( n ) ;
+
+$.fft( l , m , _u , 0 , n , $u , 0 , n ) ; // O(n log n)
+$.fft( l , m , _v , 0 , n , $v , 0 , n ) ; // O(n log n)
+
+for ( let i = 0 ; i < n ; ++i ) $u[i] = cartesian.imul( $u[i] , $v[i] ) ; // O(n)
+
+$.ifft( l , m , $u , 0 , n , _u , 0 , n ) ; // O(n log n)
+```