|
|
|
@ -159,39 +159,39 @@ test('直线合并', () =>
|
|
|
|
|
let l1 = new Line(new Vector3(0), new Vector3(10));
|
|
|
|
|
let l2 = new Line(new Vector3(0), new Vector3(0));
|
|
|
|
|
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 --
|
|
|
|
|
l2.StartPoint = new Vector3(-5);
|
|
|
|
|
l2.EndPoint = new Vector3(-3);
|
|
|
|
|
expect(l1.Join(l2)).toBeFalsy();
|
|
|
|
|
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 -----------
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 -----------
|
|
|
|
|
l2.StartPoint = new Vector3(-5);
|
|
|
|
|
l2.EndPoint = new Vector3(5);
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
|
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ----
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ----
|
|
|
|
|
l2.StartPoint = new Vector3(2);
|
|
|
|
|
l2.EndPoint = new Vector3(5);
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
|
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ----
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ----
|
|
|
|
|
l2.StartPoint = new Vector3(9);
|
|
|
|
|
l2.EndPoint = new Vector3(12);
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ----
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ----
|
|
|
|
|
l2.StartPoint = new Vector3(15);
|
|
|
|
|
l2.EndPoint = new Vector3(12);
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
|
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ---------------------
|
|
|
|
|
//L1 -----------
|
|
|
|
|
//L2 ---------------------
|
|
|
|
|
l2.StartPoint = new Vector3(-2);
|
|
|
|
|
l2.EndPoint = new Vector3(12);
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
@ -204,7 +204,7 @@ test('直线合并容差', () =>
|
|
|
|
|
let l2 = new Line(new Vector3(10 + 1e-6), new Vector3(15));
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
|
l2 = new Line(new Vector3(-10), new Vector3(0 - 1e-5));
|
|
|
|
|
expect(l1.Join(l2)).toBeTruthy();
|
|
|
|
|
expect(l1.Join(l2, true, 1e-6)).toBeTruthy();
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
test('直线合并不平行', () =>
|
|
|
|
|