@@ -227,9 +227,9 @@ double winding_number(const Point<T, 2>& q,
227227{
228228 bool dummy_isOnCurve = false ;
229229 double ret_val = 0.0 ;
230- for (int i = 0 ; i < carray. size (); i++ )
230+ for (auto & curv : carray)
231231 {
232- ret_val += detail::bezier_winding_number (q, carray[i] , dummy_isOnCurve, edge_tol, EPS);
232+ ret_val += detail::bezier_winding_number (q, curv , dummy_isOnCurve, edge_tol, EPS);
233233 }
234234
235235 return ret_val;
@@ -321,7 +321,7 @@ double winding_number(const Point<T, 2>& q,
321321 * \brief Computes the GWN for a 2D point wrt an array of memoized data for 2D NURBS curves
322322 *
323323 * \param [in] query The query point to test
324- * \param [in] nurbs_curve_arr The array of memoized curve objects
324+ * \param [in] nurbs_cache_arr The array of memoized curve objects
325325 * \param [out] isOnCurve Set to true is the query point is on the curve
326326 * \param [in] edge_tol The physical distance level at which objects are considered indistinguishable
327327 * \param [in] EPS Miscellaneous numerical tolerance level for nonphysical distances
@@ -330,17 +330,17 @@ double winding_number(const Point<T, 2>& q,
330330 */
331331template <typename T>
332332double winding_number (const Point<T, 2 >& query,
333- const axom::Array<detail::NURBSCurveGWNCache<T>>& nurbs_curve_arr ,
333+ const axom::Array<detail::NURBSCurveGWNCache<T>>& nurbs_cache_arr ,
334334 bool & isOnCurve,
335335 double edge_tol = 1e-8 ,
336336 double EPS = 1e-8 )
337337{
338338 double gwn = 0 ;
339339 isOnCurve = false ;
340- for (int i = 0 ; i < nurbs_curve_arr. size (); ++i )
340+ for (auto & the_cache : nurbs_cache_arr )
341341 {
342342 bool isOnThisCurve = false ;
343- gwn += winding_number (query, nurbs_curve_arr[i] , isOnThisCurve, edge_tol, EPS);
343+ gwn += winding_number (query, the_cache , isOnThisCurve, edge_tol, EPS);
344344 isOnCurve = isOnCurve || isOnThisCurve;
345345 }
346346
@@ -383,12 +383,12 @@ axom::Array<double> winding_number(const axom::Array<Point<T, 2>>& query_arr,
383383 {
384384 ret_val[n] = 0.0 ;
385385
386- for (int i = 0 ; i < nurbs_cache_arr. size (); ++i )
386+ for (auto & the_cache : nurbs_cache_arr)
387387 {
388- for (int k = 0 ; k < nurbs_cache_arr[i] .getNumKnotSpans (); ++k)
388+ for (int k = 0 ; k < the_cache .getNumKnotSpans (); ++k)
389389 {
390390 ret_val[n] += detail::bezier_winding_number_memoized (query_arr[n],
391- nurbs_cache_arr[i] ,
391+ the_cache ,
392392 k,
393393 0 ,
394394 0 ,
@@ -424,9 +424,9 @@ axom::Array<double> winding_number(const axom::Array<Point<T, 2>>& query_arr,
424424{
425425 axom::Array<detail::NURBSCurveGWNCache<T>> cache_arr (0 , curve_arr.size ());
426426
427- for (int i = 0 ; i < curve_arr. size (); ++i )
427+ for (auto & curv : curve_arr)
428428 {
429- cache_arr.emplace_back (detail::NURBSCurveGWNCache<T>(curve_arr[i] , edge_tol));
429+ cache_arr.emplace_back (detail::NURBSCurveGWNCache<T>(curv , edge_tol));
430430 }
431431
432432 return winding_number (query_arr, cache_arr, edge_tol, EPS);
@@ -902,9 +902,9 @@ axom::Array<double> winding_number(const axom::Array<Point<T, 3>>& query_arr,
902902{
903903 // Precompute the expansions and cast directions for each patch
904904 axom::Array<detail::NURBSPatchGWNCache<T>> nurbs_cache_arr (0 , surf_arr.size ());
905- for (int i = 0 ; i < surf_arr. size (); ++i )
905+ for (autp& surf : surf_arr)
906906 {
907- nurbs_cache_arr.emplace_back (detail::NURBSPatchGWNCache<T>(surf_arr[i] ));
907+ nurbs_cache_arr.emplace_back (detail::NURBSPatchGWNCache<T>(surf ));
908908 }
909909
910910 return winding_number (query_arr, nurbs_cache_arr, edge_tol, ls_tol, quad_tol, disk_size, EPS);
0 commit comments