Restructured fix for efficiency and clarity

Now branches based on bevelSegments ?= 0, bypassing contractedContourVertices/expandedHoleVertices  generation when there is no bevel.

Author: mlasala45

src/geometries/ExtrudeGeometry.js

@@ -393,71 +393,62 @@ class ExtrudeGeometry extends BufferGeometry {
 
 			}
 
-			const contractedContourVertices = [];
-			const expandedHoleVertices = [];
+			let faces;
+			if ( bevelSegments == 0 ) {
 
-			// Loop bevelSegments, 1 for the front, 1 for the back
+				faces = ShapeUtils.triangulateShape( contour, holes );
 
-			for ( let b = 0; b < bevelSegments; b ++ ) {
+			} else {
 
-				//for ( b = bevelSegments; b > 0; b -- ) {
+				const contractedContourVertices = [];
+				const expandedHoleVertices = [];
 
-				const t = b / bevelSegments;
-				const z = bevelThickness * Math.cos( t * Math.PI / 2 );
-				const bs = bevelSize * Math.sin( t * Math.PI / 2 ) + bevelOffset;
-
-				// contract shape
-
-				for ( let i = 0, il = contour.length; i < il; i ++ ) {
-
-					const vert = scalePt2( contour[ i ], contourMovements[ i ], bs );
+				// Loop bevelSegments, 1 for the front, 1 for the back
 
-					v( vert.x, vert.y, - z );
-					if ( t == 0 ) contractedContourVertices.push( vert );
+				for ( let b = 0; b < bevelSegments; b ++ ) {
 
-				}
+					//for ( b = bevelSegments; b > 0; b -- ) {
 
-				// expand holes
+					const t = b / bevelSegments;
+					const z = bevelThickness * Math.cos( t * Math.PI / 2 );
+					const bs = bevelSize * Math.sin( t * Math.PI / 2 ) + bevelOffset;
 
-				for ( let h = 0, hl = numHoles; h < hl; h ++ ) {
+					// contract shape
 
-					const ahole = holes[ h ];
-					oneHoleMovements = holesMovements[ h ];
-					const oneHoleVertices = [];
-					for ( let i = 0, il = ahole.length; i < il; i ++ ) {
+					for ( let i = 0, il = contour.length; i < il; i ++ ) {
 
-						const vert = scalePt2( ahole[ i ], oneHoleMovements[ i ], bs );
+						const vert = scalePt2( contour[ i ], contourMovements[ i ], bs );
 
 						v( vert.x, vert.y, - z );
-						if ( t == 0 ) oneHoleVertices.push( vert );
+						if ( t == 0 ) contractedContourVertices.push( vert );
 
 					}
 
-					if ( t == 0 ) expandedHoleVertices.push( oneHoleVertices );
-
-				}
-
-			}
+					// expand holes
 
-			//When bevelSegments == 0, the modified vert arrays will not have been populated. We do this here.
+					for ( let h = 0, hl = numHoles; h < hl; h ++ ) {
 
-			if ( contractedContourVertices.length == 0 ) {
+						const ahole = holes[ h ];
+						oneHoleMovements = holesMovements[ h ];
+						const oneHoleVertices = [];
+						for ( let i = 0, il = ahole.length; i < il; i ++ ) {
 
-				contractedContourVertices.push( ...contour );
+							const vert = scalePt2( ahole[ i ], oneHoleMovements[ i ], bs );
 
-			}
+							v( vert.x, vert.y, - z );
+							if ( t == 0 ) oneHoleVertices.push( vert );
 
-			if ( expandedHoleVertices.length == 0 ) {
+						}
 
-				for ( let h = 0, hl = numHoles; h < hl; h ++ ) {
+						if ( t == 0 ) expandedHoleVertices.push( oneHoleVertices );
 
-					expandedHoleVertices.push( holes[ h ] ); //triangulateShape expects a Vec2[][], ie. an array of holes, with each hole being a Vec2[]
+					}
 
 				}
 
-			}
+				faces = ShapeUtils.triangulateShape( contractedContourVertices, expandedHoleVertices );
 
-			const faces = ShapeUtils.triangulateShape( contractedContourVertices, expandedHoleVertices );
+			}
 
 			const flen = faces.length;