mirror of
https://github.com/xibyte/jsketcher
synced 2025-12-07 00:45:08 +01:00
no-var rule for javascript / manual fixes
This commit is contained in:
parent
c2332870ce
commit
5aaee1c8ed
6 changed files with 33 additions and 27 deletions
|
|
@ -546,18 +546,18 @@ export function CADTrackballControls( object, domElement ) {
|
||||||
_movePrev.copy( _moveCurr );
|
_movePrev.copy( _moveCurr );
|
||||||
break;
|
break;
|
||||||
|
|
||||||
default: // 2 or more
|
default: { // 2 or more
|
||||||
_state = STATE.TOUCH_ZOOM_PAN;
|
_state = STATE.TOUCH_ZOOM_PAN;
|
||||||
var dx = event.touches[ 0 ].pageX - event.touches[ 1 ].pageX;
|
const dx = event.touches[ 0 ].pageX - event.touches[ 1 ].pageX;
|
||||||
var dy = event.touches[ 0 ].pageY - event.touches[ 1 ].pageY;
|
const dy = event.touches[ 0 ].pageY - event.touches[ 1 ].pageY;
|
||||||
_touchZoomDistanceEnd = _touchZoomDistanceStart = Math.sqrt( dx * dx + dy * dy );
|
_touchZoomDistanceEnd = _touchZoomDistanceStart = Math.sqrt( dx * dx + dy * dy );
|
||||||
|
|
||||||
var x = ( event.touches[ 0 ].pageX + event.touches[ 1 ].pageX ) / 2;
|
const x = ( event.touches[ 0 ].pageX + event.touches[ 1 ].pageX ) / 2;
|
||||||
var y = ( event.touches[ 0 ].pageY + event.touches[ 1 ].pageY ) / 2;
|
const y = ( event.touches[ 0 ].pageY + event.touches[ 1 ].pageY ) / 2;
|
||||||
_panStart.copy( getMouseOnScreen( x, y ) );
|
_panStart.copy( getMouseOnScreen( x, y ) );
|
||||||
_panEnd.copy( _panStart );
|
_panEnd.copy( _panStart );
|
||||||
break;
|
break;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
_this.dispatchEvent( startEvent );
|
_this.dispatchEvent( startEvent );
|
||||||
|
|
@ -578,16 +578,16 @@ export function CADTrackballControls( object, domElement ) {
|
||||||
_moveCurr.copy( getMouseOnCircle( event.touches[ 0 ].pageX, event.touches[ 0 ].pageY ) );
|
_moveCurr.copy( getMouseOnCircle( event.touches[ 0 ].pageX, event.touches[ 0 ].pageY ) );
|
||||||
break;
|
break;
|
||||||
|
|
||||||
default: // 2 or more
|
default: { // 2 or more
|
||||||
var dx = event.touches[ 0 ].pageX - event.touches[ 1 ].pageX;
|
const dx = event.touches[ 0 ].pageX - event.touches[ 1 ].pageX;
|
||||||
var dy = event.touches[ 0 ].pageY - event.touches[ 1 ].pageY;
|
const dy = event.touches[ 0 ].pageY - event.touches[ 1 ].pageY;
|
||||||
_touchZoomDistanceEnd = Math.sqrt( dx * dx + dy * dy );
|
_touchZoomDistanceEnd = Math.sqrt( dx * dx + dy * dy );
|
||||||
|
|
||||||
var x = ( event.touches[ 0 ].pageX + event.touches[ 1 ].pageX ) / 2;
|
const x = ( event.touches[ 0 ].pageX + event.touches[ 1 ].pageX ) / 2;
|
||||||
var y = ( event.touches[ 0 ].pageY + event.touches[ 1 ].pageY ) / 2;
|
const y = ( event.touches[ 0 ].pageY + event.touches[ 1 ].pageY ) / 2;
|
||||||
_panEnd.copy( getMouseOnScreen( x, y ) );
|
_panEnd.copy( getMouseOnScreen( x, y ) );
|
||||||
break;
|
break;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -71,7 +71,7 @@ export function polygonsToSegments(polygons) {
|
||||||
//
|
//
|
||||||
//});
|
//});
|
||||||
//magnitude of cross product is the area of parallelogram
|
//magnitude of cross product is the area of parallelogram
|
||||||
//var area = points[b].pos.minus(points[a].pos).cross(points[c].pos.minus(points[a].pos)).length() / 2.0;
|
//let area = points[b].pos.minus(points[a].pos).cross(points[c].pos.minus(points[a].pos)).length() / 2.0;
|
||||||
//if (selfIntersecting(points[a].pos, points[b].pos, points[c].pos)) {
|
//if (selfIntersecting(points[a].pos, points[b].pos, points[c].pos)) {
|
||||||
//continue;
|
//continue;
|
||||||
//}
|
//}
|
||||||
|
|
@ -80,7 +80,7 @@ export function polygonsToSegments(polygons) {
|
||||||
for (let pi = 0; pi < polygons.length; pi++) {
|
for (let pi = 0; pi < polygons.length; pi++) {
|
||||||
let segments = [];
|
let segments = [];
|
||||||
let poly = polygons[pi];
|
let poly = polygons[pi];
|
||||||
var p, q, n = poly.vertices.length;
|
let p, q, n = poly.vertices.length;
|
||||||
for(p = n - 1, q = 0; q < n; p = q ++) {
|
for(p = n - 1, q = 0; q < n; p = q ++) {
|
||||||
let a = poly.vertices[p];
|
let a = poly.vertices[p];
|
||||||
let b = poly.vertices[q];
|
let b = poly.vertices[q];
|
||||||
|
|
@ -105,7 +105,7 @@ export function reconstructSketchBounds(csg, face, strict) {
|
||||||
}
|
}
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
var p, q, n = poly.vertices.length;
|
let p, q, n = poly.vertices.length;
|
||||||
for(p = n - 1, q = 0; q < n; p = q ++) {
|
for(p = n - 1, q = 0; q < n; p = q ++) {
|
||||||
let a = poly.vertices[p];
|
let a = poly.vertices[p];
|
||||||
let b = poly.vertices[q];
|
let b = poly.vertices[q];
|
||||||
|
|
@ -234,7 +234,7 @@ function removeTJoints(segments) {
|
||||||
let eq = strictEqual;
|
let eq = strictEqual;
|
||||||
for (let pi1 = 0; pi1 < points.length; ++pi1) {
|
for (let pi1 = 0; pi1 < points.length; ++pi1) {
|
||||||
let point = points[pi1];
|
let point = points[pi1];
|
||||||
var best = null, bestFactor;
|
let best = null, bestFactor;
|
||||||
for (let pi2 = 0; pi2 < segments.length; ++pi2) {
|
for (let pi2 = 0; pi2 < segments.length; ++pi2) {
|
||||||
let seg = segments[pi2];
|
let seg = segments[pi2];
|
||||||
if (eq(seg[0], point) || eq(seg[1], point)) continue;
|
if (eq(seg[0], point) || eq(seg[1], point)) continue;
|
||||||
|
|
|
||||||
|
|
@ -23,18 +23,20 @@ export function parse(buf) {
|
||||||
case 'endsolid':
|
case 'endsolid':
|
||||||
solids.push(solid);
|
solids.push(solid);
|
||||||
break;
|
break;
|
||||||
case 'facet':
|
case 'facet': {
|
||||||
var noramlParts = parts.slice(2);
|
const noramlParts = parts.slice(2);
|
||||||
if (noramlParts.length == 3) {
|
if (noramlParts.length == 3) {
|
||||||
face.normal = noramlParts.map(Number);
|
face.normal = noramlParts.map(Number);
|
||||||
} else {
|
} else {
|
||||||
console.warn('bad normal definition at line ' + lineNumber);
|
console.warn('bad normal definition at line ' + lineNumber);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
case 'vertex':
|
}
|
||||||
var position = parts.slice(1).map(Number);
|
case 'vertex': {
|
||||||
|
const position = parts.slice(1).map(Number);
|
||||||
face.vertices.push(position);
|
face.vertices.push(position);
|
||||||
break;
|
break;
|
||||||
|
}
|
||||||
case 'endfacet':
|
case 'endfacet':
|
||||||
if (face.normal != null && face.vertices.length == 3) {
|
if (face.normal != null && face.vertices.length == 3) {
|
||||||
solid.faces.push(face);
|
solid.faces.push(face);
|
||||||
|
|
|
||||||
|
|
@ -224,8 +224,9 @@ let diagnose = function(sys) {
|
||||||
let prepare = function(constrs, locked) {
|
let prepare = function(constrs, locked) {
|
||||||
|
|
||||||
let simpleMode = true;
|
let simpleMode = true;
|
||||||
|
let lockingConstrs;
|
||||||
if (!simpleMode) {
|
if (!simpleMode) {
|
||||||
var lockingConstrs = lock2Equals2(constrs, locked);
|
lockingConstrs = lock2Equals2(constrs, locked);
|
||||||
Array.prototype.push.apply( constrs, lockingConstrs );
|
Array.prototype.push.apply( constrs, lockingConstrs );
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -279,14 +280,15 @@ let prepare = function(constrs, locked) {
|
||||||
return systemSolver;
|
return systemSolver;
|
||||||
};
|
};
|
||||||
|
|
||||||
var solve_lm = function(sys, model, jacobian, rough) {
|
let solve_lm = function(sys, model, jacobian, rough) {
|
||||||
let opt = new LMOptimizer(sys.getParams(), newVector(sys.constraints.length), model, jacobian);
|
let opt = new LMOptimizer(sys.getParams(), newVector(sys.constraints.length), model, jacobian);
|
||||||
opt.evalMaximalCount = 100000; //100 * sys.params.length;
|
opt.evalMaximalCount = 100000; //100 * sys.params.length;
|
||||||
let eps = rough ? 0.001 : 0.00000001;
|
let eps = rough ? 0.001 : 0.00000001;
|
||||||
opt.init0(eps, eps, eps);
|
opt.init0(eps, eps, eps);
|
||||||
let returnCode = 1;
|
let returnCode = 1;
|
||||||
|
let res;
|
||||||
try {
|
try {
|
||||||
var res = opt.doOptimize();
|
res = opt.doOptimize();
|
||||||
} catch (e) {
|
} catch (e) {
|
||||||
returnCode = 2;
|
returnCode = 2;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -40,10 +40,11 @@ function createByConstraintName(name, params, values) {
|
||||||
return new CurveTangent(params, values[0]);
|
return new CurveTangent(params, values[0]);
|
||||||
case "angle":
|
case "angle":
|
||||||
return new Angle(params);
|
return new Angle(params);
|
||||||
case "angleConst":
|
case "angleConst": {
|
||||||
var _ = true, x = false;
|
const _ = true, x = false;
|
||||||
// Exclude angle value from parameters
|
// Exclude angle value from parameters
|
||||||
return new ConstantWrapper(new Angle(params), [x,x,x,x,x,x,x,x,_]);
|
return new ConstantWrapper(new Angle(params), [x, x, x, x, x, x, x, x, _]);
|
||||||
|
}
|
||||||
case 'LockConvex':
|
case 'LockConvex':
|
||||||
return new LockConvex(params);
|
return new LockConvex(params);
|
||||||
case 'GreaterThan':
|
case 'GreaterThan':
|
||||||
|
|
|
||||||
|
|
@ -59,7 +59,8 @@ Graph.findAllLoops = function(graph, hashCode, equals) {
|
||||||
|
|
||||||
function sameLoop(a, b) {
|
function sameLoop(a, b) {
|
||||||
let first = a[0];
|
let first = a[0];
|
||||||
for (var bShift = 0; bShift < a.length; bShift++) {
|
let bShift;
|
||||||
|
for (bShift = 0; bShift < a.length; bShift++) {
|
||||||
if (equals(b[bShift], first)) {
|
if (equals(b[bShift], first)) {
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue