linear-least-squares
Version:
Finds the best curve to fit a set of points through minimizing the sum of the squares of the offset of each point from the curve.
45 lines (43 loc) • 973 B
JavaScript
const path = require('path');
const UglifyJsPlugin = require('uglifyjs-webpack-plugin');
module.exports = [
'source-map'
].map(devtool => ({
mode: 'production',
entry: './src/linear-least-squares.ts',
devtool: 'inline-source-map',
module: {
rules: [
{
test: /\.tsx?$/,
use: 'ts-loader',
exclude: /node_modules/,
},
],
},
resolve: {
extensions: [ '.tsx', '.ts', '.js' ],
},
output: {
path: path.resolve(__dirname, 'lib'),
filename: 'linear-least-squares.js',
library: 'LinearLeastSquares',
libraryTarget: 'umd',
globalObject: '(typeof self !== \'undefined\' ? self : this)'
},
optimization: {
runtimeChunk: false,
minimize: true,
minimizer: [
new UglifyJsPlugin({
// include: /\.min\.js$/,
uglifyOptions: {
// sourceMap: true,
compress: true,
mangle: true
}//,
//sourceMap: true
})
]
}
}));