mirror of
https://github.com/bherbruck/solidcraft.git
synced 2026-11-18 14:40:54 +00:00
4176181733
* solidcore: the curve-against-surface certificate moves to nurbs::certificate `span_bound` (the proved bound between a surface and a curve between two nodes, by the convex hull of Bernstein coefficients) and its helpers move from sweep/loft_rails/certificate.rs to nurbs/certificate.rs unchanged, so the Gordon surface (nurbs) can certify a curve against its surface without depending on sweep. One copy: the railed loft calls it from there; its own code and tests are unchanged. The operation name in its refusals follows the path (`nurbs::certificate`), and the panic-site list's four proven rows follow the file. Not built or run locally (CI is the check). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * solidcore: Gordon tests for a network whose crossings are not at common parameters (fails on main) A deck: a roofline and a shoulder fitted through the same five stations along x at different heights (chord-length parameters, as edit-point curves are), so their parameters differ at each station, and three sections across ending on the rails' own points. Every crossing is exact, yet main refuses it (`Gap` at the mean parameters). The test asks for a surface within 1e-3 with each of the five curves on it within the returned bound, checked independently by the kernel's projection at 21 points each. It fails on main. A section that dips below the roofline and crosses it again is refused (`Crossings`, two or more), as on main. Not built or run locally (CI is the check). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * solidcore: Gordon refits a network whose crossings are not at common parameters A network whose curves cross once each and in order, but not at common parameters (two curves through the same stations at different heights, each parameterised by its own chord lengths), was refused with `Gap` at the mean parameters. `gordon` now builds it: where the compatible build (`build`, today's code moved as it was) refuses with a gap, `refitted` samples each curve of a family that is off along its monotone map from the common parameters to its own crossing parameters (Fritsch and Butland's monotone cubic), interpolates it at the common ones at its own degree with averaged knots (the crossings are interpolation sites, so they land there exactly, and the family shares one knot vector), builds the surface from the refits, and proves each INPUT curve within the bound of the surface span by span between its crossings with the geometric certificate (`nurbs::certificate::span_bound`, no parametric correspondence trusted). A span past the tolerance doubles the refit's points, 8 to 64 a span; past them PastTolerance. A compatible network takes `build` unchanged: the same surface and bound as before. Still refused: a pair not crossing once, crossings out of order, an outer curve crossing short of a curve's end (the original Gap), past the tolerance. The network preparation (`network`) is shared by both paths. Tests: the deck from the previous commit now builds; a compatible network's surface (degrees, knots, every control point's bits) and bound equal `build`'s; the monotone map goes through its points and increases. Not built or run locally (CI is the check). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * solidcore-ops: network::gordon's docs say what the kernel's Gordon takes now The docs still asked for a compatible network (every curve crossing the other family at one parameter). The kernel now refits a family whose crossings are not at common parameters and proves each input curve on the surface between its crossings, so the docs say that, and that NetworkGap is now left for an outer curve crossing a curve short of its end. Docs only. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * solidcore: a refitted Gordon network's curves are certified at every refit site The deck was refused at 0.0676 whatever the refit's points: inputs_on gave span_bound nodes only at the crossings, and span_bound cuts each piece at the surface's knot lines with the curve's parameter interpolated linearly between its nodes. The refit's knots lie between the crossings, and the monotone map is not linear there, so each cut slid along the rail by the map's departure from the line (about 0.0013 in parameter on the deck's roofline, some 0.066 along it), a floor no halving or doubling lowers. The refit itself lands the crossings exactly. The nodes are now every refit site, at the parameter the refit went through there (monotone(at, own, x)); the sites come from one helper the refit shares. A new test compares the refit with the original rails at each site and checks the crossings land exactly. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> --------- Co-authored-by: jyviko <2501648+jyviko@users.noreply.github.com> Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com>
163 KiB
Vendored
163 KiB
Vendored
| 1 | # Panic-prone calls in library code that no deny lint catches (#2490). Written by | ||||||
|---|---|---|---|---|---|---|---|
| 2 | # scripts/ci/check_panic_sites.py --update; may only shrink. Fix a site with a typed | ||||||
| 3 | # SolidError (checked arithmetic, .get(), a length check) and drop its row. `proven` marks | ||||||
| 4 | # a site that cannot panic, with the reason; it is exempt from the ratchet. | ||||||
| 5 | file | fn | pattern | n | status | code | reason |
| 6 | crates/solidcore-step/src/eval.rs | BSplineSurface::point | with_capacity | 1 | proven | Vec::with_capacity(nu) | nu = points.len(), already in memory |
| 7 | crates/solidcore-step/src/eval.rs | expanded | with_capacity | 1 | proven | Vec::with_capacity(total) | total == points + degree + 1 with degree < points, checked just above: at most twice the points, already in memory |
| 8 | crates/solidcore-step/src/read.rs | Reader::bspline_surface | with_capacity | 1 | proven | Vec::with_capacity(rows.len().min(MAX_CTRL)) | rows.len() of rows already in memory, and at most MAX_CTRL |
| 9 | crates/solidcore-step/src/read.rs | Reader::read_curve | with_capacity | 1 | proven | Vec::with_capacity(items.len()) | the length of a collection already in memory |
| 10 | crates/solidcore-step/src/read.rs | implied_knots | int-div | 1 | proven | (n_ctrl - 1) / degree | degree == 0 is refused just above |
| 11 | crates/solidcore-step/src/read.rs | knots | windows | 1 | proven | windows(2) | constant non-zero size |
| 12 | crates/solidcore-step/src/read.rs | knots | with_capacity | 1 | proven | Vec::with_capacity(raw.len()) | the length of a collection already in memory |
| 13 | crates/solidcore-step/src/read.rs | knots | with_capacity | 2 | proven | Vec::with_capacity(raw.len()) | the length of a collection already in memory |
| 14 | crates/solidcore-step/src/topology.rs | Builder::bound | with_capacity | 1 | proven | Vec::with_capacity(ids.len()) | the length of a collection already in memory |
| 15 | crates/solidcore-step/src/topology.rs | Builder::face | with_capacity | 1 | proven | Vec::with_capacity(bounds.len()) | the length of a collection already in memory |
| 16 | crates/solidcore-step/src/topology.rs | Builder::face_extent | with_capacity | 1 | proven | Vec::with_capacity(face.loops.len()) | the length of a collection already in memory |
| 17 | crates/solidcore-step/src/topology.rs | Builder::face_extent | with_capacity | 2 | proven | Vec::with_capacity(es.len()) | the length of a collection already in memory |
| 18 | crates/solidcore-step/src/topology.rs | Builder::face_pcurves | with_capacity | 1 | proven | Vec::with_capacity(l.len()) | the length of a collection already in memory |
| 19 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 1 | proven | Vec::with_capacity(self.faces.len()) | the length of a collection already in memory |
| 20 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 2 | proven | Vec::with_capacity(self.faces.len()) | the length of a collection already in memory |
| 21 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 3 | proven | Vec::with_capacity(self.faces.len()) | the length of a collection already in memory |
| 22 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 4 | proven | Vec::with_capacity(nf) | nf = self.faces.len(), already in memory |
| 23 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 5 | proven | Vec::with_capacity(self.edges.len()) | the length of a collection already in memory |
| 24 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 6 | proven | Vec::with_capacity(self.vertices.len()) | the length of a collection already in memory |
| 25 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 7 | proven | Vec::with_capacity(flipped) | flipped counts the entries of turned, a list in memory |
| 26 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 8 | proven | Vec::with_capacity(vertex_order.len()) | the length of a collection already in memory |
| 27 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 9 | proven | Vec::with_capacity(edge_order.len()) | the length of a collection already in memory |
| 28 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 10 | proven | Vec::with_capacity(face_order.len()) | the length of a collection already in memory |
| 29 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 11 | proven | Vec::with_capacity(face_order.len()) | the length of a collection already in memory |
| 30 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 12 | proven | Vec::with_capacity(face.loops.len()) | the length of a collection already in memory |
| 31 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 13 | proven | Vec::with_capacity(face.loops.len()) | the length of a collection already in memory |
| 32 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 14 | proven | Vec::with_capacity(es.len()) | the length of a collection already in memory |
| 33 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 15 | proven | Vec::with_capacity(shells.len()) | the length of a collection already in memory |
| 34 | crates/solidcore-step/src/topology.rs | Builder::finish | with_capacity | 16 | proven | Vec::with_capacity(s.len()) | the length of a collection already in memory |
| 35 | crates/solidcore-step/src/topology.rs | Builder::poly_loop | int-rem | 1 | proven | (k + 1) % pts.len() | pts.len() < 3 returns an Err just above, so the divisor is at least 3 |
| 36 | crates/solidcore-step/src/topology.rs | Builder::poly_loop | with_capacity | 1 | proven | Vec::with_capacity(pts.len()) | the length of a collection already in memory |
| 37 | crates/solidcore-step/src/topology.rs | Builder::shell | with_capacity | 1 | proven | Vec::with_capacity(faces.len()) | the length of a collection already in memory |
| 38 | crates/solidcore-step/src/topology.rs | Builder::trim_face | with_capacity | 1 | proven | Vec::with_capacity(edge_loops.len()) | the length of a collection already in memory |
| 39 | crates/solidcore-step/src/topology.rs | Builder::trim_face | with_capacity | 2 | proven | Vec::with_capacity(l.len()) | the length of a collection already in memory |
| 40 | crates/solidcore-step/src/topology.rs | face_domain | f64::clamp | 1 | proven | clamp(*n0, last) | n0 <= last is checked just above (crossed or NaN bounds are refused with an Err) |
| 41 | crates/solidcore-step/src/topology.rs | full_knots | with_capacity | 1 | proven | Vec::with_capacity(total) | total == count + degree + 1 with count <= MAX_SPLINE_POINTS and degree <= MAX_SPLINE_DEGREE, all checked just above |
| 42 | crates/solidcore-step/src/topology.rs | loop_area | windows | 1 | proven | windows(2) | constant non-zero size |
| 43 | crates/solidcore-step/src/topology.rs | map_edge | windows | 1 | proven | windows(2) | constant non-zero size |
| 44 | crates/solidcore-step/src/topology.rs | project | Ord::clamp | 1 | proven | clamp(1, 8) | constant bounds, min <= max |
| 45 | crates/solidcore-step/src/topology.rs | project | f64::clamp | 1 | proven | clamp(a, b) | a < b: the only caller, open_or_closed, refuses !(a < b) (which a NaN fails too) |
| 46 | crates/solidcore-step/src/topology.rs | project | int-div | 1 | proven | MAX_SAMPLES / spans | spans = breaks.len() + 1 >= 1 |
| 47 | crates/solidcore-step/src/topology.rs | project | int-div | 2 | proven | div_ceil(MAX_SAMPLES) | constant non-zero divisor MAX_SAMPLES (4096) |
| 48 | crates/solidcore-step/src/topology.rs | project | step_by | 1 | proven | step_by(stride) | ts.len() > MAX_SAMPLES just above, so stride = ts.len().div_ceil(MAX_SAMPLES) >= 1 |
| 49 | crates/solidcore-step/src/topology.rs | project | with_capacity | 1 | proven | Vec::with_capacity(spans * per + 1) | spans = breaks.len() + 1 of a list in memory, per <= 8 |
| 50 | crates/solidcore-step/src/topology.rs | read_solids_in | with_capacity | 1 | proven | Vec::with_capacity(solids.len()) | the length of a collection already in memory |
| 51 | crates/solidcore-step/src/topology.rs | read_with | with_capacity | 1 | proven | Vec::with_capacity(ids.len()) | the length of a collection already in memory |
| 52 | crates/solidcore-step/src/topology.rs | seam_only | int-div | 1 | proven | uses.len() / 2 | constant non-zero divisor |
| 53 | crates/solidcore-step/src/topology.rs | tolerance | f64::clamp | 1 | proven | clamp(MIN_TOLERANCE, MAX_FIT_TOLERANCE) | constant bounds MIN_TOLERANCE (1e-7) <= MAX_FIT_TOLERANCE (1.0) |
| 54 | crates/solidcore-step/src/topology.rs | uses_of | with_capacity | 1 | proven | Vec::with_capacity(edge_loops.len()) | the length of a collection already in memory |
| 55 | crates/solidcore-step/src/topology.rs | uses_of | with_capacity | 2 | proven | Vec::with_capacity(l.len()) | the length of a collection already in memory |
| 56 | crates/solidcore-step/src/topology/frames.rs | Builder::turn_about_axes | windows | 1 | proven | windows(2) | constant non-zero size |
| 57 | crates/solidcore-step/src/topology/frames.rs | Builder::turn_about_axes | with_capacity | 1 | proven | Vec::with_capacity(g.len()) | the length of a collection already in memory |
| 58 | crates/solidcore-step/src/topology/seams.rs | Builder::meridian_slit | with_capacity | 1 | proven | Vec::with_capacity(2 * up.len() + 4) | twice a collection in memory plus 4 |
| 59 | crates/solidcore-step/src/topology/seams.rs | Builder::seated | int-div | 1 | proven | path.len() / 2 | constant non-zero divisor |
| 60 | crates/solidcore-step/src/topology/seams.rs | Builder::split_edge | with_capacity | 1 | proven | Vec::with_capacity(es.len() + 1) | a collection in memory plus one |
| 61 | crates/solidcore-step/src/topology/seams.rs | remove_loop | Vec::remove | 1 | proven | remove(gone) | gone >= face.loops.len() returns just above |
| 62 | crates/solidcore-step/src/topology/seams.rs | restarted | with_capacity | 1 | proven | Vec::with_capacity(columns) | columns = rows.first().len(), already in memory |
| 63 | crates/solidcore-step/src/topology/seams.rs | slit_path | int-div | 1 | proven | n / 2 | constant non-zero divisor |
| 64 | crates/solidcore-step/src/topology/seams.rs | slit_path | int-rem | 1 | proven | (k + n - 1) % n | n >= 2 is checked just above |
| 65 | crates/solidcore-step/src/topology/seams.rs | slit_path | split_at | 1 | proven | split_at(n / 2) | ring has n = es.len() entries, so n / 2 <= ring.len() |
| 66 | crates/solidcore-step/src/topology/swept.rs | hyperbola_spline | Ord::clamp | 1 | proven | clamp(1, MAX_PIECES) | constant bounds 1 <= MAX_PIECES (64) |
| 67 | crates/solidcore-step/src/topology/swept.rs | revolution | int-div | 1 | proven | ts.len() / 2 | constant non-zero divisor |
| 68 | crates/solidcore-step/src/topology/swept.rs | whole | windows | 1 | proven | windows(2) | constant non-zero size |
| 69 | crates/solidcore-step/src/topology/swept.rs | widest_gap | windows | 1 | proven | windows(2) | constant non-zero size |
| 70 | crates/solidcore-step/src/write/topology.rs | BrepWriter::edge_geometry | with_capacity | 1 | proven | Vec::with_capacity(edge.uses.len()) | the length of a collection already in memory |
| 71 | crates/solidcore-step/src/write/topology.rs | BrepWriter::face | with_capacity | 1 | proven | Vec::with_capacity(face.loops.len()) | the length of a collection already in memory |
| 72 | crates/solidcore-step/src/write/topology.rs | BrepWriter::face | with_capacity | 2 | proven | Vec::with_capacity(edges.len()) | the length of a collection already in memory |
| 73 | crates/solidcore-step/src/write/topology.rs | BrepWriter::shell | with_capacity | 1 | proven | Vec::with_capacity(faces.len()) | the length of a collection already in memory |
| 74 | crates/solidcore-step/src/write/topology.rs | brep | with_capacity | 1 | proven | Vec::with_capacity(solid.voids.len()) | the length of a collection already in memory |
| 75 | crates/solidcore-step/src/write/topology.rs | brep | with_capacity | 2 | proven | Vec::with_capacity(layout.sheets.len()) | the length of a collection already in memory |
| 76 | crates/solidcore-step/src/write/topology.rs | pcurve | with_capacity | 1 | proven | Vec::with_capacity(homogeneous.len()) | the length of a collection already in memory |
| 77 | crates/solidcore-step/src/write/topology.rs | pcurve | with_capacity | 2 | proven | Vec::with_capacity(homogeneous.len()) | the length of a collection already in memory |
| 78 | crates/solidcore-step/src/write/topology.rs | signed_area | int-rem | 1 | proven | (i + 1) % n | inside a range 0..n, so n > 0 |
| 79 | crates/solidcore-step/src/write/topology.rs | surface | with_capacity | 1 | proven | Vec::with_capacity(homogeneous.len()) | the length of a collection already in memory |
| 80 | crates/solidcore-step/src/write/topology.rs | surface | with_capacity | 2 | proven | Vec::with_capacity(homogeneous.len()) | the length of a collection already in memory |
| 81 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_corner_edge_geom | with_capacity | 1 | proven | Vec::with_capacity(n) | n = contacts.len(), an in-memory collection |
| 82 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_inverse | int-rem | 1 | proven | (j + 1) % 3 | constant non-zero divisor |
| 83 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_inverse | int-rem | 2 | proven | (j + 2) % 3 | constant non-zero divisor |
| 84 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_inverse | int-rem | 3 | proven | (i + 1) % 3 | constant non-zero divisor |
| 85 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_inverse | int-rem | 4 | proven | (i + 2) % 3 | constant non-zero divisor |
| 86 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_triangle_patch | int-rem | 1 | proven | (pole + 1) % 3 | constant non-zero divisor |
| 87 | crates/solidcore/src/blend/blend_corner/ball.rs | ball_triangle_patch | int-rem | 2 | proven | (pole + 2) % 3 | constant non-zero divisor |
| 88 | crates/solidcore/src/blend/blend_corner/ball.rs | classify_ball | with_capacity | 1 | proven | Vec::with_capacity(n) | n = all_eus.len(), an in-memory slice |
| 89 | crates/solidcore/src/blend/blend_corner/ball.rs | classify_ball | with_capacity | 2 | proven | Vec::with_capacity(n) | n = all_eus.len(), an in-memory slice |
| 90 | crates/solidcore/src/blend/blend_corner/ball.rs | ring_faces | int-rem | 1 | proven | (ii + n - 1) % n | inside faces.iter_mut().enumerate() with faces = vec![None; n], so n > 0 |
| 91 | crates/solidcore/src/blend/blend_corner/chamfer.rs | bilinear_face | int-rem | 1 | proven | (i + 1) % 4 | constant non-zero divisor |
| 92 | crates/solidcore/src/blend/blend_corner/chamfer.rs | chamfer_corner_edge_geom | int-rem | 1 | proven | (i + 1) % count | inside xs.iter().enumerate(), so count = xs.len() > 0 |
| 93 | crates/solidcore/src/blend/blend_corner/chamfer.rs | chamfer_corner_edge_geom | int-rem | 2 | proven | (j + 1) % count | inside order.iter().enumerate() with order = (0..count).collect(), so count > 0 |
| 94 | crates/solidcore/src/blend/blend_corner/chamfer.rs | chamfer_planes | int-rem | 1 | open | (i + n - 1) % n | |
| 95 | crates/solidcore/src/blend/blend_corner/chamfer.rs | chamfer_planes | int-rem | 2 | open | (i + 1) % n | |
| 96 | crates/solidcore/src/blend/blend_corner/chamfer.rs | classify_chamfer | int-rem | 1 | proven | (i + n - 1) % n | n in 3..=MAX_CHAMFERS: the function returns above when not |
| 97 | crates/solidcore/src/blend/blend_corner/chamfer.rs | corner_patch | int-rem | 1 | proven | (i + n - 1) % n | inside xs.iter().enumerate(), so n = xs.len() > 0 |
| 98 | crates/solidcore/src/blend/blend_corner/chamfer.rs | crossing_rows | int-rem | 1 | open | (i + n - 1) % n | |
| 99 | crates/solidcore/src/blend/blend_corner/chamfer.rs | crossings | int-rem | 1 | proven | (i + n - 1) % n | inside for i in 0..n, so n > 0 (n = mu.len()) |
| 100 | crates/solidcore/src/blend/blend_corner/chamfer.rs | facet_fails | int-rem | 1 | proven | (i + n - 1) % n | inside xs.iter().enumerate(), so n = xs.len() > 0 |
| 101 | crates/solidcore/src/blend/blend_corner/chamfer.rs | facet_plane | int-rem | 1 | proven | (i + 1) % n | inside xs.iter().enumerate(), so n = xs.len() > 0 |
| 102 | crates/solidcore/src/blend/blend_corner/chamfer.rs | mitre_tests | int-rem | 1 | proven | (i + 1) % 3 | constant non-zero divisor |
| 103 | crates/solidcore/src/blend/blend_corner/chamfer.rs | newell | int-rem | 1 | proven | (i + 1) % n | inside xs.iter().enumerate(), so n = xs.len() > 0 |
| 104 | crates/solidcore/src/blend/blend_corner/chamfer.rs | patch_faces | int-rem | 1 | proven | m % n | n >= 4: the function returns above when not |
| 105 | crates/solidcore/src/blend/blend_corner/chamfer.rs | ring_faces | int-rem | 1 | proven | (i + n - 1) % n | inside for i in 0..n, so n > 0 (n = all_eus.len()) |
| 106 | crates/solidcore/src/blend/blend_corner/end.rs | fit_of_end_past_side_edges | int-rem | 1 | proven | (fil + total - 1) % total | returns early when total < 3 |
| 107 | crates/solidcore/src/blend/blend_corner/end.rs | fit_of_end_past_side_edges | int-rem | 2 | proven | (fil + 1) % total | total >= 3: the function returns above when not |
| 108 | crates/solidcore/src/blend/blend_corner/mixed/algebra.rs | boehm | Vec::insert | 1 | open | insert(k + 1, t) | |
| 109 | crates/solidcore/src/blend/blend_corner/mixed/algebra.rs | srf_to_bspline | int-div | 1 | proven | ii / srf.du | srf.du > 0: the function returns above when it is 0 |
| 110 | crates/solidcore/src/blend/blend_corner/mixed/algebra.rs | srf_to_bspline | int-div | 2 | proven | jj / srf.dv | srf.dv > 0: the function returns above when it is 0 |
| 111 | crates/solidcore/src/blend/blend_corner/mixed/algebra.rs | tensor_u | split_at | 1 | open | split_at_mut(k) | |
| 112 | crates/solidcore/src/blend/blend_corner/setback.rs | build_setback_fill | int-rem | 1 | open | (m + ee) % n | |
| 113 | crates/solidcore/src/blend/blend_corner/setback.rs | build_setback_fill | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 114 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | int-rem | 1 | open | (i + n - 1) % n | |
| 115 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | int-rem | 2 | open | (i + n - 1) % n | |
| 116 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | int-rem | 3 | open | (i + 1) % n | |
| 117 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 118 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | with_capacity | 2 | open | Vec::with_capacity(n) | |
| 119 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | with_capacity | 3 | open | Vec::with_capacity(n) | |
| 120 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_planes | with_capacity | 4 | open | Vec::with_capacity(n) | |
| 121 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | int-rem | 1 | open | (i + n - 1) % n | |
| 122 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | int-rem | 2 | open | (i + n - 1) % n | |
| 123 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | int-rem | 3 | open | (i + 1) % n | |
| 124 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 125 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | with_capacity | 2 | open | Vec::with_capacity(n) | |
| 126 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | with_capacity | 3 | open | Vec::with_capacity(n) | |
| 127 | crates/solidcore/src/blend/blend_corner/setback.rs | corner_quadrics | with_capacity | 4 | open | Vec::with_capacity(n) | |
| 128 | crates/solidcore/src/blend/blend_corner/setback.rs | create_setback_patches | with_capacity | 1 | open | Vec::with_capacity(sides.len()) | |
| 129 | crates/solidcore/src/blend/blend_corner/setback.rs | create_setback_patches | with_capacity | 2 | open | Vec::with_capacity(sides.len()) | |
| 130 | crates/solidcore/src/blend/blend_corner/setback.rs | create_setback_patches | with_capacity | 3 | open | Vec::with_capacity(sides.len()) | |
| 131 | crates/solidcore/src/blend/blend_corner/setback.rs | curved_least | int-rem | 1 | open | (i + n - 1) % n | |
| 132 | crates/solidcore/src/blend/blend_corner/setback.rs | curved_least | int-rem | 2 | open | (i + 1) % n | |
| 133 | crates/solidcore/src/blend/blend_corner/setback.rs | gather_ends | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 134 | crates/solidcore/src/blend/blend_corner/setback.rs | gather_ends | with_capacity | 2 | open | Vec::with_capacity(n) | |
| 135 | crates/solidcore/src/blend/blend_corner/setback.rs | make_setback_topology | int-rem | 1 | open | (i + n - 1) % n | |
| 136 | crates/solidcore/src/blend/blend_corner/setback.rs | make_setback_topology | int-rem | 2 | open | (i + 1) % n | |
| 137 | crates/solidcore/src/blend/blend_corner/setback.rs | make_setback_topology | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 138 | crates/solidcore/src/blend/blend_corner/setback.rs | make_setback_topology | with_capacity | 2 | open | Vec::with_capacity(n) | |
| 139 | crates/solidcore/src/blend/blend_corner/setback.rs | open_setback_springs | int-rem | 1 | open | (f + n - 1) % n | |
| 140 | crates/solidcore/src/blend/blend_setback.rs | affine_solutions | swap | 1 | open | swap(pi * n + j, r * n + j) | |
| 141 | crates/solidcore/src/blend/blend_setback.rs | affine_solutions | swap | 2 | open | swap(pi, r) | |
| 142 | crates/solidcore/src/blend/blend_setback.rs | affine_solutions | swap | 3 | open | swap(i * n + pj, i * n + r) | |
| 143 | crates/solidcore/src/blend/blend_setback.rs | affine_solutions | swap | 4 | open | swap(pj, r) | |
| 144 | crates/solidcore/src/blend/blend_setback.rs | basis | with_capacity | 1 | open | Vec::with_capacity(p + 1) | |
| 145 | crates/solidcore/src/blend/blend_setback.rs | distances | with_capacity | 1 | open | Vec::with_capacity(le) | |
| 146 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 1 | open | m % n | |
| 147 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 2 | open | (m + 1) % n | |
| 148 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 3 | open | (m + n - 1) % n | |
| 149 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 4 | open | (m + 1) % n | |
| 150 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 5 | open | (m + 1) % n | |
| 151 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 6 | open | (q + 1) % n | |
| 152 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | int-rem | 7 | open | (q + n - 1) % n | |
| 153 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 154 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 2 | open | Vec::with_capacity(n) | |
| 155 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 3 | open | Vec::with_capacity(n) | |
| 156 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 4 | open | Vec::with_capacity(n) | |
| 157 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 5 | open | Vec::with_capacity(n) | |
| 158 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 6 | open | Vec::with_capacity(n) | |
| 159 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 7 | open | Vec::with_capacity(n) | |
| 160 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 8 | open | Vec::with_capacity(n) | |
| 161 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 10 | open | Vec::with_capacity(n) | |
| 162 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 11 | open | Vec::with_capacity(n) | |
| 163 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 12 | open | Vec::with_capacity(n) | |
| 164 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 13 | open | Vec::with_capacity(mc) | |
| 165 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 14 | open | Vec::with_capacity(2 * n) | |
| 166 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 15 | open | Vec::with_capacity(row.len()) | |
| 167 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 16 | open | Vec::with_capacity(2 * n) | |
| 168 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 17 | open | Vec::with_capacity(net.pts.len()) | |
| 169 | crates/solidcore/src/blend/blend_setback.rs | fill_hole_with | with_capacity | 18 | open | Vec::with_capacity(net.pts.len()) | |
| 170 | crates/solidcore/src/blend/blend_setback.rs | round_jets | int-div | 1 | open | pts.len() / (lq + 1) | |
| 171 | crates/solidcore/src/blend/blend_setback.rs | round_jets | int-rem | 1 | proven | (d - l) % 2 | constant non-zero divisor |
| 172 | crates/solidcore/src/blend/blend_setback/certify.rs | fundamentals | int-rem | 1 | proven | (3 + c) % 2 | constant non-zero divisor |
| 173 | crates/solidcore/src/blend/blend_setback/certify.rs | sides_on_planes | int-rem | 1 | proven | (m + e) % n | inside while m < n, so n > 0 |
| 174 | crates/solidcore/src/blend/blend_setback/certify.rs | t_det3 | int-rem | 1 | proven | (j + 1) % 3 | constant non-zero divisor |
| 175 | crates/solidcore/src/blend/blend_setback/certify.rs | t_det3 | int-rem | 2 | proven | (j + 2) % 3 | constant non-zero divisor |
| 176 | crates/solidcore/src/blend/blend_setback/certify.rs | t_det4 | int-rem | 1 | proven | (3 + c) % 2 | constant non-zero divisor |
| 177 | crates/solidcore/src/blend/blend_setback/convexity.rs | SectorRows::add_patch | windows | 1 | proven | windows(2) | constant non-zero size |
| 178 | crates/solidcore/src/blend/blend_setback/convexity.rs | patch_curvatures | with_capacity | 1 | proven | Vec::with_capacity(patches.len()) | patches.len(), an in-memory slice |
| 179 | crates/solidcore/src/blend/blend_setback/curved.rs | containment_curved | int-rem | 1 | open | (i + 1) % n | |
| 180 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 1 | open | m % n | |
| 181 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 2 | open | (m + n - 1) % n | |
| 182 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 3 | open | (m + 1) % n | |
| 183 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 4 | open | (m + 1) % n | |
| 184 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 5 | open | (q + 1) % n | |
| 185 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 6 | open | (q + n - 1) % n | |
| 186 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 7 | open | (m + 1) % n | |
| 187 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 8 | open | (m + n - 1) % n | |
| 188 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 9 | open | (q + n - 1) % n | |
| 189 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | int-rem | 10 | open | (q + 1) % n | |
| 190 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | with_capacity | 1 | open | Vec::with_capacity(2 * n) | |
| 191 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | with_capacity | 2 | open | Vec::with_capacity(2 * n) | |
| 192 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | with_capacity | 3 | open | Vec::with_capacity(2 * n) | |
| 193 | crates/solidcore/src/blend/blend_setback/curved.rs | graph_g1_curved | with_capacity | 4 | open | Vec::with_capacity(2 * n) | |
| 194 | crates/solidcore/src/blend/blend_setback/curved.rs | no_more_concave | with_capacity | 1 | open | Vec::with_capacity(c.control_points.len()) | |
| 195 | crates/solidcore/src/blend/blend_setback/curved.rs | t_det_with | int-rem | 1 | proven | (3 + c) % 2 | constant non-zero divisor |
| 196 | crates/solidcore/src/blend/blend_setback/graph.rs | fill_from | with_capacity | 1 | open | Vec::with_capacity(nets.len()) | |
| 197 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 1 | open | m % n | |
| 198 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 2 | open | (m + n - 1) % n | |
| 199 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 3 | open | (m + 1) % n | |
| 200 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 4 | open | (m + 1) % n | |
| 201 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 5 | open | (m + 1) % n | |
| 202 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 6 | open | (q + 1) % n | |
| 203 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 7 | open | (q + n - 1) % n | |
| 204 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 8 | open | (q + n - 1) % n | |
| 205 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | int-rem | 9 | open | (q + 1) % n | |
| 206 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | with_capacity | 1 | open | Vec::with_capacity(2 * n) | |
| 207 | crates/solidcore/src/blend/blend_setback/graph.rs | graph_gk | with_capacity | 2 | open | Vec::with_capacity(2 * n) | |
| 208 | crates/solidcore/src/blend/blend_setback/qp.rs | dual_run | Vec::remove | 1 | proven | remove(drop) | drop < active.len(): the function returns above when it is not |
| 209 | crates/solidcore/src/blend/blend_setback/qp.rs | dual_run | Vec::remove | 2 | proven | remove(drop) | u is pushed and removed with active, so u.len() == active.len() > drop |
| 210 | crates/solidcore/src/blend/blend_setback/scale.rs | Model::run | with_capacity | 1 | open | Vec::with_capacity(surfaces.len()) | |
| 211 | crates/solidcore/src/blend/blend_setback/scale.rs | bisect_thousandths | int-div | 1 | proven | (lo + hi) / 2 | constant non-zero divisor |
| 212 | crates/solidcore/src/blend/blend_setback/scale.rs | model_rounds | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 213 | crates/solidcore/src/blend/blend_setback/scale.rs | model_rounds | with_capacity | 2 | proven | Vec::with_capacity(6) | constant capacity |
| 214 | crates/solidcore/src/blend/blend_setback/scale.rs | model_rounds | with_capacity | 3 | proven | Vec::with_capacity(6) | constant capacity |
| 215 | crates/solidcore/src/blend/feature_executive.rs | FeatureExecutive::restore_features | Vec::remove | 1 | open | remove(ii) | |
| 216 | crates/solidcore/src/blend/feature_executive.rs | FeatureExecutive::take_off | Vec::remove | 1 | proven | remove(f.feature) | the index was just read by self.features.get_mut(f.feature), and kept is walked in descending order |
| 217 | crates/solidcore/src/blend/feature_executive.rs | collect_feature_loop_edges | Vec::remove | 1 | open | remove(kk) | |
| 218 | crates/solidcore/src/blend/feature_executive.rs | fix_edge_chain_list | Vec::remove | 1 | open | remove(id) | |
| 219 | crates/solidcore/src/blend/feature_executive.rs | fix_edge_chain_list | Vec::remove | 2 | open | remove(id) | |
| 220 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | close_round_loop | Vec::remove | 1 | proven | remove(i) | i is from enumerate() over the same Vec, with no intervening mutation |
| 221 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | close_round_loop | windows | 1 | proven | windows(2) | constant non-zero size |
| 222 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | closing_face | windows | 1 | proven | windows(2) | constant non-zero size |
| 223 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | face_of_loop | int-rem | 1 | proven | (i + 1) % uvs.len() | inside uvs.iter().enumerate(), so uvs.len() > 0 |
| 224 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | lamina_chains | Vec::insert | 1 | proven | insert(0, found) | index 0 is never past the end |
| 225 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | lamina_chains | Vec::insert | 2 | proven | insert(0, other) | index 0 is never past the end |
| 226 | crates/solidcore/src/blend/fillet_cliff_overflow.rs | loop_area | int-rem | 1 | proven | (i + 1) % uvs.len() | inside uvs.iter().enumerate(), so uvs.len() > 0 |
| 227 | crates/solidcore/src/blend/fillet_corner/p1.rs | FilletCorner::make_constant_radius_fillet_with | int-rem | 1 | open | (found_index + total_edges - 1) % total_edges | |
| 228 | crates/solidcore/src/blend/fillet_corner/p1.rs | FilletCorner::make_constant_radius_fillet_with | int-rem | 2 | open | (found_index + 1) % total_edges | |
| 229 | crates/solidcore/src/blend/fillet_corner/p1.rs | FilletCorner::squeeze_edge | Vec::remove | 1 | open | remove(found) | |
| 230 | crates/solidcore/src/blend/fillet_corner/p1.rs | FilletCorner::squeeze_edge | Vec::remove | 2 | open | remove(found) | |
| 231 | crates/solidcore/src/blend/fillet_corner/p1.rs | create_srf_of_revolution | int-rem | 1 | proven | (major + 2) % 4 | constant non-zero divisor |
| 232 | crates/solidcore/src/blend/fillet_corner/p1.rs | create_srf_of_revolution | int-rem | 2 | open | (major + 1) % total | |
| 233 | crates/solidcore/src/blend/fillet_corner/p1.rs | face_curve_half_along | windows | 1 | proven | windows(2) | constant non-zero size |
| 234 | crates/solidcore/src/blend/fillet_corner/p1.rs | face_curve_half_along | windows | 2 | proven | windows(2) | constant non-zero size |
| 235 | crates/solidcore/src/blend/fillet_corner/p1.rs | keep_end_definition | with_capacity | 1 | open | Vec::with_capacity(edges.len()) | |
| 236 | crates/solidcore/src/blend/fillet_corner/p2.rs | FilletCorner::adjust_topology_convex_nxn_with | Vec::insert | 1 | open | insert(found_vert_index, new_vert) | |
| 237 | crates/solidcore/src/blend/fillet_corner/p2.rs | FilletCorner::adjust_topology_convex_nxn_with | Vec::insert | 2 | open | insert(found_edge_index, new_edge) | |
| 238 | crates/solidcore/src/blend/fillet_corner/p2.rs | FilletCorner::adjust_topology_convex_nxn_with | int-rem | 1 | open | (ii + 1) % total | |
| 239 | crates/solidcore/src/blend/fillet_corner/p2.rs | FilletCorner::adjust_topology_convex_nxn_with | int-rem | 2 | open | (found_vert_index + total - 1) % total | |
| 240 | crates/solidcore/src/blend/fillet_corner/p2.rs | FilletCorner::adjust_topology_convex_nxn_with | int-rem | 3 | open | (found_vert_index + 1) % total | |
| 241 | crates/solidcore/src/blend/fillet_corner/p2.rs | FilletCorner::make_variable_radius_fillet_with | int-rem | 1 | open | i % total_edges | |
| 242 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::adjust_topology_nx2_with | Vec::insert | 1 | proven | insert(index, vert_on_side_face) | index < vertices.len() in one branch; in the other vertices.get(index - 1) succeeded, so index <= len |
| 243 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::adjust_topology_nx2_with | Vec::remove | 1 | proven | remove(index) | index < edges.len(): the function returns above when it is not |
| 244 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_3x2_with | Vec::remove | 1 | proven | remove(found_index) | found_index is from enumerate() over self.edges (returns above when none matched); edges unchanged since |
| 245 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_3x2_with | Vec::remove | 2 | proven | remove(idx) | idx is position() in the same Vec |
| 246 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_default_with | int-rem | 1 | proven | (ii + 1) % 3 | constant non-zero divisor |
| 247 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_default_with | int-rem | 2 | proven | (ii + 1) % total_edges | inside else if total_edges == 4 |
| 248 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_default_with | int-rem | 3 | proven | (init_index + ii) % total_edges | inside for ii in 0..total_edges, so total_edges > 0; its only other change adds 1 |
| 249 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_default_with | windows | 1 | proven | windows(2) | constant non-zero size |
| 250 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_default_with | with_capacity | 1 | proven | Vec::with_capacity(ordered_3d.len()) | ordered_3d.len(), an in-memory Vec |
| 251 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_nx2 | Vec::remove | 1 | proven | remove(0) | edges.len() == total_edges == 4: the function returns above when not |
| 252 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_nx2 | Vec::remove | 2 | proven | remove(0) | surfaces is not empty: the function returns above when it is |
| 253 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_nx2_with | Vec::remove | 1 | proven | remove(0) | edges.len() == total_edges == 4: the function returns above when not |
| 254 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletCorner::create_corner_patch_nx2_with | Vec::remove | 2 | proven | remove(0) | surfaces is not empty: the function returns above when it is |
| 255 | crates/solidcore/src/blend/fillet_corner/p3.rs | FilletExecutiveData::remove_from_topo_edges | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 256 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_convex_nxn_corner_topology | int-rem | 1 | proven | (count + 1) % total | vertex_at(self, 0) succeeded above, so total = vertices.len() > 0; vertices unchanged since |
| 257 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_convex_nxn_corner_topology | int-rem | 2 | proven | (count + 1) % total | vertex_at(self, 0) succeeded above, so total = vertices.len() > 0; vertices unchanged since |
| 258 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx1_corner_topology | int-rem | 1 | proven | (index + total - 1) % total | index is position() in all, so total = all.len() > 0 |
| 259 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx1_corner_topology | int-rem | 2 | proven | (index + 1) % total | index is position() in all, so total = all.len() > 0 |
| 260 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx1_corner_topology | int-rem | 3 | proven | (index + total - 1) % total | inside if .. && total > 3 |
| 261 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx1_corner_topology | int-rem | 4 | proven | (index + 1) % total | inside if .. && total > 3 |
| 262 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx1_corner_topology | int-rem | 5 | proven | (idx + total - 1) % total | inside if .. && total > 3 |
| 263 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx1_corner_topology | int-rem | 6 | proven | (idx + 1) % total | inside if .. && total > 3 |
| 264 | crates/solidcore/src/blend/fillet_corner/topology.rs | FilletCorner::make_nx2_corner_topology | int-rem | 1 | proven | (found1 + found2) % 2 | constant non-zero divisor |
| 265 | crates/solidcore/src/blend/fillet_corner/topology/ball.rs | FilletCorner::make_ball_topology | int-rem | 1 | proven | (ii + n - 1) % n | inside for ii in 0..n, so n > 0 (n = all.len(), not reassigned) |
| 266 | crates/solidcore/src/blend/fillet_corner/topology/ball.rs | FilletCorner::make_ball_topology | int-rem | 2 | proven | (ii + n - 1) % n | inside for ii in 0..n, so n > 0 (n = all.len(), not reassigned) |
| 267 | crates/solidcore/src/blend/fillet_corner/topology/ball.rs | FilletCorner::make_ball_topology | int-rem | 3 | proven | (ii + 1) % n | inside for ii in 0..n, so n > 0 (n = all.len(), not reassigned) |
| 268 | crates/solidcore/src/blend/fillet_corner/topology/ball.rs | FilletCorner::make_ball_topology | with_capacity | 1 | proven | Vec::with_capacity(n) | n = all.len(), an in-memory collection |
| 269 | crates/solidcore/src/blend/fillet_corner/topology/ball.rs | FilletCorner::make_ball_topology | with_capacity | 2 | proven | Vec::with_capacity(n) | n = all.len(), an in-memory collection |
| 270 | crates/solidcore/src/blend/fillet_corner/topology/concave_nxn.rs | FilletCorner::make_concave_nxn_corner_topology | Vec::insert | 1 | open | insert(jj, extra) | |
| 271 | crates/solidcore/src/blend/fillet_corner/topology/concave_nxn.rs | FilletCorner::make_concave_nxn_corner_topology | int-rem | 1 | proven | (jj + 1) % total | total starts at all.len() and all.last() is Some (returns above when not); it only grows |
| 272 | crates/solidcore/src/blend/fillet_corner/topology/end_corners.rs | FilletCorner::make_4x3_corner_topology | int-rem | 1 | proven | i % total_eus | total_eus > 0: the function returns above when it is 0 |
| 273 | crates/solidcore/src/blend/fillet_corner/topology/end_corners.rs | FilletCorner::make_4x3_corner_topology | int-rem | 2 | proven | i % total_eus | total_eus > 0: the function returns above when it is 0 |
| 274 | crates/solidcore/src/blend/fillet_corner/topology/end_corners.rs | FilletCorner::make_4x3_corner_topology | int-rem | 3 | proven | curr_index % total_solver_eus | total_solver_eus > 0: the function returns above when it is 0 |
| 275 | crates/solidcore/src/blend/fillet_corner/topology/join.rs | join_sides | int-rem | 1 | proven | (idx1 + 1) % total | idx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0 |
| 276 | crates/solidcore/src/blend/fillet_corner/topology/join.rs | join_sides | int-rem | 2 | proven | (kk + 1) % total | idx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0 |
| 277 | crates/solidcore/src/blend/fillet_corner/topology/join.rs | join_sides | int-rem | 3 | proven | (idx2 + 1) % total | idx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0 |
| 278 | crates/solidcore/src/blend/fillet_corner/topology/join.rs | join_sides | int-rem | 4 | proven | (kk + 1) % total | idx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0 |
| 279 | crates/solidcore/src/blend/fillet_corner/topology/mixed.rs | FilletCorner::make_mixed_topology | with_capacity | 1 | proven | Vec::with_capacity(6) | constant capacity |
| 280 | crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rs | FilletCorner::make_swept_topology | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 281 | crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rs | FilletCorner::make_swept_topology | with_capacity | 2 | proven | Vec::with_capacity(2) | constant capacity |
| 282 | crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rs | FilletCorner::make_swept_topology | with_capacity | 3 | proven | Vec::with_capacity(2) | constant capacity |
| 283 | crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rs | FilletCorner::make_swept_topology | with_capacity | 4 | proven | Vec::with_capacity(2) | constant capacity |
| 284 | crates/solidcore/src/blend/fillet_exact/rational.rs | calc_rational_spine_fillet_geom | int-div | 1 | proven | cand / 2 | constant non-zero divisor |
| 285 | crates/solidcore/src/blend/fillet_exact/rational.rs | calc_rational_spine_fillet_geom | int-rem | 1 | proven | cand % 2 | constant non-zero divisor |
| 286 | crates/solidcore/src/blend/fillet_exact/rational.rs | calc_rational_spine_fillet_geom | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 287 | crates/solidcore/src/blend/fillet_executive/p1.rs | FilletExecutive::remove_from_topo_edges | Vec::remove | 1 | open | remove(index) | |
| 288 | crates/solidcore/src/blend/fillet_executive/p2.rs | FilletExecutive::collect_tangent_edge_sequence_narrow | Vec::insert | 1 | proven | insert(0, prev) | index 0 is never past the end |
| 289 | crates/solidcore/src/blend/fillet_executive/session.rs | SessionEdgeLookup::solver_pair_ops_mut | split_at | 1 | open | split_at_mut(hi) | |
| 290 | crates/solidcore/src/blend/fillet_executive/session.rs | SessionObjects::calc_solver_geometry_noting | split_at | 1 | open | split_at_mut(index) | |
| 291 | crates/solidcore/src/blend/fillet_executive/session/ball_regular.rs | ball_is_regular | with_capacity | 1 | open | Vec::with_capacity(STEPS) | |
| 292 | crates/solidcore/src/blend/fillet_executive/session/ball_regular.rs | ball_is_regular | with_capacity | 2 | open | Vec::with_capacity(STEPS) | |
| 293 | crates/solidcore/src/blend/fillet_executive/session/ball_regular.rs | ball_is_regular | with_capacity | 3 | open | Vec::with_capacity(STEPS) | |
| 294 | crates/solidcore/src/blend/fillet_executive/session/ball_regular.rs | solve4 | swap | 1 | open | swap(kk, pivot) | |
| 295 | crates/solidcore/src/blend/fillet_executive/session/band_cuts.rs | section_breaks_through | windows | 1 | proven | windows(2) | constant non-zero size |
| 296 | crates/solidcore/src/blend/fillet_executive/session/band_cuts.rs | section_breaks_through | with_capacity | 1 | open | Vec::with_capacity(meets.len() + 2) | |
| 297 | crates/solidcore/src/blend/fillet_executive/session/cliff_overflow.rs | FilletSession::holds_its_law | int-rem | 1 | proven | c % 2 | constant non-zero divisor |
| 298 | crates/solidcore/src/blend/fillet_executive/session/cliff_overflow.rs | FilletSession::holds_its_law | int-rem | 2 | proven | c % 2 | constant non-zero divisor |
| 299 | crates/solidcore/src/blend/fillet_executive/session/fit_size.rs | corner_takes_per_radius | int-rem | 1 | proven | (i + 1) % 3 | constant non-zero divisor |
| 300 | crates/solidcore/src/blend/fillet_executive/session/fit_size.rs | corner_takes_per_radius | int-rem | 2 | proven | (i + 2) % 3 | constant non-zero divisor |
| 301 | crates/solidcore/src/blend/fillet_executive/session/keep_features.rs | FilletSession::keep_features_on | with_capacity | 1 | proven | Vec::with_capacity(rim.len()) | rim.len(), an in-memory collection |
| 302 | crates/solidcore/src/blend/fillet_executive/session/keep_features.rs | FilletSession::keep_features_on | with_capacity | 2 | open | Vec::with_capacity(2 * rim_curves.len()) | |
| 303 | crates/solidcore/src/blend/fillet_executive/session/keep_features.rs | FilletSession::keep_features_on | with_capacity | 3 | proven | Vec::with_capacity(sheet_faces.len()) | sheet_faces.len(), an in-memory collection |
| 304 | crates/solidcore/src/blend/fillet_executive/session/keep_features.rs | FilletSession::keep_features_on | with_capacity | 4 | proven | Vec::with_capacity(blended_edges.len()) | blended_edges.len(), an in-memory collection |
| 305 | crates/solidcore/src/blend/fillet_executive/session/outline_rims.rs | FilletSession::end_round_on_outline | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 306 | crates/solidcore/src/blend/fillet_executive/session/surface.rs | SessionObjects::allocate_surface_surface_solver | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 307 | crates/solidcore/src/blend/fillet_executive/session/two_offsets.rs | FilletSession::prepare_chamfers_along | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 308 | crates/solidcore/src/blend/fillet_geom/p2.rs | FilletBrep::calc_rail_rail_interpolation_with_solvers | int-rem | 1 | open | (index + 2) % total_edges | |
| 309 | crates/solidcore/src/blend/fillet_geom/p2.rs | FilletBrep::calc_rail_rail_interpolation_with_solvers | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 310 | crates/solidcore/src/blend/fillet_geom/p2.rs | FilletBrep::calc_rail_rail_interpolation_with_solvers | step_by | 2 | proven | step_by(2) | constant non-zero step |
| 311 | crates/solidcore/src/blend/fillet_geom/p2.rs | RailRailSolvers::rail_rail_intersect | split_at | 1 | open | split_at_mut(hi) | |
| 312 | crates/solidcore/src/blend/fillet_geom/p2.rs | g2_rail_rail_curve | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 313 | crates/solidcore/src/blend/fillet_geom/p2.rs | with_solver_pair | split_at | 1 | open | split_at_mut(hi) | |
| 314 | crates/solidcore/src/blend/fillet_geom/p3.rs | FilletBrep::re_calc_fillet_geom_through | Vec::insert | 1 | open | insert(index_of_insert, t) | |
| 315 | crates/solidcore/src/blend/fillet_geom/p3.rs | FilletBrep::re_calc_fillet_geom_through | Vec::insert | 2 | open | insert(index_of_insert, vu) | |
| 316 | crates/solidcore/src/blend/fillet_geom/p3.rs | FilletBrep::topology_split | Vec::remove | 1 | proven | remove(j) | inside if j < geom.ref_eus.len() |
| 317 | crates/solidcore/src/blend/fillet_geom/p3.rs | FilletBrep::topology_split | Vec::remove | 2 | proven | remove(i) | i is position() in the same Vec |
| 318 | crates/solidcore/src/blend/fillet_geom/p4.rs | FilletBrep::make_face_brep_resolved | Vec::remove | 1 | proven | remove(m) | curves_3d.get(m) succeeded just above (an error otherwise) |
| 319 | crates/solidcore/src/blend/fillet_geom/p4.rs | FilletBrep::make_face_brep_resolved | Vec::remove | 2 | open | remove(m) | |
| 320 | crates/solidcore/src/blend/fillet_geom/p4.rs | FilletBrep::make_face_brep_resolved | Vec::remove | 3 | open | remove(m) | |
| 321 | crates/solidcore/src/blend/fillet_geom/p4.rs | FilletBrep::make_face_brep_resolved | with_capacity | 1 | proven | Vec::with_capacity(lists1.curves_3d.len()) | lists1.curves_3d.len(), an in-memory Vec |
| 322 | crates/solidcore/src/blend/fillet_geom/p4.rs | FilletBrep::make_face_brep_resolved | with_capacity | 2 | proven | Vec::with_capacity(lists1.uv_curves.len()) | lists1.uv_curves.len(), an in-memory Vec |
| 323 | crates/solidcore/src/blend/fillet_geom/p5.rs | FilletBrep::calc_edge_on_extended_edge_with_surfaces | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 324 | crates/solidcore/src/blend/fillet_geom/p5.rs | FilletBrep::create_end_curve_resolved | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 325 | crates/solidcore/src/blend/fillet_geom/p5.rs | edge_insert | Vec::insert | 1 | proven | insert(0, eu) | index 0 is never past the end |
| 326 | crates/solidcore/src/blend/fillet_geom/p6.rs | FilletBrep::trim_original_surfaces_resolved | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 327 | crates/solidcore/src/blend/fillet_geom/p6.rs | FilletBrep::trim_original_surfaces_resolved | step_by | 2 | proven | step_by(2) | constant non-zero step |
| 328 | crates/solidcore/src/blend/fillet_geom/p6.rs | join_two_fillet_verts_by_curves_resolved | Vec::remove | 1 | proven | remove(ii) | inside while ii < copy_side_eus.len(); every ii += 1 before it continues |
| 329 | crates/solidcore/src/blend/fillet_geom/p6.rs | move_tsp | Vec::insert | 1 | proven | insert(to, tsp_temp) | to < the length before the remove, so to <= the length after it |
| 330 | crates/solidcore/src/blend/fillet_geom/p6.rs | move_tsp | Vec::remove | 1 | proven | remove(from) | from < tsect_pnts.len(): the function returns above when it is not |
| 331 | crates/solidcore/src/blend/fillet_geom/p6.rs | move_tsp | swap | 1 | proven | swap(from, to) | from and to < tsect_pnts.len(): the function returns above when not |
| 332 | crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rs | surface_plane_curve | windows | 1 | proven | windows(2) | constant non-zero size |
| 333 | crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rs | surface_plane_curve | windows | 2 | proven | windows(2) | constant non-zero size |
| 334 | crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rs | surface_plane_curve | with_capacity | 1 | open | Vec::with_capacity(st.len()) | |
| 335 | crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rs | surface_plane_curve | with_capacity | 2 | open | Vec::with_capacity(st.len() + off.len()) | |
| 336 | crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rs | tangent_end_rib | Vec::insert | 1 | open | insert(at, 0.5 * (t0 + t1)) | |
| 337 | crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rs | tangent_end_rib | Vec::insert | 2 | open | insert(at, alpha) | |
| 338 | crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rs | tangent_end_rib | Vec::insert | 3 | open | insert(at, uv) | |
| 339 | crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rs | tangent_end_rib | Vec::insert | 4 | open | insert(at, exact) | |
| 340 | crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rs | tangent_end_rib | int-rem | 1 | proven | order % 2 | constant non-zero divisor |
| 341 | crates/solidcore/src/blend/fillet_intersector.rs | FilletIntersector::flush_curve | Vec::insert | 1 | open | insert(j + 1, split_knot) | |
| 342 | crates/solidcore/src/blend/fillet_intersector.rs | FilletIntersector::flush_curve | Vec::insert | 2 | open | insert(j + 1, mid_pnt) | |
| 343 | crates/solidcore/src/blend/fillet_intersector.rs | FilletIntersector::flush_curve | windows | 1 | proven | windows(2) | constant non-zero size |
| 344 | crates/solidcore/src/blend/fillet_outline.rs | decide | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 345 | crates/solidcore/src/blend/fillet_outline.rs | decide | with_capacity | 2 | proven | Vec::with_capacity(2) | constant capacity |
| 346 | crates/solidcore/src/blend/fillet_outline.rs | decide | with_capacity | 3 | proven | Vec::with_capacity(2) | constant capacity |
| 347 | crates/solidcore/src/blend/fillet_outline.rs | outline_supports | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 348 | crates/solidcore/src/blend/fillet_overflow.rs | extend | Vec::insert | 1 | proven | insert(0, (q, rev)) | index 0 is never past the end |
| 349 | crates/solidcore/src/blend/fillet_overflow.rs | twice_area | int-rem | 1 | proven | (p + 1) % uv.len() | inside uv.iter().enumerate(), so uv.len() > 0 |
| 350 | crates/solidcore/src/blend/fillet_removal.rs | relink | Vec::remove | 1 | proven | remove(at) | at is position() in the same Vec |
| 351 | crates/solidcore/src/blend/fillet_section/certificate.rs | gn_certify_span | windows | 1 | proven | windows(2) | constant non-zero size |
| 352 | crates/solidcore/src/blend/fillet_section/definition.rs | bern_taylor | windows | 1 | proven | windows(2) | constant non-zero size |
| 353 | crates/solidcore/src/blend/fillet_section/definition.rs | evaluate_definition | int-rem | 1 | proven | (memo.next + 1) % STATION_MEMO | divisor is the non-zero constant STATION_MEMO |
| 354 | crates/solidcore/src/blend/fillet_section/definition_box.rs | bern_taylor_over | windows | 1 | proven | windows(2) | constant non-zero size |
| 355 | crates/solidcore/src/blend/fillet_section/form.rs | hermite_points_sided | windows | 1 | proven | windows(2) | constant non-zero size |
| 356 | crates/solidcore/src/blend/fillet_section/form.rs | hermite_points_sided | windows | 2 | proven | windows(2) | constant non-zero size |
| 357 | crates/solidcore/src/blend/fillet_section/recertify.rs | pieces | swap | 1 | open | swap(0, 1) | |
| 358 | crates/solidcore/src/blend/fillet_section/recertify.rs | pieces | swap | 2 | open | swap(0, 1) | |
| 359 | crates/solidcore/src/blend/fillet_section/recertify.rs | recertify_in_frame | windows | 1 | proven | windows(2) | constant non-zero size |
| 360 | crates/solidcore/src/blend/fillet_section/recertify.rs | spans_of_definition | windows | 1 | proven | windows(2) | constant non-zero size |
| 361 | crates/solidcore/src/blend/fillet_section/recertify.rs | sub_curve | windows | 1 | proven | windows(2) | constant non-zero size |
| 362 | crates/solidcore/src/blend/fillet_section/section.rs | GnSectionFsg::build | windows | 1 | proven | windows(2) | constant non-zero size |
| 363 | crates/solidcore/src/blend/fillet_section/section.rs | GnSectionFsg::build | windows | 2 | proven | windows(2) | constant non-zero size |
| 364 | crates/solidcore/src/blend/fillet_section/section.rs | GnSectionFsg::certify | windows | 1 | proven | windows(2) | constant non-zero size |
| 365 | crates/solidcore/src/blend/fillet_section/section.rs | GnSectionFsg::certify | windows | 2 | proven | windows(2) | constant non-zero size |
| 366 | crates/solidcore/src/blend/fillet_section/section.rs | GnSectionFsg::contact_order_at | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 367 | crates/solidcore/src/blend/fillet_section/section.rs | GnSectionFsg::contact_order_at | int-rem | 1 | proven | kk % 2 | constant non-zero divisor |
| 368 | crates/solidcore/src/blend/fillet_section/smooth_interior_plan.rs | SmoothInteriorPlan::prepare | windows | 1 | proven | windows(2) | constant non-zero size |
| 369 | crates/solidcore/src/blend/fillet_section/smooth_interior_plan.rs | SmoothInteriorPlan::prepare | windows | 2 | proven | windows(3) | constant non-zero size |
| 370 | crates/solidcore/src/blend/fillet_section/station.rs | gn_evaluate_vn | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 371 | crates/solidcore/src/blend/fillet_section/tay.rs | gn_area_sum | int-rem | 1 | proven | i % 2 | constant non-zero divisor |
| 372 | crates/solidcore/src/blend/fillet_solver/ball_fit.rs | ball_fits_its_faces | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 373 | crates/solidcore/src/blend/fillet_solver/ball_fit.rs | ball_fits_its_faces | with_capacity | 2 | proven | Vec::with_capacity(2) | constant capacity |
| 374 | crates/solidcore/src/blend/fillet_solver/p1.rs | FilletSolver::set_offsets_data | Vec::remove | 1 | open | remove(pos) | |
| 375 | crates/solidcore/src/blend/fillet_solver/p2.rs | FilletSolver::create_cliff_roll_over_side_fg | Vec::insert | 1 | proven | insert(0, new_eu1) | index 0 is never past the end |
| 376 | crates/solidcore/src/blend/fillet_solver/p4.rs | c1_collect_points | Vec::insert | 1 | proven | insert(0, r) | index 0 is never past the end |
| 377 | crates/solidcore/src/blend/fillet_solver/p4.rs | c1_collect_points | int-div | 1 | proven | total_g1_knots / 2 | constant non-zero divisor |
| 378 | crates/solidcore/src/blend/fillet_solver/p4.rs | c2_clean_ends | Vec::remove | 1 | open | remove(1) | |
| 379 | crates/solidcore/src/blend/fillet_solver/p4.rs | c2_sort_points | Vec::insert | 1 | open | insert(index, t) | |
| 380 | crates/solidcore/src/blend/fillet_solver/p4.rs | c2_sort_points | Vec::insert | 2 | open | insert(index, r) | |
| 381 | crates/solidcore/src/blend/fillet_solver/p4.rs | c2_trace_to_edge_ends | Vec::insert | 1 | proven | insert(0, r) | index 0 is never past the end |
| 382 | crates/solidcore/src/blend/fillet_solver/p4.rs | c4_cusp_recovery | Vec::insert | 1 | proven | insert(0, new_pnt) | index 0 is never past the end |
| 383 | crates/solidcore/src/blend/fillet_solver/p4.rs | c4_trace | Vec::drain | 1 | open | drain(..ii) | |
| 384 | crates/solidcore/src/blend/fillet_standard_solver/p2.rs | CircularCrossSectionFsg::piece_definitions | windows | 1 | proven | windows(2) | constant non-zero size |
| 385 | crates/solidcore/src/blend/fillet_standard_solver/p2.rs | CircularCrossSectionFsg::piecewise_surface | windows | 1 | proven | windows(2) | constant non-zero size |
| 386 | crates/solidcore/src/blend/fillet_standard_solver/p2.rs | LinearCrossSectionFsg::definition_surface | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 387 | crates/solidcore/src/blend/fillet_standard_solver/p2.rs | VariableRadiusFs::re_calc_fillet_geom | Vec::insert | 1 | open | insert(index_of_insert, t) | |
| 388 | crates/solidcore/src/blend/fillet_standard_solver/p2.rs | VariableRadiusFs::re_calc_fillet_geom | Vec::insert | 2 | open | insert(index_of_insert, vu) | |
| 389 | crates/solidcore/src/blend/hcr.rs | - | int-div | 1 | proven | usize::MAX / 2 | constant non-zero divisor |
| 390 | crates/solidcore/src/blend/law_corners.rs | LawCornerPieces::classify | windows | 1 | proven | windows(2) | constant non-zero size |
| 391 | crates/solidcore/src/blend/law_corners.rs | sphere_zone | with_capacity | 1 | proven | Vec::with_capacity(9) | constant capacity |
| 392 | crates/solidcore/src/blend/law_corners.rs | sphere_zone | with_capacity | 2 | proven | Vec::with_capacity(9) | constant capacity |
| 393 | crates/solidcore/src/boolean/merge/p2.rs | MergeState::merge_added_body | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 394 | crates/solidcore/src/boolean/merge/p4.rs | classify_edge_faces | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 395 | crates/solidcore/src/boolean/topology_intersector/p1.rs | TopologyIntersector::face_face_intersect | Vec::insert | 1 | open | insert((jj + 1).min(faces2.len()), new_face) | |
| 396 | crates/solidcore/src/boolean/topology_intersector/p2.rs | TopologyIntersector::intersect_topology | with_capacity | 1 | proven | Vec::with_capacity(faces.len()) | faces.len(), an in-memory slice |
| 397 | crates/solidcore/src/boolean/topology_intersector/p2.rs | teardown_reads_freed | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 398 | crates/solidcore/src/curve/composite_curve/p1.rs | CompositeCurve::approximate_curve | Vec::drain | 1 | proven | drain(..) | full-range drain(..) |
| 399 | crates/solidcore/src/curve/composite_curve/p1.rs | CompositeCurve::approximate_curve | with_capacity | 1 | proven | Vec::with_capacity(n) | n = self.segments.len(), an existing Vec of elements larger than &Curve |
| 400 | crates/solidcore/src/curve/composite_curve/p1.rs | CompositeCurve::approximate_curve | with_capacity | 2 | proven | Vec::with_capacity(approx_segments.len()) | an existing Vec<Curve>; a Curve holds its BSplineCurve inline |
| 401 | crates/solidcore/src/curve/composite_curve/p1.rs | CompositeCurve::copy | with_capacity | 1 | proven | Vec::with_capacity(self.segments.len()) | n = self.segments.len(), an existing Vec of the same element type |
| 402 | crates/solidcore/src/curve/composite_curve/p1.rs | convert_to_bspline_curves_indexed | with_capacity | 1 | proven | Vec::with_capacity(curves.len()) | n = curves.len(), an existing slice of references; usize is no larger |
| 403 | crates/solidcore/src/curve/composite_curve/p1.rs | flush_crv | Vec::drain | 1 | proven | drain(..) | full-range drain(..) |
| 404 | crates/solidcore/src/curve/composite_curve/p1.rs | insert_sorted_breaks | Vec::insert | 1 | proven | insert(ii, value) | breaks.get(ii) is Some just above, so ii < len() |
| 405 | crates/solidcore/src/curve/composite_curve/p1.rs | trim_first_break | Vec::drain | 1 | proven | drain(..ii) | breaks.get(ii) is Some just above, so ii < len() |
| 406 | crates/solidcore/src/curve/composite_curve/p1.rs | trim_first_break | Vec::drain | 2 | proven | drain(..ii) | ii < len() by breaks.get(ii), and the insert just above grew it |
| 407 | crates/solidcore/src/curve/composite_curve/p1.rs | trim_first_break | Vec::insert | 1 | proven | insert(ii, value) | breaks.get(ii) is Some just above, so ii < len() |
| 408 | crates/solidcore/src/curve/composite_curve/p1.rs | trim_last_break | Vec::insert | 1 | proven | insert(ii, value) | breaks.get(ii) is Some just above, so ii < len() |
| 409 | crates/solidcore/src/curve/composite_curve/p2.rs | CompositeCurve::create_offsets_of_many_curves | with_capacity | 1 | proven | Vec::with_capacity(curves.len()) | n = curves.len(), an existing slice of references; bool is smaller |
| 410 | crates/solidcore/src/curve/composite_curve/p2.rs | CompositeCurve::create_offsets_of_many_curves | with_capacity | 2 | proven | Vec::with_capacity(comp.segments.len()) | n = comp.segments.len(), an existing Vec of segments, each holding a Curve |
| 411 | crates/solidcore/src/curve/composite_curve/p2.rs | CompositeCurve::intersect_and_trim_offsets | windows | 1 | proven | windows(2) | constant non-zero size |
| 412 | crates/solidcore/src/curve/composite_curve/p2.rs | CompositeCurve::composite_nurb | with_capacity | 1 | proven | Vec::with_capacity(self.segments.len()) | n = self.segments.len(), segments each holding a Curve, which holds a BSplineCurve inline |
| 413 | crates/solidcore/src/curve/composite_curve/p2.rs | CompositeCurve::composite_nurb | with_capacity | 2 | proven | Vec::with_capacity(self.segments.len()) | n = self.segments.len(), an existing Vec of segments; bool is smaller |
| 414 | crates/solidcore/src/curve/crv_in_volume.rs | CrvInVolume::compute_breaks | Vec::insert | 1 | proven | insert(jj, class_bndry) | returns Err when jj > knots.len() |
| 415 | crates/solidcore/src/curve/crv_in_volume.rs | CrvInVolume::compute_breaks | Vec::insert | 2 | proven | insert(jj.min(mults.len()), 2) | index is min(.., mults.len()) |
| 416 | crates/solidcore/src/curve/crv_on_surf.rs | CrvOnSurf::knots_with_status | Vec::insert | 1 | proven | insert(jj, class_bndry) | returns Err when jj > knots.len() |
| 417 | crates/solidcore/src/curve/crv_on_surf.rs | CrvOnSurf::knots_with_status | Vec::insert | 2 | proven | insert(jj.min(mults.len()), 2) | index is min(.., mults.len()) |
| 418 | crates/solidcore/src/curve/crv_on_surf.rs | CrvOnSurf::knots_with_status | with_capacity | 1 | proven | Vec::with_capacity(num) | num = breaks.len(), an existing Vec<f64>; usize is no larger |
| 419 | crates/solidcore/src/curve/curve/p1.rs | CpGlobalSolver::local_solve_branch | with_capacity | 1 | proven | Vec::with_capacity(6) | constant capacity |
| 420 | crates/solidcore/src/curve/curve/p1.rs | CpGlobalSolver::local_solve_branch | with_capacity | 2 | proven | Vec::with_capacity(6) | constant capacity |
| 421 | crates/solidcore/src/curve/curve/p1.rs | Curve::approximate_curve_base | windows | 1 | proven | windows(2) | constant non-zero size |
| 422 | crates/solidcore/src/curve/curve/p1.rs | Curve::approximate_curve_base | with_capacity | 1 | proven | Vec::with_capacity(256 * 4 * 2) | constant capacity |
| 423 | crates/solidcore/src/curve/curve/p1.rs | Curve::approximate_curve_base | with_capacity | 2 | proven | Vec::with_capacity(256) | constant capacity |
| 424 | crates/solidcore/src/curve/curve/p1.rs | Curve::approximate_curve_base | with_capacity | 3 | proven | Vec::with_capacity(256) | constant capacity |
| 425 | crates/solidcore/src/curve/curve/p1.rs | Curve::classify_intersecting_range_solution | int-rem | 1 | proven | (tgt + 3 - 1) % 3 | constant non-zero divisor |
| 426 | crates/solidcore/src/curve/curve/p1.rs | Curve::classify_intersecting_range_solution | int-rem | 2 | proven | (tgt + 3 - 2) % 3 | constant non-zero divisor |
| 427 | crates/solidcore/src/curve/curve/p2.rs | Curve::null_segments | windows | 1 | proven | windows(2) | constant non-zero size |
| 428 | crates/solidcore/src/curve/curve/p4.rs | approximate_polar_box | int-rem | 1 | proven | point_count % 2 | constant non-zero divisor |
| 429 | crates/solidcore/src/curve/curve/p4.rs | fix_chain_curves_list | Vec::insert | 1 | proven | insert(loop_start, next_crv) | loop_start was chained.len() at the chain's start; chained and origin only grow |
| 430 | crates/solidcore/src/curve/curve/p4.rs | fix_chain_curves_list | Vec::insert | 2 | proven | insert(loop_start, idx) | loop_start was chained.len() at the chain's start; chained and origin only grow |
| 431 | crates/solidcore/src/curve/curve/p4.rs | fix_chain_curves_list | Vec::insert | 3 | proven | insert(loop_start, next_crv) | loop_start was chained.len() at the chain's start; chained and origin only grow |
| 432 | crates/solidcore/src/curve/curve/p4.rs | fix_chain_curves_list | Vec::insert | 4 | proven | insert(loop_start, idx) | loop_start was chained.len() at the chain's start; chained and origin only grow |
| 433 | crates/solidcore/src/curve/curve/p5.rs | crvs_cleanup | Vec::remove | 1 | proven | remove(ii) | inside while ii < curves.len(), curves unchanged before it |
| 434 | crates/solidcore/src/curve/curve/p5.rs | crvs_cleanup | Vec::remove | 2 | proven | remove(ii) | guarded by ii < origin.len() |
| 435 | crates/solidcore/src/curve/curve/p5.rs | crvs_cleanup | split_at | 1 | proven | split_at_mut(ii) | guarded by ii < curves.len() |
| 436 | crates/solidcore/src/curve/curve/p5.rs | remove_duplicate_curves | with_capacity | 1 | proven | Vec::with_capacity(keep.len()) | keep.len() <= curves.len() (one push per i), the same element type |
| 437 | crates/solidcore/src/curve/curve/p6.rs | Curve::global_coincidence_checker_into | Vec::insert | 1 | proven | insert(drops.len() - 1, entry) | drops.last() is Some, so drops.len() - 1 < len() |
| 438 | crates/solidcore/src/curve/curve/p6.rs | Curve::global_coincidence_checker_into | with_capacity | 1 | proven | Vec::with_capacity(3) | constant capacity |
| 439 | crates/solidcore/src/curve/curve/p6.rs | Curve::global_coincidence_checker_into | with_capacity | 2 | proven | Vec::with_capacity(3) | constant capacity |
| 440 | crates/solidcore/src/curve/curve/p6.rs | Curve::global_coincidence_checker_into | with_capacity | 3 | proven | Vec::with_capacity(4) | constant capacity |
| 441 | crates/solidcore/src/curve/curve/p6.rs | Curve::simple_coincidence_checker | Vec::insert | 1 | proven | insert(drops.len() - 1, entry) | drops.last() is Some, so drops.len() - 1 < len() |
| 442 | crates/solidcore/src/curve/curve/p6.rs | Curve::simple_coincidence_checker | with_capacity | 1 | proven | Vec::with_capacity(4) | constant capacity |
| 443 | crates/solidcore/src/curve/curve/p6.rs | calculate_bounding_box_base | int-div | 1 | proven | count / 2 | constant non-zero divisor |
| 444 | crates/solidcore/src/curve/curve/p6.rs | calculate_bounding_box_base | int-div | 2 | proven | count / 2 | constant non-zero divisor |
| 445 | crates/solidcore/src/curve/curve/p6.rs | calculate_bounding_box_base | int-div | 3 | proven | tangents.len() / 2 | constant non-zero divisor |
| 446 | crates/solidcore/src/curve/curve/p6.rs | calculate_bounding_box_base | with_capacity | 1 | proven | Vec::with_capacity(32) | constant capacity |
| 447 | crates/solidcore/src/curve/curve/p6.rs | calculate_bounding_box_base | with_capacity | 2 | proven | Vec::with_capacity(32) | constant capacity |
| 448 | crates/solidcore/src/curve/curve/p7.rs | CciGlobalSolver::local_solve_branch | with_capacity | 1 | proven | Vec::with_capacity(10) | constant capacity |
| 449 | crates/solidcore/src/curve/curve/p7.rs | CciGlobalSolver::local_solve_branch | with_capacity | 2 | proven | Vec::with_capacity(10) | constant capacity |
| 450 | crates/solidcore/src/curve/curve/p7.rs | Curve::global_property_analysis_into | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 451 | crates/solidcore/src/curve/curve/p8.rs | Curve::cull_ranges_near_points | Vec::insert | 1 | proven | insert(at, false) | at is min(.., cull.len()) |
| 452 | crates/solidcore/src/curve/curve_cache.rs | CurveCache::build_tree | int-div | 1 | proven | curr.len() / 2 | constant non-zero divisor |
| 453 | crates/solidcore/src/curve/curve_cache.rs | CurveCache::build_tree | int-rem | 1 | proven | curr.len() % 2 | constant non-zero divisor |
| 454 | crates/solidcore/src/curve/curve_cache.rs | CurveCache::build_tree | with_capacity | 1 | proven | Vec::with_capacity(span_count) | span_count = self.spans.len(), an existing Vec of BezierSpan, larger than NodeId |
| 455 | crates/solidcore/src/curve/curve_cache.rs | CurveCache::build_tree | with_capacity | 2 | proven | Vec::with_capacity(curr.len() / 2 + 1) | at most curr.len() (inside while curr.len() > 1), the same element type |
| 456 | crates/solidcore/src/curve/curve_cache.rs | compute_constants | windows | 1 | proven | windows(2) | constant non-zero size |
| 457 | crates/solidcore/src/curve/ellipse/p1.rs | PolarConversion::read_tables | int-rem | 1 | proven | ii % 5 | constant non-zero divisor |
| 458 | crates/solidcore/src/curve/ellipse/p1.rs | PolarConversion::read_tables | int-rem | 2 | proven | n % 5 | constant non-zero divisor |
| 459 | crates/solidcore/src/curve/ellipse/p1.rs | PolarConversion::read_tables | int-rem | 3 | proven | ii % 5 | constant non-zero divisor |
| 460 | crates/solidcore/src/curve/ellipse/p1.rs | PolarConversion::read_tables | int-rem | 4 | proven | n_exact % 5 | constant non-zero divisor |
| 461 | crates/solidcore/src/curve/ellipse/p1.rs | PolarConversion::write_to_db | int-rem | 1 | proven | ii % 5 | constant non-zero divisor |
| 462 | crates/solidcore/src/curve/ellipse/p1.rs | PolarConversion::write_to_db | int-rem | 2 | proven | n % 5 | constant non-zero divisor |
| 463 | crates/solidcore/src/curve/ellipse/p2.rs | Ellipse::drop_point_fast | Vec::remove | 1 | proven | remove(0) | guarded by solutions.len() > 1 |
| 464 | crates/solidcore/src/curve/ellipse/p2.rs | Ellipse::eval_step | with_capacity | 1 | proven | Vec::with_capacity(num_derivs + 1) | callers pass num_derivs <= 3: evaluate_step returns Err above 3, step_point passes 0 |
| 465 | crates/solidcore/src/curve/hyperbola.rs | Hyperbola::evaluate_step | with_capacity | 1 | proven | Vec::with_capacity(num_derivs + 1) | returns Err when num_derivs > 3 |
| 466 | crates/solidcore/src/curve/line.rs | Line::intersect_with_ellipse | swap | 1 | proven | swap(0, 1) | objects is [_; MAX_TREES], MAX_TREES = 5 |
| 467 | crates/solidcore/src/curve/line.rs | Line::intersect_with_ellipse | swap | 2 | proven | swap(0, 1) | parameters is [f64; MAX_PARAMS], MAX_PARAMS = 10 |
| 468 | crates/solidcore/src/curve/line.rs | Line::intersect_with_ellipse | swap | 3 | proven | swap(0, 1) | parameters is [f64; MAX_PARAMS], MAX_PARAMS = 10 |
| 469 | crates/solidcore/src/curve/line.rs | Line::make_nurb_owned | copy_from_slice | 1 | proven | copy_from_slice(&[min, min, max, max]) | allocate_nurb_curve(1, 1, 3) makes 4 knots, the slice's length |
| 470 | crates/solidcore/src/curve/parabola.rs | Parabola::evaluate_step | with_capacity | 1 | proven | Vec::with_capacity(num_derivs + 1) | returns Err when num_derivs > 3 |
| 471 | crates/solidcore/src/eval/form.rs | extent_in | with_capacity | 1 | proven | Vec::with_capacity(EXTENT_POINTS + 1) | constant capacity |
| 472 | crates/solidcore/src/eval/form.rs | face_arcs | f64::clamp | 1 | proven | clamp(0.0, n - 1.0) | arcs_between requires finite positive span and produces 1 to 4 arcs, so n >= 1 and phi > 0 |
| 473 | crates/solidcore/src/eval/form.rs | face_arcs | f64::clamp | 2 | proven | clamp(0.0, phi) | arcs_between requires finite positive span and produces 1 to 4 arcs, so n >= 1 and phi > 0 |
| 474 | crates/solidcore/src/eval/form.rs | param | f64::clamp | 1 | proven | clamp(0.0, FRAC_PI_2) | bounds are constants 0 and FRAC_PI_2 |
| 475 | crates/solidcore/src/eval/form.rs | params | f64::clamp | 1 | proven | clamp(q0, end) | quarters validates finite angles and returns nonnegative n, so q0 <= end |
| 476 | crates/solidcore/src/eval/form.rs | params | f64::clamp | 2 | proven | clamp(q0, end) | quarters validates finite angles and returns nonnegative n, so q0 <= end |
| 477 | crates/solidcore/src/eval/sphere.rs | curve_on_sphere | int-div | 1 | proven | b / p | degree calls basis_check, which requires 1 <= p <= 16 |
| 478 | crates/solidcore/src/eval/sphere.rs | curve_on_sphere | int-rem | 1 | proven | (n - 1) % p | degree calls basis_check, which requires 1 <= p <= 16 |
| 479 | crates/solidcore/src/eval/sphere.rs | cuts | windows | 1 | proven | windows(2) | constant non-zero size |
| 480 | crates/solidcore/src/eval/sphere.rs | insert | Vec::insert | 1 | proven | insert(k + 1, t) | k + 1 < knots.len() checked before insertion |
| 481 | crates/solidcore/src/eval/sphere.rs | surface_on_sphere | int-div | 1 | proven | bu / p | degree calls basis_check for both directions, requiring p and q in 1..=16 |
| 482 | crates/solidcore/src/eval/sphere.rs | surface_on_sphere | int-div | 2 | proven | bv / q | degree calls basis_check for both directions, requiring p and q in 1..=16 |
| 483 | crates/solidcore/src/eval/sphere.rs | surface_on_sphere | int-rem | 1 | proven | (lu - 1) % p | degree calls basis_check for both directions, requiring p and q in 1..=16 |
| 484 | crates/solidcore/src/eval/sphere.rs | surface_on_sphere | int-rem | 2 | proven | (lv - 1) % q | degree calls basis_check for both directions, requiring p and q in 1..=16 |
| 485 | crates/solidcore/src/eval/spline.rs | trig_derivative | int-rem | 1 | proven | k % 4 | constant non-zero divisor |
| 486 | crates/solidcore/src/eval/surface.rs | nurbs | with_capacity | 1 | open | Vec::with_capacity(nu * nv) | |
| 487 | crates/solidcore/src/eval/uv.rs | Domain::clamp | f64::clamp | 1 | open | clamp(a.min(b), a.max(b)) | |
| 488 | crates/solidcore/src/eval/uv.rs | Starts::of | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 489 | crates/solidcore/src/eval/uv.rs | Starts::of | with_capacity | 1 | open | Vec::with_capacity(us.len() * vs.len()) | |
| 490 | crates/solidcore/src/eval/uv.rs | clamped | windows | 1 | proven | windows(2) | constant non-zero size |
| 491 | crates/solidcore/src/eval/uv.rs | starts_along | windows | 1 | proven | windows(2) | constant non-zero size |
| 492 | crates/solidcore/src/eval/uv.rs | wrap_into | f64::clamp | 1 | open | clamp(a, b) | |
| 493 | crates/solidcore/src/geom/a_object.rs | reverse_knots | int-div | 1 | proven | m / 2 | constant non-zero divisor |
| 494 | crates/solidcore/src/geom/assert_array.rs | AssertArray::remove_at | Vec::remove | 1 | proven | remove(index) | returns None when index >= reports.len() |
| 495 | crates/solidcore/src/geom/attribute.rs | AttributeStore::remove_attribute | Vec::remove | 1 | proven | remove(pos) | pos is position() in the same Vec |
| 496 | crates/solidcore/src/geom/attribute.rs | AttributeStore::remove_user | Vec::remove | 1 | proven | remove(pos) | pos is position() in the same users Vec |
| 497 | crates/solidcore/src/geom/geom_utility/p1.rs | add_sorted | Vec::insert | 1 | proven | insert(found_idx, value) | found_idx is position() or len() of sorted_values; indices insertion guarded by found_idx < indices.len() |
| 498 | crates/solidcore/src/geom/geom_utility/p1.rs | add_sorted | Vec::insert | 2 | proven | insert(found_idx, idx) | found_idx is position() or len() of sorted_values; indices insertion guarded by found_idx < indices.len() |
| 499 | crates/solidcore/src/geom/geom_utility/p1.rs | segment_point_distance | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 500 | crates/solidcore/src/geom/geom_utility/p1.rs | shell_sort_double_array | int-div | 1 | proven | div_ceil(2) | divisor is a nonzero constant |
| 501 | crates/solidcore/src/geom/geom_utility/p1.rs | shell_sort_double_array | swap | 1 | proven | swap(ii, ii + d) | both indices checked by get() on the same values slice |
| 502 | crates/solidcore/src/geom/geom_utility/p2.rs | inverse_4x4 | int-rem | 1 | proven | (r + c) % 2 | constant non-zero divisor |
| 503 | crates/solidcore/src/geom/geom_utility/p2.rs | segment_segment_closest_point | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 504 | crates/solidcore/src/geom/geom_utility/p2.rs | segment_segment_closest_point | f64::clamp | 2 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 505 | crates/solidcore/src/geom/geom_utility/p2.rs | segment_segment_intersect | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 506 | crates/solidcore/src/geom/geom_utility/p2.rs | segment_segment_intersect | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 507 | crates/solidcore/src/geom/geom_utility/p2.rs | sphere_circle_sphere_circle_intersect | int-rem | 1 | proven | ii % 2 | constant non-zero divisor |
| 508 | crates/solidcore/src/geom/geom_utility/p2.rs | triangle_point_distance | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 509 | crates/solidcore/src/geom/geom_utility/p2.rs | triangle_point_distance | f64::clamp | 2 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 510 | crates/solidcore/src/geom/grid.rs | Grid::voxel_address | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 511 | crates/solidcore/src/geom/grid.rs | Grid::voxel_address | f64::clamp | 2 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 512 | crates/solidcore/src/geom/grid.rs | Grid::voxel_address | f64::clamp | 3 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 513 | crates/solidcore/src/geom/grid.rs | insertion_sort | Vec::insert | 1 | proven | insert(insert_at, elem) | step_3ddda starts with empty parallel lists and only insertion_sort grows them together; insert_at <= min_distances.len() |
| 514 | crates/solidcore/src/geom/grid.rs | insertion_sort | Vec::insert | 2 | proven | insert(insert_at, t_enter) | step_3ddda starts with empty parallel lists and only insertion_sort grows them together; insert_at <= min_distances.len() |
| 515 | crates/solidcore/src/geom/grid.rs | insertion_sort | Vec::insert | 3 | proven | insert(insert_at, t_exit) | step_3ddda starts with empty parallel lists and only insertion_sort grows them together; insert_at <= min_distances.len() |
| 516 | crates/solidcore/src/geom/hash_table.rs | ObjsInVoxels::map_voxel_index_to_indices | int-div | 1 | proven | index / xy | xy != 0 checked; xy = x_cnt wrapping_mul y_cnt implies x_cnt != 0 |
| 517 | crates/solidcore/src/geom/hash_table.rs | ObjsInVoxels::map_voxel_index_to_indices | int-div | 2 | proven | index.wrapping_sub(iz.wrapping_mul(xy)) / self.x_cnt | xy != 0 checked; xy = x_cnt wrapping_mul y_cnt implies x_cnt != 0 |
| 518 | crates/solidcore/src/geom/local_solve1d.rs | IterQueue1d::is_oscillating | int-rem | 1 | proven | (i as u64) % step | returns false unless step == 2 |
| 519 | crates/solidcore/src/geom/matrix.rs | Matrix::make_identity | step_by | 1 | proven | step_by(step) | rows == cols checked and square storage bounds rows, so rows + 1 is nonzero |
| 520 | crates/solidcore/src/geom/matrix.rs | sort_eigen_system | swap | 1 | proven | swap(i, j_min) | i and j_min index d; n equals both matrix dimensions and offset() validates matrix indices |
| 521 | crates/solidcore/src/geom/matrix.rs | sort_eigen_system | swap | 2 | proven | swap(a, b) | i and j_min index d; n equals both matrix dimensions and offset() validates matrix indices |
| 522 | crates/solidcore/src/geom/point_set.rs | PointSet3d::set_up_centroid | int-div | 1 | proven | size / BLOCK_SIZE | divisor is the non-zero constant BLOCK_SIZE |
| 523 | crates/solidcore/src/geom/point_set.rs | PointSet3d::set_up_centroid | int-rem | 1 | proven | size % BLOCK_SIZE | divisor is the non-zero constant BLOCK_SIZE |
| 524 | crates/solidcore/src/geom/polar_box.rs | PolarBox::are_disjoint | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 525 | crates/solidcore/src/geom/pseudo_box.rs | PseudoBox::distance_to_point | with_capacity | 1 | proven | Vec::with_capacity(6) | constant capacity |
| 526 | crates/solidcore/src/geom/solution_array.rs | SolutionArray::insert_at | Vec::split_off | 1 | proven | split_off(index) | inside index < data.len() branch |
| 527 | crates/solidcore/src/geom/solution_array.rs | SolutionArray::swap | swap | 1 | proven | swap(index1, index2) | returns Err if either index >= data.len() |
| 528 | crates/solidcore/src/heal/face_props.rs | FaceProps::set_props_stage3_inner | int-rem | 1 | proven | total % 2 | constant non-zero divisor |
| 529 | crates/solidcore/src/heal/face_props.rs | LoopProps::set_props | int-div | 1 | proven | (this_touches.len() as u64) / 2 | constant non-zero divisor |
| 530 | crates/solidcore/src/heal/face_props.rs | LoopProps::set_props | int-div | 2 | proven | (this_touches.len() as u64) / 2 | constant non-zero divisor |
| 531 | crates/solidcore/src/heal/face_props.rs | LoopProps::set_props | int-rem | 1 | proven | self.seam_crossing_cnt_u % 2 | constant non-zero divisor |
| 532 | crates/solidcore/src/heal/face_props.rs | LoopProps::set_props | int-rem | 2 | proven | self.seam_crossing_cnt_v % 2 | constant non-zero divisor |
| 533 | crates/solidcore/src/heal/gap.rs | add_unique_get_ordered_index | Vec::insert | 1 | proven | insert(0, value) | index 0 is never past the end |
| 534 | crates/solidcore/src/heal/gap.rs | add_unique_get_ordered_index | Vec::insert | 2 | proven | insert(ii, value) | ii ranges over 1..array.len() |
| 535 | crates/solidcore/src/heal/gap.rs | samples_per_interval | int-div | 1 | proven | want / intervals | sample_normalized_values checks end_u > start_u and, for surfaces, end_v > start_v before both calls |
| 536 | crates/solidcore/src/heal/gap.rs | samples_per_interval | int-rem | 1 | proven | per % 2 | constant non-zero divisor |
| 537 | crates/solidcore/src/heal/gap.rs | trimmed_span_values | windows | 1 | proven | windows(2) | constant non-zero size |
| 538 | crates/solidcore/src/heal/heal_data/p1.rs | brep_regions_from_infinite | rotate | 1 | proven | rotate_left(at) | at is position() in the same regions Vec |
| 539 | crates/solidcore/src/heal/heal_data/p2.rs | HealData::cache_coin_vertices | copy_from_slice | 1 | proven | copy_from_slice(&hist) | hist is [u64; GAPSIZE_BUCKET_CNT] and destination length checked equal to GAPSIZE_BUCKET_CNT |
| 540 | crates/solidcore/src/heal/heal_data/p2.rs | PairProbArray::remove | Vec::drain | 1 | proven | drain(ii..ii + 2) | both get(ii) and get(ii + 1) pass through flag()?, which returns Err for None |
| 541 | crates/solidcore/src/heal/heal_data/p2.rs | PairProbArray::remove | Vec::remove | 1 | proven | remove(ii) | guarded by ii < prob_array.len() of the same Vec |
| 542 | crates/solidcore/src/heal/heal_data/p2.rs | remove_first | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 543 | crates/solidcore/src/heal/heal_data/p3.rs | HealData::fix_coin_vertices | int-div | 1 | proven | pairs.len() / 2 | constant non-zero divisor |
| 544 | crates/solidcore/src/heal/stitch/p1.rs | sort_by_param | Vec::insert | 1 | proven | insert(0, ii) | index 0 is never past the end |
| 545 | crates/solidcore/src/heal/stitch/p1.rs | sort_by_param | Vec::insert | 2 | proven | insert(lmax, ii) | returns Err when lmax > sorted.len() |
| 546 | crates/solidcore/src/heal/stitch/p1.rs | sort_by_param | int-div | 1 | proven | (lmin + lmax) / 2 | constant non-zero divisor |
| 547 | crates/solidcore/src/intersect/adv_surface_intersector.rs | AdvSurfaceIntersector::local_solve | copy_from_slice | 1 | proven | copy_from_slice(&[mn.x, mn.y, mn.z, mx.x, mx.y, mx.z, 1.0]) | destination prefix and source array have identical literal lengths in fixed MAX_PARAMS = 10 storage |
| 548 | crates/solidcore/src/intersect/adv_surface_intersector.rs | AdvSurfaceIntersector::local_solve | copy_from_slice | 2 | proven | copy_from_slice(&[a.x, a.y, b.x, b.y, c.x, c.y, d.x, d.y]) | destination prefix and source array have identical literal lengths in fixed MAX_PARAMS = 10 storage |
| 549 | crates/solidcore/src/intersect/adv_surface_intersector.rs | AdvSurfaceIntersector::local_solve | copy_from_slice | 3 | proven | copy_from_slice(&[mn.x, mn.y, mn.z, mx.x, mx.y, mx.z]) | destination prefix and source array have identical literal lengths in fixed MAX_PARAMS = 10 storage |
| 550 | crates/solidcore/src/intersect/adv_surface_intersector.rs | AdvSurfaceIntersector::local_solve | copy_from_slice | 4 | proven | copy_from_slice(&[a.x, a.y, b.x, b.y, c.x, c.y, d.x, d.y]) | destination prefix and source array have identical literal lengths in fixed MAX_PARAMS = 10 storage |
| 551 | crates/solidcore/src/intersect/adv_surface_intersector/tangent_contacts.rs | tp_solve4 | split_at | 1 | proven | split_at_mut(k + 1) | k in 0..4, so k + 1 <= length of four-row array |
| 552 | crates/solidcore/src/intersect/adv_surface_intersector/tangent_contacts.rs | tp_solve4 | swap | 1 | proven | swap(k, i_piv) | k and i_piv in 0..4 on fixed four-element arrays |
| 553 | crates/solidcore/src/intersect/adv_surface_intersector/tangent_contacts.rs | tp_solve4 | swap | 2 | proven | swap(k, i_piv) | k and i_piv in 0..4 on fixed four-element arrays |
| 554 | crates/solidcore/src/intersect/curve_class/p1.rs | CurveClassification::remove_at | Vec::remove | 1 | proven | remove(index) | guarded by index < size = data.len() |
| 555 | crates/solidcore/src/intersect/curve_class/p1.rs | get_winding_count | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 556 | crates/solidcore/src/intersect/curve_class/p1.rs | get_winding_count | int-rem | 1 | proven | touches.len() % 2 | constant non-zero divisor |
| 557 | crates/solidcore/src/intersect/curve_class/p1.rs | remove_non_crossings | int-rem | 1 | proven | count % 2 | constant non-zero divisor |
| 558 | crates/solidcore/src/intersect/curve_class/p4.rs | CurveClassification::classify_touch | int-rem | 1 | proven | (next + c.ivl_cnt - 1) % c.ivl_cnt | preceding checked_rem(c.ivl_cnt)? returns Err for zero divisor |
| 559 | crates/solidcore/src/intersect/curve_class/p4.rs | CurveClassification::classify_touch | with_capacity | 1 | proven | Vec::with_capacity(vertexuses.len()) | n = vertexuses.len(), an existing Vec of the same vertexuse handle type |
| 560 | crates/solidcore/src/intersect/curve_class/p4.rs | CurveClassification::crossings_from_touches | int-div | 1 | proven | get_connected_touches(Some(lp), &crossings).len() as u64 / 2 | constant non-zero divisor |
| 561 | crates/solidcore/src/intersect/curve_class/p8.rs | CurveClassification::natural_bounds | windows | 1 | proven | windows(2) | constant non-zero size |
| 562 | crates/solidcore/src/intersect/surface_drop_curve.rs | SurfaceDropCurve::boundary_start_points | Vec::remove | 1 | open | remove(kk) | |
| 563 | crates/solidcore/src/intersect/surface_drop_curve.rs | SurfaceDropCurve::step_size | int-div | 1 | proven | (l_min + l_max) / 2 | constant non-zero divisor |
| 564 | crates/solidcore/src/intersect/surface_drop_curve.rs | SurfaceDropCurve::trace_curve_2_in | Vec::remove | 1 | open | remove(0) | |
| 565 | crates/solidcore/src/intersect/surface_drop_curve.rs | add_break | Vec::insert | 1 | open | insert(insertion, new_break) | |
| 566 | crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rs | join | f64::clamp | 1 | proven | clamp(ivl.min(), ivl.max()) | u_interval/v_interval order the bounds and NaN bounds return Err before clamp |
| 567 | crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rs | join | step_by | 1 | proven | step_by(degree) | returns Ok(None) when degree == 0 |
| 568 | crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rs | pieces | windows | 1 | proven | windows(2) | constant non-zero size |
| 569 | crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rs | pieces | windows | 2 | proven | windows(2) | constant non-zero size |
| 570 | crates/solidcore/src/intersect/surface_drop_lib/p1.rs | Surface::drop_iso_curve | Vec::insert | 1 | proven | insert(0, interval.min()) | index 0 is never past the end |
| 571 | crates/solidcore/src/intersect/surface_drop_lib/p1.rs | Surface::drop_iso_curve | Vec::remove | 1 | proven | remove(0) | first().is_some_and() requires a nonempty knots Vec |
| 572 | crates/solidcore/src/intersect/surface_drop_lib/p1.rs | fix_boundary_curves | int-div | 1 | proven | num_pts / 3 | constant non-zero divisor |
| 573 | crates/solidcore/src/intersect/surface_drop_lib/p3.rs | Surface::drop_curve_base_in | Vec::drain | 1 | proven | drain(..) | full drain(..) has no invalid bounds |
| 574 | crates/solidcore/src/intersect/surface_drop_lib/p3.rs | Surface::drop_curve_base_in | int-div | 1 | proven | stack.len() / 5 | constant non-zero divisor |
| 575 | crates/solidcore/src/intersect/surface_intersector/p1.rs | SurfaceIntersector::add_start_point | Vec::insert | 1 | proven | insert(0, id) | index 0 is never past the end |
| 576 | crates/solidcore/src/intersect/surface_intersector/p2.rs | SurfaceIntersector::flush_curve | windows | 1 | proven | windows(2) | constant non-zero size |
| 577 | crates/solidcore/src/intersect/surface_intersector/p2.rs | SurfaceIntersector::walk_gap_side | int-rem | 1 | proven | ((tgt + 3) - 1) % 3 | constant non-zero divisor |
| 578 | crates/solidcore/src/intersect/surface_intersector/p2.rs | SurfaceIntersector::walk_gap_side | int-rem | 2 | proven | ((tgt + 3) - 2) % 3 | constant non-zero divisor |
| 579 | crates/solidcore/src/intersect/surface_intersector/p3.rs | SurfaceIntersector::add_boundary_curve | with_capacity | 1 | proven | Vec::with_capacity(work.edge_crossings.len()) | n = edge_crossings.len(), an existing Vec of the same crossing point type |
| 580 | crates/solidcore/src/intersect/surface_intersector/p3.rs | SurfaceIntersector::find_boundary_start_points_body | int-rem | 1 | proven | ii % 2 | constant non-zero divisor |
| 581 | crates/solidcore/src/intersect/surface_intersector/p3.rs | SurfaceIntersector::find_boundary_start_points_body | int-rem | 2 | proven | l_crv % 2 | constant non-zero divisor |
| 582 | crates/solidcore/src/intersect/surface_intersector/p3.rs | unlink | Vec::remove | 1 | proven | remove(pos) | pos is position() in the same Vec |
| 583 | crates/solidcore/src/intersect/surface_intersector/p4.rs | do_law_intersection_with | Vec::insert | 1 | proven | insert(ip, new_tsect) | inside while ip < curve_pnts.len(), with no removal before insertion |
| 584 | crates/solidcore/src/intersect/surface_intersector/p5.rs | AdvSurfaceIntersector::do_intersection_in | Vec::remove | 1 | proven | remove(ii) | ii < curves_3d.len() in loop and all four companion lengths checked before removal |
| 585 | crates/solidcore/src/intersect/surface_intersector/p5.rs | AdvSurfaceIntersector::do_intersection_in | Vec::remove | 2 | proven | remove(ii) | ii < curves_3d.len() in loop and all four companion lengths checked before removal |
| 586 | crates/solidcore/src/intersect/surface_intersector/p5.rs | AdvSurfaceIntersector::do_intersection_in | Vec::remove | 3 | proven | remove(ii) | ii < curves_3d.len() in loop and all four companion lengths checked before removal |
| 587 | crates/solidcore/src/intersect/surface_intersector/p5.rs | AdvSurfaceIntersector::do_intersection_in | Vec::remove | 4 | proven | remove(ii) | ii < curves_3d.len() in loop and all four companion lengths checked before removal |
| 588 | crates/solidcore/src/intersect/surface_intersector/p5.rs | AdvSurfaceIntersector::do_intersection_in | Vec::remove | 5 | proven | remove(ii) | ii < curves_3d.len() in loop and all four companion lengths checked before removal |
| 589 | crates/solidcore/src/intersect/surface_intersector/singular_splits.rs | split_curves_at_singular_points | windows | 1 | proven | windows(2) | constant non-zero size |
| 590 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | covers | int-div | 1 | proven | rc.len() / 40 | constant non-zero divisor |
| 591 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | covers_crossing | int-div | 1 | proven | rc.len() / 40 | constant non-zero divisor |
| 592 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | find_tangent_curves | windows | 1 | proven | windows(2) | constant non-zero size |
| 593 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | find_tangent_curves | with_capacity | 1 | proven | Vec::with_capacity(new_curves.len()) | n = new_curves.len(), an existing Vec<NewCurve>; NewCurve contains a Vec plus flags and f64, no smaller than output Vec elements |
| 594 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | find_tangent_curves | with_capacity | 2 | proven | Vec::with_capacity(new_curves.len()) | n = new_curves.len(), an existing Vec<NewCurve>; NewCurve contains a Vec plus flags and f64, no smaller than output Vec elements |
| 595 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | find_tangent_curves | with_capacity | 3 | proven | Vec::with_capacity(new_curves.len()) | n = new_curves.len(), an existing Vec<NewCurve>; NewCurve contains a Vec plus flags and f64, no smaller than output Vec elements |
| 596 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | remove_curve | Vec::remove | 1 | proven | remove(ii) | guarded by ii < len() of the same Vec |
| 597 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | remove_curve | Vec::remove | 2 | proven | remove(ii) | guarded by ii < len() of the same Vec |
| 598 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | remove_curve | Vec::remove | 3 | proven | remove(ii) | guarded by ii < len() of the same Vec |
| 599 | crates/solidcore/src/intersect/surface_intersector/tangent_curves.rs | remove_curve | Vec::remove | 4 | proven | remove(ii) | guarded by ii < len() of the same Vec |
| 600 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | TangentTracer::probe | int-div | 1 | proven | PROBE_DIRS / 2 | constant non-zero divisor |
| 601 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | TangentTracer::residual | with_capacity | 1 | proven | Vec::with_capacity(10) | constant capacity |
| 602 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | TangentTracer::residual | with_capacity | 2 | proven | Vec::with_capacity(10) | constant capacity |
| 603 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | TangentTracer::solve4 | swap | 1 | proven | swap(c, p) | c and pivot p in 0..4 on fixed four-row array |
| 604 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | TangentTracer::step | int-div | 1 | proven | i / 2 | constant non-zero divisor |
| 605 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | TangentTracer::step | int-rem | 1 | proven | i % 2 | constant non-zero divisor |
| 606 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | tc_near_poly | windows | 1 | proven | windows(2) | constant non-zero size |
| 607 | crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rs | tc_poly_dist | windows | 1 | proven | windows(2) | constant non-zero size |
| 608 | crates/solidcore/src/intersect/surface_tracer.rs | find_boundary_start_points_base | Vec::swap_remove | 1 | proven | swap_remove(side) | side in 0..=1 and uv_curves.len() == 2 checked |
| 609 | crates/solidcore/src/intersect/surface_tracer.rs | flush_curve | windows | 1 | proven | windows(2) | constant non-zero size |
| 610 | crates/solidcore/src/intersect/topology_solver/p2.rs | swap_curve_surface_parameters | rotate | 1 | proven | rotate_left(1) | get_mut(..3)? yields a slice of length 3, so rotation by 1 fits |
| 611 | crates/solidcore/src/intersect/topology_solver/p2.rs | swap_curve_surface_parameters | rotate | 2 | proven | rotate_left(1) | get_mut(..3)? yields a slice of length 3, so rotation by 1 fits |
| 612 | crates/solidcore/src/mass/integrator.rs | OdeIntegrator::integrate | copy_from_slice | 1 | open | copy_from_slice(&y) | |
| 613 | crates/solidcore/src/mass/integrator/properties.rs | boundary_properties | windows | 1 | proven | windows(2) | constant non-zero size |
| 614 | crates/solidcore/src/nurbs/b_spline_curve/analysis.rs | pairs | windows | 1 | proven | windows(2) | constant non-zero size |
| 615 | crates/solidcore/src/nurbs/b_spline_curve/p1.rs | BSplineCurve::control_polygon | with_capacity | 1 | open | Vec::with_capacity(pw.len()) | |
| 616 | crates/solidcore/src/nurbs/b_spline_curve/p1.rs | BSplineCurve::from_data | copy_from_slice | 1 | open | copy_from_slice(src_u) | |
| 617 | crates/solidcore/src/nurbs/b_spline_curve/p1.rs | BSplineCurve::from_data | copy_from_slice | 2 | open | copy_from_slice(src_pw) | |
| 618 | crates/solidcore/src/nurbs/b_spline_curve/p2.rs | BSplineCurve::calculate_bounding_box_onto | int-div | 1 | proven | num_points / smp_cnt | num_points >= 1 is checked; smp_cnt = num_points.min(7) |
| 619 | crates/solidcore/src/nurbs/b_spline_curve/p2.rs | BSplineCurve::join | Vec::insert | 1 | proven | insert(1, mid) | seg_pts.get(1) succeeds before insertion; inserting at 1 only grows it |
| 620 | crates/solidcore/src/nurbs/b_spline_curve/p2.rs | BSplineCurve::join | Vec::insert | 2 | proven | insert(1, mid1) | seg_pts.get(1) succeeds before insertion; inserting at 1 only grows it |
| 621 | crates/solidcore/src/nurbs/b_spline_curve/p2.rs | BSplineCurve::join | Vec::insert | 3 | proven | insert(2, mid2) | seg_pts.get(1) succeeds before insertion; inserting at 1 only grows it |
| 622 | crates/solidcore/src/nurbs/b_spline_curve/p2.rs | BSplineCurve::read_from_db | int-div | 1 | proven | u64::MAX / (4 * 32) | constant non-zero divisor |
| 623 | crates/solidcore/src/nurbs/b_spline_curve/p3.rs | BSplineCurve::assert_no_periodic_jump | windows | 1 | proven | windows(2) | constant non-zero size |
| 624 | crates/solidcore/src/nurbs/b_spline_curve/p3.rs | BSplineCurve::assert_valid_with | with_capacity | 1 | open | Vec::with_capacity(solutions.len()) | |
| 625 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::create_interpolating_curve_with_params | windows | 1 | proven | windows(2) | constant non-zero size |
| 626 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::dampen_knot_spacing | Vec::insert | 1 | open | insert(i + 1, split_knot) | |
| 627 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::deform_to_end_point_targets | int-div | 1 | proven | DISP_INSIDE_KNT_CNT / 2 | constant non-zero divisor |
| 628 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::deform_to_end_point_targets | int-div | 2 | proven | DISP_INSIDE_KNT_CNT / 2 | constant non-zero divisor |
| 629 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::deform_to_end_point_targets | int-div | 3 | open | div_ceil(2) | |
| 630 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::deform_to_end_point_targets | int-div | 4 | open | div_ceil(2) | |
| 631 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::deform_to_end_point_targets | int-rem | 1 | proven | degree % 2 | constant non-zero divisor |
| 632 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::deform_to_end_point_targets | with_capacity | 1 | open | Vec::with_capacity(curr_reg2_cnt) | |
| 633 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::make_curves_compatible | with_capacity | 1 | open | Vec::with_capacity(curves.len()) | |
| 634 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::set_intersection_curve_through_point | copy_from_slice | 1 | open | copy_from_slice(&pu) | |
| 635 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::set_intersection_curve_through_point | copy_from_slice | 2 | open | copy_from_slice(&pu) | |
| 636 | crates/solidcore/src/nurbs/b_spline_curve_n_lib.rs | BSplineCurve::synchronize_knots_of_curves | with_capacity | 1 | open | Vec::with_capacity(curves.len()) | |
| 637 | crates/solidcore/src/nurbs/b_spline_surface/p1.rs | BSplineSurface::from_data | copy_from_slice | 1 | proven | copy_from_slice(src_u) | allocate_nurb_surface sizes knots to r + 1 and s + 1; checked source slices match |
| 638 | crates/solidcore/src/nurbs/b_spline_surface/p1.rs | BSplineSurface::from_data | copy_from_slice | 2 | proven | copy_from_slice(src_v) | allocate_nurb_surface sizes knots to r + 1 and s + 1; checked source slices match |
| 639 | crates/solidcore/src/nurbs/b_spline_surface/p1.rs | BSplineSurface::read_from_db | int-div | 1 | proven | u64::MAX / (4 * 32) | constant non-zero divisor |
| 640 | crates/solidcore/src/nurbs/b_spline_surface/p1.rs | BSplineSurface::read_from_db | int-div | 2 | proven | max_cpoints / (n as u64 + 1) | n >= p >= 1 is checked; n is an i64, so n as u64 + 1 cannot wrap |
| 641 | crates/solidcore/src/nurbs/b_spline_surface/p2.rs | BSplineSurface::analytic_or_exact_copy | with_capacity | 1 | proven | Vec::with_capacity(49) | constant capacity |
| 642 | crates/solidcore/src/nurbs/b_spline_surface/p2.rs | BSplineSurface::create_sphere_from_arcs | int-rem | 1 | proven | (gen_curve_index + 1) % total_curves | returns Err unless total_curves == 3 |
| 643 | crates/solidcore/src/nurbs/b_spline_surface/p2.rs | BSplineSurface::create_sphere_from_arcs | int-rem | 2 | proven | ((gen_curve_index + total_curves) - 1) % total_curves | returns Err unless total_curves == 3 |
| 644 | crates/solidcore/src/nurbs/b_spline_surface/p2.rs | transpose | int-div | 1 | proven | a.len() / num_rows | returns before division when num_rows < 1 |
| 645 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/approx.rs | BSplineSurface::approximate_points | chunks | 1 | proven | chunks(cols.max(1)) | cols.max(1) is nonzero |
| 646 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p1.rs | BSplineSurface::create_n_sided_patch | with_capacity | 1 | open | Vec::with_capacity(bdry_crvs.len()) | |
| 647 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p1.rs | BSplineSurface::create_n_sided_patch | with_capacity | 2 | open | Vec::with_capacity(bdry_crvs.len()) | |
| 648 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | BSplineSurface::evaluate_impl | int-div | 1 | proven | k / nv1 | highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1 |
| 649 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | BSplineSurface::evaluate_impl | int-div | 2 | proven | k / nv1 | highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1 |
| 650 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | BSplineSurface::evaluate_impl | int-rem | 1 | proven | k % nv1 | highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1 |
| 651 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | BSplineSurface::evaluate_impl | int-rem | 2 | proven | k % nv1 | highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1 |
| 652 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | approximate_tangent_field | windows | 1 | proven | windows(2) | constant non-zero size |
| 653 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | approximate_tangent_field | with_capacity | 1 | proven | Vec::with_capacity(256 * 4 * 2) | constant capacity |
| 654 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | approximate_tangent_field | with_capacity | 2 | proven | Vec::with_capacity(256) | constant capacity |
| 655 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | approximate_tangent_field | with_capacity | 3 | proven | Vec::with_capacity(256) | constant capacity |
| 656 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | corner_blend_4 | int-rem | 1 | proven | ii % 2 | constant non-zero divisor |
| 657 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | corner_blend_4 | with_capacity | 1 | proven | Vec::with_capacity(4) | constant capacity |
| 658 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | corner_blend_4 | with_capacity | 2 | proven | Vec::with_capacity(4) | constant capacity |
| 659 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | corner_blend_n | with_capacity | 1 | proven | Vec::with_capacity(cnt) | cnt = boundaries.len(), an existing Vec of the same BSplineCurve elements |
| 660 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | project_coons_side_rows | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 661 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | project_coons_side_rows | with_capacity | 2 | proven | Vec::with_capacity(2) | constant capacity |
| 662 | crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rs | refine_to_spans | windows | 1 | proven | windows(2) | constant non-zero size |
| 663 | crates/solidcore/src/nurbs/basis_basic.rs | compatible_knot_vectors_to_tol | with_capacity | 1 | proven | Vec::with_capacity(knots.len()) | knots is an existing slice of Vec<f64>; new i64 elements are no larger |
| 664 | crates/solidcore/src/nurbs/bezier.rs | band_matrix_into | int-div | 1 | proven | n / 2 | constant non-zero divisor |
| 665 | crates/solidcore/src/nurbs/bezier.rs | reduce_degree | int-rem | 1 | proven | p % 2 | constant non-zero divisor |
| 666 | crates/solidcore/src/nurbs/bezier.rs | reduce_mid | int-div | 1 | proven | p.saturating_sub(1) / 2 | constant non-zero divisor |
| 667 | crates/solidcore/src/nurbs/crv_adv/p1.rs | cmax_derivs | int-rem | 1 | proven | ii % 2 | constant non-zero divisor |
| 668 | crates/solidcore/src/nurbs/crv_adv/p1.rs | cmax_new_cpts | int-rem | 1 | proven | jj % 2 | constant non-zero divisor |
| 669 | crates/solidcore/src/nurbs/crv_approx.rs | approx_nurbs_with_non_rat_crv | with_capacity | 1 | proven | Vec::with_capacity(bez.len()) | bez is an existing Vec<Curve>; new i64 elements are no larger |
| 670 | crates/solidcore/src/nurbs/crv_approx.rs | calc_num_cpts_to_approx_arc | f64::clamp | 1 | proven | clamp(1.0e-6, 1.0) | constant bounds, min <= max |
| 671 | crates/solidcore/src/nurbs/crv_common.rs | quadratic_arc_min_arcs | int-div | 1 | proven | cd.n / 2 | constant non-zero divisor |
| 672 | crates/solidcore/src/nurbs/crv_common.rs | quartic_arc_tol | int-div | 1 | proven | n / 4 | constant non-zero divisor |
| 673 | crates/solidcore/src/nurbs/crv_fit/p3.rs | approx_closed_conditions | int-div | 1 | proven | n / 2 | constant non-zero divisor |
| 674 | crates/solidcore/src/nurbs/crv_fit/p3.rs | interp_end_derivs | copy_from_slice | 1 | proven | copy_from_slice(&pw) | returns Err when the lengths differ |
| 675 | crates/solidcore/src/nurbs/crv_fit/p3.rs | interp_end_derivs | copy_from_slice | 2 | proven | copy_from_slice(&uk) | returns Err when dk.len() != uk.len() |
| 676 | crates/solidcore/src/nurbs/crv_geom.rs | Curve::approx_with_polyline | int-div | 1 | proven | (p + 1) / 2 | constant non-zero divisor |
| 677 | crates/solidcore/src/nurbs/crv_nurb.rs | Curve::reverse | int-div | 1 | proven | n / 2 | constant non-zero divisor |
| 678 | crates/solidcore/src/nurbs/crv_nurb.rs | pascal | int-div | 1 | proven | k / 2 | constant non-zero divisor |
| 679 | crates/solidcore/src/nurbs/crv_offset.rs | Curve::offset_pt_sampling_cancellable | with_capacity | 1 | proven | Vec::with_capacity(bez.len()) | bez is an existing Vec<Curve>; new isize elements are no larger |
| 680 | crates/solidcore/src/nurbs/crv_offset.rs | offset_sample_bound | Ord::clamp | 1 | proven | clamp(MAX_OFFSET_SAMPLES, MAX_OFFSET_SAMPLES_ANY) | constant bounds 16384 <= 1 << 17 |
| 681 | crates/solidcore/src/nurbs/crv_tool/p1.rs | Curve::elevate_degree | int-div | 1 | proven | (oldr + 2) / 2 | constant non-zero divisor |
| 682 | crates/solidcore/src/nurbs/crv_tool/p1.rs | Curve::elevate_degree | int-div | 2 | proven | (r + 1) / 2 | constant non-zero divisor |
| 683 | crates/solidcore/src/nurbs/crv_tool/p1.rs | Curve::remove_knot | int-div | 1 | proven | (2 * spn - mlt - p) / 2 | constant non-zero divisor |
| 684 | crates/solidcore/src/nurbs/crv_tool/p1.rs | Curve::remove_knot | int-rem | 1 | proven | l % 2 | constant non-zero divisor |
| 685 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::reduce_degree_once | int-div | 1 | proven | (oldr + 2) / 2 | constant non-zero divisor |
| 686 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::reduce_degree_once | int-div | 2 | proven | (2 * p - k + 1) / 2 | constant non-zero divisor |
| 687 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::reduce_degree_once | int-rem | 1 | proven | k % 2 | constant non-zero divisor |
| 688 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::remove_knots_constrained | int-div | 1 | proven | (p + s + 1) / 2 | constant non-zero divisor |
| 689 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::remove_knots_constrained | int-div | 2 | proven | (p + s) / 2 | constant non-zero divisor |
| 690 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::remove_knots_constrained | int-div | 3 | proven | (2 * r - s - p) / 2 | constant non-zero divisor |
| 691 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::remove_knots_constrained | int-rem | 1 | proven | (p + s) % 2 | constant non-zero divisor |
| 692 | crates/solidcore/src/nurbs/crv_tool/p2.rs | Curve::remove_knots_constrained | int-rem | 2 | proven | (p + s) % 2 | constant non-zero divisor |
| 693 | crates/solidcore/src/nurbs/fit_arrays.rs | mat_slot | int-div | 1 | proven | k / cols | returns Err when cols == 0 or k < 0, excluding both zero and MIN / -1 |
| 694 | crates/solidcore/src/nurbs/fit_arrays.rs | mat_slot | int-rem | 1 | proven | k % cols | returns Err when cols == 0 or k < 0, excluding both zero and MIN / -1 |
| 695 | crates/solidcore/src/nurbs/funcs_adv.rs | multiply | int-div | 1 | proven | (rem + 2) / 2 | constant non-zero divisor |
| 696 | crates/solidcore/src/nurbs/funcs_adv.rs | multiply | int-div | 2 | proven | (tt + 1) / 2 | constant non-zero divisor |
| 697 | crates/solidcore/src/nurbs/funcs_basic.rs | CurveFunction::derivs | with_capacity | 1 | proven | Vec::with_capacity(nd.derivs.len()) | nd.derivs is an existing Vec<Vec<f64>>; new f64 elements are no larger |
| 698 | crates/solidcore/src/nurbs/funcs_basic.rs | SurfaceFunction::eval | with_capacity | 1 | proven | Vec::with_capacity(nu.values.len()) | nu.values is an existing Vec<f64>, the same element type |
| 699 | crates/solidcore/src/nurbs/geom.rs | dist_cpolygon | windows | 1 | proven | windows(2) | constant non-zero size |
| 700 | crates/solidcore/src/nurbs/geom.rs | dist_polygon | windows | 1 | proven | windows(2) | constant non-zero size |
| 701 | crates/solidcore/src/nurbs/geom.rs | vectors_angle | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 702 | crates/solidcore/src/nurbs/geom.rs | vectors_cos_angle | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 703 | crates/solidcore/src/nurbs/iges.rs | validate | windows | 1 | proven | windows(2) | constant non-zero size |
| 704 | crates/solidcore/src/nurbs/knots.rs | KnotVector::find_span | int-div | 1 | proven | (low + high) / 2 | constant non-zero divisor |
| 705 | crates/solidcore/src/nurbs/knots.rs | KnotVector::find_span | int-div | 2 | proven | (low + high) / 2 | constant non-zero divisor |
| 706 | crates/solidcore/src/nurbs/knots.rs | KnotVector::find_span | int-div | 3 | proven | (low + high) / 2 | constant non-zero divisor |
| 707 | crates/solidcore/src/nurbs/knots.rs | KnotVector::span_count | windows | 1 | proven | windows(2) | constant non-zero size |
| 708 | crates/solidcore/src/nurbs/math.rs | RealMatrix::for_back_cpoints | int-div | 1 | proven | self.bw / 2 | constant non-zero divisor |
| 709 | crates/solidcore/src/nurbs/math.rs | RealMatrix::for_back_points | int-div | 1 | proven | self.bw / 2 | constant non-zero divisor |
| 710 | crates/solidcore/src/nurbs/math.rs | RealMatrix::lu_decompose | int-div | 1 | proven | bw / 2 | constant non-zero divisor |
| 711 | crates/solidcore/src/nurbs/math.rs | RealMatrix::multiply_cpoints | int-div | 1 | proven | bw / 2 | constant non-zero divisor |
| 712 | crates/solidcore/src/nurbs/math.rs | RealMatrix::multiply_points | int-div | 1 | proven | bw / 2 | constant non-zero divisor |
| 713 | crates/solidcore/src/nurbs/math.rs | RealMatrix::right_for_back | int-div | 1 | proven | self.bw / 2 | constant non-zero divisor |
| 714 | crates/solidcore/src/nurbs/math.rs | RealMatrix::transpose_fill | int-div | 1 | proven | bw / 2 | constant non-zero divisor |
| 715 | crates/solidcore/src/nurbs/math.rs | pascal_triangle | int-div | 1 | proven | k / 2 | constant non-zero divisor |
| 716 | crates/solidcore/src/nurbs/nurbs_crv.rs | copy_into | copy_from_slice | 1 | proven | copy_from_slice(src) | destination is checked get_mut(..src.len()), so lengths match |
| 717 | crates/solidcore/src/nurbs/nurbs_crv.rs | crv_remove_knots | int-div | 1 | proven | (p + s + 1) / 2 | constant non-zero divisor |
| 718 | crates/solidcore/src/nurbs/nurbs_crv.rs | crv_remove_knots | int-div | 2 | proven | (p + s) / 2 | constant non-zero divisor |
| 719 | crates/solidcore/src/nurbs/nurbs_crv.rs | crv_remove_knots | int-div | 3 | proven | (2 * r - s - p) / 2 | constant non-zero divisor |
| 720 | crates/solidcore/src/nurbs/nurbs_crv.rs | crv_remove_knots | int-rem | 1 | proven | (p + s) % 2 | constant non-zero divisor |
| 721 | crates/solidcore/src/nurbs/nurbs_crv.rs | crv_remove_knots | int-rem | 2 | proven | (p + s) % 2 | constant non-zero divisor |
| 722 | crates/solidcore/src/nurbs/nurbs_crv.rs | crv_remove_knots | int-rem | 3 | proven | (p + s) % 2 | constant non-zero divisor |
| 723 | crates/solidcore/src/nurbs/nurbs_srf.rs | compute_net_constants | int-div | 1 | proven | m / ii | ii is in 1..=m or 1..=n, so ii > 0 |
| 724 | crates/solidcore/src/nurbs/nurbs_srf.rs | compute_net_constants | int-div | 2 | proven | n / ii | ii is in 1..=m or 1..=n, so ii > 0 |
| 725 | crates/solidcore/src/nurbs/nurbs_srf.rs | turn | f64::clamp | 1 | proven | clamp(-1.0, 1.0) | constant bounds, min <= max |
| 726 | crates/solidcore/src/nurbs/srf_adv/p1.rs | create_skin_spine | split_at | 1 | open | split_at_mut(k) | |
| 727 | crates/solidcore/src/nurbs/srf_adv/p1.rs | create_skin_spine | with_capacity | 1 | open | Vec::with_capacity(k + 1) | |
| 728 | crates/solidcore/src/nurbs/srf_adv/p1.rs | create_skin_spine | with_capacity | 2 | open | Vec::with_capacity(nc + 1) | |
| 729 | crates/solidcore/src/nurbs/srf_adv/p1.rs | cross_boundary_derivs_vector_field | with_capacity | 1 | open | Vec::with_capacity(pw.len()) | |
| 730 | crates/solidcore/src/nurbs/srf_adv/p1.rs | cross_boundary_derivs_vector_field | with_capacity | 2 | open | Vec::with_capacity(pw.len()) | |
| 731 | crates/solidcore/src/nurbs/srf_adv/p3.rs | cmax_points | int-rem | 1 | proven | jj % 2 | constant non-zero divisor |
| 732 | crates/solidcore/src/nurbs/srf_adv/p3.rs | cmax_points | int-rem | 2 | proven | jj % 2 | constant non-zero divisor |
| 733 | crates/solidcore/src/nurbs/srf_adv/p3.rs | cmax_points | int-rem | 3 | proven | jj % 2 | constant non-zero divisor |
| 734 | crates/solidcore/src/nurbs/srf_adv/p3.rs | cmax_points | int-rem | 4 | proven | jj % 2 | constant non-zero divisor |
| 735 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_skin_srf | int-div | 1 | proven | ki / 2 | constant non-zero divisor |
| 736 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_skin_srf | int-div | 2 | proven | (ki + 1) / 2 | constant non-zero divisor |
| 737 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_skin_srf | split_at | 1 | proven | split_at_mut(k) | k = cur.len().checked_sub(1), so k < cur.len() |
| 738 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_swung_srf | with_capacity | 1 | proven | Vec::with_capacity(pw.len()) | pw is an existing CPoint slice; new Vec<CPoint> headers are no larger |
| 739 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_swung_srf | with_capacity | 2 | proven | Vec::with_capacity(tw.len()) | tw is an existing CPoint slice; new CPoint elements are no larger |
| 740 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_trans_sweep_srf | with_capacity | 1 | proven | Vec::with_capacity(sw.len()) | sw is an existing CPoint slice; new Vec<CPoint> headers are no larger |
| 741 | crates/solidcore/src/nurbs/srf_adv/p3.rs | create_trans_sweep_srf | with_capacity | 2 | proven | Vec::with_capacity(tw.len()) | tw is an existing CPoint slice; new CPoint elements are no larger |
| 742 | crates/solidcore/src/nurbs/srf_adv/p3.rs | shetty_white | with_capacity | 1 | proven | Vec::with_capacity(4) | constant capacity |
| 743 | crates/solidcore/src/nurbs/srf_adv/p4.rs | combine_coons | with_capacity | 1 | proven | Vec::with_capacity(idx.n + 1) | n + 1 <= stored net.len(), the same Vec<CPoint> element type |
| 744 | crates/solidcore/src/nurbs/srf_adv/p4.rs | combine_coons | with_capacity | 2 | proven | Vec::with_capacity(idx.m + 1) | m + 1 <= stored row.len(), the same CPoint element type |
| 745 | crates/solidcore/src/nurbs/srf_adv/p4.rs | create_skin_srf_boundary_derivs | swap | 1 | proven | swap(0, 1) | returns Err when net.len() < 2 |
| 746 | crates/solidcore/src/nurbs/srf_adv/p4.rs | create_skin_srf_boundary_derivs | swap | 2 | proven | swap(0, 1) | returns Err when row.len() < 2 |
| 747 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | copy_from_slice | 1 | open | copy_from_slice(kv) | |
| 748 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | copy_from_slice | 2 | open | copy_from_slice(ku) | |
| 749 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 1 | open | Vec::with_capacity(k + 1) | |
| 750 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 2 | open | Vec::with_capacity(k + 1) | |
| 751 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 3 | open | Vec::with_capacity(k + 1) | |
| 752 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 4 | open | Vec::with_capacity(k + 1) | |
| 753 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 5 | open | Vec::with_capacity(k + 1) | |
| 754 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 6 | open | Vec::with_capacity(k + 1) | |
| 755 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 7 | open | Vec::with_capacity(k + 1) | |
| 756 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 8 | open | Vec::with_capacity(k + 1) | |
| 757 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 9 | open | Vec::with_capacity(k + 1) | |
| 758 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 10 | open | Vec::with_capacity(k + 1) | |
| 759 | crates/solidcore/src/nurbs/srf_adv/p6.rs | fill_n_sided_hole | with_capacity | 11 | open | Vec::with_capacity(k + 1) | |
| 760 | crates/solidcore/src/nurbs/srf_adv/p6.rs | frame_subsampling | int-div | 1 | proven | MAXPTS / 2 | constant non-zero divisor |
| 761 | crates/solidcore/src/nurbs/srf_adv/p6.rs | frame_subsampling | int-div | 2 | proven | MAXPTS / 5 | constant non-zero divisor |
| 762 | crates/solidcore/src/nurbs/srf_adv/p6.rs | frame_subsampling | int-div | 3 | proven | MAXPTS / 10 | constant non-zero divisor |
| 763 | crates/solidcore/src/nurbs/srf_adv/p6.rs | frame_subsampling | int-div | 4 | proven | MAXPTS / 20 | constant non-zero divisor |
| 764 | crates/solidcore/src/nurbs/srf_adv/p6.rs | sweep_scale | int-div | 1 | open | mm / kk | |
| 765 | crates/solidcore/src/nurbs/srf_adv/p6.rs | sweep_scale | int-div | 2 | proven | n_placed / 2 | constant non-zero divisor |
| 766 | crates/solidcore/src/nurbs/srf_adv/p6.rs | sweep_scale | with_capacity | 1 | open | Vec::with_capacity(segs.len()) | |
| 767 | crates/solidcore/src/nurbs/srf_adv/p6.rs | sweep_scale | with_capacity | 2 | open | Vec::with_capacity(kk * (nn + 1) + 1) | |
| 768 | crates/solidcore/src/nurbs/srf_adv/p6.rs | sweep_scale | with_capacity | 3 | open | Vec::with_capacity(np + 1) | |
| 769 | crates/solidcore/src/nurbs/srf_adv/p6.rs | sweep_scale | with_capacity | 4 | open | Vec::with_capacity(np + 1) | |
| 770 | crates/solidcore/src/nurbs/srf_common.rs | cyl_cone | with_capacity | 1 | proven | Vec::with_capacity(n + 1) | n + 1 <= cur.cpts().len(), an existing CPoint slice of the same element type |
| 771 | crates/solidcore/src/nurbs/srf_common.rs | cyl_cone | with_capacity | 2 | proven | Vec::with_capacity(n + 1) | n + 1 <= cur.cpts().len(), an existing CPoint slice of the same element type |
| 772 | crates/solidcore/src/nurbs/srf_common.rs | revolved_srf | with_capacity | 1 | proven | Vec::with_capacity(m + 1) | m + 1 <= cur.cpts().len(), an existing CPoint slice of the same element type |
| 773 | crates/solidcore/src/nurbs/srf_common.rs | ruled_srf | with_capacity | 1 | proven | Vec::with_capacity(n + 1) | n + 1 <= cur_b.cpts().len(), an existing CPoint slice of the same element type |
| 774 | crates/solidcore/src/nurbs/srf_common.rs | ruled_srf | with_capacity | 2 | proven | Vec::with_capacity(n + 1) | n + 1 <= cur_b.cpts().len(), an existing CPoint slice of the same element type |
| 775 | crates/solidcore/src/nurbs/srf_nurb.rs | Surface::euclid_net | with_capacity | 1 | proven | Vec::with_capacity(n + 1) | n + 1 <= stored net.len(); new Vec<Vec3> and Vec<f64> row headers match existing Vec<CPoint> headers |
| 776 | crates/solidcore/src/nurbs/srf_nurb.rs | Surface::euclid_net | with_capacity | 2 | proven | Vec::with_capacity(n + 1) | n + 1 <= stored net.len(); new Vec<Vec3> and Vec<f64> row headers match existing Vec<CPoint> headers |
| 777 | crates/solidcore/src/nurbs/srf_nurb.rs | Surface::reverse | int-div | 1 | proven | n / 2 | constant non-zero divisor |
| 778 | crates/solidcore/src/nurbs/srf_nurb.rs | Surface::reverse | int-div | 2 | proven | m / 2 | constant non-zero divisor |
| 779 | crates/solidcore/src/nurbs/srf_offset.rs | Surface::offset_general | f64::clamp | 1 | proven | clamp(1.0, SLM) | constant finite bounds 1.0 <= SLM (1000.0) |
| 780 | crates/solidcore/src/nurbs/srf_offset.rs | Surface::offset_general | with_capacity | 1 | proven | Vec::with_capacity(ku) | ku = bez.len(), an existing Vec of elements no smaller than isize |
| 781 | crates/solidcore/src/nurbs/srf_offset.rs | Surface::offset_general | with_capacity | 2 | proven | Vec::with_capacity(lv) | lv = bez.first().len(), an existing Vec of elements no smaller than isize |
| 782 | crates/solidcore/src/nurbs/srf_offset.rs | Surface::offset_refined | windows | 1 | proven | windows(2) | constant non-zero size |
| 783 | crates/solidcore/src/nurbs/srf_offset.rs | Surface::offset_refined | windows | 2 | proven | windows(2) | constant non-zero size |
| 784 | crates/solidcore/src/nurbs/srf_offset.rs | refine_parameters | windows | 1 | proven | windows(2) | constant non-zero size |
| 785 | crates/solidcore/src/nurbs/srf_tool/p2.rs | elevate_rows | int-div | 1 | proven | (oldr + 2) / 2 | constant non-zero divisor |
| 786 | crates/solidcore/src/nurbs/srf_tool/p2.rs | elevate_rows | int-div | 2 | proven | (r + 1) / 2 | constant non-zero divisor |
| 787 | crates/solidcore/src/nurbs/srf_tool/p2.rs | remove_conditional_rows | int-div | 1 | proven | (2 * spn - mlt - deg) / 2 | constant non-zero divisor |
| 788 | crates/solidcore/src/nurbs/srf_tool/p2.rs | remove_conditional_rows | int-rem | 1 | proven | l % 2 | constant non-zero divisor |
| 789 | crates/solidcore/src/nurbs/srf_tool/p3.rs | RemoveAll::step | int-div | 1 | proven | (deg + sd + 1) / 2 | constant non-zero divisor |
| 790 | crates/solidcore/src/nurbs/srf_tool/p3.rs | RemoveAll::step | int-div | 2 | proven | (deg + sd) / 2 | constant non-zero divisor |
| 791 | crates/solidcore/src/nurbs/srf_tool/p3.rs | RemoveAll::step | int-div | 3 | proven | (2 * rd - sd - deg) / 2 | constant non-zero divisor |
| 792 | crates/solidcore/src/nurbs/srf_tool/p3.rs | RemoveAll::step | int-rem | 1 | proven | (deg + sd) % 2 | constant non-zero divisor |
| 793 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::deriv_u | windows | 1 | proven | windows(2) | constant non-zero size |
| 794 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::deriv_v | windows | 1 | proven | windows(2) | constant non-zero size |
| 795 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::mul | chunks | 1 | proven | chunks_mut(dv + 1) | dv <= MAX_DEGREE (96), checked in new() and kept by every constructor, so dv + 1 is 1..=97 |
| 796 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::rows | chunks | 1 | proven | chunks(self.dv + 1) | dv <= MAX_DEGREE (96), checked in new() and kept by every constructor, so dv + 1 is 1..=97 |
| 797 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::split_v | with_capacity | 1 | proven | Vec::with_capacity(self.c.len()) | the length of a Vec already in memory |
| 798 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::split_v | with_capacity | 2 | proven | Vec::with_capacity(self.c.len()) | the length of a Vec already in memory |
| 799 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::transpose | step_by | 1 | proven | step_by(self.dv + 1) | dv <= MAX_DEGREE (96), checked in new() and kept by every constructor, so dv + 1 is 1..=97 |
| 800 | crates/solidcore/src/offset/construction/bernstein.rs | Bernstein2::transpose | with_capacity | 1 | proven | Vec::with_capacity(self.c.len()) | the length of a Vec already in memory |
| 801 | crates/solidcore/src/offset/construction/bernstein.rs | Binomials::new | windows | 1 | proven | windows(2) | constant non-zero size |
| 802 | crates/solidcore/src/offset/construction/bernstein.rs | eval_1d | windows | 1 | proven | windows(2) | constant non-zero size |
| 803 | crates/solidcore/src/offset/construction/bernstein.rs | split_1d | windows | 1 | proven | windows(2) | constant non-zero size |
| 804 | crates/solidcore/src/offset/construction/bernstein.rs | split_1d | with_capacity | 1 | proven | Vec::with_capacity(c.len()) | the length of a Vec already in memory |
| 805 | crates/solidcore/src/offset/construction/bernstein.rs | split_1d | with_capacity | 2 | proven | Vec::with_capacity(c.len()) | the length of a Vec already in memory |
| 806 | crates/solidcore/src/offset/construction/sheets.rs | greville | windows | 1 | proven | windows(DEGREE + 2) | constant non-zero size (DEGREE is a const) |
| 807 | crates/solidcore/src/offset/construction/sheets.rs | least_radius | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 808 | crates/solidcore/src/offset/construction/sheets.rs | least_radius | f64::clamp | 2 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 809 | crates/solidcore/src/offset/construction/sheets.rs | local | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 810 | crates/solidcore/src/offset/construction/sheets.rs | local | f64::clamp | 2 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 811 | crates/solidcore/src/offset/construction/sheets.rs | span_of | windows | 1 | proven | windows(2) | constant non-zero size |
| 812 | crates/solidcore/src/offset/offset_executive/p1.rs | sort_edgeuses | swap | 1 | open | swap(i - 1, i) | |
| 813 | crates/solidcore/src/offset/offset_executive/p2.rs | api_shell_brep_full | with_capacity | 1 | open | Vec::with_capacity(faces.len()) | |
| 814 | crates/solidcore/src/offset/offset_executive/step_gaps.rs | OffsetExecutive::close_loop_gaps_in | int-rem | 1 | open | (kk + 1) % num | |
| 815 | crates/solidcore/src/offset/offset_executive/step_gaps.rs | OffsetExecutive::split_corner_vertices | int-rem | 1 | open | (kk + 1) % num | |
| 816 | crates/solidcore/src/offset/offset_faces.rs | OffsetFacesExecutive::join_across_closed_walls | Vec::remove | 1 | proven | remove(at) | at comes from position() over the same Vec just above |
| 817 | crates/solidcore/src/offset/offset_geometry_creation.rs | OffsetGeometryCreation::create_step_wall | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 818 | crates/solidcore/src/offset/offset_geometry_creation.rs | OffsetGeometryCreation::vertex_offset_with_backend | int-rem | 1 | open | (j + 1) % curves.len() | |
| 819 | crates/solidcore/src/offset/offset_geometry_creation.rs | OffsetGeometryCreation::vertex_offset_with_backend | int-rem | 2 | proven | (kk + 1) % 3 | constant non-zero divisor |
| 820 | crates/solidcore/src/offset/offset_geometry_creation.rs | OffsetGeometryCreation::vertex_offset_with_backend | int-rem | 3 | proven | (other + 1) % 3 | constant non-zero divisor |
| 821 | crates/solidcore/src/primitive/api_curve_ops.rs | create_curve_interp_points | windows | 1 | proven | windows(2) | constant non-zero size |
| 822 | crates/solidcore/src/primitive/api_curves.rs | create_curve | with_capacity | 1 | proven | Vec::with_capacity(num_knots) | num_knots < points.len(), an in-memory slice |
| 823 | crates/solidcore/src/primitive/api_curves.rs | create_curve | with_capacity | 2 | proven | Vec::with_capacity(num_knots) | num_knots < points.len(), an in-memory slice |
| 824 | crates/solidcore/src/primitive/api_curves.rs | create_curve_approx_points | int-div | 1 | proven | points.len() / 2 | constant non-zero divisor |
| 825 | crates/solidcore/src/primitive/api_curves.rs | create_curve_approx_points | int-div | 2 | proven | points.len() / 4 | constant non-zero divisor |
| 826 | crates/solidcore/src/primitive/api_curves.rs | create_helix | Ord::clamp | 1 | proven | clamp(1024, 20000) | constant bounds, min <= max |
| 827 | crates/solidcore/src/primitive/api_curves.rs | segments | int-rem | 1 | proven | (ii + 1) % points.len() | inside iteration over points, so len() > 0 |
| 828 | crates/solidcore/src/primitive/api_curves.rs | segments | with_capacity | 1 | proven | Vec::with_capacity(points.len()) | points.len() is an in-memory slice length |
| 829 | crates/solidcore/src/primitive/api_primitives.rs | create_pyramid | int-rem | 1 | proven | (ii + 1) % 4 | constant non-zero divisor |
| 830 | crates/solidcore/src/primitive/api_primitives.rs | create_pyramid | int-rem | 2 | proven | (ii + 1) % 4 | constant non-zero divisor |
| 831 | crates/solidcore/src/primitive/primitive_creation/model.rs | PrimitiveModel::unlock_mark | Vec::remove | 1 | proven | remove(at) | at is rposition() in the same Vec |
| 832 | crates/solidcore/src/primitive/primitive_creation/p1/boolean.rs | finish_with | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 833 | crates/solidcore/src/primitive/primitive_creation/p1/boolean.rs | finish_with | step_by | 2 | proven | step_by(2) | constant non-zero step |
| 834 | crates/solidcore/src/primitive/primitive_creation/p2/access.rs | PrimitiveCreationAccess::boolean_trees | with_capacity | 1 | proven | Vec::with_capacity(breps.len()) | breps.len() is an in-memory slice length |
| 835 | crates/solidcore/src/primitive/primitive_creation/p2/planar_path.rs | PrimitiveCreation::create_sweep_along_planar_path_owned | with_capacity | 1 | proven | Vec::with_capacity(paths.len()) | paths.len() is an in-memory slice length |
| 836 | crates/solidcore/src/primitive/primitive_creation/p2/planar_path.rs | PrimitiveCreation::create_sweep_along_planar_path_owned | with_capacity | 2 | proven | Vec::with_capacity(count) | count is new_breps.len(), an in-memory Vec length |
| 837 | crates/solidcore/src/primitive/primitive_creation/p2/taper.rs | taper | Vec::split_off | 1 | proven | split_off(start.min(rest.len())) | start.min(rest.len()) is at most rest.len() |
| 838 | crates/solidcore/src/primitive/primitive_creation/p2/taper.rs | taper | with_capacity | 1 | proven | Vec::with_capacity(composite.segments().len()) | composite.segments().len() is an in-memory slice length |
| 839 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | crossing | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 840 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | curvature_keeping_walls | int-rem | 1 | proven | (i + count - 1) % count | inside for i in 0..count, so count > 0 |
| 841 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | curvature_keeping_walls | int-rem | 2 | proven | (i + 1) % count | inside for i in 0..count, so count > 0 |
| 842 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | curvature_keeping_walls | int-rem | 3 | proven | (i + 1) % count | inside for i in 0..count, so count > 0 |
| 843 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | half_quadratic_roots | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 844 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | has_corner | int-rem | 1 | proven | (i + count - 1) % count | inside for i in 0..count, so count > 0 |
| 845 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | seam_pcurve | windows | 1 | proven | windows(2) | constant non-zero size |
| 846 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | walls_closing_at_apexes | int-rem | 1 | proven | (i + count - 1) % count | inside for i in 0..count, so count > 0 |
| 847 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | walls_closing_at_apexes | int-rem | 2 | proven | (i + 1) % count | inside for i in 0..count, so count > 0 |
| 848 | crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rs | with_tangent_planes | int-rem | 1 | proven | (i + count - 1) % count | inside for i in 0..count, so count > 0 |
| 849 | crates/solidcore/src/primitive/primitive_creation/p3/sweeps.rs | split_curves_on_axis | with_capacity | 1 | proven | Vec::with_capacity(middle.len() + 1) | middle.len() + 1 <= at.len() + 1, an in-memory Vec length |
| 850 | crates/solidcore/src/query/api_queries.rs | edge_piece_points | windows | 1 | proven | windows(2) | constant non-zero size |
| 851 | crates/solidcore/src/query/face/p3.rs | find_and_classify_loop_bisector_cached | int-div | 1 | proven | sample_cnt / 2 | constant non-zero divisor |
| 852 | crates/solidcore/src/query/face/p3.rs | find_and_classify_loop_bisector_cached | int-rem | 1 | proven | in_loop.len() % 2 | constant non-zero divisor |
| 853 | crates/solidcore/src/query/face/p3.rs | find_and_classify_loop_bisector_cached | int-rem | 2 | proven | (jj + smp_inc) % sample_cnt | inside for jj in 0..sample_cnt, so sample_cnt > 0 |
| 854 | crates/solidcore/src/query/face/p4.rs | classify_loops_cached | int-div | 1 | proven | this_touches.len() / 2 | constant non-zero divisor |
| 855 | crates/solidcore/src/query/face/p4.rs | classify_loops_cached | int-rem | 1 | proven | out.ordered_no_area_indices.len() % 2 | constant non-zero divisor |
| 856 | crates/solidcore/src/query/face/p4.rs | classify_loops_cached | int-rem | 2 | proven | stack_cnt % 2 | constant non-zero divisor |
| 857 | crates/solidcore/src/query/face/p4.rs | classify_loops_cached | int-rem | 3 | proven | (j1 + 2) % done_size | inc_indx.filter requires done_size != 0 before the loop |
| 858 | crates/solidcore/src/query/face/p4.rs | classify_loops_cached | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 859 | crates/solidcore/src/query/face/p4.rs | is_odd | int-rem | 1 | proven | n % 2 | constant non-zero divisor |
| 860 | crates/solidcore/src/query/face/p4.rs | set_classify_loop_ios_size | Vec::split_off | 1 | proven | split_off(size) | size <= old + slack.len() in this branch and all contains both lists |
| 861 | crates/solidcore/src/query/loop.rs | WindingHull::of | windows | 1 | proven | windows(2) | constant non-zero size |
| 862 | crates/solidcore/src/query/loop.rs | contains_uv_point_with_topology | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 863 | crates/solidcore/src/query/poly.rs | PolyBrep::cpoly_remove_poly_face | Vec::remove | 1 | proven | remove(i) | i is position() in members; fallback found checked against members.len() |
| 864 | crates/solidcore/src/query/poly.rs | PolyBrep::cpoly_remove_poly_face | Vec::remove | 2 | proven | remove(found) | i is position() in members; fallback found checked against members.len() |
| 865 | crates/solidcore/src/query/poly.rs | PolyBrep::face_normal | int-rem | 1 | proven | (ii + 1) % total | inside total > 3 branch |
| 866 | crates/solidcore/src/query/poly.rs | PolyBrep::face_normal | int-rem | 2 | proven | (ii + 1) % total | inside total > 3 branch |
| 867 | crates/solidcore/src/query/poly.rs | PolyBrep::face_normal | int-rem | 3 | proven | (ii + 2) % total | inside total > 3 branch |
| 868 | crates/solidcore/src/query/poly.rs | PolyBrep::link_radials | int-rem | 1 | proven | (i + 1) % n | inside edges.iter().enumerate(), so n = edges.len() > 0 |
| 869 | crates/solidcore/src/query/poly.rs | PolyBrep::link_radials | int-rem | 2 | proven | (i + n - 1) % n | inside edges.iter().enumerate(), so n = edges.len() > 0 |
| 870 | crates/solidcore/src/query/tess.rs | TessSrfCache::implant_uv_segment | Vec::insert | 1 | proven | insert(0, TessHandle::PolyEdge(segment)) | index 0 is never past the end |
| 871 | crates/solidcore/src/surface/cone/p2.rs | ellipse_trim_intervals | int-rem | 1 | proven | (ii + 1) % cnt | cnt >= 2: the function returns above when it is less |
| 872 | crates/solidcore/src/surface/cone/p2.rs | ellipse_trim_intervals | int-rem | 2 | proven | (ii + 1) % cnt | cnt >= 2: the function returns above when it is less |
| 873 | crates/solidcore/src/surface/cone/p2.rs | ellipse_trim_intervals | int-rem | 3 | proven | (ii + cnt - 1) % cnt | cnt >= 2: the function returns above when it is less |
| 874 | crates/solidcore/src/surface/cone/p2.rs | ellipse_trim_intervals | with_capacity | 1 | proven | Vec::with_capacity(6) | constant capacity |
| 875 | crates/solidcore/src/surface/cone/p2.rs | ellipse_trim_intervals | with_capacity | 2 | proven | Vec::with_capacity(cnt) | cnt = xsect_angle.len(), an in-memory Vec |
| 876 | crates/solidcore/src/surface/cone/p3.rs | append_boundary_intersections | Vec::remove | 1 | proven | remove(j) | j is from enumerate() over the same Vec, with no intervening mutation |
| 877 | crates/solidcore/src/surface/cone/p3.rs | append_boundary_intersections | Vec::remove | 2 | proven | remove(j) | a Vec checked above to curves_3d's length; each removal takes one from all five |
| 878 | crates/solidcore/src/surface/cone/p3.rs | append_boundary_intersections | Vec::remove | 3 | proven | remove(j) | a Vec checked above to curves_3d's length; each removal takes one from all five |
| 879 | crates/solidcore/src/surface/cone/p3.rs | append_boundary_intersections | Vec::remove | 4 | proven | remove(j) | a Vec checked above to curves_3d's length; each removal takes one from all five |
| 880 | crates/solidcore/src/surface/cone/p3.rs | append_boundary_intersections | Vec::remove | 5 | proven | remove(j) | a Vec checked above to curves_3d's length; each removal takes one from all five |
| 881 | crates/solidcore/src/surface/extend/ball.rs | certify_circle | int-div | 1 | proven | n / 2 | constant non-zero divisor |
| 882 | crates/solidcore/src/surface/extend/ball.rs | certify_circle | int-div | 2 | proven | n / 2 | constant non-zero divisor |
| 883 | crates/solidcore/src/surface/implicit.rs | lies_on_canal | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 884 | crates/solidcore/src/surface/implicit.rs | lies_on_canal | windows | 1 | proven | windows(2) | constant non-zero size |
| 885 | crates/solidcore/src/surface/implicit.rs | sub_segment | windows | 1 | proven | windows(2) | constant non-zero size |
| 886 | crates/solidcore/src/surface/offset_surface.rs | AsItselfDir::join | Vec::insert | 1 | proven | insert(0, t) | index 0 is never past the end |
| 887 | crates/solidcore/src/surface/offset_surface.rs | AsItselfDir::join | Vec::insert | 2 | proven | insert(0, deg) | index 0 is never past the end |
| 888 | crates/solidcore/src/surface/offset_surface.rs | OffsetSurface::calculate_bounding_box_with | int-div | 1 | proven | crn / 4 | constant non-zero divisor |
| 889 | crates/solidcore/src/surface/offset_surface.rs | OffsetSurface::calculate_bounding_box_with | int-div | 2 | proven | crn / 2 | constant non-zero divisor |
| 890 | crates/solidcore/src/surface/offset_surface.rs | OffsetSurface::calculate_bounding_box_with | int-rem | 1 | proven | (crn / 4) % 2 | constant non-zero divisor |
| 891 | crates/solidcore/src/surface/offset_surface.rs | OffsetSurface::calculate_bounding_box_with | int-rem | 2 | proven | (crn / 2) % 2 | constant non-zero divisor |
| 892 | crates/solidcore/src/surface/offset_surface.rs | OffsetSurface::calculate_bounding_box_with | int-rem | 3 | proven | crn % 2 | constant non-zero divisor |
| 893 | crates/solidcore/src/surface/offset_surface.rs | OffsetSurface::evaluate_with | chunks | 1 | open | chunks(hv + 1) | |
| 894 | crates/solidcore/src/surface/plane/p1.rs | Plane::coincidence_check | with_capacity | 1 | proven | Vec::with_capacity(4) | constant capacity |
| 895 | crates/solidcore/src/surface/plane/p1.rs | Plane::coincidence_check | with_capacity | 2 | proven | Vec::with_capacity(4) | constant capacity |
| 896 | crates/solidcore/src/surface/plane/p1.rs | Plane::plane_overlap | windows | 1 | proven | windows(2) | constant non-zero size |
| 897 | crates/solidcore/src/surface/plane/p1.rs | Plane::plane_overlap | with_capacity | 1 | proven | Vec::with_capacity(5) | constant capacity |
| 898 | crates/solidcore/src/surface/plane/p1.rs | Plane::surface_overlap | with_capacity | 1 | open | Vec::with_capacity(bdrys_3d1.len()) | |
| 899 | crates/solidcore/src/surface/plane/p1.rs | transpose | int-div | 1 | open | a.len() / num_rows | |
| 900 | crates/solidcore/src/surface/plane/p2.rs | Plane::make_new_plane_ellipse | int-rem | 1 | proven | ((ii + count) - 1) % count | inside for ii in 0..count, so count > 0 |
| 901 | crates/solidcore/src/surface/plane/p2.rs | Plane::make_new_plane_ellipse | int-rem | 2 | proven | (ii + 1) % count | inside for ii in 0..count, so count > 0 |
| 902 | crates/solidcore/src/surface/procedural_blend/convert.rs | corner_from_record | with_capacity | 1 | open | Vec::with_capacity(r.rounds.len()) | |
| 903 | crates/solidcore/src/surface/procedural_blend/convert.rs | non_decreasing | windows | 1 | proven | windows(2) | constant non-zero size |
| 904 | crates/solidcore/src/surface/procedural_sweep.rs | ProceduralSweep::create | windows | 1 | proven | windows(2) | constant non-zero size |
| 905 | crates/solidcore/src/surface/procedural_sweep.rs | ProceduralSweep::largest_change_per_span | windows | 1 | proven | windows(2) | constant non-zero size |
| 906 | crates/solidcore/src/surface/procedural_sweep.rs | ProceduralSweep::turn_at | f64::clamp | 1 | open | clamp(first, last) | |
| 907 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::largest_slope_over | windows | 1 | proven | windows(2) | constant non-zero size |
| 908 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::largest_slope_over | windows | 2 | proven | windows(2) | constant non-zero size |
| 909 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::new | windows | 1 | proven | windows(2) | constant non-zero size |
| 910 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::offset | windows | 1 | proven | windows(2) | constant non-zero size |
| 911 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::offset | windows | 2 | proven | windows(2) | constant non-zero size |
| 912 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::slope_over | windows | 1 | proven | windows(2) | constant non-zero size |
| 913 | crates/solidcore/src/surface/procedural_sweep.rs | RadialLaw::slope_over | windows | 2 | proven | windows(2) | constant non-zero size |
| 914 | crates/solidcore/src/surface/procedural_sweep.rs | alternating | int-rem | 1 | proven | n % 2 | constant non-zero divisor |
| 915 | crates/solidcore/src/surface/procedural_sweep.rs | offset_error_bound | Vec::swap_remove | 1 | open | swap_remove(at) | |
| 916 | crates/solidcore/src/surface/procedural_sweep/path.rs | NetView::read | with_capacity | 1 | open | Vec::with_capacity(along) | |
| 917 | crates/solidcore/src/surface/procedural_sweep/path.rs | NetView::read | with_capacity | 2 | open | Vec::with_capacity(sections) | |
| 918 | crates/solidcore/src/surface/procedural_sweep/path.rs | NetView::read | with_capacity | 3 | open | Vec::with_capacity(along) | |
| 919 | crates/solidcore/src/surface/procedural_sweep/path.rs | PathMotion::certify | windows | 1 | proven | windows(2) | constant non-zero size |
| 920 | crates/solidcore/src/surface/procedural_sweep/path.rs | PathMotion::chord_parameters | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 921 | crates/solidcore/src/surface/procedural_sweep/path.rs | PathMotion::exact_net | with_capacity | 1 | open | Vec::with_capacity(count * prof.control_points.len()) | |
| 922 | crates/solidcore/src/surface/procedural_sweep/path.rs | PathMotion::exact_net | with_capacity | 2 | open | Vec::with_capacity(points.capacity()) | |
| 923 | crates/solidcore/src/surface/procedural_sweep/path.rs | Spline::derivative | windows | 1 | proven | windows(2) | constant non-zero size |
| 924 | crates/solidcore/src/surface/procedural_sweep/path.rs | Spline::new | windows | 1 | proven | windows(2) | constant non-zero size |
| 925 | crates/solidcore/src/surface/procedural_sweep/path.rs | classify | with_capacity | 1 | proven | Vec::with_capacity(12) | constant capacity |
| 926 | crates/solidcore/src/surface/procedural_sweep/path.rs | spans_of | windows | 1 | proven | windows(2) | constant non-zero size |
| 927 | crates/solidcore/src/surface/srf_in_volume.rs | SrfInVolume::evaluate | chunks | 1 | proven | chunks(ovs) | ovs = hv + 1 >= 1, with hv <= MAX_DERIVS checked above |
| 928 | crates/solidcore/src/surface/step_window.rs | Bezier::pieces | f64::clamp | 1 | proven | clamp(1.0, 8.0) | constant bounds, min <= max |
| 929 | crates/solidcore/src/surface/step_window.rs | derivative | windows | 1 | proven | windows(2) | constant non-zero size |
| 930 | crates/solidcore/src/surface/step_window.rs | push_every | f64::clamp | 1 | proven | clamp(0.0, 8.0) | constant bounds, min <= max |
| 931 | crates/solidcore/src/surface/step_window.rs | split | with_capacity | 1 | proven | Vec::with_capacity(n) | n = c.len(), an in-memory slice |
| 932 | crates/solidcore/src/surface/step_window.rs | split | with_capacity | 2 | proven | Vec::with_capacity(n) | n = c.len(), an in-memory slice |
| 933 | crates/solidcore/src/surface/step_window.rs | unwind | int-rem | 1 | proven | (start + step) % n | inside for step in 0..n, so n > 0 |
| 934 | crates/solidcore/src/surface/step_window.rs | unwind | int-rem | 2 | proven | (start + step + 1) % n | inside for step in 0..n, so n > 0 |
| 935 | crates/solidcore/src/surface/surf_of_extrusion/p1.rs | SurfOfExtrusion::drop_point_fast | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 936 | crates/solidcore/src/surface/surf_of_extrusion/p2.rs | SurfOfExtrusion::intersect_with_plane_on | Vec::remove | 1 | proven | remove(0) | inside if !...is_empty() on the same Vec |
| 937 | crates/solidcore/src/surface/surf_of_extrusion/p2.rs | SurfOfExtrusion::intersect_with_plane_on | Vec::remove | 2 | proven | remove(0) | inside if !...is_empty() on the same Vec |
| 938 | crates/solidcore/src/surface/surf_of_extrusion/p2.rs | SurfOfExtrusion::intersect_with_plane_on | Vec::swap_remove | 1 | proven | swap_remove(0) | lines is not empty: the function returns above when it is |
| 939 | crates/solidcore/src/surface/surf_of_revolution/p1.rs | test_for_iso_circles | windows | 1 | proven | windows(2) | constant non-zero size |
| 940 | crates/solidcore/src/surface/surface/approximate.rs | Surface::approximate_surface_impl | chunks | 1 | proven | chunks_exact_mut(4) | constant non-zero size |
| 941 | crates/solidcore/src/surface/surface/approximate.rs | Surface::approximate_surface_impl | windows | 1 | proven | windows(2) | constant non-zero size |
| 942 | crates/solidcore/src/surface/surface/approximate.rs | Surface::approximate_surface_impl | windows | 2 | proven | windows(2) | constant non-zero size |
| 943 | crates/solidcore/src/surface/surface/approximate.rs | Surface::approximate_surface_impl | windows | 3 | proven | windows(2) | constant non-zero size |
| 944 | crates/solidcore/src/surface/surface/approximate.rs | Surface::approximate_surface_impl | windows | 4 | proven | windows(2) | constant non-zero size |
| 945 | crates/solidcore/src/surface/surface/assert_valid.rs | grid_non_monotonic | int-div | 1 | proven | size / row_size | row_size > 0: zero returns an error above |
| 946 | crates/solidcore/src/surface/surface/p1.rs | StepSurface::knots_of | with_capacity | 1 | proven | Vec::with_capacity(2) | constant capacity |
| 947 | crates/solidcore/src/surface/surface/p1.rs | Surface::evaluate_step | chunks | 1 | open | chunks(highest_v_deriv + 1) | |
| 948 | crates/solidcore/src/surface/surface/p1.rs | Surface::evaluate_step | chunks | 2 | open | chunks(highest_v_deriv + 1) | |
| 949 | crates/solidcore/src/surface/surface/p1.rs | Surface::evaluate_step | chunks | 3 | open | chunks(highest_v_deriv + 1) | |
| 950 | crates/solidcore/src/surface/surface/p1.rs | Surface::evaluate_step | chunks | 4 | open | chunks(highest_v_deriv + 1) | |
| 951 | crates/solidcore/src/surface/surface/p1.rs | Surface::evaluate_step | chunks | 5 | open | chunks(highest_v_deriv + 1) | |
| 952 | crates/solidcore/src/surface/surface/p1.rs | find_uv_curve_ivl_in_domain | windows | 1 | proven | windows(2) | constant non-zero size |
| 953 | crates/solidcore/src/surface/surface/p10.rs | LsiGlobalSolver::local_solve_branch | Vec::insert | 1 | proven | insert(0, first_uv) | index 0 is never past the end |
| 954 | crates/solidcore/src/surface/surface/p10.rs | LsiGlobalSolver::local_solve_branch | Vec::insert | 2 | proven | insert(0, first_t) | index 0 is never past the end |
| 955 | crates/solidcore/src/surface/surface/p11.rs | Surface::intersect_surface_boundaries | windows | 1 | proven | windows(2) | constant non-zero size |
| 956 | crates/solidcore/src/surface/surface/p11.rs | Surface::lift_curve_in | windows | 1 | proven | windows(2) | constant non-zero size |
| 957 | crates/solidcore/src/surface/surface/p2.rs | DerivSurfDefinition::create_cross_section_curves | with_capacity | 1 | open | Vec::with_capacity(n) | |
| 958 | crates/solidcore/src/surface/surface/p2.rs | Surface::end_owner_cleared | Vec::remove | 1 | open | remove(i) | |
| 959 | crates/solidcore/src/surface/surface/p2.rs | insert_split | Vec::insert | 1 | open | insert(insert_index, t) | |
| 960 | crates/solidcore/src/surface/surface/p2.rs | is_even | int-div | 1 | proven | num / 2 | constant non-zero divisor |
| 961 | crates/solidcore/src/surface/surface/p2.rs | join_touching_loops | Vec::remove | 1 | open | remove(bb) | |
| 962 | crates/solidcore/src/surface/surface/p2.rs | join_touching_loops | Vec::split_off | 1 | open | split_off(ia) | |
| 963 | crates/solidcore/src/surface/surface/p2.rs | merge_double_arrays | with_capacity | 1 | open | Vec::with_capacity(params1.len() + params2.len()) | |
| 964 | crates/solidcore/src/surface/surface/p2.rs | set_up_breaks | Vec::insert | 1 | proven | insert(0, ivl.min()) | index 0 is never past the end |
| 965 | crates/solidcore/src/surface/surface/p2.rs | set_up_breaks | Vec::remove | 1 | open | remove(0) | |
| 966 | crates/solidcore/src/surface/surface/p3.rs | Surface::cover_coincident_surface_inner | int-div | 1 | proven | ii / 2 | constant non-zero divisor |
| 967 | crates/solidcore/src/surface/surface/p3.rs | Surface::cover_coincident_surface_inner | with_capacity | 1 | open | Vec::with_capacity(NUM_FOLD_SAMPLES) | |
| 968 | crates/solidcore/src/surface/surface/p5.rs | Surface::create_iso_parametric_curve | Vec::insert | 1 | proven | insert(0, d_min) | index 0 is never past the end |
| 969 | crates/solidcore/src/surface/surface/p5.rs | Surface::create_iso_parametric_curve | Vec::remove | 1 | open | remove(0) | |
| 970 | crates/solidcore/src/surface/surface/p6.rs | Surface::classify_intersecting_range_solution | int-rem | 1 | proven | ((tgt + 3) - 1) % 3 | constant non-zero divisor |
| 971 | crates/solidcore/src/surface/surface/p6.rs | Surface::classify_intersecting_range_solution | int-rem | 2 | proven | ((tgt + 3) - 2) % 3 | constant non-zero divisor |
| 972 | crates/solidcore/src/surface/surface/p6.rs | Surface::create_natural_uv_trim_curves | int-rem | 1 | proven | (start_index + side) % 4 | constant non-zero divisor |
| 973 | crates/solidcore/src/surface/surface/p9.rs | Surface::find_splits_at_depth | windows | 1 | proven | windows(2) | constant non-zero size |
| 974 | crates/solidcore/src/surface/surface_cache/p1.rs | AltSrfCache::copy_of_curves_partial | with_capacity | 1 | open | Vec::with_capacity(cached.len()) | |
| 975 | crates/solidcore/src/surface/surface_cache/p1.rs | SurfaceCache::build_tree_top | int-div | 1 | open | div_ceil(2) | |
| 976 | crates/solidcore/src/surface/surface_cache/p1.rs | SurfaceCache::build_tree_top | int-div | 2 | open | div_ceil(2) | |
| 977 | crates/solidcore/src/surface/surface_cache/p1.rs | SurfaceCache::build_tree_top | int-rem | 1 | proven | num_v % 2 | constant non-zero divisor |
| 978 | crates/solidcore/src/surface/surface_cache/p1.rs | SurfaceCache::build_tree_top | int-rem | 2 | proven | num_u % 2 | constant non-zero divisor |
| 979 | crates/solidcore/src/surface/surface_cache/p1.rs | SurfaceCache::build_tree_top | with_capacity | 1 | open | Vec::with_capacity(curr.len()) | |
| 980 | crates/solidcore/src/surface/surface_cache/p2.rs | SurfaceCache::add_curves_to_cache | Vec::insert | 1 | proven | insert(0, new_cache) | index 0 is never past the end |
| 981 | crates/solidcore/src/surface/surface_cache/p2.rs | SurfaceCache::block_from_splits | int-div | 1 | proven | div_ceil(2) | constant non-zero divisor |
| 982 | crates/solidcore/src/surface/surface_cache/p2.rs | SurfaceCache::block_from_splits | int-div | 2 | proven | div_ceil(2) | constant non-zero divisor |
| 983 | crates/solidcore/src/surface/surface_cache/p2.rs | SurfaceCache::block_from_splits | int-rem | 1 | proven | num_v % 2 | constant non-zero divisor |
| 984 | crates/solidcore/src/surface/surface_cache/p2.rs | SurfaceCache::block_from_splits | int-rem | 2 | proven | num_u % 2 | constant non-zero divisor |
| 985 | crates/solidcore/src/surface/surface_cache/p2.rs | SurfaceCache::block_from_splits | with_capacity | 1 | proven | Vec::with_capacity(base_nodes.len()) | base_nodes.len(), an in-memory Vec |
| 986 | crates/solidcore/src/surface/surface_cache/p2.rs | create_approximate_bezier_patch_block | with_capacity | 1 | proven | Vec::with_capacity(num_u_spans * num_v_spans) | limit_splits keeps at most 6 splits a side, so at most 5 x 5 spans |
| 987 | crates/solidcore/src/surface/surface_cache/p3.rs | SurfaceCache::build_tree_base_nodes | with_capacity | 1 | open | Vec::with_capacity(u_count.saturating_mul(v_count)) | |
| 988 | crates/solidcore/src/surface/surface_point_solve/p1.rs | SurfPtGlobalSolver::refine_guess_polygon_leg | f64::clamp | 1 | proven | clamp(0.0, 0.5) | constant bounds, min <= max |
| 989 | crates/solidcore/src/surface/trim_srf_cache.rs | TrimSrfCache::implant_poly_edge | Vec::insert | 1 | proven | insert(0, input.poly_edge) | index 0 is never past the end |
| 990 | crates/solidcore/src/surface/trim_srf_cache.rs | TrimSrfCache::implant_retained_edgeuse | Vec::insert | 1 | proven | insert(0, edgeuse) | index 0 is never past the end |
| 991 | crates/solidcore/src/surface/trim_srf_cache.rs | TrimSrfCache::implant_vertexuse | Vec::insert | 1 | proven | insert(0, sc::VertexListItem { vertexuse: Some(input.vertexuse), uv_point: uv, uv_tol, },) | index 0 is never past the end |
| 992 | crates/solidcore/src/surface/trim_srf_cache.rs | TrimSrfCache::subdivide_node | Vec::insert | 1 | proven | insert(0, pe) | index 0 is never past the end |
| 993 | crates/solidcore/src/surface/volume/p2.rs | Volume::is_box_in_param_domain | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 994 | crates/solidcore/src/surface/volume/p2.rs | Volume::is_pseudo_box_in_in_space_domain | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 995 | crates/solidcore/src/sweep/loft_rails.rs | Loft::anchor_rails | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 996 | crates/solidcore/src/sweep/loft_rails.rs | Loft::new | windows | 1 | proven | windows(2) | constant non-zero size |
| 997 | crates/solidcore/src/sweep/loft_rails.rs | Loft::new | windows | 2 | proven | windows(2) | constant non-zero size |
| 998 | crates/solidcore/src/sweep/loft_rails.rs | Loft::new | with_capacity | 1 | proven | Vec::with_capacity(count) | count is sources.len(), checked to be 2..=MAX_SECTIONS (100) just before |
| 999 | crates/solidcore/src/sweep/loft_rails.rs | Loft::new | with_capacity | 2 | proven | Vec::with_capacity(count) | count is sources.len(), checked to be 2..=MAX_SECTIONS (100) just before |
| 1000 | crates/solidcore/src/sweep/loft_rails.rs | Loft::new | with_capacity | 3 | proven | Vec::with_capacity(count) | count is sources.len(), checked to be 2..=MAX_SECTIONS (100) just before |
| 1001 | crates/solidcore/src/sweep/loft_rails.rs | Loft::plain | with_capacity | 1 | proven | Vec::with_capacity(lead.len()) | the length of an existing Vec (the first section's curves) |
| 1002 | crates/solidcore/src/sweep/loft_rails.rs | Loft::plain | with_capacity | 2 | proven | Vec::with_capacity(per.len()) | the length of an existing Vec (a control point's curves across the sections) |
| 1003 | crates/solidcore/src/sweep/loft_rails.rs | Plain::nurb | with_capacity | 1 | proven | Vec::with_capacity(self.points.len()) | the length of an existing Vec (the curve's control points) |
| 1004 | crates/solidcore/src/sweep/loft_rails.rs | Plain::point_at | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 1005 | crates/solidcore/src/sweep/loft_rails.rs | centroid | windows | 1 | proven | windows(2) | constant non-zero size |
| 1006 | crates/solidcore/src/sweep/loft_rails.rs | certify | windows | 1 | proven | windows(2) | constant non-zero size |
| 1007 | crates/solidcore/src/sweep/loft_rails.rs | certify | with_capacity | 1 | proven | Vec::with_capacity(wires.len()) | the length of an existing Vec (the wires made) |
| 1008 | crates/solidcore/src/sweep/loft_rails.rs | certify | with_capacity | 2 | proven | Vec::with_capacity(wires.len()) | the length of an existing Vec (the wires made) |
| 1009 | crates/solidcore/src/sweep/loft_rails.rs | interpolate_g | f64::clamp | 1 | proven | clamp(0.0, n) | n is a usize cast to f64: never NaN and never below 0.0, so min <= max |
| 1010 | crates/solidcore/src/sweep/loft_rails.rs | skin_and_certify | Vec::drain | 1 | proven | drain(..) | a full range, never out of bounds |
| 1011 | crates/solidcore/src/nurbs/certificate.rs | interval_bound | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 1012 | crates/solidcore/src/nurbs/certificate.rs | interval_bound | with_capacity | 1 | proven | Vec::with_capacity(4) | constant capacity |
| 1013 | crates/solidcore/src/nurbs/certificate.rs | interval_bound | with_capacity | 2 | proven | Vec::with_capacity(4) | constant capacity |
| 1014 | crates/solidcore/src/nurbs/certificate.rs | interval_bound | with_capacity | 3 | proven | Vec::with_capacity(4) | constant capacity |
| 1015 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | RotationalSweepGeometry::edge_sweep_higher | swap | 1 | proven | swap(1, 3) | a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array |
| 1016 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | RotationalSweepGeometry::edge_sweep_higher | swap | 2 | proven | swap(1, 3) | a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array |
| 1017 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | RotationalSweepGeometry::edge_sweep_higher | swap | 3 | proven | swap(1, 3) | a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array |
| 1018 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | RotationalSweepGeometry::edge_sweep_higher | swap | 4 | proven | swap(1, 3) | a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array |
| 1019 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | remove_first | Vec::remove | 1 | proven | remove(0) | each Vec checked nonempty before remove(0) |
| 1020 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | remove_first | Vec::remove | 2 | proven | remove(0) | each Vec checked nonempty before remove(0) |
| 1021 | crates/solidcore/src/sweep/rotational_sweep_geometry.rs | remove_first | Vec::remove | 3 | proven | remove(0) | each Vec checked nonempty before remove(0) |
| 1022 | crates/solidcore/src/sweep/screw.rs | Screw::offset | windows | 1 | proven | windows(2) | constant non-zero size |
| 1023 | crates/solidcore/src/sweep/screw.rs | Screw::offset | windows | 2 | proven | windows(2) | constant non-zero size |
| 1024 | crates/solidcore/src/sweep/screw.rs | Stations::weight | int-rem | 1 | proven | j % 2 | constant non-zero divisor |
| 1025 | crates/solidcore/src/sweep/screw.rs | axial_radius | f64::clamp | 1 | proven | clamp(0.0, 1.0) | constant bounds, min <= max |
| 1026 | crates/solidcore/src/sweep/screw.rs | path | windows | 1 | proven | windows(2) | constant non-zero size |
| 1027 | crates/solidcore/src/sweep/screw.rs | sweep | windows | 1 | proven | windows(2) | constant non-zero size |
| 1028 | crates/solidcore/src/sweep/stations.rs | fractions | Ord::clamp | 1 | proven | clamp(MIN_SKIN_STATIONS, MAX_SKIN_STATIONS) | constants 16 <= 2048, so min <= max always |
| 1029 | crates/solidcore/src/sweep/topology_sweep/store.rs | SweepStore::drop | Vec::drain | 1 | proven | drain(..) | full drain(..) has no invalid bounds |
| 1030 | crates/solidcore/src/sweep/topology_sweep/store.rs | SweepStore::unlock_mark | Vec::remove | 1 | proven | remove(index) | index is rposition() in the same locks Vec |
| 1031 | crates/solidcore/src/sweep/topology_sweep/store.rs | body_pair_mut | split_at | 1 | proven | split_at_mut(si.max(di)) | entry() validates both base-adjusted indices against the same slots Vec |
| 1032 | crates/solidcore/src/topology.rs | Brep::add_loop | with_capacity | 1 | open | Vec::with_capacity(edges.len()) | |
| 1033 | crates/solidcore/src/topology.rs | Brep::end_surface_owner_cleared | Vec::remove | 1 | open | remove(i) | |
| 1034 | crates/solidcore/src/topology/brep/local_operation.rs | local_operation | with_capacity | 1 | open | Vec::with_capacity(all_faces.len()) | |
| 1035 | crates/solidcore/src/topology/brep/p1.rs | Brep::fix_region_order | rotate | 1 | proven | rotate_left(pos) | pos is position() in the same region order Vec |
| 1036 | crates/solidcore/src/topology/brep/p1.rs | Brep::set_region_list_head | rotate | 1 | proven | rotate_left(pos) | pos is position() in the same region order Vec |
| 1037 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::insert | 1 | proven | insert(2 - ii, Curve::from(top_curve)) | ii is in 0..2 and all four parallel Vecs have at least two entries |
| 1038 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::insert | 2 | proven | insert(2 - ii, OrientType::Same) | ii is in 0..2 and all four parallel Vecs have at least two entries |
| 1039 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::insert | 3 | proven | insert(2 - ii, None) | ii is in 0..2 and all four parallel Vecs have at least two entries |
| 1040 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::insert | 4 | proven | insert(2 - ii, None) | ii is in 0..2 and all four parallel Vecs have at least two entries |
| 1041 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::remove | 1 | proven | remove(0) | work_eus copies edgeuses after the edgeuses.len() >= 2 check |
| 1042 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::remove | 2 | proven | remove(0) | work_tan.first() succeeds before removing index 0 |
| 1043 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::remove | 3 | proven | remove(i) | i is in 0..work_eus.len(); removal immediately breaks the loop |
| 1044 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::remove | 4 | proven | remove(i) | work_tan.get(i) succeeds before work_eus.remove(i), which does not change work_tan |
| 1045 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::remove | 5 | proven | remove(i) | i is in 0..work_eus.len(); removal immediately breaks the loop |
| 1046 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | Vec::remove | 6 | proven | remove(i) | work_tan.get(i) succeeds before work_eus.remove(i), which does not change work_tan |
| 1047 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | rotate | 1 | proven | rotate_right(1) | each parallel Vec has at least two ordered edge entries before padding |
| 1048 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | rotate | 2 | proven | rotate_right(1) | each parallel Vec has at least two ordered edge entries before padding |
| 1049 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | rotate | 3 | proven | rotate_right(1) | each parallel Vec has at least two ordered edge entries before padding |
| 1050 | crates/solidcore/src/topology/brep/p1.rs | create_corner_blend | rotate | 4 | proven | rotate_right(1) | each parallel Vec has at least two ordered edge entries before padding |
| 1051 | crates/solidcore/src/topology/brep/p1.rs | create_edge_edge_blend | with_capacity | 1 | proven | Vec::with_capacity(num_loc) | constant capacity: num_loc = 11 |
| 1052 | crates/solidcore/src/topology/brep/p1.rs | create_edge_edge_blend | with_capacity | 2 | proven | Vec::with_capacity(num_loc) | constant capacity: num_loc = 11 |
| 1053 | crates/solidcore/src/topology/brep/p1.rs | mark_loops_to_delete_bounded | int-rem | 1 | proven | rec_level % 2 | constant non-zero divisor |
| 1054 | crates/solidcore/src/topology/brep/p1.rs | region_set_list | rotate | 1 | proven | rotate_left(at) | at is position() in the same shells Vec |
| 1055 | crates/solidcore/src/topology/brep/p1.rs | reverse_reflection_edgeuses | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 1056 | crates/solidcore/src/topology/brep/p1.rs | reverse_reflection_edgeuses | int-rem | 1 | proven | uses.len() % 2 | constant non-zero divisor |
| 1057 | crates/solidcore/src/topology/brep/p1.rs | reverse_reflection_edgeuses | with_capacity | 1 | proven | Vec::with_capacity(uses.len()) | uses.len() counts existing EdgeuseId elements; relinked also stores EdgeuseId |
| 1058 | crates/solidcore/src/topology/brep/p1.rs | set_region_is_void_flags_for_nested_solids | Vec::remove | 1 | proven | remove(0) | inside while !queue.is_empty() |
| 1059 | crates/solidcore/src/topology/brep/p1.rs | set_region_is_void_flags_for_nested_solids | Vec::remove | 2 | proven | remove(0) | guarded by !is_empty() |
| 1060 | crates/solidcore/src/topology/brep/p1.rs | update_vertex_edge_intervals | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 1061 | crates/solidcore/src/topology/brep/p1.rs | vertexuse_neighbour | int-rem | 1 | proven | (i + 1) % n | position() finds i in list before n = list.len(), so n > 0 |
| 1062 | crates/solidcore/src/topology/brep/p1.rs | vertexuse_neighbour | int-rem | 2 | proven | (i + n - 1) % n | position() finds i in list before n = list.len(), so n > 0 |
| 1063 | crates/solidcore/src/topology/brep/p10.rs | build_regions | Vec::insert | 1 | proven | insert(pos, i + INSIDE_SHELL) | returns Err when pos > len() |
| 1064 | crates/solidcore/src/topology/brep/p10.rs | relink_radial_lists | int-rem | 1 | proven | (i + 1) % list.len() | inside list.iter().enumerate(), so list.len() > 0 |
| 1065 | crates/solidcore/src/topology/brep/p2.rs | make_shell_vertex_topology | Vec::insert | 1 | proven | insert(0, vu) | index 0 is never past the end |
| 1066 | crates/solidcore/src/topology/brep/p2.rs | mate_lamina_edge_to_surface | Vec::remove | 1 | open | remove(i) | |
| 1067 | crates/solidcore/src/topology/brep/p2.rs | mate_lamina_edge_to_surface | Vec::remove | 2 | open | remove(i) | |
| 1068 | crates/solidcore/src/topology/brep/p2.rs | region_insert_shell_after | Vec::insert | 1 | open | insert(at + 1, s) | |
| 1069 | crates/solidcore/src/topology/brep/p3.rs | Brep::pre_insert_region | Vec::insert | 1 | proven | insert(0, r) | index 0 is never past the end |
| 1070 | crates/solidcore/src/topology/brep/p3.rs | delete_face_in | Vec::insert | 1 | proven | insert(0, vu) | index 0 is never past the end |
| 1071 | crates/solidcore/src/topology/brep/p3.rs | orient_ray_votes | int-rem | 1 | proven | n % 2 | constant non-zero divisor |
| 1072 | crates/solidcore/src/topology/brep/p3.rs | squeeze_loops | Vec::insert | 1 | proven | insert(0, vu) | index 0 is never past the end |
| 1073 | crates/solidcore/src/topology/brep/p4.rs | delete_vertex_in | chunks | 1 | proven | chunks(2) | constant non-zero size |
| 1074 | crates/solidcore/src/topology/brep/p4.rs | edge_remove | Vec::remove | 1 | proven | remove(at) | index is position() in the same Vec, with no intervening mutation |
| 1075 | crates/solidcore/src/topology/brep/p4.rs | faceuse_remove | Vec::remove | 1 | proven | remove(at) | index is position() in the same Vec, with no intervening mutation |
| 1076 | crates/solidcore/src/topology/brep/p4.rs | shell_remove_faceuse | Vec::remove | 1 | proven | remove(at) | index is position() in the same Vec, with no intervening mutation |
| 1077 | crates/solidcore/src/topology/brep/p4.rs | vertex_remove | Vec::remove | 1 | proven | remove(at) | index is position() in the same Vec, with no intervening mutation |
| 1078 | crates/solidcore/src/topology/brep/p5.rs | make_manifold_in | Vec::remove | 1 | proven | remove(index) | index is position() in the same Vec, with no intervening mutation |
| 1079 | crates/solidcore/src/topology/brep/p5.rs | remove_vertexuse | Vec::remove | 1 | proven | remove(index) | index is position() in the same Vec, with no intervening mutation |
| 1080 | crates/solidcore/src/topology/brep/p7.rs | edge_remove | Vec::remove | 1 | open | remove(at) | |
| 1081 | crates/solidcore/src/topology/brep/p7.rs | glue_edges_general | Vec::remove | 1 | open | remove(at) | |
| 1082 | crates/solidcore/src/topology/brep/p9.rs | faceuse_pre_insert_loopuse | Vec::insert | 1 | proven | insert(0, lu) | index 0 is never past the end |
| 1083 | crates/solidcore/src/topology/brep/p9.rs | faceuse_remove_loopuse | Vec::remove | 1 | proven | remove(at) | index is position() in the same Vec, with no intervening mutation |
| 1084 | crates/solidcore/src/topology/brep/p9.rs | make_vertex_split_edge_with_curve_identity_state | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 1085 | crates/solidcore/src/topology/brep/p9.rs | make_vertex_split_edge_with_curve_identity_state | chunks | 2 | proven | chunks_exact(2) | constant non-zero size |
| 1086 | crates/solidcore/src/topology/brep/p9.rs | make_vertex_split_edge_with_curve_identity_state | chunks | 3 | proven | chunks_exact(2) | constant non-zero size |
| 1087 | crates/solidcore/src/topology/brep/p9.rs | make_vertex_split_edge_with_curve_identity_state | chunks | 4 | proven | chunks_exact(2) | constant non-zero size |
| 1088 | crates/solidcore/src/topology/brep/p9.rs | make_vertex_split_edge_with_curve_identity_state | chunks | 5 | proven | chunks_exact(2) | constant non-zero size |
| 1089 | crates/solidcore/src/topology/brep/p9.rs | make_vertex_split_edge_with_curve_identity_state | int-rem | 1 | proven | original_uses.len() % 2 | constant non-zero divisor |
| 1090 | crates/solidcore/src/topology/brep/p9.rs | shell_post_insert | int-rem | 1 | proven | (i + 1) % members.len() | inside iteration over members, so len() > 0 |
| 1091 | crates/solidcore/src/topology/brep/planar_section.rs | create_planar_section_curves | Vec::remove | 1 | proven | remove(index) | inside while index < curves_3d.len() |
| 1092 | crates/solidcore/src/topology/brep/planar_section.rs | create_planar_section_curves | Vec::remove | 2 | proven | remove(index) | uv_curves is resized to curves_3d.len(); removals and force_uv_curves pushes stay paired |
| 1093 | crates/solidcore/src/topology/brep/validation/assert_valid/loops.rs | loop_ | int-rem | 1 | proven | (idx1 + idx2) % n1 | guarded by n1 > 1 |
| 1094 | crates/solidcore/src/topology/brep/validation/assert_valid/loops.rs | loop_ | int-rem | 2 | proven | (n1 - i1 + off) % n1 | guarded by n1 > 1 |
| 1095 | crates/solidcore/src/topology/brep/validation/pointers.rs | Lists::new | int-rem | 1 | proven | (i + 1) % e.edgeuses.len() | inside e.edgeuses.iter().enumerate(), so e.edgeuses.len() > 0 |
| 1096 | crates/solidcore/src/topology/brep/validation/pointers.rs | Lists::new | int-rem | 2 | proven | (i + e.edgeuses.len() - 1) % e.edgeuses.len() | inside e.edgeuses.iter().enumerate(), so e.edgeuses.len() > 0 |
| 1097 | crates/solidcore/src/topology/brep/validation/pointers.rs | check_edges | int-rem | 1 | proven | uses.len() % 2 | constant non-zero divisor |
| 1098 | crates/solidcore/src/topology/brep/validation/pointers.rs | validate_pointers | int-rem | 1 | proven | (j + 1) % uses.len() | inside for j in (1..uses.len()).step_by(2), so uses.len() > 1 |
| 1099 | crates/solidcore/src/topology/brep/validation/pointers.rs | validate_pointers | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 1100 | crates/solidcore/src/topology/brep/validation/spatial.rs | SpatialIndex::new | int-div | 1 | proven | (end - begin) / 2 | constant non-zero divisor |
| 1101 | crates/solidcore/src/topology/brep/validation/spatial.rs | SpatialIndex::new | int-rem | 1 | proven | (axis + 1) % 3 | constant non-zero divisor |
| 1102 | crates/solidcore/src/topology/brep/validation/spatial.rs | SpatialIndex::new | int-rem | 2 | proven | (axis + 1) % 3 | constant non-zero divisor |
| 1103 | crates/solidcore/src/topology/brep/vertex_fans.rs | remove_vertexuse | Vec::remove | 1 | proven | remove(index) | index is position() in the same Vec, with no intervening mutation |
| 1104 | crates/solidcore/src/topology/brep_data_write.rs | BrepData::from_brep | Vec::insert | 1 | proven | insert(0, r) | index 0 is never past the end |
| 1105 | crates/solidcore/src/topology/brep_data_write.rs | BrepData::from_brep | Vec::remove | 1 | proven | remove(i + 1) | i is position() after skip(1) in the same regions Vec, so i + 1 < len() |
| 1106 | crates/solidcore/src/topology/database_io.rs | DatabaseReader::read_raw_items | chunks | 1 | proven | chunks_exact(N) | N is a const generic, 1, 4 or 8 at every call |
| 1107 | crates/solidcore/src/topology/database_io.rs | DatabaseReader::read_raw_items | copy_from_slice | 1 | proven | copy_from_slice(c) | c is a chunks_exact(N) chunk of [u8; N] |
| 1108 | crates/solidcore/src/topology/database_io.rs | InputStream::scan_int | int-div | 1 | proven | max / 10 | constant non-zero divisor |
| 1109 | crates/solidcore/src/topology/edge.rs | insert_after | Vec::insert | 1 | proven | insert(pos + 1, obj) | pos is position() in the same edgeuses Vec, so pos + 1 <= len() |
| 1110 | crates/solidcore/src/topology/edge.rs | is_seam_of_surface | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 1111 | crates/solidcore/src/topology/edge.rs | orient_edge_sequence | windows | 1 | proven | windows(2) | constant non-zero size |
| 1112 | crates/solidcore/src/topology/edge.rs | reset_primary_edgeuse | rotate | 1 | proven | rotate_left(pos) | pos is position() in list; rotated is an unchanged clone of list |
| 1113 | crates/solidcore/src/topology/edge.rs | set_orientation | chunks | 1 | proven | chunks_exact(2) | constant non-zero size |
| 1114 | crates/solidcore/src/topology/edgeuse/p1.rs | edgeuse_last | int-rem | 1 | proven | (i + list.len() - 1) % list.len() | list_of returns Some only after position() finds i in that list, so len() > 0 |
| 1115 | crates/solidcore/src/topology/edgeuse/p1.rs | edgeuse_next | int-rem | 1 | proven | (i + 1) % list.len() | list_of returns Some only after position() finds i in that list, so len() > 0 |
| 1116 | crates/solidcore/src/topology/edgeuse/p3.rs | create_uv_trim_curve | Vec::remove | 1 | proven | remove(0) | guarded by uv_curves.len() == 2; branches remove at most one curve |
| 1117 | crates/solidcore/src/topology/edgeuse/p3.rs | create_uv_trim_curve | Vec::remove | 2 | proven | remove(1) | guarded by uv_curves.len() == 2; branches remove at most one curve |
| 1118 | crates/solidcore/src/topology/edgeuse/p3.rs | create_uv_trim_curve | Vec::swap_remove | 1 | proven | swap_remove(kkk) | kkk comes from uv_curves.iter().enumerate(), with no intervening Vec mutation |
| 1119 | crates/solidcore/src/topology/edgeuse/p3.rs | evaluate_binormal_uv | int-rem | 1 | proven | steps % 2 | constant non-zero divisor |
| 1120 | crates/solidcore/src/topology/edgeuse/p3.rs | longest_drop_run | with_capacity | 1 | proven | Vec::with_capacity(pieces.len()) | pieces.len() counts existing Curve elements, no smaller than (Extent1d, Point3, Point3) via CurveKind::Line |
| 1121 | crates/solidcore/src/topology/edgeuse/p3.rs | longest_drop_run | with_capacity | 2 | proven | Vec::with_capacity(run_pieces.len()) | run_pieces.len() counts existing Curve elements, which contain the BSplineCurve variant inline |
| 1122 | crates/solidcore/src/topology/edgeuse/p3.rs | remove_seam_curve | Vec::remove | 1 | proven | remove(1) | only caller pick_seam_curve checks get(1) before calling, and removes at most one curve |
| 1123 | crates/solidcore/src/topology/edgeuse/p3.rs | remove_seam_curve | Vec::remove | 2 | proven | remove(0) | only caller pick_seam_curve checks get(1) before calling, and removes at most one curve |
| 1124 | crates/solidcore/src/topology/face/p1.rs | faceuse_remove | Vec::remove | 1 | open | remove(at) | |
| 1125 | crates/solidcore/src/topology/face/p1.rs | move_seam_notified | int-rem | 1 | open | 1 % cnt | |
| 1126 | crates/solidcore/src/topology/face/p1.rs | move_seam_notified | int-rem | 2 | open | (jj + 1) % cnt | |
| 1127 | crates/solidcore/src/topology/face/p1.rs | move_seam_notified | int-rem | 3 | open | (max_indx + 1) % cnt | |
| 1128 | crates/solidcore/src/topology/face/p1.rs | split_at_seam_merges | rotate | 1 | open | rotate_left(at) | |
| 1129 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 1 | open | point_count / trim_curve_cnt | |
| 1130 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 2 | open | point_count / trim_curve_cnt | |
| 1131 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 3 | open | point_count / trim_curve_cnt | |
| 1132 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 4 | proven | trim_curve_cnt / 2 | constant non-zero divisor |
| 1133 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 5 | proven | ii / 2 | constant non-zero divisor |
| 1134 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 6 | open | div_ceil(2) | |
| 1135 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 7 | open | point_count / n_classes | |
| 1136 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 8 | open | point_count / n_classes | |
| 1137 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-div | 9 | open | point_count / n_classes | |
| 1138 | crates/solidcore/src/topology/face/p2.rs | points_in_face | int-rem | 1 | proven | ii % 2 | constant non-zero divisor |
| 1139 | crates/solidcore/src/topology/face/p2.rs | remove_suspect_split_at_seam_uv_trim_curves | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 1140 | crates/solidcore/src/topology/face/p2.rs | trim_curve_breaks | windows | 1 | proven | windows(2) | constant non-zero size |
| 1141 | crates/solidcore/src/topology/face/p3.rs | is_degenerate | split_at | 1 | open | split_at_mut(jj) | |
| 1142 | crates/solidcore/src/topology/face/p3.rs | loop_orientation_3d | windows | 1 | proven | windows(2) | constant non-zero size |
| 1143 | crates/solidcore/src/topology/loopuse.rs | is_closed_3d | int-rem | 1 | proven | (ii + 1) % num | num = eus.len() and call is inside eus.iter().enumerate(), so num > 0 |
| 1144 | crates/solidcore/src/topology/part_file.rs | read_part_from_db | int-div | 1 | proven | total_curves / 1_000_000 | constant non-zero divisor |
| 1145 | crates/solidcore/src/topology/part_file.rs | read_part_from_db | int-div | 2 | proven | total_surfaces / 1_000_000 | constant non-zero divisor |
| 1146 | crates/solidcore/src/topology/proto_topology/p1/proto.rs | ProtoEdge::remove_edge_definition | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 1147 | crates/solidcore/src/topology/proto_topology/p1/proto.rs | ProtoTopologyManager::remove_proto_edge | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 1148 | crates/solidcore/src/topology/proto_topology/p1/proto.rs | ProtoTopologyManager::remove_proto_vertex | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 1149 | crates/solidcore/src/topology/proto_topology/p1/proto.rs | ProtoVertex::remove_proto_edge | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 1150 | crates/solidcore/src/topology/proto_topology/p1/proto.rs | ProtoVertex::remove_vertex_definition | Vec::remove | 1 | proven | remove(i) | i is position() in the same Vec |
| 1151 | crates/solidcore/src/topology/proto_topology/p2.rs | ProtoTopologyManager::combine_proto_edge | Vec::remove | 1 | open | remove(idx) | |
| 1152 | crates/solidcore/src/topology/proto_topology/p3.rs | ProtoTopologyManager::find_or_create_proto_edge | with_capacity | 1 | proven | Vec::with_capacity(overlapping.len()) | overlapping.len() counts existing Option<ProtoEdgeId> elements, no smaller than ProtoEdgeId |
| 1153 | crates/solidcore/src/topology/proto_topology/p3.rs | ProtoTopologyManager::glue_coincident_brep_vertices | with_capacity | 1 | proven | Vec::with_capacity(defs.len()) | defs.len() counts existing VertexDefId elements; keep also stores VertexDefId |
| 1154 | crates/solidcore/src/topology/shell.rs | is_inner_shell_of | step_by | 1 | proven | step_by(2) | constant non-zero step |
| 1155 | crates/solidcore/src/topology/shell.rs | order_region_shells | rotate | 1 | proven | rotate_left(position) | position is position() in a clone of the same shell list; classification only edits trim/cache data |
| 1156 | crates/solidcore/src/topology/shell.rs | region_remove_shell | Vec::remove | 1 | proven | remove(index) | index is position() in the same Vec, with no intervening mutation |
| 1157 | crates/solidcore/src/topology/shell.rs | remove_and_post_insert | Vec::remove | 1 | proven | remove(index) | index is position() in the same Vec, with no intervening mutation |
| 1158 | crates/solidcore/src/topology/shell.rs | shell_remove_faceuse | Vec::remove | 1 | proven | remove(index) | index is position() in the same Vec, with no intervening mutation |
| 1159 | crates/solidcore/src/topology/topology.rs | propagate | copy_from_slice | 1 | proven | copy_from_slice(&src.marks[..3]) | both slices are ..3 of marks arrays of length 5 |
| 1160 | crates/solidcore/src/topology/topology.rs | remove_key | Vec::remove | 1 | proven | remove(i) | index is position() in the same Vec, with no intervening mutation |
| 1161 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | chunks | 1 | proven | chunks_exact_mut(2) | constant non-zero size |
| 1162 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | chunks | 2 | proven | chunks_exact(2) | constant non-zero size |
| 1163 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | int-rem | 1 | proven | forward % 2 | constant non-zero divisor |
| 1164 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | int-rem | 2 | proven | backward % 2 | constant non-zero divisor |
| 1165 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | int-rem | 3 | proven | forward % 2 | constant non-zero divisor |
| 1166 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | int-rem | 4 | proven | backward % 2 | constant non-zero divisor |
| 1167 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | int-rem | 5 | proven | forward % 2 | constant non-zero divisor |
| 1168 | crates/solidcore/src/topology/topology_traverser.rs | is_inner_shell | int-rem | 6 | proven | backward % 2 | constant non-zero divisor |
| 1169 | crates/solidcore/src/topology/trimming_tools.rs | ensure_last_edgeuse_uv_correct | rotate | 1 | proven | rotate_left(if dropped_correctly + 1 < n { dropped_correctly + 1 } else { 0 }) | rotation is either dropped_correctly + 1 < n or 0, with n = edgeuses.len() |
| 1170 | crates/solidcore/src/topology/trimming_tools.rs | move_loopuse_first | Vec::insert | 1 | proven | insert(0, lu) | index 0 is never past the end |
| 1171 | crates/solidcore/src/topology/trimming_tools.rs | move_loopuse_first | Vec::remove | 1 | proven | remove(pos) | index is position() in the same Vec, with no intervening mutation |
| 1172 | crates/solidcore/src/topology/trimming_tools.rs | next_round_the_vertex | int-div | 1 | proven | ii / 2 | constant non-zero divisor |
| 1173 | crates/solidcore/src/topology/trimming_tools.rs | next_round_the_vertex | int-div | 2 | proven | end / 2 | constant non-zero divisor |
| 1174 | crates/solidcore/src/topology/trimming_tools.rs | next_round_the_vertex | int-rem | 1 | proven | end % 2 | constant non-zero divisor |
| 1175 | crates/solidcore/src/topology/trimming_tools.rs | order_curves_into_loops | int-div | 1 | proven | found_index / 2 | constant non-zero divisor |
| 1176 | crates/solidcore/src/topology/trimming_tools.rs | order_curves_into_loops | int-div | 2 | proven | (found_index - 1) / 2 | constant non-zero divisor |
| 1177 | crates/solidcore/src/topology/trimming_tools.rs | order_curves_into_loops | int-rem | 1 | proven | found_index % 2 | constant non-zero divisor |
| 1178 | crates/solidcore/src/topology/trimming_tools.rs | order_curves_into_loops | int-rem | 2 | proven | found_index % 2 | constant non-zero divisor |
| 1179 | crates/solidcore/src/topology/trimming_tools/curve_loops.rs | CurveLoops::insert_into_loops | Vec::insert | 1 | proven | insert(idx + 1, new_curve) | idx is position() in self.curves, so idx + 1 <= len() |
| 1180 | crates/solidcore/src/topology/trimming_tools/curve_loops.rs | CurveLoops::insert_into_loops | Vec::insert | 2 | proven | insert(idx + 1, o) | returns Err when idx + 1 > self.orients.len() |
| 1181 | crates/step-export/src/brep_to_model.rs | brep_to_model | with_capacity | 1 | proven | Vec::with_capacity(65) | constant capacity |
| 1182 | crates/step-export/src/brep_to_model.rs | bspline_surface | chunks | 1 | proven | chunks(v_count) | v_count is net.v_count.max(1) |
| 1183 | crates/step-export/src/brep_to_model.rs | bspline_surface | chunks | 2 | proven | chunks(v_count) | v_count is net.v_count.max(1) |
| 1184 | crates/step-export/src/lib.rs | faceted_shell | int-rem | 1 | open | (index + 1) % len | |
| 1185 | crates/step-export/src/lib.rs | faceted_shell | with_capacity | 1 | open | Vec::with_capacity(face_indices.len()) | |
| 1186 | crates/step-export/src/lib.rs | faceted_shell | with_capacity | 2 | open | Vec::with_capacity(face.loops.len()) | |
| 1187 | crates/step-export/src/lib.rs | faceted_shell | with_capacity | 3 | open | Vec::with_capacity(edges.len()) | |
| 1188 | crates/step-export/src/lib.rs | faceted_shell | with_capacity | 4 | open | Vec::with_capacity(welded.points.len()) | |
| 1189 | crates/step-export/src/lib.rs | faceted_shell | with_capacity | 5 | open | Vec::with_capacity(faces.len()) | |
| 1190 | crates/step-export/src/lib.rs | faceted_shell | with_capacity | 6 | open | Vec::with_capacity(loops.len()) | |
| 1191 | crates/step-export/src/lib.rs | quoted | with_capacity | 1 | open | String::with_capacity(value.len() + 2) | |
| 1192 | crates/step-export/src/lib.rs | shell | with_capacity | 1 | open | Vec::with_capacity(body.faces.len()) | |
| 1193 | crates/step-export/src/lib.rs | shell | with_capacity | 2 | open | Vec::with_capacity(step_shell.faces.len()) | |
| 1194 | crates/step-export/src/lib.rs | shell | with_capacity | 3 | open | Vec::with_capacity(face.loops.len()) | |
| 1195 | crates/step-export/src/lib.rs | shell | with_capacity | 4 | open | Vec::with_capacity(edges.len()) | |
| 1196 | crates/step-export/src/lib.rs | weld_vertices | with_capacity | 1 | open | Vec::with_capacity(body.vertices.len()) | |
| 1197 | crates/step-export/src/lib.rs | write_bspline_surface | with_capacity | 1 | open | Vec::with_capacity(surface.points.len()) | |
| 1198 | crates/step-export/src/lib.rs | write_bspline_surface | with_capacity | 2 | open | Vec::with_capacity(row.len()) | |
| 1199 | crates/step-export/src/lib.rs | write_pcurve_edge | with_capacity | 1 | open | Vec::with_capacity(pcurves.len()) | |
| 1200 | crates/step-export/src/lib.rs | write_pcurve_edge | with_capacity | 2 | open | Vec::with_capacity(uv.len()) | |
| 1201 | crates/step-export/src/geom.rs | bspline_point | f64::clamp | 1 | proven | clamp(lo, hi) | check_bspline_curve just above: n > p, knots increasing, no NaN, so lo <= hi |
| 1202 | crates/step-export/src/map.rs | Mapper::poly_loop | int-rem | 1 | proven | (k + 1) % vs.len() | vs has one entry per point, fewer than 3 refused |
| 1203 | crates/step-export/src/map.rs | check_knots | windows | 1 | proven | windows(2) | constant non-zero size |
| 1204 | crates/step-export/src/map.rs | implied_knots | int-div | 1 | proven | (n - 1) / dd | dd == 0 returns Err just above |
| 1205 | crates/step-export/src/map.rs | polygon_plane | int-rem | 1 | proven | (k + 1) % pts.len() | inside iteration over pts, so len() > 0 |