Files
jyviko 4176181733 solidcore: Gordon surface of a network whose crossings are not at common parameters (#16006)
* 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>
2026-11-13 11:40:43 +00:00

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.
5filefnpatternnstatuscodereason
6crates/solidcore-step/src/eval.rsBSplineSurface::pointwith_capacity1provenVec::with_capacity(nu)nu = points.len(), already in memory
7crates/solidcore-step/src/eval.rsexpandedwith_capacity1provenVec::with_capacity(total)total == points + degree + 1 with degree < points, checked just above: at most twice the points, already in memory
8crates/solidcore-step/src/read.rsReader::bspline_surfacewith_capacity1provenVec::with_capacity(rows.len().min(MAX_CTRL))rows.len() of rows already in memory, and at most MAX_CTRL
9crates/solidcore-step/src/read.rsReader::read_curvewith_capacity1provenVec::with_capacity(items.len())the length of a collection already in memory
10crates/solidcore-step/src/read.rsimplied_knotsint-div1proven(n_ctrl - 1) / degreedegree == 0 is refused just above
11crates/solidcore-step/src/read.rsknotswindows1provenwindows(2)constant non-zero size
12crates/solidcore-step/src/read.rsknotswith_capacity1provenVec::with_capacity(raw.len())the length of a collection already in memory
13crates/solidcore-step/src/read.rsknotswith_capacity2provenVec::with_capacity(raw.len())the length of a collection already in memory
14crates/solidcore-step/src/topology.rsBuilder::boundwith_capacity1provenVec::with_capacity(ids.len())the length of a collection already in memory
15crates/solidcore-step/src/topology.rsBuilder::facewith_capacity1provenVec::with_capacity(bounds.len())the length of a collection already in memory
16crates/solidcore-step/src/topology.rsBuilder::face_extentwith_capacity1provenVec::with_capacity(face.loops.len())the length of a collection already in memory
17crates/solidcore-step/src/topology.rsBuilder::face_extentwith_capacity2provenVec::with_capacity(es.len())the length of a collection already in memory
18crates/solidcore-step/src/topology.rsBuilder::face_pcurveswith_capacity1provenVec::with_capacity(l.len())the length of a collection already in memory
19crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity1provenVec::with_capacity(self.faces.len())the length of a collection already in memory
20crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity2provenVec::with_capacity(self.faces.len())the length of a collection already in memory
21crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity3provenVec::with_capacity(self.faces.len())the length of a collection already in memory
22crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity4provenVec::with_capacity(nf)nf = self.faces.len(), already in memory
23crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity5provenVec::with_capacity(self.edges.len())the length of a collection already in memory
24crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity6provenVec::with_capacity(self.vertices.len())the length of a collection already in memory
25crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity7provenVec::with_capacity(flipped)flipped counts the entries of turned, a list in memory
26crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity8provenVec::with_capacity(vertex_order.len())the length of a collection already in memory
27crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity9provenVec::with_capacity(edge_order.len())the length of a collection already in memory
28crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity10provenVec::with_capacity(face_order.len())the length of a collection already in memory
29crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity11provenVec::with_capacity(face_order.len())the length of a collection already in memory
30crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity12provenVec::with_capacity(face.loops.len())the length of a collection already in memory
31crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity13provenVec::with_capacity(face.loops.len())the length of a collection already in memory
32crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity14provenVec::with_capacity(es.len())the length of a collection already in memory
33crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity15provenVec::with_capacity(shells.len())the length of a collection already in memory
34crates/solidcore-step/src/topology.rsBuilder::finishwith_capacity16provenVec::with_capacity(s.len())the length of a collection already in memory
35crates/solidcore-step/src/topology.rsBuilder::poly_loopint-rem1proven(k + 1) % pts.len()pts.len() < 3 returns an Err just above, so the divisor is at least 3
36crates/solidcore-step/src/topology.rsBuilder::poly_loopwith_capacity1provenVec::with_capacity(pts.len())the length of a collection already in memory
37crates/solidcore-step/src/topology.rsBuilder::shellwith_capacity1provenVec::with_capacity(faces.len())the length of a collection already in memory
38crates/solidcore-step/src/topology.rsBuilder::trim_facewith_capacity1provenVec::with_capacity(edge_loops.len())the length of a collection already in memory
39crates/solidcore-step/src/topology.rsBuilder::trim_facewith_capacity2provenVec::with_capacity(l.len())the length of a collection already in memory
40crates/solidcore-step/src/topology.rsface_domainf64::clamp1provenclamp(*n0, last)n0 <= last is checked just above (crossed or NaN bounds are refused with an Err)
41crates/solidcore-step/src/topology.rsfull_knotswith_capacity1provenVec::with_capacity(total)total == count + degree + 1 with count <= MAX_SPLINE_POINTS and degree <= MAX_SPLINE_DEGREE, all checked just above
42crates/solidcore-step/src/topology.rsloop_areawindows1provenwindows(2)constant non-zero size
43crates/solidcore-step/src/topology.rsmap_edgewindows1provenwindows(2)constant non-zero size
44crates/solidcore-step/src/topology.rsprojectOrd::clamp1provenclamp(1, 8)constant bounds, min <= max
45crates/solidcore-step/src/topology.rsprojectf64::clamp1provenclamp(a, b)a < b: the only caller, open_or_closed, refuses !(a < b) (which a NaN fails too)
46crates/solidcore-step/src/topology.rsprojectint-div1provenMAX_SAMPLES / spansspans = breaks.len() + 1 >= 1
47crates/solidcore-step/src/topology.rsprojectint-div2provendiv_ceil(MAX_SAMPLES)constant non-zero divisor MAX_SAMPLES (4096)
48crates/solidcore-step/src/topology.rsprojectstep_by1provenstep_by(stride)ts.len() > MAX_SAMPLES just above, so stride = ts.len().div_ceil(MAX_SAMPLES) >= 1
49crates/solidcore-step/src/topology.rsprojectwith_capacity1provenVec::with_capacity(spans * per + 1)spans = breaks.len() + 1 of a list in memory, per <= 8
50crates/solidcore-step/src/topology.rsread_solids_inwith_capacity1provenVec::with_capacity(solids.len())the length of a collection already in memory
51crates/solidcore-step/src/topology.rsread_withwith_capacity1provenVec::with_capacity(ids.len())the length of a collection already in memory
52crates/solidcore-step/src/topology.rsseam_onlyint-div1provenuses.len() / 2constant non-zero divisor
53crates/solidcore-step/src/topology.rstolerancef64::clamp1provenclamp(MIN_TOLERANCE, MAX_FIT_TOLERANCE)constant bounds MIN_TOLERANCE (1e-7) <= MAX_FIT_TOLERANCE (1.0)
54crates/solidcore-step/src/topology.rsuses_ofwith_capacity1provenVec::with_capacity(edge_loops.len())the length of a collection already in memory
55crates/solidcore-step/src/topology.rsuses_ofwith_capacity2provenVec::with_capacity(l.len())the length of a collection already in memory
56crates/solidcore-step/src/topology/frames.rsBuilder::turn_about_axeswindows1provenwindows(2)constant non-zero size
57crates/solidcore-step/src/topology/frames.rsBuilder::turn_about_axeswith_capacity1provenVec::with_capacity(g.len())the length of a collection already in memory
58crates/solidcore-step/src/topology/seams.rsBuilder::meridian_slitwith_capacity1provenVec::with_capacity(2 * up.len() + 4)twice a collection in memory plus 4
59crates/solidcore-step/src/topology/seams.rsBuilder::seatedint-div1provenpath.len() / 2constant non-zero divisor
60crates/solidcore-step/src/topology/seams.rsBuilder::split_edgewith_capacity1provenVec::with_capacity(es.len() + 1)a collection in memory plus one
61crates/solidcore-step/src/topology/seams.rsremove_loopVec::remove1provenremove(gone)gone >= face.loops.len() returns just above
62crates/solidcore-step/src/topology/seams.rsrestartedwith_capacity1provenVec::with_capacity(columns)columns = rows.first().len(), already in memory
63crates/solidcore-step/src/topology/seams.rsslit_pathint-div1provenn / 2constant non-zero divisor
64crates/solidcore-step/src/topology/seams.rsslit_pathint-rem1proven(k + n - 1) % nn >= 2 is checked just above
65crates/solidcore-step/src/topology/seams.rsslit_pathsplit_at1provensplit_at(n / 2)ring has n = es.len() entries, so n / 2 <= ring.len()
66crates/solidcore-step/src/topology/swept.rshyperbola_splineOrd::clamp1provenclamp(1, MAX_PIECES)constant bounds 1 <= MAX_PIECES (64)
67crates/solidcore-step/src/topology/swept.rsrevolutionint-div1provents.len() / 2constant non-zero divisor
68crates/solidcore-step/src/topology/swept.rswholewindows1provenwindows(2)constant non-zero size
69crates/solidcore-step/src/topology/swept.rswidest_gapwindows1provenwindows(2)constant non-zero size
70crates/solidcore-step/src/write/topology.rsBrepWriter::edge_geometrywith_capacity1provenVec::with_capacity(edge.uses.len())the length of a collection already in memory
71crates/solidcore-step/src/write/topology.rsBrepWriter::facewith_capacity1provenVec::with_capacity(face.loops.len())the length of a collection already in memory
72crates/solidcore-step/src/write/topology.rsBrepWriter::facewith_capacity2provenVec::with_capacity(edges.len())the length of a collection already in memory
73crates/solidcore-step/src/write/topology.rsBrepWriter::shellwith_capacity1provenVec::with_capacity(faces.len())the length of a collection already in memory
74crates/solidcore-step/src/write/topology.rsbrepwith_capacity1provenVec::with_capacity(solid.voids.len())the length of a collection already in memory
75crates/solidcore-step/src/write/topology.rsbrepwith_capacity2provenVec::with_capacity(layout.sheets.len())the length of a collection already in memory
76crates/solidcore-step/src/write/topology.rspcurvewith_capacity1provenVec::with_capacity(homogeneous.len())the length of a collection already in memory
77crates/solidcore-step/src/write/topology.rspcurvewith_capacity2provenVec::with_capacity(homogeneous.len())the length of a collection already in memory
78crates/solidcore-step/src/write/topology.rssigned_areaint-rem1proven(i + 1) % ninside a range 0..n, so n > 0
79crates/solidcore-step/src/write/topology.rssurfacewith_capacity1provenVec::with_capacity(homogeneous.len())the length of a collection already in memory
80crates/solidcore-step/src/write/topology.rssurfacewith_capacity2provenVec::with_capacity(homogeneous.len())the length of a collection already in memory
81crates/solidcore/src/blend/blend_corner/ball.rsball_corner_edge_geomwith_capacity1provenVec::with_capacity(n)n = contacts.len(), an in-memory collection
82crates/solidcore/src/blend/blend_corner/ball.rsball_inverseint-rem1proven(j + 1) % 3constant non-zero divisor
83crates/solidcore/src/blend/blend_corner/ball.rsball_inverseint-rem2proven(j + 2) % 3constant non-zero divisor
84crates/solidcore/src/blend/blend_corner/ball.rsball_inverseint-rem3proven(i + 1) % 3constant non-zero divisor
85crates/solidcore/src/blend/blend_corner/ball.rsball_inverseint-rem4proven(i + 2) % 3constant non-zero divisor
86crates/solidcore/src/blend/blend_corner/ball.rsball_triangle_patchint-rem1proven(pole + 1) % 3constant non-zero divisor
87crates/solidcore/src/blend/blend_corner/ball.rsball_triangle_patchint-rem2proven(pole + 2) % 3constant non-zero divisor
88crates/solidcore/src/blend/blend_corner/ball.rsclassify_ballwith_capacity1provenVec::with_capacity(n)n = all_eus.len(), an in-memory slice
89crates/solidcore/src/blend/blend_corner/ball.rsclassify_ballwith_capacity2provenVec::with_capacity(n)n = all_eus.len(), an in-memory slice
90crates/solidcore/src/blend/blend_corner/ball.rsring_facesint-rem1proven(ii + n - 1) % ninside faces.iter_mut().enumerate() with faces = vec![None; n], so n > 0
91crates/solidcore/src/blend/blend_corner/chamfer.rsbilinear_faceint-rem1proven(i + 1) % 4constant non-zero divisor
92crates/solidcore/src/blend/blend_corner/chamfer.rschamfer_corner_edge_geomint-rem1proven(i + 1) % countinside xs.iter().enumerate(), so count = xs.len() > 0
93crates/solidcore/src/blend/blend_corner/chamfer.rschamfer_corner_edge_geomint-rem2proven(j + 1) % countinside order.iter().enumerate() with order = (0..count).collect(), so count > 0
94crates/solidcore/src/blend/blend_corner/chamfer.rschamfer_planesint-rem1open(i + n - 1) % n
95crates/solidcore/src/blend/blend_corner/chamfer.rschamfer_planesint-rem2open(i + 1) % n
96crates/solidcore/src/blend/blend_corner/chamfer.rsclassify_chamferint-rem1proven(i + n - 1) % nn in 3..=MAX_CHAMFERS: the function returns above when not
97crates/solidcore/src/blend/blend_corner/chamfer.rscorner_patchint-rem1proven(i + n - 1) % ninside xs.iter().enumerate(), so n = xs.len() > 0
98crates/solidcore/src/blend/blend_corner/chamfer.rscrossing_rowsint-rem1open(i + n - 1) % n
99crates/solidcore/src/blend/blend_corner/chamfer.rscrossingsint-rem1proven(i + n - 1) % ninside for i in 0..n, so n > 0 (n = mu.len())
100crates/solidcore/src/blend/blend_corner/chamfer.rsfacet_failsint-rem1proven(i + n - 1) % ninside xs.iter().enumerate(), so n = xs.len() > 0
101crates/solidcore/src/blend/blend_corner/chamfer.rsfacet_planeint-rem1proven(i + 1) % ninside xs.iter().enumerate(), so n = xs.len() > 0
102crates/solidcore/src/blend/blend_corner/chamfer.rsmitre_testsint-rem1proven(i + 1) % 3constant non-zero divisor
103crates/solidcore/src/blend/blend_corner/chamfer.rsnewellint-rem1proven(i + 1) % ninside xs.iter().enumerate(), so n = xs.len() > 0
104crates/solidcore/src/blend/blend_corner/chamfer.rspatch_facesint-rem1provenm % nn >= 4: the function returns above when not
105crates/solidcore/src/blend/blend_corner/chamfer.rsring_facesint-rem1proven(i + n - 1) % ninside for i in 0..n, so n > 0 (n = all_eus.len())
106crates/solidcore/src/blend/blend_corner/end.rsfit_of_end_past_side_edgesint-rem1proven(fil + total - 1) % totalreturns early when total < 3
107crates/solidcore/src/blend/blend_corner/end.rsfit_of_end_past_side_edgesint-rem2proven(fil + 1) % totaltotal >= 3: the function returns above when not
108crates/solidcore/src/blend/blend_corner/mixed/algebra.rsboehmVec::insert1openinsert(k + 1, t)
109crates/solidcore/src/blend/blend_corner/mixed/algebra.rssrf_to_bsplineint-div1provenii / srf.dusrf.du > 0: the function returns above when it is 0
110crates/solidcore/src/blend/blend_corner/mixed/algebra.rssrf_to_bsplineint-div2provenjj / srf.dvsrf.dv > 0: the function returns above when it is 0
111crates/solidcore/src/blend/blend_corner/mixed/algebra.rstensor_usplit_at1opensplit_at_mut(k)
112crates/solidcore/src/blend/blend_corner/setback.rsbuild_setback_fillint-rem1open(m + ee) % n
113crates/solidcore/src/blend/blend_corner/setback.rsbuild_setback_fillwith_capacity1openVec::with_capacity(n)
114crates/solidcore/src/blend/blend_corner/setback.rscorner_planesint-rem1open(i + n - 1) % n
115crates/solidcore/src/blend/blend_corner/setback.rscorner_planesint-rem2open(i + n - 1) % n
116crates/solidcore/src/blend/blend_corner/setback.rscorner_planesint-rem3open(i + 1) % n
117crates/solidcore/src/blend/blend_corner/setback.rscorner_planeswith_capacity1openVec::with_capacity(n)
118crates/solidcore/src/blend/blend_corner/setback.rscorner_planeswith_capacity2openVec::with_capacity(n)
119crates/solidcore/src/blend/blend_corner/setback.rscorner_planeswith_capacity3openVec::with_capacity(n)
120crates/solidcore/src/blend/blend_corner/setback.rscorner_planeswith_capacity4openVec::with_capacity(n)
121crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricsint-rem1open(i + n - 1) % n
122crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricsint-rem2open(i + n - 1) % n
123crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricsint-rem3open(i + 1) % n
124crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricswith_capacity1openVec::with_capacity(n)
125crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricswith_capacity2openVec::with_capacity(n)
126crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricswith_capacity3openVec::with_capacity(n)
127crates/solidcore/src/blend/blend_corner/setback.rscorner_quadricswith_capacity4openVec::with_capacity(n)
128crates/solidcore/src/blend/blend_corner/setback.rscreate_setback_patcheswith_capacity1openVec::with_capacity(sides.len())
129crates/solidcore/src/blend/blend_corner/setback.rscreate_setback_patcheswith_capacity2openVec::with_capacity(sides.len())
130crates/solidcore/src/blend/blend_corner/setback.rscreate_setback_patcheswith_capacity3openVec::with_capacity(sides.len())
131crates/solidcore/src/blend/blend_corner/setback.rscurved_leastint-rem1open(i + n - 1) % n
132crates/solidcore/src/blend/blend_corner/setback.rscurved_leastint-rem2open(i + 1) % n
133crates/solidcore/src/blend/blend_corner/setback.rsgather_endswith_capacity1openVec::with_capacity(n)
134crates/solidcore/src/blend/blend_corner/setback.rsgather_endswith_capacity2openVec::with_capacity(n)
135crates/solidcore/src/blend/blend_corner/setback.rsmake_setback_topologyint-rem1open(i + n - 1) % n
136crates/solidcore/src/blend/blend_corner/setback.rsmake_setback_topologyint-rem2open(i + 1) % n
137crates/solidcore/src/blend/blend_corner/setback.rsmake_setback_topologywith_capacity1openVec::with_capacity(n)
138crates/solidcore/src/blend/blend_corner/setback.rsmake_setback_topologywith_capacity2openVec::with_capacity(n)
139crates/solidcore/src/blend/blend_corner/setback.rsopen_setback_springsint-rem1open(f + n - 1) % n
140crates/solidcore/src/blend/blend_setback.rsaffine_solutionsswap1openswap(pi * n + j, r * n + j)
141crates/solidcore/src/blend/blend_setback.rsaffine_solutionsswap2openswap(pi, r)
142crates/solidcore/src/blend/blend_setback.rsaffine_solutionsswap3openswap(i * n + pj, i * n + r)
143crates/solidcore/src/blend/blend_setback.rsaffine_solutionsswap4openswap(pj, r)
144crates/solidcore/src/blend/blend_setback.rsbasiswith_capacity1openVec::with_capacity(p + 1)
145crates/solidcore/src/blend/blend_setback.rsdistanceswith_capacity1openVec::with_capacity(le)
146crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem1openm % n
147crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem2open(m + 1) % n
148crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem3open(m + n - 1) % n
149crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem4open(m + 1) % n
150crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem5open(m + 1) % n
151crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem6open(q + 1) % n
152crates/solidcore/src/blend/blend_setback.rsfill_hole_withint-rem7open(q + n - 1) % n
153crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity1openVec::with_capacity(n)
154crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity2openVec::with_capacity(n)
155crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity3openVec::with_capacity(n)
156crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity4openVec::with_capacity(n)
157crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity5openVec::with_capacity(n)
158crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity6openVec::with_capacity(n)
159crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity7openVec::with_capacity(n)
160crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity8openVec::with_capacity(n)
161crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity10openVec::with_capacity(n)
162crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity11openVec::with_capacity(n)
163crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity12openVec::with_capacity(n)
164crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity13openVec::with_capacity(mc)
165crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity14openVec::with_capacity(2 * n)
166crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity15openVec::with_capacity(row.len())
167crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity16openVec::with_capacity(2 * n)
168crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity17openVec::with_capacity(net.pts.len())
169crates/solidcore/src/blend/blend_setback.rsfill_hole_withwith_capacity18openVec::with_capacity(net.pts.len())
170crates/solidcore/src/blend/blend_setback.rsround_jetsint-div1openpts.len() / (lq + 1)
171crates/solidcore/src/blend/blend_setback.rsround_jetsint-rem1proven(d - l) % 2constant non-zero divisor
172crates/solidcore/src/blend/blend_setback/certify.rsfundamentalsint-rem1proven(3 + c) % 2constant non-zero divisor
173crates/solidcore/src/blend/blend_setback/certify.rssides_on_planesint-rem1proven(m + e) % ninside while m < n, so n > 0
174crates/solidcore/src/blend/blend_setback/certify.rst_det3int-rem1proven(j + 1) % 3constant non-zero divisor
175crates/solidcore/src/blend/blend_setback/certify.rst_det3int-rem2proven(j + 2) % 3constant non-zero divisor
176crates/solidcore/src/blend/blend_setback/certify.rst_det4int-rem1proven(3 + c) % 2constant non-zero divisor
177crates/solidcore/src/blend/blend_setback/convexity.rsSectorRows::add_patchwindows1provenwindows(2)constant non-zero size
178crates/solidcore/src/blend/blend_setback/convexity.rspatch_curvatureswith_capacity1provenVec::with_capacity(patches.len())patches.len(), an in-memory slice
179crates/solidcore/src/blend/blend_setback/curved.rscontainment_curvedint-rem1open(i + 1) % n
180crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem1openm % n
181crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem2open(m + n - 1) % n
182crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem3open(m + 1) % n
183crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem4open(m + 1) % n
184crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem5open(q + 1) % n
185crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem6open(q + n - 1) % n
186crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem7open(m + 1) % n
187crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem8open(m + n - 1) % n
188crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem9open(q + n - 1) % n
189crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedint-rem10open(q + 1) % n
190crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedwith_capacity1openVec::with_capacity(2 * n)
191crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedwith_capacity2openVec::with_capacity(2 * n)
192crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedwith_capacity3openVec::with_capacity(2 * n)
193crates/solidcore/src/blend/blend_setback/curved.rsgraph_g1_curvedwith_capacity4openVec::with_capacity(2 * n)
194crates/solidcore/src/blend/blend_setback/curved.rsno_more_concavewith_capacity1openVec::with_capacity(c.control_points.len())
195crates/solidcore/src/blend/blend_setback/curved.rst_det_withint-rem1proven(3 + c) % 2constant non-zero divisor
196crates/solidcore/src/blend/blend_setback/graph.rsfill_fromwith_capacity1openVec::with_capacity(nets.len())
197crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem1openm % n
198crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem2open(m + n - 1) % n
199crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem3open(m + 1) % n
200crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem4open(m + 1) % n
201crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem5open(m + 1) % n
202crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem6open(q + 1) % n
203crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem7open(q + n - 1) % n
204crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem8open(q + n - 1) % n
205crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkint-rem9open(q + 1) % n
206crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkwith_capacity1openVec::with_capacity(2 * n)
207crates/solidcore/src/blend/blend_setback/graph.rsgraph_gkwith_capacity2openVec::with_capacity(2 * n)
208crates/solidcore/src/blend/blend_setback/qp.rsdual_runVec::remove1provenremove(drop)drop < active.len(): the function returns above when it is not
209crates/solidcore/src/blend/blend_setback/qp.rsdual_runVec::remove2provenremove(drop)u is pushed and removed with active, so u.len() == active.len() > drop
210crates/solidcore/src/blend/blend_setback/scale.rsModel::runwith_capacity1openVec::with_capacity(surfaces.len())
211crates/solidcore/src/blend/blend_setback/scale.rsbisect_thousandthsint-div1proven(lo + hi) / 2constant non-zero divisor
212crates/solidcore/src/blend/blend_setback/scale.rsmodel_roundswith_capacity1openVec::with_capacity(n)
213crates/solidcore/src/blend/blend_setback/scale.rsmodel_roundswith_capacity2provenVec::with_capacity(6)constant capacity
214crates/solidcore/src/blend/blend_setback/scale.rsmodel_roundswith_capacity3provenVec::with_capacity(6)constant capacity
215crates/solidcore/src/blend/feature_executive.rsFeatureExecutive::restore_featuresVec::remove1openremove(ii)
216crates/solidcore/src/blend/feature_executive.rsFeatureExecutive::take_offVec::remove1provenremove(f.feature)the index was just read by self.features.get_mut(f.feature), and kept is walked in descending order
217crates/solidcore/src/blend/feature_executive.rscollect_feature_loop_edgesVec::remove1openremove(kk)
218crates/solidcore/src/blend/feature_executive.rsfix_edge_chain_listVec::remove1openremove(id)
219crates/solidcore/src/blend/feature_executive.rsfix_edge_chain_listVec::remove2openremove(id)
220crates/solidcore/src/blend/fillet_cliff_overflow.rsclose_round_loopVec::remove1provenremove(i)i is from enumerate() over the same Vec, with no intervening mutation
221crates/solidcore/src/blend/fillet_cliff_overflow.rsclose_round_loopwindows1provenwindows(2)constant non-zero size
222crates/solidcore/src/blend/fillet_cliff_overflow.rsclosing_facewindows1provenwindows(2)constant non-zero size
223crates/solidcore/src/blend/fillet_cliff_overflow.rsface_of_loopint-rem1proven(i + 1) % uvs.len()inside uvs.iter().enumerate(), so uvs.len() > 0
224crates/solidcore/src/blend/fillet_cliff_overflow.rslamina_chainsVec::insert1proveninsert(0, found)index 0 is never past the end
225crates/solidcore/src/blend/fillet_cliff_overflow.rslamina_chainsVec::insert2proveninsert(0, other)index 0 is never past the end
226crates/solidcore/src/blend/fillet_cliff_overflow.rsloop_areaint-rem1proven(i + 1) % uvs.len()inside uvs.iter().enumerate(), so uvs.len() > 0
227crates/solidcore/src/blend/fillet_corner/p1.rsFilletCorner::make_constant_radius_fillet_withint-rem1open(found_index + total_edges - 1) % total_edges
228crates/solidcore/src/blend/fillet_corner/p1.rsFilletCorner::make_constant_radius_fillet_withint-rem2open(found_index + 1) % total_edges
229crates/solidcore/src/blend/fillet_corner/p1.rsFilletCorner::squeeze_edgeVec::remove1openremove(found)
230crates/solidcore/src/blend/fillet_corner/p1.rsFilletCorner::squeeze_edgeVec::remove2openremove(found)
231crates/solidcore/src/blend/fillet_corner/p1.rscreate_srf_of_revolutionint-rem1proven(major + 2) % 4constant non-zero divisor
232crates/solidcore/src/blend/fillet_corner/p1.rscreate_srf_of_revolutionint-rem2open(major + 1) % total
233crates/solidcore/src/blend/fillet_corner/p1.rsface_curve_half_alongwindows1provenwindows(2)constant non-zero size
234crates/solidcore/src/blend/fillet_corner/p1.rsface_curve_half_alongwindows2provenwindows(2)constant non-zero size
235crates/solidcore/src/blend/fillet_corner/p1.rskeep_end_definitionwith_capacity1openVec::with_capacity(edges.len())
236crates/solidcore/src/blend/fillet_corner/p2.rsFilletCorner::adjust_topology_convex_nxn_withVec::insert1openinsert(found_vert_index, new_vert)
237crates/solidcore/src/blend/fillet_corner/p2.rsFilletCorner::adjust_topology_convex_nxn_withVec::insert2openinsert(found_edge_index, new_edge)
238crates/solidcore/src/blend/fillet_corner/p2.rsFilletCorner::adjust_topology_convex_nxn_withint-rem1open(ii + 1) % total
239crates/solidcore/src/blend/fillet_corner/p2.rsFilletCorner::adjust_topology_convex_nxn_withint-rem2open(found_vert_index + total - 1) % total
240crates/solidcore/src/blend/fillet_corner/p2.rsFilletCorner::adjust_topology_convex_nxn_withint-rem3open(found_vert_index + 1) % total
241crates/solidcore/src/blend/fillet_corner/p2.rsFilletCorner::make_variable_radius_fillet_withint-rem1openi % total_edges
242crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::adjust_topology_nx2_withVec::insert1proveninsert(index, vert_on_side_face)index < vertices.len() in one branch; in the other vertices.get(index - 1) succeeded, so index <= len
243crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::adjust_topology_nx2_withVec::remove1provenremove(index)index < edges.len(): the function returns above when it is not
244crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_3x2_withVec::remove1provenremove(found_index)found_index is from enumerate() over self.edges (returns above when none matched); edges unchanged since
245crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_3x2_withVec::remove2provenremove(idx)idx is position() in the same Vec
246crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_default_withint-rem1proven(ii + 1) % 3constant non-zero divisor
247crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_default_withint-rem2proven(ii + 1) % total_edgesinside else if total_edges == 4
248crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_default_withint-rem3proven(init_index + ii) % total_edgesinside for ii in 0..total_edges, so total_edges > 0; its only other change adds 1
249crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_default_withwindows1provenwindows(2)constant non-zero size
250crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_default_withwith_capacity1provenVec::with_capacity(ordered_3d.len())ordered_3d.len(), an in-memory Vec
251crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_nx2Vec::remove1provenremove(0)edges.len() == total_edges == 4: the function returns above when not
252crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_nx2Vec::remove2provenremove(0)surfaces is not empty: the function returns above when it is
253crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_nx2_withVec::remove1provenremove(0)edges.len() == total_edges == 4: the function returns above when not
254crates/solidcore/src/blend/fillet_corner/p3.rsFilletCorner::create_corner_patch_nx2_withVec::remove2provenremove(0)surfaces is not empty: the function returns above when it is
255crates/solidcore/src/blend/fillet_corner/p3.rsFilletExecutiveData::remove_from_topo_edgesVec::remove1provenremove(i)i is position() in the same Vec
256crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_convex_nxn_corner_topologyint-rem1proven(count + 1) % totalvertex_at(self, 0) succeeded above, so total = vertices.len() > 0; vertices unchanged since
257crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_convex_nxn_corner_topologyint-rem2proven(count + 1) % totalvertex_at(self, 0) succeeded above, so total = vertices.len() > 0; vertices unchanged since
258crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx1_corner_topologyint-rem1proven(index + total - 1) % totalindex is position() in all, so total = all.len() > 0
259crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx1_corner_topologyint-rem2proven(index + 1) % totalindex is position() in all, so total = all.len() > 0
260crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx1_corner_topologyint-rem3proven(index + total - 1) % totalinside if .. && total > 3
261crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx1_corner_topologyint-rem4proven(index + 1) % totalinside if .. && total > 3
262crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx1_corner_topologyint-rem5proven(idx + total - 1) % totalinside if .. && total > 3
263crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx1_corner_topologyint-rem6proven(idx + 1) % totalinside if .. && total > 3
264crates/solidcore/src/blend/fillet_corner/topology.rsFilletCorner::make_nx2_corner_topologyint-rem1proven(found1 + found2) % 2constant non-zero divisor
265crates/solidcore/src/blend/fillet_corner/topology/ball.rsFilletCorner::make_ball_topologyint-rem1proven(ii + n - 1) % ninside for ii in 0..n, so n > 0 (n = all.len(), not reassigned)
266crates/solidcore/src/blend/fillet_corner/topology/ball.rsFilletCorner::make_ball_topologyint-rem2proven(ii + n - 1) % ninside for ii in 0..n, so n > 0 (n = all.len(), not reassigned)
267crates/solidcore/src/blend/fillet_corner/topology/ball.rsFilletCorner::make_ball_topologyint-rem3proven(ii + 1) % ninside for ii in 0..n, so n > 0 (n = all.len(), not reassigned)
268crates/solidcore/src/blend/fillet_corner/topology/ball.rsFilletCorner::make_ball_topologywith_capacity1provenVec::with_capacity(n)n = all.len(), an in-memory collection
269crates/solidcore/src/blend/fillet_corner/topology/ball.rsFilletCorner::make_ball_topologywith_capacity2provenVec::with_capacity(n)n = all.len(), an in-memory collection
270crates/solidcore/src/blend/fillet_corner/topology/concave_nxn.rsFilletCorner::make_concave_nxn_corner_topologyVec::insert1openinsert(jj, extra)
271crates/solidcore/src/blend/fillet_corner/topology/concave_nxn.rsFilletCorner::make_concave_nxn_corner_topologyint-rem1proven(jj + 1) % totaltotal starts at all.len() and all.last() is Some (returns above when not); it only grows
272crates/solidcore/src/blend/fillet_corner/topology/end_corners.rsFilletCorner::make_4x3_corner_topologyint-rem1proveni % total_eustotal_eus > 0: the function returns above when it is 0
273crates/solidcore/src/blend/fillet_corner/topology/end_corners.rsFilletCorner::make_4x3_corner_topologyint-rem2proveni % total_eustotal_eus > 0: the function returns above when it is 0
274crates/solidcore/src/blend/fillet_corner/topology/end_corners.rsFilletCorner::make_4x3_corner_topologyint-rem3provencurr_index % total_solver_eustotal_solver_eus > 0: the function returns above when it is 0
275crates/solidcore/src/blend/fillet_corner/topology/join.rsjoin_sidesint-rem1proven(idx1 + 1) % totalidx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0
276crates/solidcore/src/blend/fillet_corner/topology/join.rsjoin_sidesint-rem2proven(kk + 1) % totalidx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0
277crates/solidcore/src/blend/fillet_corner/topology/join.rsjoin_sidesint-rem3proven(idx2 + 1) % totalidx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0
278crates/solidcore/src/blend/fillet_corner/topology/join.rsjoin_sidesint-rem4proven(kk + 1) % totalidx1 and idx2 are from enumerate() over all_eus (returns above when not found), so total = all_eus.len() > 0
279crates/solidcore/src/blend/fillet_corner/topology/mixed.rsFilletCorner::make_mixed_topologywith_capacity1provenVec::with_capacity(6)constant capacity
280crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rsFilletCorner::make_swept_topologywith_capacity1provenVec::with_capacity(2)constant capacity
281crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rsFilletCorner::make_swept_topologywith_capacity2provenVec::with_capacity(2)constant capacity
282crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rsFilletCorner::make_swept_topologywith_capacity3provenVec::with_capacity(2)constant capacity
283crates/solidcore/src/blend/fillet_corner/topology/swept_turn.rsFilletCorner::make_swept_topologywith_capacity4provenVec::with_capacity(2)constant capacity
284crates/solidcore/src/blend/fillet_exact/rational.rscalc_rational_spine_fillet_geomint-div1provencand / 2constant non-zero divisor
285crates/solidcore/src/blend/fillet_exact/rational.rscalc_rational_spine_fillet_geomint-rem1provencand % 2constant non-zero divisor
286crates/solidcore/src/blend/fillet_exact/rational.rscalc_rational_spine_fillet_geomwith_capacity1provenVec::with_capacity(2)constant capacity
287crates/solidcore/src/blend/fillet_executive/p1.rsFilletExecutive::remove_from_topo_edgesVec::remove1openremove(index)
288crates/solidcore/src/blend/fillet_executive/p2.rsFilletExecutive::collect_tangent_edge_sequence_narrowVec::insert1proveninsert(0, prev)index 0 is never past the end
289crates/solidcore/src/blend/fillet_executive/session.rsSessionEdgeLookup::solver_pair_ops_mutsplit_at1opensplit_at_mut(hi)
290crates/solidcore/src/blend/fillet_executive/session.rsSessionObjects::calc_solver_geometry_notingsplit_at1opensplit_at_mut(index)
291crates/solidcore/src/blend/fillet_executive/session/ball_regular.rsball_is_regularwith_capacity1openVec::with_capacity(STEPS)
292crates/solidcore/src/blend/fillet_executive/session/ball_regular.rsball_is_regularwith_capacity2openVec::with_capacity(STEPS)
293crates/solidcore/src/blend/fillet_executive/session/ball_regular.rsball_is_regularwith_capacity3openVec::with_capacity(STEPS)
294crates/solidcore/src/blend/fillet_executive/session/ball_regular.rssolve4swap1openswap(kk, pivot)
295crates/solidcore/src/blend/fillet_executive/session/band_cuts.rssection_breaks_throughwindows1provenwindows(2)constant non-zero size
296crates/solidcore/src/blend/fillet_executive/session/band_cuts.rssection_breaks_throughwith_capacity1openVec::with_capacity(meets.len() + 2)
297crates/solidcore/src/blend/fillet_executive/session/cliff_overflow.rsFilletSession::holds_its_lawint-rem1provenc % 2constant non-zero divisor
298crates/solidcore/src/blend/fillet_executive/session/cliff_overflow.rsFilletSession::holds_its_lawint-rem2provenc % 2constant non-zero divisor
299crates/solidcore/src/blend/fillet_executive/session/fit_size.rscorner_takes_per_radiusint-rem1proven(i + 1) % 3constant non-zero divisor
300crates/solidcore/src/blend/fillet_executive/session/fit_size.rscorner_takes_per_radiusint-rem2proven(i + 2) % 3constant non-zero divisor
301crates/solidcore/src/blend/fillet_executive/session/keep_features.rsFilletSession::keep_features_onwith_capacity1provenVec::with_capacity(rim.len())rim.len(), an in-memory collection
302crates/solidcore/src/blend/fillet_executive/session/keep_features.rsFilletSession::keep_features_onwith_capacity2openVec::with_capacity(2 * rim_curves.len())
303crates/solidcore/src/blend/fillet_executive/session/keep_features.rsFilletSession::keep_features_onwith_capacity3provenVec::with_capacity(sheet_faces.len())sheet_faces.len(), an in-memory collection
304crates/solidcore/src/blend/fillet_executive/session/keep_features.rsFilletSession::keep_features_onwith_capacity4provenVec::with_capacity(blended_edges.len())blended_edges.len(), an in-memory collection
305crates/solidcore/src/blend/fillet_executive/session/outline_rims.rsFilletSession::end_round_on_outlinewith_capacity1provenVec::with_capacity(2)constant capacity
306crates/solidcore/src/blend/fillet_executive/session/surface.rsSessionObjects::allocate_surface_surface_solverwith_capacity1provenVec::with_capacity(2)constant capacity
307crates/solidcore/src/blend/fillet_executive/session/two_offsets.rsFilletSession::prepare_chamfers_alongf64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
308crates/solidcore/src/blend/fillet_geom/p2.rsFilletBrep::calc_rail_rail_interpolation_with_solversint-rem1open(index + 2) % total_edges
309crates/solidcore/src/blend/fillet_geom/p2.rsFilletBrep::calc_rail_rail_interpolation_with_solversstep_by1provenstep_by(2)constant non-zero step
310crates/solidcore/src/blend/fillet_geom/p2.rsFilletBrep::calc_rail_rail_interpolation_with_solversstep_by2provenstep_by(2)constant non-zero step
311crates/solidcore/src/blend/fillet_geom/p2.rsRailRailSolvers::rail_rail_intersectsplit_at1opensplit_at_mut(hi)
312crates/solidcore/src/blend/fillet_geom/p2.rsg2_rail_rail_curvestep_by1provenstep_by(2)constant non-zero step
313crates/solidcore/src/blend/fillet_geom/p2.rswith_solver_pairsplit_at1opensplit_at_mut(hi)
314crates/solidcore/src/blend/fillet_geom/p3.rsFilletBrep::re_calc_fillet_geom_throughVec::insert1openinsert(index_of_insert, t)
315crates/solidcore/src/blend/fillet_geom/p3.rsFilletBrep::re_calc_fillet_geom_throughVec::insert2openinsert(index_of_insert, vu)
316crates/solidcore/src/blend/fillet_geom/p3.rsFilletBrep::topology_splitVec::remove1provenremove(j)inside if j < geom.ref_eus.len()
317crates/solidcore/src/blend/fillet_geom/p3.rsFilletBrep::topology_splitVec::remove2provenremove(i)i is position() in the same Vec
318crates/solidcore/src/blend/fillet_geom/p4.rsFilletBrep::make_face_brep_resolvedVec::remove1provenremove(m)curves_3d.get(m) succeeded just above (an error otherwise)
319crates/solidcore/src/blend/fillet_geom/p4.rsFilletBrep::make_face_brep_resolvedVec::remove2openremove(m)
320crates/solidcore/src/blend/fillet_geom/p4.rsFilletBrep::make_face_brep_resolvedVec::remove3openremove(m)
321crates/solidcore/src/blend/fillet_geom/p4.rsFilletBrep::make_face_brep_resolvedwith_capacity1provenVec::with_capacity(lists1.curves_3d.len())lists1.curves_3d.len(), an in-memory Vec
322crates/solidcore/src/blend/fillet_geom/p4.rsFilletBrep::make_face_brep_resolvedwith_capacity2provenVec::with_capacity(lists1.uv_curves.len())lists1.uv_curves.len(), an in-memory Vec
323crates/solidcore/src/blend/fillet_geom/p5.rsFilletBrep::calc_edge_on_extended_edge_with_surfaceswith_capacity1provenVec::with_capacity(2)constant capacity
324crates/solidcore/src/blend/fillet_geom/p5.rsFilletBrep::create_end_curve_resolvedwith_capacity1provenVec::with_capacity(2)constant capacity
325crates/solidcore/src/blend/fillet_geom/p5.rsedge_insertVec::insert1proveninsert(0, eu)index 0 is never past the end
326crates/solidcore/src/blend/fillet_geom/p6.rsFilletBrep::trim_original_surfaces_resolvedstep_by1provenstep_by(2)constant non-zero step
327crates/solidcore/src/blend/fillet_geom/p6.rsFilletBrep::trim_original_surfaces_resolvedstep_by2provenstep_by(2)constant non-zero step
328crates/solidcore/src/blend/fillet_geom/p6.rsjoin_two_fillet_verts_by_curves_resolvedVec::remove1provenremove(ii)inside while ii < copy_side_eus.len(); every ii += 1 before it continues
329crates/solidcore/src/blend/fillet_geom/p6.rsmove_tspVec::insert1proveninsert(to, tsp_temp)to < the length before the remove, so to <= the length after it
330crates/solidcore/src/blend/fillet_geom/p6.rsmove_tspVec::remove1provenremove(from)from < tsect_pnts.len(): the function returns above when it is not
331crates/solidcore/src/blend/fillet_geom/p6.rsmove_tspswap1provenswap(from, to)from and to < tsect_pnts.len(): the function returns above when not
332crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rssurface_plane_curvewindows1provenwindows(2)constant non-zero size
333crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rssurface_plane_curvewindows2provenwindows(2)constant non-zero size
334crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rssurface_plane_curvewith_capacity1openVec::with_capacity(st.len())
335crates/solidcore/src/blend/fillet_geom/surface_plane_curve.rssurface_plane_curvewith_capacity2openVec::with_capacity(st.len() + off.len())
336crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rstangent_end_ribVec::insert1openinsert(at, 0.5 * (t0 + t1))
337crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rstangent_end_ribVec::insert2openinsert(at, alpha)
338crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rstangent_end_ribVec::insert3openinsert(at, uv)
339crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rstangent_end_ribVec::insert4openinsert(at, exact)
340crates/solidcore/src/blend/fillet_geom/tangent_end_rib.rstangent_end_ribint-rem1provenorder % 2constant non-zero divisor
341crates/solidcore/src/blend/fillet_intersector.rsFilletIntersector::flush_curveVec::insert1openinsert(j + 1, split_knot)
342crates/solidcore/src/blend/fillet_intersector.rsFilletIntersector::flush_curveVec::insert2openinsert(j + 1, mid_pnt)
343crates/solidcore/src/blend/fillet_intersector.rsFilletIntersector::flush_curvewindows1provenwindows(2)constant non-zero size
344crates/solidcore/src/blend/fillet_outline.rsdecidewith_capacity1provenVec::with_capacity(2)constant capacity
345crates/solidcore/src/blend/fillet_outline.rsdecidewith_capacity2provenVec::with_capacity(2)constant capacity
346crates/solidcore/src/blend/fillet_outline.rsdecidewith_capacity3provenVec::with_capacity(2)constant capacity
347crates/solidcore/src/blend/fillet_outline.rsoutline_supportswith_capacity1provenVec::with_capacity(2)constant capacity
348crates/solidcore/src/blend/fillet_overflow.rsextendVec::insert1proveninsert(0, (q, rev))index 0 is never past the end
349crates/solidcore/src/blend/fillet_overflow.rstwice_areaint-rem1proven(p + 1) % uv.len()inside uv.iter().enumerate(), so uv.len() > 0
350crates/solidcore/src/blend/fillet_removal.rsrelinkVec::remove1provenremove(at)at is position() in the same Vec
351crates/solidcore/src/blend/fillet_section/certificate.rsgn_certify_spanwindows1provenwindows(2)constant non-zero size
352crates/solidcore/src/blend/fillet_section/definition.rsbern_taylorwindows1provenwindows(2)constant non-zero size
353crates/solidcore/src/blend/fillet_section/definition.rsevaluate_definitionint-rem1proven(memo.next + 1) % STATION_MEMOdivisor is the non-zero constant STATION_MEMO
354crates/solidcore/src/blend/fillet_section/definition_box.rsbern_taylor_overwindows1provenwindows(2)constant non-zero size
355crates/solidcore/src/blend/fillet_section/form.rshermite_points_sidedwindows1provenwindows(2)constant non-zero size
356crates/solidcore/src/blend/fillet_section/form.rshermite_points_sidedwindows2provenwindows(2)constant non-zero size
357crates/solidcore/src/blend/fillet_section/recertify.rspiecesswap1openswap(0, 1)
358crates/solidcore/src/blend/fillet_section/recertify.rspiecesswap2openswap(0, 1)
359crates/solidcore/src/blend/fillet_section/recertify.rsrecertify_in_framewindows1provenwindows(2)constant non-zero size
360crates/solidcore/src/blend/fillet_section/recertify.rsspans_of_definitionwindows1provenwindows(2)constant non-zero size
361crates/solidcore/src/blend/fillet_section/recertify.rssub_curvewindows1provenwindows(2)constant non-zero size
362crates/solidcore/src/blend/fillet_section/section.rsGnSectionFsg::buildwindows1provenwindows(2)constant non-zero size
363crates/solidcore/src/blend/fillet_section/section.rsGnSectionFsg::buildwindows2provenwindows(2)constant non-zero size
364crates/solidcore/src/blend/fillet_section/section.rsGnSectionFsg::certifywindows1provenwindows(2)constant non-zero size
365crates/solidcore/src/blend/fillet_section/section.rsGnSectionFsg::certifywindows2provenwindows(2)constant non-zero size
366crates/solidcore/src/blend/fillet_section/section.rsGnSectionFsg::contact_order_atchunks1provenchunks_exact(2)constant non-zero size
367crates/solidcore/src/blend/fillet_section/section.rsGnSectionFsg::contact_order_atint-rem1provenkk % 2constant non-zero divisor
368crates/solidcore/src/blend/fillet_section/smooth_interior_plan.rsSmoothInteriorPlan::preparewindows1provenwindows(2)constant non-zero size
369crates/solidcore/src/blend/fillet_section/smooth_interior_plan.rsSmoothInteriorPlan::preparewindows2provenwindows(3)constant non-zero size
370crates/solidcore/src/blend/fillet_section/station.rsgn_evaluate_vnchunks1provenchunks_exact(2)constant non-zero size
371crates/solidcore/src/blend/fillet_section/tay.rsgn_area_sumint-rem1proveni % 2constant non-zero divisor
372crates/solidcore/src/blend/fillet_solver/ball_fit.rsball_fits_its_faceswith_capacity1provenVec::with_capacity(2)constant capacity
373crates/solidcore/src/blend/fillet_solver/ball_fit.rsball_fits_its_faceswith_capacity2provenVec::with_capacity(2)constant capacity
374crates/solidcore/src/blend/fillet_solver/p1.rsFilletSolver::set_offsets_dataVec::remove1openremove(pos)
375crates/solidcore/src/blend/fillet_solver/p2.rsFilletSolver::create_cliff_roll_over_side_fgVec::insert1proveninsert(0, new_eu1)index 0 is never past the end
376crates/solidcore/src/blend/fillet_solver/p4.rsc1_collect_pointsVec::insert1proveninsert(0, r)index 0 is never past the end
377crates/solidcore/src/blend/fillet_solver/p4.rsc1_collect_pointsint-div1proventotal_g1_knots / 2constant non-zero divisor
378crates/solidcore/src/blend/fillet_solver/p4.rsc2_clean_endsVec::remove1openremove(1)
379crates/solidcore/src/blend/fillet_solver/p4.rsc2_sort_pointsVec::insert1openinsert(index, t)
380crates/solidcore/src/blend/fillet_solver/p4.rsc2_sort_pointsVec::insert2openinsert(index, r)
381crates/solidcore/src/blend/fillet_solver/p4.rsc2_trace_to_edge_endsVec::insert1proveninsert(0, r)index 0 is never past the end
382crates/solidcore/src/blend/fillet_solver/p4.rsc4_cusp_recoveryVec::insert1proveninsert(0, new_pnt)index 0 is never past the end
383crates/solidcore/src/blend/fillet_solver/p4.rsc4_traceVec::drain1opendrain(..ii)
384crates/solidcore/src/blend/fillet_standard_solver/p2.rsCircularCrossSectionFsg::piece_definitionswindows1provenwindows(2)constant non-zero size
385crates/solidcore/src/blend/fillet_standard_solver/p2.rsCircularCrossSectionFsg::piecewise_surfacewindows1provenwindows(2)constant non-zero size
386crates/solidcore/src/blend/fillet_standard_solver/p2.rsLinearCrossSectionFsg::definition_surfacef64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
387crates/solidcore/src/blend/fillet_standard_solver/p2.rsVariableRadiusFs::re_calc_fillet_geomVec::insert1openinsert(index_of_insert, t)
388crates/solidcore/src/blend/fillet_standard_solver/p2.rsVariableRadiusFs::re_calc_fillet_geomVec::insert2openinsert(index_of_insert, vu)
389crates/solidcore/src/blend/hcr.rs-int-div1provenusize::MAX / 2constant non-zero divisor
390crates/solidcore/src/blend/law_corners.rsLawCornerPieces::classifywindows1provenwindows(2)constant non-zero size
391crates/solidcore/src/blend/law_corners.rssphere_zonewith_capacity1provenVec::with_capacity(9)constant capacity
392crates/solidcore/src/blend/law_corners.rssphere_zonewith_capacity2provenVec::with_capacity(9)constant capacity
393crates/solidcore/src/boolean/merge/p2.rsMergeState::merge_added_bodyVec::remove1provenremove(i)i is position() in the same Vec
394crates/solidcore/src/boolean/merge/p4.rsclassify_edge_facesstep_by1provenstep_by(2)constant non-zero step
395crates/solidcore/src/boolean/topology_intersector/p1.rsTopologyIntersector::face_face_intersectVec::insert1openinsert((jj + 1).min(faces2.len()), new_face)
396crates/solidcore/src/boolean/topology_intersector/p2.rsTopologyIntersector::intersect_topologywith_capacity1provenVec::with_capacity(faces.len())faces.len(), an in-memory slice
397crates/solidcore/src/boolean/topology_intersector/p2.rsteardown_reads_freedVec::remove1provenremove(i)i is position() in the same Vec
398crates/solidcore/src/curve/composite_curve/p1.rsCompositeCurve::approximate_curveVec::drain1provendrain(..)full-range drain(..)
399crates/solidcore/src/curve/composite_curve/p1.rsCompositeCurve::approximate_curvewith_capacity1provenVec::with_capacity(n)n = self.segments.len(), an existing Vec of elements larger than &Curve
400crates/solidcore/src/curve/composite_curve/p1.rsCompositeCurve::approximate_curvewith_capacity2provenVec::with_capacity(approx_segments.len())an existing Vec<Curve>; a Curve holds its BSplineCurve inline
401crates/solidcore/src/curve/composite_curve/p1.rsCompositeCurve::copywith_capacity1provenVec::with_capacity(self.segments.len())n = self.segments.len(), an existing Vec of the same element type
402crates/solidcore/src/curve/composite_curve/p1.rsconvert_to_bspline_curves_indexedwith_capacity1provenVec::with_capacity(curves.len())n = curves.len(), an existing slice of references; usize is no larger
403crates/solidcore/src/curve/composite_curve/p1.rsflush_crvVec::drain1provendrain(..)full-range drain(..)
404crates/solidcore/src/curve/composite_curve/p1.rsinsert_sorted_breaksVec::insert1proveninsert(ii, value)breaks.get(ii) is Some just above, so ii < len()
405crates/solidcore/src/curve/composite_curve/p1.rstrim_first_breakVec::drain1provendrain(..ii)breaks.get(ii) is Some just above, so ii < len()
406crates/solidcore/src/curve/composite_curve/p1.rstrim_first_breakVec::drain2provendrain(..ii)ii < len() by breaks.get(ii), and the insert just above grew it
407crates/solidcore/src/curve/composite_curve/p1.rstrim_first_breakVec::insert1proveninsert(ii, value)breaks.get(ii) is Some just above, so ii < len()
408crates/solidcore/src/curve/composite_curve/p1.rstrim_last_breakVec::insert1proveninsert(ii, value)breaks.get(ii) is Some just above, so ii < len()
409crates/solidcore/src/curve/composite_curve/p2.rsCompositeCurve::create_offsets_of_many_curveswith_capacity1provenVec::with_capacity(curves.len())n = curves.len(), an existing slice of references; bool is smaller
410crates/solidcore/src/curve/composite_curve/p2.rsCompositeCurve::create_offsets_of_many_curveswith_capacity2provenVec::with_capacity(comp.segments.len())n = comp.segments.len(), an existing Vec of segments, each holding a Curve
411crates/solidcore/src/curve/composite_curve/p2.rsCompositeCurve::intersect_and_trim_offsetswindows1provenwindows(2)constant non-zero size
412crates/solidcore/src/curve/composite_curve/p2.rsCompositeCurve::composite_nurbwith_capacity1provenVec::with_capacity(self.segments.len())n = self.segments.len(), segments each holding a Curve, which holds a BSplineCurve inline
413crates/solidcore/src/curve/composite_curve/p2.rsCompositeCurve::composite_nurbwith_capacity2provenVec::with_capacity(self.segments.len())n = self.segments.len(), an existing Vec of segments; bool is smaller
414crates/solidcore/src/curve/crv_in_volume.rsCrvInVolume::compute_breaksVec::insert1proveninsert(jj, class_bndry)returns Err when jj > knots.len()
415crates/solidcore/src/curve/crv_in_volume.rsCrvInVolume::compute_breaksVec::insert2proveninsert(jj.min(mults.len()), 2)index is min(.., mults.len())
416crates/solidcore/src/curve/crv_on_surf.rsCrvOnSurf::knots_with_statusVec::insert1proveninsert(jj, class_bndry)returns Err when jj > knots.len()
417crates/solidcore/src/curve/crv_on_surf.rsCrvOnSurf::knots_with_statusVec::insert2proveninsert(jj.min(mults.len()), 2)index is min(.., mults.len())
418crates/solidcore/src/curve/crv_on_surf.rsCrvOnSurf::knots_with_statuswith_capacity1provenVec::with_capacity(num)num = breaks.len(), an existing Vec<f64>; usize is no larger
419crates/solidcore/src/curve/curve/p1.rsCpGlobalSolver::local_solve_branchwith_capacity1provenVec::with_capacity(6)constant capacity
420crates/solidcore/src/curve/curve/p1.rsCpGlobalSolver::local_solve_branchwith_capacity2provenVec::with_capacity(6)constant capacity
421crates/solidcore/src/curve/curve/p1.rsCurve::approximate_curve_basewindows1provenwindows(2)constant non-zero size
422crates/solidcore/src/curve/curve/p1.rsCurve::approximate_curve_basewith_capacity1provenVec::with_capacity(256 * 4 * 2)constant capacity
423crates/solidcore/src/curve/curve/p1.rsCurve::approximate_curve_basewith_capacity2provenVec::with_capacity(256)constant capacity
424crates/solidcore/src/curve/curve/p1.rsCurve::approximate_curve_basewith_capacity3provenVec::with_capacity(256)constant capacity
425crates/solidcore/src/curve/curve/p1.rsCurve::classify_intersecting_range_solutionint-rem1proven(tgt + 3 - 1) % 3constant non-zero divisor
426crates/solidcore/src/curve/curve/p1.rsCurve::classify_intersecting_range_solutionint-rem2proven(tgt + 3 - 2) % 3constant non-zero divisor
427crates/solidcore/src/curve/curve/p2.rsCurve::null_segmentswindows1provenwindows(2)constant non-zero size
428crates/solidcore/src/curve/curve/p4.rsapproximate_polar_boxint-rem1provenpoint_count % 2constant non-zero divisor
429crates/solidcore/src/curve/curve/p4.rsfix_chain_curves_listVec::insert1proveninsert(loop_start, next_crv)loop_start was chained.len() at the chain's start; chained and origin only grow
430crates/solidcore/src/curve/curve/p4.rsfix_chain_curves_listVec::insert2proveninsert(loop_start, idx)loop_start was chained.len() at the chain's start; chained and origin only grow
431crates/solidcore/src/curve/curve/p4.rsfix_chain_curves_listVec::insert3proveninsert(loop_start, next_crv)loop_start was chained.len() at the chain's start; chained and origin only grow
432crates/solidcore/src/curve/curve/p4.rsfix_chain_curves_listVec::insert4proveninsert(loop_start, idx)loop_start was chained.len() at the chain's start; chained and origin only grow
433crates/solidcore/src/curve/curve/p5.rscrvs_cleanupVec::remove1provenremove(ii)inside while ii < curves.len(), curves unchanged before it
434crates/solidcore/src/curve/curve/p5.rscrvs_cleanupVec::remove2provenremove(ii)guarded by ii < origin.len()
435crates/solidcore/src/curve/curve/p5.rscrvs_cleanupsplit_at1provensplit_at_mut(ii)guarded by ii < curves.len()
436crates/solidcore/src/curve/curve/p5.rsremove_duplicate_curveswith_capacity1provenVec::with_capacity(keep.len())keep.len() <= curves.len() (one push per i), the same element type
437crates/solidcore/src/curve/curve/p6.rsCurve::global_coincidence_checker_intoVec::insert1proveninsert(drops.len() - 1, entry)drops.last() is Some, so drops.len() - 1 < len()
438crates/solidcore/src/curve/curve/p6.rsCurve::global_coincidence_checker_intowith_capacity1provenVec::with_capacity(3)constant capacity
439crates/solidcore/src/curve/curve/p6.rsCurve::global_coincidence_checker_intowith_capacity2provenVec::with_capacity(3)constant capacity
440crates/solidcore/src/curve/curve/p6.rsCurve::global_coincidence_checker_intowith_capacity3provenVec::with_capacity(4)constant capacity
441crates/solidcore/src/curve/curve/p6.rsCurve::simple_coincidence_checkerVec::insert1proveninsert(drops.len() - 1, entry)drops.last() is Some, so drops.len() - 1 < len()
442crates/solidcore/src/curve/curve/p6.rsCurve::simple_coincidence_checkerwith_capacity1provenVec::with_capacity(4)constant capacity
443crates/solidcore/src/curve/curve/p6.rscalculate_bounding_box_baseint-div1provencount / 2constant non-zero divisor
444crates/solidcore/src/curve/curve/p6.rscalculate_bounding_box_baseint-div2provencount / 2constant non-zero divisor
445crates/solidcore/src/curve/curve/p6.rscalculate_bounding_box_baseint-div3proventangents.len() / 2constant non-zero divisor
446crates/solidcore/src/curve/curve/p6.rscalculate_bounding_box_basewith_capacity1provenVec::with_capacity(32)constant capacity
447crates/solidcore/src/curve/curve/p6.rscalculate_bounding_box_basewith_capacity2provenVec::with_capacity(32)constant capacity
448crates/solidcore/src/curve/curve/p7.rsCciGlobalSolver::local_solve_branchwith_capacity1provenVec::with_capacity(10)constant capacity
449crates/solidcore/src/curve/curve/p7.rsCciGlobalSolver::local_solve_branchwith_capacity2provenVec::with_capacity(10)constant capacity
450crates/solidcore/src/curve/curve/p7.rsCurve::global_property_analysis_intof64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
451crates/solidcore/src/curve/curve/p8.rsCurve::cull_ranges_near_pointsVec::insert1proveninsert(at, false)at is min(.., cull.len())
452crates/solidcore/src/curve/curve_cache.rsCurveCache::build_treeint-div1provencurr.len() / 2constant non-zero divisor
453crates/solidcore/src/curve/curve_cache.rsCurveCache::build_treeint-rem1provencurr.len() % 2constant non-zero divisor
454crates/solidcore/src/curve/curve_cache.rsCurveCache::build_treewith_capacity1provenVec::with_capacity(span_count)span_count = self.spans.len(), an existing Vec of BezierSpan, larger than NodeId
455crates/solidcore/src/curve/curve_cache.rsCurveCache::build_treewith_capacity2provenVec::with_capacity(curr.len() / 2 + 1)at most curr.len() (inside while curr.len() > 1), the same element type
456crates/solidcore/src/curve/curve_cache.rscompute_constantswindows1provenwindows(2)constant non-zero size
457crates/solidcore/src/curve/ellipse/p1.rsPolarConversion::read_tablesint-rem1provenii % 5constant non-zero divisor
458crates/solidcore/src/curve/ellipse/p1.rsPolarConversion::read_tablesint-rem2provenn % 5constant non-zero divisor
459crates/solidcore/src/curve/ellipse/p1.rsPolarConversion::read_tablesint-rem3provenii % 5constant non-zero divisor
460crates/solidcore/src/curve/ellipse/p1.rsPolarConversion::read_tablesint-rem4provenn_exact % 5constant non-zero divisor
461crates/solidcore/src/curve/ellipse/p1.rsPolarConversion::write_to_dbint-rem1provenii % 5constant non-zero divisor
462crates/solidcore/src/curve/ellipse/p1.rsPolarConversion::write_to_dbint-rem2provenn % 5constant non-zero divisor
463crates/solidcore/src/curve/ellipse/p2.rsEllipse::drop_point_fastVec::remove1provenremove(0)guarded by solutions.len() > 1
464crates/solidcore/src/curve/ellipse/p2.rsEllipse::eval_stepwith_capacity1provenVec::with_capacity(num_derivs + 1)callers pass num_derivs <= 3: evaluate_step returns Err above 3, step_point passes 0
465crates/solidcore/src/curve/hyperbola.rsHyperbola::evaluate_stepwith_capacity1provenVec::with_capacity(num_derivs + 1)returns Err when num_derivs > 3
466crates/solidcore/src/curve/line.rsLine::intersect_with_ellipseswap1provenswap(0, 1)objects is [_; MAX_TREES], MAX_TREES = 5
467crates/solidcore/src/curve/line.rsLine::intersect_with_ellipseswap2provenswap(0, 1)parameters is [f64; MAX_PARAMS], MAX_PARAMS = 10
468crates/solidcore/src/curve/line.rsLine::intersect_with_ellipseswap3provenswap(0, 1)parameters is [f64; MAX_PARAMS], MAX_PARAMS = 10
469crates/solidcore/src/curve/line.rsLine::make_nurb_ownedcopy_from_slice1provencopy_from_slice(&[min, min, max, max])allocate_nurb_curve(1, 1, 3) makes 4 knots, the slice's length
470crates/solidcore/src/curve/parabola.rsParabola::evaluate_stepwith_capacity1provenVec::with_capacity(num_derivs + 1)returns Err when num_derivs > 3
471crates/solidcore/src/eval/form.rsextent_inwith_capacity1provenVec::with_capacity(EXTENT_POINTS + 1)constant capacity
472crates/solidcore/src/eval/form.rsface_arcsf64::clamp1provenclamp(0.0, n - 1.0)arcs_between requires finite positive span and produces 1 to 4 arcs, so n >= 1 and phi > 0
473crates/solidcore/src/eval/form.rsface_arcsf64::clamp2provenclamp(0.0, phi)arcs_between requires finite positive span and produces 1 to 4 arcs, so n >= 1 and phi > 0
474crates/solidcore/src/eval/form.rsparamf64::clamp1provenclamp(0.0, FRAC_PI_2)bounds are constants 0 and FRAC_PI_2
475crates/solidcore/src/eval/form.rsparamsf64::clamp1provenclamp(q0, end)quarters validates finite angles and returns nonnegative n, so q0 <= end
476crates/solidcore/src/eval/form.rsparamsf64::clamp2provenclamp(q0, end)quarters validates finite angles and returns nonnegative n, so q0 <= end
477crates/solidcore/src/eval/sphere.rscurve_on_sphereint-div1provenb / pdegree calls basis_check, which requires 1 <= p <= 16
478crates/solidcore/src/eval/sphere.rscurve_on_sphereint-rem1proven(n - 1) % pdegree calls basis_check, which requires 1 <= p <= 16
479crates/solidcore/src/eval/sphere.rscutswindows1provenwindows(2)constant non-zero size
480crates/solidcore/src/eval/sphere.rsinsertVec::insert1proveninsert(k + 1, t)k + 1 < knots.len() checked before insertion
481crates/solidcore/src/eval/sphere.rssurface_on_sphereint-div1provenbu / pdegree calls basis_check for both directions, requiring p and q in 1..=16
482crates/solidcore/src/eval/sphere.rssurface_on_sphereint-div2provenbv / qdegree calls basis_check for both directions, requiring p and q in 1..=16
483crates/solidcore/src/eval/sphere.rssurface_on_sphereint-rem1proven(lu - 1) % pdegree calls basis_check for both directions, requiring p and q in 1..=16
484crates/solidcore/src/eval/sphere.rssurface_on_sphereint-rem2proven(lv - 1) % qdegree calls basis_check for both directions, requiring p and q in 1..=16
485crates/solidcore/src/eval/spline.rstrig_derivativeint-rem1provenk % 4constant non-zero divisor
486crates/solidcore/src/eval/surface.rsnurbswith_capacity1openVec::with_capacity(nu * nv)
487crates/solidcore/src/eval/uv.rsDomain::clampf64::clamp1openclamp(a.min(b), a.max(b))
488crates/solidcore/src/eval/uv.rsStarts::ofstep_by1provenstep_by(2)constant non-zero step
489crates/solidcore/src/eval/uv.rsStarts::ofwith_capacity1openVec::with_capacity(us.len() * vs.len())
490crates/solidcore/src/eval/uv.rsclampedwindows1provenwindows(2)constant non-zero size
491crates/solidcore/src/eval/uv.rsstarts_alongwindows1provenwindows(2)constant non-zero size
492crates/solidcore/src/eval/uv.rswrap_intof64::clamp1openclamp(a, b)
493crates/solidcore/src/geom/a_object.rsreverse_knotsint-div1provenm / 2constant non-zero divisor
494crates/solidcore/src/geom/assert_array.rsAssertArray::remove_atVec::remove1provenremove(index)returns None when index >= reports.len()
495crates/solidcore/src/geom/attribute.rsAttributeStore::remove_attributeVec::remove1provenremove(pos)pos is position() in the same Vec
496crates/solidcore/src/geom/attribute.rsAttributeStore::remove_userVec::remove1provenremove(pos)pos is position() in the same users Vec
497crates/solidcore/src/geom/geom_utility/p1.rsadd_sortedVec::insert1proveninsert(found_idx, value)found_idx is position() or len() of sorted_values; indices insertion guarded by found_idx < indices.len()
498crates/solidcore/src/geom/geom_utility/p1.rsadd_sortedVec::insert2proveninsert(found_idx, idx)found_idx is position() or len() of sorted_values; indices insertion guarded by found_idx < indices.len()
499crates/solidcore/src/geom/geom_utility/p1.rssegment_point_distancef64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
500crates/solidcore/src/geom/geom_utility/p1.rsshell_sort_double_arrayint-div1provendiv_ceil(2)divisor is a nonzero constant
501crates/solidcore/src/geom/geom_utility/p1.rsshell_sort_double_arrayswap1provenswap(ii, ii + d)both indices checked by get() on the same values slice
502crates/solidcore/src/geom/geom_utility/p2.rsinverse_4x4int-rem1proven(r + c) % 2constant non-zero divisor
503crates/solidcore/src/geom/geom_utility/p2.rssegment_segment_closest_pointf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
504crates/solidcore/src/geom/geom_utility/p2.rssegment_segment_closest_pointf64::clamp2provenclamp(0.0, 1.0)constant bounds, min <= max
505crates/solidcore/src/geom/geom_utility/p2.rssegment_segment_intersectf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
506crates/solidcore/src/geom/geom_utility/p2.rssegment_segment_intersectwith_capacity1provenVec::with_capacity(2)constant capacity
507crates/solidcore/src/geom/geom_utility/p2.rssphere_circle_sphere_circle_intersectint-rem1provenii % 2constant non-zero divisor
508crates/solidcore/src/geom/geom_utility/p2.rstriangle_point_distancef64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
509crates/solidcore/src/geom/geom_utility/p2.rstriangle_point_distancef64::clamp2provenclamp(0.0, 1.0)constant bounds, min <= max
510crates/solidcore/src/geom/grid.rsGrid::voxel_addressf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
511crates/solidcore/src/geom/grid.rsGrid::voxel_addressf64::clamp2provenclamp(0.0, 1.0)constant bounds, min <= max
512crates/solidcore/src/geom/grid.rsGrid::voxel_addressf64::clamp3provenclamp(0.0, 1.0)constant bounds, min <= max
513crates/solidcore/src/geom/grid.rsinsertion_sortVec::insert1proveninsert(insert_at, elem)step_3ddda starts with empty parallel lists and only insertion_sort grows them together; insert_at <= min_distances.len()
514crates/solidcore/src/geom/grid.rsinsertion_sortVec::insert2proveninsert(insert_at, t_enter)step_3ddda starts with empty parallel lists and only insertion_sort grows them together; insert_at <= min_distances.len()
515crates/solidcore/src/geom/grid.rsinsertion_sortVec::insert3proveninsert(insert_at, t_exit)step_3ddda starts with empty parallel lists and only insertion_sort grows them together; insert_at <= min_distances.len()
516crates/solidcore/src/geom/hash_table.rsObjsInVoxels::map_voxel_index_to_indicesint-div1provenindex / xyxy != 0 checked; xy = x_cnt wrapping_mul y_cnt implies x_cnt != 0
517crates/solidcore/src/geom/hash_table.rsObjsInVoxels::map_voxel_index_to_indicesint-div2provenindex.wrapping_sub(iz.wrapping_mul(xy)) / self.x_cntxy != 0 checked; xy = x_cnt wrapping_mul y_cnt implies x_cnt != 0
518crates/solidcore/src/geom/local_solve1d.rsIterQueue1d::is_oscillatingint-rem1proven(i as u64) % stepreturns false unless step == 2
519crates/solidcore/src/geom/matrix.rsMatrix::make_identitystep_by1provenstep_by(step)rows == cols checked and square storage bounds rows, so rows + 1 is nonzero
520crates/solidcore/src/geom/matrix.rssort_eigen_systemswap1provenswap(i, j_min)i and j_min index d; n equals both matrix dimensions and offset() validates matrix indices
521crates/solidcore/src/geom/matrix.rssort_eigen_systemswap2provenswap(a, b)i and j_min index d; n equals both matrix dimensions and offset() validates matrix indices
522crates/solidcore/src/geom/point_set.rsPointSet3d::set_up_centroidint-div1provensize / BLOCK_SIZEdivisor is the non-zero constant BLOCK_SIZE
523crates/solidcore/src/geom/point_set.rsPointSet3d::set_up_centroidint-rem1provensize % BLOCK_SIZEdivisor is the non-zero constant BLOCK_SIZE
524crates/solidcore/src/geom/polar_box.rsPolarBox::are_disjointf64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
525crates/solidcore/src/geom/pseudo_box.rsPseudoBox::distance_to_pointwith_capacity1provenVec::with_capacity(6)constant capacity
526crates/solidcore/src/geom/solution_array.rsSolutionArray::insert_atVec::split_off1provensplit_off(index)inside index < data.len() branch
527crates/solidcore/src/geom/solution_array.rsSolutionArray::swapswap1provenswap(index1, index2)returns Err if either index >= data.len()
528crates/solidcore/src/heal/face_props.rsFaceProps::set_props_stage3_innerint-rem1proventotal % 2constant non-zero divisor
529crates/solidcore/src/heal/face_props.rsLoopProps::set_propsint-div1proven(this_touches.len() as u64) / 2constant non-zero divisor
530crates/solidcore/src/heal/face_props.rsLoopProps::set_propsint-div2proven(this_touches.len() as u64) / 2constant non-zero divisor
531crates/solidcore/src/heal/face_props.rsLoopProps::set_propsint-rem1provenself.seam_crossing_cnt_u % 2constant non-zero divisor
532crates/solidcore/src/heal/face_props.rsLoopProps::set_propsint-rem2provenself.seam_crossing_cnt_v % 2constant non-zero divisor
533crates/solidcore/src/heal/gap.rsadd_unique_get_ordered_indexVec::insert1proveninsert(0, value)index 0 is never past the end
534crates/solidcore/src/heal/gap.rsadd_unique_get_ordered_indexVec::insert2proveninsert(ii, value)ii ranges over 1..array.len()
535crates/solidcore/src/heal/gap.rssamples_per_intervalint-div1provenwant / intervalssample_normalized_values checks end_u > start_u and, for surfaces, end_v > start_v before both calls
536crates/solidcore/src/heal/gap.rssamples_per_intervalint-rem1provenper % 2constant non-zero divisor
537crates/solidcore/src/heal/gap.rstrimmed_span_valueswindows1provenwindows(2)constant non-zero size
538crates/solidcore/src/heal/heal_data/p1.rsbrep_regions_from_infiniterotate1provenrotate_left(at)at is position() in the same regions Vec
539crates/solidcore/src/heal/heal_data/p2.rsHealData::cache_coin_verticescopy_from_slice1provencopy_from_slice(&hist)hist is [u64; GAPSIZE_BUCKET_CNT] and destination length checked equal to GAPSIZE_BUCKET_CNT
540crates/solidcore/src/heal/heal_data/p2.rsPairProbArray::removeVec::drain1provendrain(ii..ii + 2)both get(ii) and get(ii + 1) pass through flag()?, which returns Err for None
541crates/solidcore/src/heal/heal_data/p2.rsPairProbArray::removeVec::remove1provenremove(ii)guarded by ii < prob_array.len() of the same Vec
542crates/solidcore/src/heal/heal_data/p2.rsremove_firstVec::remove1provenremove(i)i is position() in the same Vec
543crates/solidcore/src/heal/heal_data/p3.rsHealData::fix_coin_verticesint-div1provenpairs.len() / 2constant non-zero divisor
544crates/solidcore/src/heal/stitch/p1.rssort_by_paramVec::insert1proveninsert(0, ii)index 0 is never past the end
545crates/solidcore/src/heal/stitch/p1.rssort_by_paramVec::insert2proveninsert(lmax, ii)returns Err when lmax > sorted.len()
546crates/solidcore/src/heal/stitch/p1.rssort_by_paramint-div1proven(lmin + lmax) / 2constant non-zero divisor
547crates/solidcore/src/intersect/adv_surface_intersector.rsAdvSurfaceIntersector::local_solvecopy_from_slice1provencopy_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
548crates/solidcore/src/intersect/adv_surface_intersector.rsAdvSurfaceIntersector::local_solvecopy_from_slice2provencopy_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
549crates/solidcore/src/intersect/adv_surface_intersector.rsAdvSurfaceIntersector::local_solvecopy_from_slice3provencopy_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
550crates/solidcore/src/intersect/adv_surface_intersector.rsAdvSurfaceIntersector::local_solvecopy_from_slice4provencopy_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
551crates/solidcore/src/intersect/adv_surface_intersector/tangent_contacts.rstp_solve4split_at1provensplit_at_mut(k + 1)k in 0..4, so k + 1 <= length of four-row array
552crates/solidcore/src/intersect/adv_surface_intersector/tangent_contacts.rstp_solve4swap1provenswap(k, i_piv)k and i_piv in 0..4 on fixed four-element arrays
553crates/solidcore/src/intersect/adv_surface_intersector/tangent_contacts.rstp_solve4swap2provenswap(k, i_piv)k and i_piv in 0..4 on fixed four-element arrays
554crates/solidcore/src/intersect/curve_class/p1.rsCurveClassification::remove_atVec::remove1provenremove(index)guarded by index < size = data.len()
555crates/solidcore/src/intersect/curve_class/p1.rsget_winding_countchunks1provenchunks_exact(2)constant non-zero size
556crates/solidcore/src/intersect/curve_class/p1.rsget_winding_countint-rem1proventouches.len() % 2constant non-zero divisor
557crates/solidcore/src/intersect/curve_class/p1.rsremove_non_crossingsint-rem1provencount % 2constant non-zero divisor
558crates/solidcore/src/intersect/curve_class/p4.rsCurveClassification::classify_touchint-rem1proven(next + c.ivl_cnt - 1) % c.ivl_cntpreceding checked_rem(c.ivl_cnt)? returns Err for zero divisor
559crates/solidcore/src/intersect/curve_class/p4.rsCurveClassification::classify_touchwith_capacity1provenVec::with_capacity(vertexuses.len())n = vertexuses.len(), an existing Vec of the same vertexuse handle type
560crates/solidcore/src/intersect/curve_class/p4.rsCurveClassification::crossings_from_touchesint-div1provenget_connected_touches(Some(lp), &crossings).len() as u64 / 2constant non-zero divisor
561crates/solidcore/src/intersect/curve_class/p8.rsCurveClassification::natural_boundswindows1provenwindows(2)constant non-zero size
562crates/solidcore/src/intersect/surface_drop_curve.rsSurfaceDropCurve::boundary_start_pointsVec::remove1openremove(kk)
563crates/solidcore/src/intersect/surface_drop_curve.rsSurfaceDropCurve::step_sizeint-div1proven(l_min + l_max) / 2constant non-zero divisor
564crates/solidcore/src/intersect/surface_drop_curve.rsSurfaceDropCurve::trace_curve_2_inVec::remove1openremove(0)
565crates/solidcore/src/intersect/surface_drop_curve.rsadd_breakVec::insert1openinsert(insertion, new_break)
566crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rsjoinf64::clamp1provenclamp(ivl.min(), ivl.max())u_interval/v_interval order the bounds and NaN bounds return Err before clamp
567crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rsjoinstep_by1provenstep_by(degree)returns Ok(None) when degree == 0
568crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rspieceswindows1provenwindows(2)constant non-zero size
569crates/solidcore/src/intersect/surface_drop_lib/cylinder_section.rspieceswindows2provenwindows(2)constant non-zero size
570crates/solidcore/src/intersect/surface_drop_lib/p1.rsSurface::drop_iso_curveVec::insert1proveninsert(0, interval.min())index 0 is never past the end
571crates/solidcore/src/intersect/surface_drop_lib/p1.rsSurface::drop_iso_curveVec::remove1provenremove(0)first().is_some_and() requires a nonempty knots Vec
572crates/solidcore/src/intersect/surface_drop_lib/p1.rsfix_boundary_curvesint-div1provennum_pts / 3constant non-zero divisor
573crates/solidcore/src/intersect/surface_drop_lib/p3.rsSurface::drop_curve_base_inVec::drain1provendrain(..)full drain(..) has no invalid bounds
574crates/solidcore/src/intersect/surface_drop_lib/p3.rsSurface::drop_curve_base_inint-div1provenstack.len() / 5constant non-zero divisor
575crates/solidcore/src/intersect/surface_intersector/p1.rsSurfaceIntersector::add_start_pointVec::insert1proveninsert(0, id)index 0 is never past the end
576crates/solidcore/src/intersect/surface_intersector/p2.rsSurfaceIntersector::flush_curvewindows1provenwindows(2)constant non-zero size
577crates/solidcore/src/intersect/surface_intersector/p2.rsSurfaceIntersector::walk_gap_sideint-rem1proven((tgt + 3) - 1) % 3constant non-zero divisor
578crates/solidcore/src/intersect/surface_intersector/p2.rsSurfaceIntersector::walk_gap_sideint-rem2proven((tgt + 3) - 2) % 3constant non-zero divisor
579crates/solidcore/src/intersect/surface_intersector/p3.rsSurfaceIntersector::add_boundary_curvewith_capacity1provenVec::with_capacity(work.edge_crossings.len())n = edge_crossings.len(), an existing Vec of the same crossing point type
580crates/solidcore/src/intersect/surface_intersector/p3.rsSurfaceIntersector::find_boundary_start_points_bodyint-rem1provenii % 2constant non-zero divisor
581crates/solidcore/src/intersect/surface_intersector/p3.rsSurfaceIntersector::find_boundary_start_points_bodyint-rem2provenl_crv % 2constant non-zero divisor
582crates/solidcore/src/intersect/surface_intersector/p3.rsunlinkVec::remove1provenremove(pos)pos is position() in the same Vec
583crates/solidcore/src/intersect/surface_intersector/p4.rsdo_law_intersection_withVec::insert1proveninsert(ip, new_tsect)inside while ip < curve_pnts.len(), with no removal before insertion
584crates/solidcore/src/intersect/surface_intersector/p5.rsAdvSurfaceIntersector::do_intersection_inVec::remove1provenremove(ii)ii < curves_3d.len() in loop and all four companion lengths checked before removal
585crates/solidcore/src/intersect/surface_intersector/p5.rsAdvSurfaceIntersector::do_intersection_inVec::remove2provenremove(ii)ii < curves_3d.len() in loop and all four companion lengths checked before removal
586crates/solidcore/src/intersect/surface_intersector/p5.rsAdvSurfaceIntersector::do_intersection_inVec::remove3provenremove(ii)ii < curves_3d.len() in loop and all four companion lengths checked before removal
587crates/solidcore/src/intersect/surface_intersector/p5.rsAdvSurfaceIntersector::do_intersection_inVec::remove4provenremove(ii)ii < curves_3d.len() in loop and all four companion lengths checked before removal
588crates/solidcore/src/intersect/surface_intersector/p5.rsAdvSurfaceIntersector::do_intersection_inVec::remove5provenremove(ii)ii < curves_3d.len() in loop and all four companion lengths checked before removal
589crates/solidcore/src/intersect/surface_intersector/singular_splits.rssplit_curves_at_singular_pointswindows1provenwindows(2)constant non-zero size
590crates/solidcore/src/intersect/surface_intersector/tangent_curves.rscoversint-div1provenrc.len() / 40constant non-zero divisor
591crates/solidcore/src/intersect/surface_intersector/tangent_curves.rscovers_crossingint-div1provenrc.len() / 40constant non-zero divisor
592crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsfind_tangent_curveswindows1provenwindows(2)constant non-zero size
593crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsfind_tangent_curveswith_capacity1provenVec::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
594crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsfind_tangent_curveswith_capacity2provenVec::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
595crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsfind_tangent_curveswith_capacity3provenVec::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
596crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsremove_curveVec::remove1provenremove(ii)guarded by ii < len() of the same Vec
597crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsremove_curveVec::remove2provenremove(ii)guarded by ii < len() of the same Vec
598crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsremove_curveVec::remove3provenremove(ii)guarded by ii < len() of the same Vec
599crates/solidcore/src/intersect/surface_intersector/tangent_curves.rsremove_curveVec::remove4provenremove(ii)guarded by ii < len() of the same Vec
600crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rsTangentTracer::probeint-div1provenPROBE_DIRS / 2constant non-zero divisor
601crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rsTangentTracer::residualwith_capacity1provenVec::with_capacity(10)constant capacity
602crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rsTangentTracer::residualwith_capacity2provenVec::with_capacity(10)constant capacity
603crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rsTangentTracer::solve4swap1provenswap(c, p)c and pivot p in 0..4 on fixed four-row array
604crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rsTangentTracer::stepint-div1proveni / 2constant non-zero divisor
605crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rsTangentTracer::stepint-rem1proveni % 2constant non-zero divisor
606crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rstc_near_polywindows1provenwindows(2)constant non-zero size
607crates/solidcore/src/intersect/surface_intersector/tangent_tracer.rstc_poly_distwindows1provenwindows(2)constant non-zero size
608crates/solidcore/src/intersect/surface_tracer.rsfind_boundary_start_points_baseVec::swap_remove1provenswap_remove(side)side in 0..=1 and uv_curves.len() == 2 checked
609crates/solidcore/src/intersect/surface_tracer.rsflush_curvewindows1provenwindows(2)constant non-zero size
610crates/solidcore/src/intersect/topology_solver/p2.rsswap_curve_surface_parametersrotate1provenrotate_left(1)get_mut(..3)? yields a slice of length 3, so rotation by 1 fits
611crates/solidcore/src/intersect/topology_solver/p2.rsswap_curve_surface_parametersrotate2provenrotate_left(1)get_mut(..3)? yields a slice of length 3, so rotation by 1 fits
612crates/solidcore/src/mass/integrator.rsOdeIntegrator::integratecopy_from_slice1opencopy_from_slice(&y)
613crates/solidcore/src/mass/integrator/properties.rsboundary_propertieswindows1provenwindows(2)constant non-zero size
614crates/solidcore/src/nurbs/b_spline_curve/analysis.rspairswindows1provenwindows(2)constant non-zero size
615crates/solidcore/src/nurbs/b_spline_curve/p1.rsBSplineCurve::control_polygonwith_capacity1openVec::with_capacity(pw.len())
616crates/solidcore/src/nurbs/b_spline_curve/p1.rsBSplineCurve::from_datacopy_from_slice1opencopy_from_slice(src_u)
617crates/solidcore/src/nurbs/b_spline_curve/p1.rsBSplineCurve::from_datacopy_from_slice2opencopy_from_slice(src_pw)
618crates/solidcore/src/nurbs/b_spline_curve/p2.rsBSplineCurve::calculate_bounding_box_ontoint-div1provennum_points / smp_cntnum_points >= 1 is checked; smp_cnt = num_points.min(7)
619crates/solidcore/src/nurbs/b_spline_curve/p2.rsBSplineCurve::joinVec::insert1proveninsert(1, mid)seg_pts.get(1) succeeds before insertion; inserting at 1 only grows it
620crates/solidcore/src/nurbs/b_spline_curve/p2.rsBSplineCurve::joinVec::insert2proveninsert(1, mid1)seg_pts.get(1) succeeds before insertion; inserting at 1 only grows it
621crates/solidcore/src/nurbs/b_spline_curve/p2.rsBSplineCurve::joinVec::insert3proveninsert(2, mid2)seg_pts.get(1) succeeds before insertion; inserting at 1 only grows it
622crates/solidcore/src/nurbs/b_spline_curve/p2.rsBSplineCurve::read_from_dbint-div1provenu64::MAX / (4 * 32)constant non-zero divisor
623crates/solidcore/src/nurbs/b_spline_curve/p3.rsBSplineCurve::assert_no_periodic_jumpwindows1provenwindows(2)constant non-zero size
624crates/solidcore/src/nurbs/b_spline_curve/p3.rsBSplineCurve::assert_valid_withwith_capacity1openVec::with_capacity(solutions.len())
625crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::create_interpolating_curve_with_paramswindows1provenwindows(2)constant non-zero size
626crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::dampen_knot_spacingVec::insert1openinsert(i + 1, split_knot)
627crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::deform_to_end_point_targetsint-div1provenDISP_INSIDE_KNT_CNT / 2constant non-zero divisor
628crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::deform_to_end_point_targetsint-div2provenDISP_INSIDE_KNT_CNT / 2constant non-zero divisor
629crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::deform_to_end_point_targetsint-div3opendiv_ceil(2)
630crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::deform_to_end_point_targetsint-div4opendiv_ceil(2)
631crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::deform_to_end_point_targetsint-rem1provendegree % 2constant non-zero divisor
632crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::deform_to_end_point_targetswith_capacity1openVec::with_capacity(curr_reg2_cnt)
633crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::make_curves_compatiblewith_capacity1openVec::with_capacity(curves.len())
634crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::set_intersection_curve_through_pointcopy_from_slice1opencopy_from_slice(&pu)
635crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::set_intersection_curve_through_pointcopy_from_slice2opencopy_from_slice(&pu)
636crates/solidcore/src/nurbs/b_spline_curve_n_lib.rsBSplineCurve::synchronize_knots_of_curveswith_capacity1openVec::with_capacity(curves.len())
637crates/solidcore/src/nurbs/b_spline_surface/p1.rsBSplineSurface::from_datacopy_from_slice1provencopy_from_slice(src_u)allocate_nurb_surface sizes knots to r + 1 and s + 1; checked source slices match
638crates/solidcore/src/nurbs/b_spline_surface/p1.rsBSplineSurface::from_datacopy_from_slice2provencopy_from_slice(src_v)allocate_nurb_surface sizes knots to r + 1 and s + 1; checked source slices match
639crates/solidcore/src/nurbs/b_spline_surface/p1.rsBSplineSurface::read_from_dbint-div1provenu64::MAX / (4 * 32)constant non-zero divisor
640crates/solidcore/src/nurbs/b_spline_surface/p1.rsBSplineSurface::read_from_dbint-div2provenmax_cpoints / (n as u64 + 1)n >= p >= 1 is checked; n is an i64, so n as u64 + 1 cannot wrap
641crates/solidcore/src/nurbs/b_spline_surface/p2.rsBSplineSurface::analytic_or_exact_copywith_capacity1provenVec::with_capacity(49)constant capacity
642crates/solidcore/src/nurbs/b_spline_surface/p2.rsBSplineSurface::create_sphere_from_arcsint-rem1proven(gen_curve_index + 1) % total_curvesreturns Err unless total_curves == 3
643crates/solidcore/src/nurbs/b_spline_surface/p2.rsBSplineSurface::create_sphere_from_arcsint-rem2proven((gen_curve_index + total_curves) - 1) % total_curvesreturns Err unless total_curves == 3
644crates/solidcore/src/nurbs/b_spline_surface/p2.rstransposeint-div1provena.len() / num_rowsreturns before division when num_rows < 1
645crates/solidcore/src/nurbs/b_spline_surface_n_lib/approx.rsBSplineSurface::approximate_pointschunks1provenchunks(cols.max(1))cols.max(1) is nonzero
646crates/solidcore/src/nurbs/b_spline_surface_n_lib/p1.rsBSplineSurface::create_n_sided_patchwith_capacity1openVec::with_capacity(bdry_crvs.len())
647crates/solidcore/src/nurbs/b_spline_surface_n_lib/p1.rsBSplineSurface::create_n_sided_patchwith_capacity2openVec::with_capacity(bdry_crvs.len())
648crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsBSplineSurface::evaluate_implint-div1provenk / nv1highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1
649crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsBSplineSurface::evaluate_implint-div2provenk / nv1highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1
650crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsBSplineSurface::evaluate_implint-rem1provenk % nv1highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1
651crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsBSplineSurface::evaluate_implint-rem2provenk % nv1highest_v_deriv <= MAX_DERIVATIVE (4) is checked; nv1 = highest_v_deriv + 1
652crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsapproximate_tangent_fieldwindows1provenwindows(2)constant non-zero size
653crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsapproximate_tangent_fieldwith_capacity1provenVec::with_capacity(256 * 4 * 2)constant capacity
654crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsapproximate_tangent_fieldwith_capacity2provenVec::with_capacity(256)constant capacity
655crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsapproximate_tangent_fieldwith_capacity3provenVec::with_capacity(256)constant capacity
656crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rscorner_blend_4int-rem1provenii % 2constant non-zero divisor
657crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rscorner_blend_4with_capacity1provenVec::with_capacity(4)constant capacity
658crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rscorner_blend_4with_capacity2provenVec::with_capacity(4)constant capacity
659crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rscorner_blend_nwith_capacity1provenVec::with_capacity(cnt)cnt = boundaries.len(), an existing Vec of the same BSplineCurve elements
660crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsproject_coons_side_rowswith_capacity1provenVec::with_capacity(2)constant capacity
661crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsproject_coons_side_rowswith_capacity2provenVec::with_capacity(2)constant capacity
662crates/solidcore/src/nurbs/b_spline_surface_n_lib/p2.rsrefine_to_spanswindows1provenwindows(2)constant non-zero size
663crates/solidcore/src/nurbs/basis_basic.rscompatible_knot_vectors_to_tolwith_capacity1provenVec::with_capacity(knots.len())knots is an existing slice of Vec<f64>; new i64 elements are no larger
664crates/solidcore/src/nurbs/bezier.rsband_matrix_intoint-div1provenn / 2constant non-zero divisor
665crates/solidcore/src/nurbs/bezier.rsreduce_degreeint-rem1provenp % 2constant non-zero divisor
666crates/solidcore/src/nurbs/bezier.rsreduce_midint-div1provenp.saturating_sub(1) / 2constant non-zero divisor
667crates/solidcore/src/nurbs/crv_adv/p1.rscmax_derivsint-rem1provenii % 2constant non-zero divisor
668crates/solidcore/src/nurbs/crv_adv/p1.rscmax_new_cptsint-rem1provenjj % 2constant non-zero divisor
669crates/solidcore/src/nurbs/crv_approx.rsapprox_nurbs_with_non_rat_crvwith_capacity1provenVec::with_capacity(bez.len())bez is an existing Vec<Curve>; new i64 elements are no larger
670crates/solidcore/src/nurbs/crv_approx.rscalc_num_cpts_to_approx_arcf64::clamp1provenclamp(1.0e-6, 1.0)constant bounds, min <= max
671crates/solidcore/src/nurbs/crv_common.rsquadratic_arc_min_arcsint-div1provencd.n / 2constant non-zero divisor
672crates/solidcore/src/nurbs/crv_common.rsquartic_arc_tolint-div1provenn / 4constant non-zero divisor
673crates/solidcore/src/nurbs/crv_fit/p3.rsapprox_closed_conditionsint-div1provenn / 2constant non-zero divisor
674crates/solidcore/src/nurbs/crv_fit/p3.rsinterp_end_derivscopy_from_slice1provencopy_from_slice(&pw)returns Err when the lengths differ
675crates/solidcore/src/nurbs/crv_fit/p3.rsinterp_end_derivscopy_from_slice2provencopy_from_slice(&uk)returns Err when dk.len() != uk.len()
676crates/solidcore/src/nurbs/crv_geom.rsCurve::approx_with_polylineint-div1proven(p + 1) / 2constant non-zero divisor
677crates/solidcore/src/nurbs/crv_nurb.rsCurve::reverseint-div1provenn / 2constant non-zero divisor
678crates/solidcore/src/nurbs/crv_nurb.rspascalint-div1provenk / 2constant non-zero divisor
679crates/solidcore/src/nurbs/crv_offset.rsCurve::offset_pt_sampling_cancellablewith_capacity1provenVec::with_capacity(bez.len())bez is an existing Vec<Curve>; new isize elements are no larger
680crates/solidcore/src/nurbs/crv_offset.rsoffset_sample_boundOrd::clamp1provenclamp(MAX_OFFSET_SAMPLES, MAX_OFFSET_SAMPLES_ANY)constant bounds 16384 <= 1 << 17
681crates/solidcore/src/nurbs/crv_tool/p1.rsCurve::elevate_degreeint-div1proven(oldr + 2) / 2constant non-zero divisor
682crates/solidcore/src/nurbs/crv_tool/p1.rsCurve::elevate_degreeint-div2proven(r + 1) / 2constant non-zero divisor
683crates/solidcore/src/nurbs/crv_tool/p1.rsCurve::remove_knotint-div1proven(2 * spn - mlt - p) / 2constant non-zero divisor
684crates/solidcore/src/nurbs/crv_tool/p1.rsCurve::remove_knotint-rem1provenl % 2constant non-zero divisor
685crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::reduce_degree_onceint-div1proven(oldr + 2) / 2constant non-zero divisor
686crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::reduce_degree_onceint-div2proven(2 * p - k + 1) / 2constant non-zero divisor
687crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::reduce_degree_onceint-rem1provenk % 2constant non-zero divisor
688crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::remove_knots_constrainedint-div1proven(p + s + 1) / 2constant non-zero divisor
689crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::remove_knots_constrainedint-div2proven(p + s) / 2constant non-zero divisor
690crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::remove_knots_constrainedint-div3proven(2 * r - s - p) / 2constant non-zero divisor
691crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::remove_knots_constrainedint-rem1proven(p + s) % 2constant non-zero divisor
692crates/solidcore/src/nurbs/crv_tool/p2.rsCurve::remove_knots_constrainedint-rem2proven(p + s) % 2constant non-zero divisor
693crates/solidcore/src/nurbs/fit_arrays.rsmat_slotint-div1provenk / colsreturns Err when cols == 0 or k < 0, excluding both zero and MIN / -1
694crates/solidcore/src/nurbs/fit_arrays.rsmat_slotint-rem1provenk % colsreturns Err when cols == 0 or k < 0, excluding both zero and MIN / -1
695crates/solidcore/src/nurbs/funcs_adv.rsmultiplyint-div1proven(rem + 2) / 2constant non-zero divisor
696crates/solidcore/src/nurbs/funcs_adv.rsmultiplyint-div2proven(tt + 1) / 2constant non-zero divisor
697crates/solidcore/src/nurbs/funcs_basic.rsCurveFunction::derivswith_capacity1provenVec::with_capacity(nd.derivs.len())nd.derivs is an existing Vec<Vec<f64>>; new f64 elements are no larger
698crates/solidcore/src/nurbs/funcs_basic.rsSurfaceFunction::evalwith_capacity1provenVec::with_capacity(nu.values.len())nu.values is an existing Vec<f64>, the same element type
699crates/solidcore/src/nurbs/geom.rsdist_cpolygonwindows1provenwindows(2)constant non-zero size
700crates/solidcore/src/nurbs/geom.rsdist_polygonwindows1provenwindows(2)constant non-zero size
701crates/solidcore/src/nurbs/geom.rsvectors_anglef64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
702crates/solidcore/src/nurbs/geom.rsvectors_cos_anglef64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
703crates/solidcore/src/nurbs/iges.rsvalidatewindows1provenwindows(2)constant non-zero size
704crates/solidcore/src/nurbs/knots.rsKnotVector::find_spanint-div1proven(low + high) / 2constant non-zero divisor
705crates/solidcore/src/nurbs/knots.rsKnotVector::find_spanint-div2proven(low + high) / 2constant non-zero divisor
706crates/solidcore/src/nurbs/knots.rsKnotVector::find_spanint-div3proven(low + high) / 2constant non-zero divisor
707crates/solidcore/src/nurbs/knots.rsKnotVector::span_countwindows1provenwindows(2)constant non-zero size
708crates/solidcore/src/nurbs/math.rsRealMatrix::for_back_cpointsint-div1provenself.bw / 2constant non-zero divisor
709crates/solidcore/src/nurbs/math.rsRealMatrix::for_back_pointsint-div1provenself.bw / 2constant non-zero divisor
710crates/solidcore/src/nurbs/math.rsRealMatrix::lu_decomposeint-div1provenbw / 2constant non-zero divisor
711crates/solidcore/src/nurbs/math.rsRealMatrix::multiply_cpointsint-div1provenbw / 2constant non-zero divisor
712crates/solidcore/src/nurbs/math.rsRealMatrix::multiply_pointsint-div1provenbw / 2constant non-zero divisor
713crates/solidcore/src/nurbs/math.rsRealMatrix::right_for_backint-div1provenself.bw / 2constant non-zero divisor
714crates/solidcore/src/nurbs/math.rsRealMatrix::transpose_fillint-div1provenbw / 2constant non-zero divisor
715crates/solidcore/src/nurbs/math.rspascal_triangleint-div1provenk / 2constant non-zero divisor
716crates/solidcore/src/nurbs/nurbs_crv.rscopy_intocopy_from_slice1provencopy_from_slice(src)destination is checked get_mut(..src.len()), so lengths match
717crates/solidcore/src/nurbs/nurbs_crv.rscrv_remove_knotsint-div1proven(p + s + 1) / 2constant non-zero divisor
718crates/solidcore/src/nurbs/nurbs_crv.rscrv_remove_knotsint-div2proven(p + s) / 2constant non-zero divisor
719crates/solidcore/src/nurbs/nurbs_crv.rscrv_remove_knotsint-div3proven(2 * r - s - p) / 2constant non-zero divisor
720crates/solidcore/src/nurbs/nurbs_crv.rscrv_remove_knotsint-rem1proven(p + s) % 2constant non-zero divisor
721crates/solidcore/src/nurbs/nurbs_crv.rscrv_remove_knotsint-rem2proven(p + s) % 2constant non-zero divisor
722crates/solidcore/src/nurbs/nurbs_crv.rscrv_remove_knotsint-rem3proven(p + s) % 2constant non-zero divisor
723crates/solidcore/src/nurbs/nurbs_srf.rscompute_net_constantsint-div1provenm / iiii is in 1..=m or 1..=n, so ii > 0
724crates/solidcore/src/nurbs/nurbs_srf.rscompute_net_constantsint-div2provenn / iiii is in 1..=m or 1..=n, so ii > 0
725crates/solidcore/src/nurbs/nurbs_srf.rsturnf64::clamp1provenclamp(-1.0, 1.0)constant bounds, min <= max
726crates/solidcore/src/nurbs/srf_adv/p1.rscreate_skin_spinesplit_at1opensplit_at_mut(k)
727crates/solidcore/src/nurbs/srf_adv/p1.rscreate_skin_spinewith_capacity1openVec::with_capacity(k + 1)
728crates/solidcore/src/nurbs/srf_adv/p1.rscreate_skin_spinewith_capacity2openVec::with_capacity(nc + 1)
729crates/solidcore/src/nurbs/srf_adv/p1.rscross_boundary_derivs_vector_fieldwith_capacity1openVec::with_capacity(pw.len())
730crates/solidcore/src/nurbs/srf_adv/p1.rscross_boundary_derivs_vector_fieldwith_capacity2openVec::with_capacity(pw.len())
731crates/solidcore/src/nurbs/srf_adv/p3.rscmax_pointsint-rem1provenjj % 2constant non-zero divisor
732crates/solidcore/src/nurbs/srf_adv/p3.rscmax_pointsint-rem2provenjj % 2constant non-zero divisor
733crates/solidcore/src/nurbs/srf_adv/p3.rscmax_pointsint-rem3provenjj % 2constant non-zero divisor
734crates/solidcore/src/nurbs/srf_adv/p3.rscmax_pointsint-rem4provenjj % 2constant non-zero divisor
735crates/solidcore/src/nurbs/srf_adv/p3.rscreate_skin_srfint-div1provenki / 2constant non-zero divisor
736crates/solidcore/src/nurbs/srf_adv/p3.rscreate_skin_srfint-div2proven(ki + 1) / 2constant non-zero divisor
737crates/solidcore/src/nurbs/srf_adv/p3.rscreate_skin_srfsplit_at1provensplit_at_mut(k)k = cur.len().checked_sub(1), so k < cur.len()
738crates/solidcore/src/nurbs/srf_adv/p3.rscreate_swung_srfwith_capacity1provenVec::with_capacity(pw.len())pw is an existing CPoint slice; new Vec<CPoint> headers are no larger
739crates/solidcore/src/nurbs/srf_adv/p3.rscreate_swung_srfwith_capacity2provenVec::with_capacity(tw.len())tw is an existing CPoint slice; new CPoint elements are no larger
740crates/solidcore/src/nurbs/srf_adv/p3.rscreate_trans_sweep_srfwith_capacity1provenVec::with_capacity(sw.len())sw is an existing CPoint slice; new Vec<CPoint> headers are no larger
741crates/solidcore/src/nurbs/srf_adv/p3.rscreate_trans_sweep_srfwith_capacity2provenVec::with_capacity(tw.len())tw is an existing CPoint slice; new CPoint elements are no larger
742crates/solidcore/src/nurbs/srf_adv/p3.rsshetty_whitewith_capacity1provenVec::with_capacity(4)constant capacity
743crates/solidcore/src/nurbs/srf_adv/p4.rscombine_coonswith_capacity1provenVec::with_capacity(idx.n + 1)n + 1 <= stored net.len(), the same Vec<CPoint> element type
744crates/solidcore/src/nurbs/srf_adv/p4.rscombine_coonswith_capacity2provenVec::with_capacity(idx.m + 1)m + 1 <= stored row.len(), the same CPoint element type
745crates/solidcore/src/nurbs/srf_adv/p4.rscreate_skin_srf_boundary_derivsswap1provenswap(0, 1)returns Err when net.len() < 2
746crates/solidcore/src/nurbs/srf_adv/p4.rscreate_skin_srf_boundary_derivsswap2provenswap(0, 1)returns Err when row.len() < 2
747crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holecopy_from_slice1opencopy_from_slice(kv)
748crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holecopy_from_slice2opencopy_from_slice(ku)
749crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity1openVec::with_capacity(k + 1)
750crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity2openVec::with_capacity(k + 1)
751crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity3openVec::with_capacity(k + 1)
752crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity4openVec::with_capacity(k + 1)
753crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity5openVec::with_capacity(k + 1)
754crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity6openVec::with_capacity(k + 1)
755crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity7openVec::with_capacity(k + 1)
756crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity8openVec::with_capacity(k + 1)
757crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity9openVec::with_capacity(k + 1)
758crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity10openVec::with_capacity(k + 1)
759crates/solidcore/src/nurbs/srf_adv/p6.rsfill_n_sided_holewith_capacity11openVec::with_capacity(k + 1)
760crates/solidcore/src/nurbs/srf_adv/p6.rsframe_subsamplingint-div1provenMAXPTS / 2constant non-zero divisor
761crates/solidcore/src/nurbs/srf_adv/p6.rsframe_subsamplingint-div2provenMAXPTS / 5constant non-zero divisor
762crates/solidcore/src/nurbs/srf_adv/p6.rsframe_subsamplingint-div3provenMAXPTS / 10constant non-zero divisor
763crates/solidcore/src/nurbs/srf_adv/p6.rsframe_subsamplingint-div4provenMAXPTS / 20constant non-zero divisor
764crates/solidcore/src/nurbs/srf_adv/p6.rssweep_scaleint-div1openmm / kk
765crates/solidcore/src/nurbs/srf_adv/p6.rssweep_scaleint-div2provenn_placed / 2constant non-zero divisor
766crates/solidcore/src/nurbs/srf_adv/p6.rssweep_scalewith_capacity1openVec::with_capacity(segs.len())
767crates/solidcore/src/nurbs/srf_adv/p6.rssweep_scalewith_capacity2openVec::with_capacity(kk * (nn + 1) + 1)
768crates/solidcore/src/nurbs/srf_adv/p6.rssweep_scalewith_capacity3openVec::with_capacity(np + 1)
769crates/solidcore/src/nurbs/srf_adv/p6.rssweep_scalewith_capacity4openVec::with_capacity(np + 1)
770crates/solidcore/src/nurbs/srf_common.rscyl_conewith_capacity1provenVec::with_capacity(n + 1)n + 1 <= cur.cpts().len(), an existing CPoint slice of the same element type
771crates/solidcore/src/nurbs/srf_common.rscyl_conewith_capacity2provenVec::with_capacity(n + 1)n + 1 <= cur.cpts().len(), an existing CPoint slice of the same element type
772crates/solidcore/src/nurbs/srf_common.rsrevolved_srfwith_capacity1provenVec::with_capacity(m + 1)m + 1 <= cur.cpts().len(), an existing CPoint slice of the same element type
773crates/solidcore/src/nurbs/srf_common.rsruled_srfwith_capacity1provenVec::with_capacity(n + 1)n + 1 <= cur_b.cpts().len(), an existing CPoint slice of the same element type
774crates/solidcore/src/nurbs/srf_common.rsruled_srfwith_capacity2provenVec::with_capacity(n + 1)n + 1 <= cur_b.cpts().len(), an existing CPoint slice of the same element type
775crates/solidcore/src/nurbs/srf_nurb.rsSurface::euclid_netwith_capacity1provenVec::with_capacity(n + 1)n + 1 <= stored net.len(); new Vec<Vec3> and Vec<f64> row headers match existing Vec<CPoint> headers
776crates/solidcore/src/nurbs/srf_nurb.rsSurface::euclid_netwith_capacity2provenVec::with_capacity(n + 1)n + 1 <= stored net.len(); new Vec<Vec3> and Vec<f64> row headers match existing Vec<CPoint> headers
777crates/solidcore/src/nurbs/srf_nurb.rsSurface::reverseint-div1provenn / 2constant non-zero divisor
778crates/solidcore/src/nurbs/srf_nurb.rsSurface::reverseint-div2provenm / 2constant non-zero divisor
779crates/solidcore/src/nurbs/srf_offset.rsSurface::offset_generalf64::clamp1provenclamp(1.0, SLM)constant finite bounds 1.0 <= SLM (1000.0)
780crates/solidcore/src/nurbs/srf_offset.rsSurface::offset_generalwith_capacity1provenVec::with_capacity(ku)ku = bez.len(), an existing Vec of elements no smaller than isize
781crates/solidcore/src/nurbs/srf_offset.rsSurface::offset_generalwith_capacity2provenVec::with_capacity(lv)lv = bez.first().len(), an existing Vec of elements no smaller than isize
782crates/solidcore/src/nurbs/srf_offset.rsSurface::offset_refinedwindows1provenwindows(2)constant non-zero size
783crates/solidcore/src/nurbs/srf_offset.rsSurface::offset_refinedwindows2provenwindows(2)constant non-zero size
784crates/solidcore/src/nurbs/srf_offset.rsrefine_parameterswindows1provenwindows(2)constant non-zero size
785crates/solidcore/src/nurbs/srf_tool/p2.rselevate_rowsint-div1proven(oldr + 2) / 2constant non-zero divisor
786crates/solidcore/src/nurbs/srf_tool/p2.rselevate_rowsint-div2proven(r + 1) / 2constant non-zero divisor
787crates/solidcore/src/nurbs/srf_tool/p2.rsremove_conditional_rowsint-div1proven(2 * spn - mlt - deg) / 2constant non-zero divisor
788crates/solidcore/src/nurbs/srf_tool/p2.rsremove_conditional_rowsint-rem1provenl % 2constant non-zero divisor
789crates/solidcore/src/nurbs/srf_tool/p3.rsRemoveAll::stepint-div1proven(deg + sd + 1) / 2constant non-zero divisor
790crates/solidcore/src/nurbs/srf_tool/p3.rsRemoveAll::stepint-div2proven(deg + sd) / 2constant non-zero divisor
791crates/solidcore/src/nurbs/srf_tool/p3.rsRemoveAll::stepint-div3proven(2 * rd - sd - deg) / 2constant non-zero divisor
792crates/solidcore/src/nurbs/srf_tool/p3.rsRemoveAll::stepint-rem1proven(deg + sd) % 2constant non-zero divisor
793crates/solidcore/src/offset/construction/bernstein.rsBernstein2::deriv_uwindows1provenwindows(2)constant non-zero size
794crates/solidcore/src/offset/construction/bernstein.rsBernstein2::deriv_vwindows1provenwindows(2)constant non-zero size
795crates/solidcore/src/offset/construction/bernstein.rsBernstein2::mulchunks1provenchunks_mut(dv + 1)dv <= MAX_DEGREE (96), checked in new() and kept by every constructor, so dv + 1 is 1..=97
796crates/solidcore/src/offset/construction/bernstein.rsBernstein2::rowschunks1provenchunks(self.dv + 1)dv <= MAX_DEGREE (96), checked in new() and kept by every constructor, so dv + 1 is 1..=97
797crates/solidcore/src/offset/construction/bernstein.rsBernstein2::split_vwith_capacity1provenVec::with_capacity(self.c.len())the length of a Vec already in memory
798crates/solidcore/src/offset/construction/bernstein.rsBernstein2::split_vwith_capacity2provenVec::with_capacity(self.c.len())the length of a Vec already in memory
799crates/solidcore/src/offset/construction/bernstein.rsBernstein2::transposestep_by1provenstep_by(self.dv + 1)dv <= MAX_DEGREE (96), checked in new() and kept by every constructor, so dv + 1 is 1..=97
800crates/solidcore/src/offset/construction/bernstein.rsBernstein2::transposewith_capacity1provenVec::with_capacity(self.c.len())the length of a Vec already in memory
801crates/solidcore/src/offset/construction/bernstein.rsBinomials::newwindows1provenwindows(2)constant non-zero size
802crates/solidcore/src/offset/construction/bernstein.rseval_1dwindows1provenwindows(2)constant non-zero size
803crates/solidcore/src/offset/construction/bernstein.rssplit_1dwindows1provenwindows(2)constant non-zero size
804crates/solidcore/src/offset/construction/bernstein.rssplit_1dwith_capacity1provenVec::with_capacity(c.len())the length of a Vec already in memory
805crates/solidcore/src/offset/construction/bernstein.rssplit_1dwith_capacity2provenVec::with_capacity(c.len())the length of a Vec already in memory
806crates/solidcore/src/offset/construction/sheets.rsgrevillewindows1provenwindows(DEGREE + 2)constant non-zero size (DEGREE is a const)
807crates/solidcore/src/offset/construction/sheets.rsleast_radiusf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
808crates/solidcore/src/offset/construction/sheets.rsleast_radiusf64::clamp2provenclamp(0.0, 1.0)constant bounds, min <= max
809crates/solidcore/src/offset/construction/sheets.rslocalf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
810crates/solidcore/src/offset/construction/sheets.rslocalf64::clamp2provenclamp(0.0, 1.0)constant bounds, min <= max
811crates/solidcore/src/offset/construction/sheets.rsspan_ofwindows1provenwindows(2)constant non-zero size
812crates/solidcore/src/offset/offset_executive/p1.rssort_edgeusesswap1openswap(i - 1, i)
813crates/solidcore/src/offset/offset_executive/p2.rsapi_shell_brep_fullwith_capacity1openVec::with_capacity(faces.len())
814crates/solidcore/src/offset/offset_executive/step_gaps.rsOffsetExecutive::close_loop_gaps_inint-rem1open(kk + 1) % num
815crates/solidcore/src/offset/offset_executive/step_gaps.rsOffsetExecutive::split_corner_verticesint-rem1open(kk + 1) % num
816crates/solidcore/src/offset/offset_faces.rsOffsetFacesExecutive::join_across_closed_wallsVec::remove1provenremove(at)at comes from position() over the same Vec just above
817crates/solidcore/src/offset/offset_geometry_creation.rsOffsetGeometryCreation::create_step_wallwith_capacity1provenVec::with_capacity(2)constant capacity
818crates/solidcore/src/offset/offset_geometry_creation.rsOffsetGeometryCreation::vertex_offset_with_backendint-rem1open(j + 1) % curves.len()
819crates/solidcore/src/offset/offset_geometry_creation.rsOffsetGeometryCreation::vertex_offset_with_backendint-rem2proven(kk + 1) % 3constant non-zero divisor
820crates/solidcore/src/offset/offset_geometry_creation.rsOffsetGeometryCreation::vertex_offset_with_backendint-rem3proven(other + 1) % 3constant non-zero divisor
821crates/solidcore/src/primitive/api_curve_ops.rscreate_curve_interp_pointswindows1provenwindows(2)constant non-zero size
822crates/solidcore/src/primitive/api_curves.rscreate_curvewith_capacity1provenVec::with_capacity(num_knots)num_knots < points.len(), an in-memory slice
823crates/solidcore/src/primitive/api_curves.rscreate_curvewith_capacity2provenVec::with_capacity(num_knots)num_knots < points.len(), an in-memory slice
824crates/solidcore/src/primitive/api_curves.rscreate_curve_approx_pointsint-div1provenpoints.len() / 2constant non-zero divisor
825crates/solidcore/src/primitive/api_curves.rscreate_curve_approx_pointsint-div2provenpoints.len() / 4constant non-zero divisor
826crates/solidcore/src/primitive/api_curves.rscreate_helixOrd::clamp1provenclamp(1024, 20000)constant bounds, min <= max
827crates/solidcore/src/primitive/api_curves.rssegmentsint-rem1proven(ii + 1) % points.len()inside iteration over points, so len() > 0
828crates/solidcore/src/primitive/api_curves.rssegmentswith_capacity1provenVec::with_capacity(points.len())points.len() is an in-memory slice length
829crates/solidcore/src/primitive/api_primitives.rscreate_pyramidint-rem1proven(ii + 1) % 4constant non-zero divisor
830crates/solidcore/src/primitive/api_primitives.rscreate_pyramidint-rem2proven(ii + 1) % 4constant non-zero divisor
831crates/solidcore/src/primitive/primitive_creation/model.rsPrimitiveModel::unlock_markVec::remove1provenremove(at)at is rposition() in the same Vec
832crates/solidcore/src/primitive/primitive_creation/p1/boolean.rsfinish_withstep_by1provenstep_by(2)constant non-zero step
833crates/solidcore/src/primitive/primitive_creation/p1/boolean.rsfinish_withstep_by2provenstep_by(2)constant non-zero step
834crates/solidcore/src/primitive/primitive_creation/p2/access.rsPrimitiveCreationAccess::boolean_treeswith_capacity1provenVec::with_capacity(breps.len())breps.len() is an in-memory slice length
835crates/solidcore/src/primitive/primitive_creation/p2/planar_path.rsPrimitiveCreation::create_sweep_along_planar_path_ownedwith_capacity1provenVec::with_capacity(paths.len())paths.len() is an in-memory slice length
836crates/solidcore/src/primitive/primitive_creation/p2/planar_path.rsPrimitiveCreation::create_sweep_along_planar_path_ownedwith_capacity2provenVec::with_capacity(count)count is new_breps.len(), an in-memory Vec length
837crates/solidcore/src/primitive/primitive_creation/p2/taper.rstaperVec::split_off1provensplit_off(start.min(rest.len()))start.min(rest.len()) is at most rest.len()
838crates/solidcore/src/primitive/primitive_creation/p2/taper.rstaperwith_capacity1provenVec::with_capacity(composite.segments().len())composite.segments().len() is an in-memory slice length
839crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rscrossingwith_capacity1provenVec::with_capacity(2)constant capacity
840crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rscurvature_keeping_wallsint-rem1proven(i + count - 1) % countinside for i in 0..count, so count > 0
841crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rscurvature_keeping_wallsint-rem2proven(i + 1) % countinside for i in 0..count, so count > 0
842crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rscurvature_keeping_wallsint-rem3proven(i + 1) % countinside for i in 0..count, so count > 0
843crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rshalf_quadratic_rootswith_capacity1provenVec::with_capacity(2)constant capacity
844crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rshas_cornerint-rem1proven(i + count - 1) % countinside for i in 0..count, so count > 0
845crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rsseam_pcurvewindows1provenwindows(2)constant non-zero size
846crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rswalls_closing_at_apexesint-rem1proven(i + count - 1) % countinside for i in 0..count, so count > 0
847crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rswalls_closing_at_apexesint-rem2proven(i + 1) % countinside for i in 0..count, so count > 0
848crates/solidcore/src/primitive/primitive_creation/p2/taper_walls.rswith_tangent_planesint-rem1proven(i + count - 1) % countinside for i in 0..count, so count > 0
849crates/solidcore/src/primitive/primitive_creation/p3/sweeps.rssplit_curves_on_axiswith_capacity1provenVec::with_capacity(middle.len() + 1)middle.len() + 1 <= at.len() + 1, an in-memory Vec length
850crates/solidcore/src/query/api_queries.rsedge_piece_pointswindows1provenwindows(2)constant non-zero size
851crates/solidcore/src/query/face/p3.rsfind_and_classify_loop_bisector_cachedint-div1provensample_cnt / 2constant non-zero divisor
852crates/solidcore/src/query/face/p3.rsfind_and_classify_loop_bisector_cachedint-rem1provenin_loop.len() % 2constant non-zero divisor
853crates/solidcore/src/query/face/p3.rsfind_and_classify_loop_bisector_cachedint-rem2proven(jj + smp_inc) % sample_cntinside for jj in 0..sample_cnt, so sample_cnt > 0
854crates/solidcore/src/query/face/p4.rsclassify_loops_cachedint-div1proventhis_touches.len() / 2constant non-zero divisor
855crates/solidcore/src/query/face/p4.rsclassify_loops_cachedint-rem1provenout.ordered_no_area_indices.len() % 2constant non-zero divisor
856crates/solidcore/src/query/face/p4.rsclassify_loops_cachedint-rem2provenstack_cnt % 2constant non-zero divisor
857crates/solidcore/src/query/face/p4.rsclassify_loops_cachedint-rem3proven(j1 + 2) % done_sizeinc_indx.filter requires done_size != 0 before the loop
858crates/solidcore/src/query/face/p4.rsclassify_loops_cachedstep_by1provenstep_by(2)constant non-zero step
859crates/solidcore/src/query/face/p4.rsis_oddint-rem1provenn % 2constant non-zero divisor
860crates/solidcore/src/query/face/p4.rsset_classify_loop_ios_sizeVec::split_off1provensplit_off(size)size <= old + slack.len() in this branch and all contains both lists
861crates/solidcore/src/query/loop.rsWindingHull::ofwindows1provenwindows(2)constant non-zero size
862crates/solidcore/src/query/loop.rscontains_uv_point_with_topologyf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
863crates/solidcore/src/query/poly.rsPolyBrep::cpoly_remove_poly_faceVec::remove1provenremove(i)i is position() in members; fallback found checked against members.len()
864crates/solidcore/src/query/poly.rsPolyBrep::cpoly_remove_poly_faceVec::remove2provenremove(found)i is position() in members; fallback found checked against members.len()
865crates/solidcore/src/query/poly.rsPolyBrep::face_normalint-rem1proven(ii + 1) % totalinside total > 3 branch
866crates/solidcore/src/query/poly.rsPolyBrep::face_normalint-rem2proven(ii + 1) % totalinside total > 3 branch
867crates/solidcore/src/query/poly.rsPolyBrep::face_normalint-rem3proven(ii + 2) % totalinside total > 3 branch
868crates/solidcore/src/query/poly.rsPolyBrep::link_radialsint-rem1proven(i + 1) % ninside edges.iter().enumerate(), so n = edges.len() > 0
869crates/solidcore/src/query/poly.rsPolyBrep::link_radialsint-rem2proven(i + n - 1) % ninside edges.iter().enumerate(), so n = edges.len() > 0
870crates/solidcore/src/query/tess.rsTessSrfCache::implant_uv_segmentVec::insert1proveninsert(0, TessHandle::PolyEdge(segment))index 0 is never past the end
871crates/solidcore/src/surface/cone/p2.rsellipse_trim_intervalsint-rem1proven(ii + 1) % cntcnt >= 2: the function returns above when it is less
872crates/solidcore/src/surface/cone/p2.rsellipse_trim_intervalsint-rem2proven(ii + 1) % cntcnt >= 2: the function returns above when it is less
873crates/solidcore/src/surface/cone/p2.rsellipse_trim_intervalsint-rem3proven(ii + cnt - 1) % cntcnt >= 2: the function returns above when it is less
874crates/solidcore/src/surface/cone/p2.rsellipse_trim_intervalswith_capacity1provenVec::with_capacity(6)constant capacity
875crates/solidcore/src/surface/cone/p2.rsellipse_trim_intervalswith_capacity2provenVec::with_capacity(cnt)cnt = xsect_angle.len(), an in-memory Vec
876crates/solidcore/src/surface/cone/p3.rsappend_boundary_intersectionsVec::remove1provenremove(j)j is from enumerate() over the same Vec, with no intervening mutation
877crates/solidcore/src/surface/cone/p3.rsappend_boundary_intersectionsVec::remove2provenremove(j)a Vec checked above to curves_3d's length; each removal takes one from all five
878crates/solidcore/src/surface/cone/p3.rsappend_boundary_intersectionsVec::remove3provenremove(j)a Vec checked above to curves_3d's length; each removal takes one from all five
879crates/solidcore/src/surface/cone/p3.rsappend_boundary_intersectionsVec::remove4provenremove(j)a Vec checked above to curves_3d's length; each removal takes one from all five
880crates/solidcore/src/surface/cone/p3.rsappend_boundary_intersectionsVec::remove5provenremove(j)a Vec checked above to curves_3d's length; each removal takes one from all five
881crates/solidcore/src/surface/extend/ball.rscertify_circleint-div1provenn / 2constant non-zero divisor
882crates/solidcore/src/surface/extend/ball.rscertify_circleint-div2provenn / 2constant non-zero divisor
883crates/solidcore/src/surface/implicit.rslies_on_canalf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
884crates/solidcore/src/surface/implicit.rslies_on_canalwindows1provenwindows(2)constant non-zero size
885crates/solidcore/src/surface/implicit.rssub_segmentwindows1provenwindows(2)constant non-zero size
886crates/solidcore/src/surface/offset_surface.rsAsItselfDir::joinVec::insert1proveninsert(0, t)index 0 is never past the end
887crates/solidcore/src/surface/offset_surface.rsAsItselfDir::joinVec::insert2proveninsert(0, deg)index 0 is never past the end
888crates/solidcore/src/surface/offset_surface.rsOffsetSurface::calculate_bounding_box_withint-div1provencrn / 4constant non-zero divisor
889crates/solidcore/src/surface/offset_surface.rsOffsetSurface::calculate_bounding_box_withint-div2provencrn / 2constant non-zero divisor
890crates/solidcore/src/surface/offset_surface.rsOffsetSurface::calculate_bounding_box_withint-rem1proven(crn / 4) % 2constant non-zero divisor
891crates/solidcore/src/surface/offset_surface.rsOffsetSurface::calculate_bounding_box_withint-rem2proven(crn / 2) % 2constant non-zero divisor
892crates/solidcore/src/surface/offset_surface.rsOffsetSurface::calculate_bounding_box_withint-rem3provencrn % 2constant non-zero divisor
893crates/solidcore/src/surface/offset_surface.rsOffsetSurface::evaluate_withchunks1openchunks(hv + 1)
894crates/solidcore/src/surface/plane/p1.rsPlane::coincidence_checkwith_capacity1provenVec::with_capacity(4)constant capacity
895crates/solidcore/src/surface/plane/p1.rsPlane::coincidence_checkwith_capacity2provenVec::with_capacity(4)constant capacity
896crates/solidcore/src/surface/plane/p1.rsPlane::plane_overlapwindows1provenwindows(2)constant non-zero size
897crates/solidcore/src/surface/plane/p1.rsPlane::plane_overlapwith_capacity1provenVec::with_capacity(5)constant capacity
898crates/solidcore/src/surface/plane/p1.rsPlane::surface_overlapwith_capacity1openVec::with_capacity(bdrys_3d1.len())
899crates/solidcore/src/surface/plane/p1.rstransposeint-div1opena.len() / num_rows
900crates/solidcore/src/surface/plane/p2.rsPlane::make_new_plane_ellipseint-rem1proven((ii + count) - 1) % countinside for ii in 0..count, so count > 0
901crates/solidcore/src/surface/plane/p2.rsPlane::make_new_plane_ellipseint-rem2proven(ii + 1) % countinside for ii in 0..count, so count > 0
902crates/solidcore/src/surface/procedural_blend/convert.rscorner_from_recordwith_capacity1openVec::with_capacity(r.rounds.len())
903crates/solidcore/src/surface/procedural_blend/convert.rsnon_decreasingwindows1provenwindows(2)constant non-zero size
904crates/solidcore/src/surface/procedural_sweep.rsProceduralSweep::createwindows1provenwindows(2)constant non-zero size
905crates/solidcore/src/surface/procedural_sweep.rsProceduralSweep::largest_change_per_spanwindows1provenwindows(2)constant non-zero size
906crates/solidcore/src/surface/procedural_sweep.rsProceduralSweep::turn_atf64::clamp1openclamp(first, last)
907crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::largest_slope_overwindows1provenwindows(2)constant non-zero size
908crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::largest_slope_overwindows2provenwindows(2)constant non-zero size
909crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::newwindows1provenwindows(2)constant non-zero size
910crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::offsetwindows1provenwindows(2)constant non-zero size
911crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::offsetwindows2provenwindows(2)constant non-zero size
912crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::slope_overwindows1provenwindows(2)constant non-zero size
913crates/solidcore/src/surface/procedural_sweep.rsRadialLaw::slope_overwindows2provenwindows(2)constant non-zero size
914crates/solidcore/src/surface/procedural_sweep.rsalternatingint-rem1provenn % 2constant non-zero divisor
915crates/solidcore/src/surface/procedural_sweep.rsoffset_error_boundVec::swap_remove1openswap_remove(at)
916crates/solidcore/src/surface/procedural_sweep/path.rsNetView::readwith_capacity1openVec::with_capacity(along)
917crates/solidcore/src/surface/procedural_sweep/path.rsNetView::readwith_capacity2openVec::with_capacity(sections)
918crates/solidcore/src/surface/procedural_sweep/path.rsNetView::readwith_capacity3openVec::with_capacity(along)
919crates/solidcore/src/surface/procedural_sweep/path.rsPathMotion::certifywindows1provenwindows(2)constant non-zero size
920crates/solidcore/src/surface/procedural_sweep/path.rsPathMotion::chord_parameterswith_capacity1openVec::with_capacity(n)
921crates/solidcore/src/surface/procedural_sweep/path.rsPathMotion::exact_netwith_capacity1openVec::with_capacity(count * prof.control_points.len())
922crates/solidcore/src/surface/procedural_sweep/path.rsPathMotion::exact_netwith_capacity2openVec::with_capacity(points.capacity())
923crates/solidcore/src/surface/procedural_sweep/path.rsSpline::derivativewindows1provenwindows(2)constant non-zero size
924crates/solidcore/src/surface/procedural_sweep/path.rsSpline::newwindows1provenwindows(2)constant non-zero size
925crates/solidcore/src/surface/procedural_sweep/path.rsclassifywith_capacity1provenVec::with_capacity(12)constant capacity
926crates/solidcore/src/surface/procedural_sweep/path.rsspans_ofwindows1provenwindows(2)constant non-zero size
927crates/solidcore/src/surface/srf_in_volume.rsSrfInVolume::evaluatechunks1provenchunks(ovs)ovs = hv + 1 >= 1, with hv <= MAX_DERIVS checked above
928crates/solidcore/src/surface/step_window.rsBezier::piecesf64::clamp1provenclamp(1.0, 8.0)constant bounds, min <= max
929crates/solidcore/src/surface/step_window.rsderivativewindows1provenwindows(2)constant non-zero size
930crates/solidcore/src/surface/step_window.rspush_everyf64::clamp1provenclamp(0.0, 8.0)constant bounds, min <= max
931crates/solidcore/src/surface/step_window.rssplitwith_capacity1provenVec::with_capacity(n)n = c.len(), an in-memory slice
932crates/solidcore/src/surface/step_window.rssplitwith_capacity2provenVec::with_capacity(n)n = c.len(), an in-memory slice
933crates/solidcore/src/surface/step_window.rsunwindint-rem1proven(start + step) % ninside for step in 0..n, so n > 0
934crates/solidcore/src/surface/step_window.rsunwindint-rem2proven(start + step + 1) % ninside for step in 0..n, so n > 0
935crates/solidcore/src/surface/surf_of_extrusion/p1.rsSurfOfExtrusion::drop_point_fastf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
936crates/solidcore/src/surface/surf_of_extrusion/p2.rsSurfOfExtrusion::intersect_with_plane_onVec::remove1provenremove(0)inside if !...is_empty() on the same Vec
937crates/solidcore/src/surface/surf_of_extrusion/p2.rsSurfOfExtrusion::intersect_with_plane_onVec::remove2provenremove(0)inside if !...is_empty() on the same Vec
938crates/solidcore/src/surface/surf_of_extrusion/p2.rsSurfOfExtrusion::intersect_with_plane_onVec::swap_remove1provenswap_remove(0)lines is not empty: the function returns above when it is
939crates/solidcore/src/surface/surf_of_revolution/p1.rstest_for_iso_circleswindows1provenwindows(2)constant non-zero size
940crates/solidcore/src/surface/surface/approximate.rsSurface::approximate_surface_implchunks1provenchunks_exact_mut(4)constant non-zero size
941crates/solidcore/src/surface/surface/approximate.rsSurface::approximate_surface_implwindows1provenwindows(2)constant non-zero size
942crates/solidcore/src/surface/surface/approximate.rsSurface::approximate_surface_implwindows2provenwindows(2)constant non-zero size
943crates/solidcore/src/surface/surface/approximate.rsSurface::approximate_surface_implwindows3provenwindows(2)constant non-zero size
944crates/solidcore/src/surface/surface/approximate.rsSurface::approximate_surface_implwindows4provenwindows(2)constant non-zero size
945crates/solidcore/src/surface/surface/assert_valid.rsgrid_non_monotonicint-div1provensize / row_sizerow_size > 0: zero returns an error above
946crates/solidcore/src/surface/surface/p1.rsStepSurface::knots_ofwith_capacity1provenVec::with_capacity(2)constant capacity
947crates/solidcore/src/surface/surface/p1.rsSurface::evaluate_stepchunks1openchunks(highest_v_deriv + 1)
948crates/solidcore/src/surface/surface/p1.rsSurface::evaluate_stepchunks2openchunks(highest_v_deriv + 1)
949crates/solidcore/src/surface/surface/p1.rsSurface::evaluate_stepchunks3openchunks(highest_v_deriv + 1)
950crates/solidcore/src/surface/surface/p1.rsSurface::evaluate_stepchunks4openchunks(highest_v_deriv + 1)
951crates/solidcore/src/surface/surface/p1.rsSurface::evaluate_stepchunks5openchunks(highest_v_deriv + 1)
952crates/solidcore/src/surface/surface/p1.rsfind_uv_curve_ivl_in_domainwindows1provenwindows(2)constant non-zero size
953crates/solidcore/src/surface/surface/p10.rsLsiGlobalSolver::local_solve_branchVec::insert1proveninsert(0, first_uv)index 0 is never past the end
954crates/solidcore/src/surface/surface/p10.rsLsiGlobalSolver::local_solve_branchVec::insert2proveninsert(0, first_t)index 0 is never past the end
955crates/solidcore/src/surface/surface/p11.rsSurface::intersect_surface_boundarieswindows1provenwindows(2)constant non-zero size
956crates/solidcore/src/surface/surface/p11.rsSurface::lift_curve_inwindows1provenwindows(2)constant non-zero size
957crates/solidcore/src/surface/surface/p2.rsDerivSurfDefinition::create_cross_section_curveswith_capacity1openVec::with_capacity(n)
958crates/solidcore/src/surface/surface/p2.rsSurface::end_owner_clearedVec::remove1openremove(i)
959crates/solidcore/src/surface/surface/p2.rsinsert_splitVec::insert1openinsert(insert_index, t)
960crates/solidcore/src/surface/surface/p2.rsis_evenint-div1provennum / 2constant non-zero divisor
961crates/solidcore/src/surface/surface/p2.rsjoin_touching_loopsVec::remove1openremove(bb)
962crates/solidcore/src/surface/surface/p2.rsjoin_touching_loopsVec::split_off1opensplit_off(ia)
963crates/solidcore/src/surface/surface/p2.rsmerge_double_arrayswith_capacity1openVec::with_capacity(params1.len() + params2.len())
964crates/solidcore/src/surface/surface/p2.rsset_up_breaksVec::insert1proveninsert(0, ivl.min())index 0 is never past the end
965crates/solidcore/src/surface/surface/p2.rsset_up_breaksVec::remove1openremove(0)
966crates/solidcore/src/surface/surface/p3.rsSurface::cover_coincident_surface_innerint-div1provenii / 2constant non-zero divisor
967crates/solidcore/src/surface/surface/p3.rsSurface::cover_coincident_surface_innerwith_capacity1openVec::with_capacity(NUM_FOLD_SAMPLES)
968crates/solidcore/src/surface/surface/p5.rsSurface::create_iso_parametric_curveVec::insert1proveninsert(0, d_min)index 0 is never past the end
969crates/solidcore/src/surface/surface/p5.rsSurface::create_iso_parametric_curveVec::remove1openremove(0)
970crates/solidcore/src/surface/surface/p6.rsSurface::classify_intersecting_range_solutionint-rem1proven((tgt + 3) - 1) % 3constant non-zero divisor
971crates/solidcore/src/surface/surface/p6.rsSurface::classify_intersecting_range_solutionint-rem2proven((tgt + 3) - 2) % 3constant non-zero divisor
972crates/solidcore/src/surface/surface/p6.rsSurface::create_natural_uv_trim_curvesint-rem1proven(start_index + side) % 4constant non-zero divisor
973crates/solidcore/src/surface/surface/p9.rsSurface::find_splits_at_depthwindows1provenwindows(2)constant non-zero size
974crates/solidcore/src/surface/surface_cache/p1.rsAltSrfCache::copy_of_curves_partialwith_capacity1openVec::with_capacity(cached.len())
975crates/solidcore/src/surface/surface_cache/p1.rsSurfaceCache::build_tree_topint-div1opendiv_ceil(2)
976crates/solidcore/src/surface/surface_cache/p1.rsSurfaceCache::build_tree_topint-div2opendiv_ceil(2)
977crates/solidcore/src/surface/surface_cache/p1.rsSurfaceCache::build_tree_topint-rem1provennum_v % 2constant non-zero divisor
978crates/solidcore/src/surface/surface_cache/p1.rsSurfaceCache::build_tree_topint-rem2provennum_u % 2constant non-zero divisor
979crates/solidcore/src/surface/surface_cache/p1.rsSurfaceCache::build_tree_topwith_capacity1openVec::with_capacity(curr.len())
980crates/solidcore/src/surface/surface_cache/p2.rsSurfaceCache::add_curves_to_cacheVec::insert1proveninsert(0, new_cache)index 0 is never past the end
981crates/solidcore/src/surface/surface_cache/p2.rsSurfaceCache::block_from_splitsint-div1provendiv_ceil(2)constant non-zero divisor
982crates/solidcore/src/surface/surface_cache/p2.rsSurfaceCache::block_from_splitsint-div2provendiv_ceil(2)constant non-zero divisor
983crates/solidcore/src/surface/surface_cache/p2.rsSurfaceCache::block_from_splitsint-rem1provennum_v % 2constant non-zero divisor
984crates/solidcore/src/surface/surface_cache/p2.rsSurfaceCache::block_from_splitsint-rem2provennum_u % 2constant non-zero divisor
985crates/solidcore/src/surface/surface_cache/p2.rsSurfaceCache::block_from_splitswith_capacity1provenVec::with_capacity(base_nodes.len())base_nodes.len(), an in-memory Vec
986crates/solidcore/src/surface/surface_cache/p2.rscreate_approximate_bezier_patch_blockwith_capacity1provenVec::with_capacity(num_u_spans * num_v_spans)limit_splits keeps at most 6 splits a side, so at most 5 x 5 spans
987crates/solidcore/src/surface/surface_cache/p3.rsSurfaceCache::build_tree_base_nodeswith_capacity1openVec::with_capacity(u_count.saturating_mul(v_count))
988crates/solidcore/src/surface/surface_point_solve/p1.rsSurfPtGlobalSolver::refine_guess_polygon_legf64::clamp1provenclamp(0.0, 0.5)constant bounds, min <= max
989crates/solidcore/src/surface/trim_srf_cache.rsTrimSrfCache::implant_poly_edgeVec::insert1proveninsert(0, input.poly_edge)index 0 is never past the end
990crates/solidcore/src/surface/trim_srf_cache.rsTrimSrfCache::implant_retained_edgeuseVec::insert1proveninsert(0, edgeuse)index 0 is never past the end
991crates/solidcore/src/surface/trim_srf_cache.rsTrimSrfCache::implant_vertexuseVec::insert1proveninsert(0, sc::VertexListItem { vertexuse: Some(input.vertexuse), uv_point: uv, uv_tol, },)index 0 is never past the end
992crates/solidcore/src/surface/trim_srf_cache.rsTrimSrfCache::subdivide_nodeVec::insert1proveninsert(0, pe)index 0 is never past the end
993crates/solidcore/src/surface/volume/p2.rsVolume::is_box_in_param_domainchunks1provenchunks_exact(2)constant non-zero size
994crates/solidcore/src/surface/volume/p2.rsVolume::is_pseudo_box_in_in_space_domainchunks1provenchunks_exact(2)constant non-zero size
995crates/solidcore/src/sweep/loft_rails.rsLoft::anchor_railsf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
996crates/solidcore/src/sweep/loft_rails.rsLoft::newwindows1provenwindows(2)constant non-zero size
997crates/solidcore/src/sweep/loft_rails.rsLoft::newwindows2provenwindows(2)constant non-zero size
998crates/solidcore/src/sweep/loft_rails.rsLoft::newwith_capacity1provenVec::with_capacity(count)count is sources.len(), checked to be 2..=MAX_SECTIONS (100) just before
999crates/solidcore/src/sweep/loft_rails.rsLoft::newwith_capacity2provenVec::with_capacity(count)count is sources.len(), checked to be 2..=MAX_SECTIONS (100) just before
1000crates/solidcore/src/sweep/loft_rails.rsLoft::newwith_capacity3provenVec::with_capacity(count)count is sources.len(), checked to be 2..=MAX_SECTIONS (100) just before
1001crates/solidcore/src/sweep/loft_rails.rsLoft::plainwith_capacity1provenVec::with_capacity(lead.len())the length of an existing Vec (the first section's curves)
1002crates/solidcore/src/sweep/loft_rails.rsLoft::plainwith_capacity2provenVec::with_capacity(per.len())the length of an existing Vec (a control point's curves across the sections)
1003crates/solidcore/src/sweep/loft_rails.rsPlain::nurbwith_capacity1provenVec::with_capacity(self.points.len())the length of an existing Vec (the curve's control points)
1004crates/solidcore/src/sweep/loft_rails.rsPlain::point_atf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
1005crates/solidcore/src/sweep/loft_rails.rscentroidwindows1provenwindows(2)constant non-zero size
1006crates/solidcore/src/sweep/loft_rails.rscertifywindows1provenwindows(2)constant non-zero size
1007crates/solidcore/src/sweep/loft_rails.rscertifywith_capacity1provenVec::with_capacity(wires.len())the length of an existing Vec (the wires made)
1008crates/solidcore/src/sweep/loft_rails.rscertifywith_capacity2provenVec::with_capacity(wires.len())the length of an existing Vec (the wires made)
1009crates/solidcore/src/sweep/loft_rails.rsinterpolate_gf64::clamp1provenclamp(0.0, n)n is a usize cast to f64: never NaN and never below 0.0, so min <= max
1010crates/solidcore/src/sweep/loft_rails.rsskin_and_certifyVec::drain1provendrain(..)a full range, never out of bounds
1011crates/solidcore/src/nurbs/certificate.rsinterval_boundf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
1012crates/solidcore/src/nurbs/certificate.rsinterval_boundwith_capacity1provenVec::with_capacity(4)constant capacity
1013crates/solidcore/src/nurbs/certificate.rsinterval_boundwith_capacity2provenVec::with_capacity(4)constant capacity
1014crates/solidcore/src/nurbs/certificate.rsinterval_boundwith_capacity3provenVec::with_capacity(4)constant capacity
1015crates/solidcore/src/sweep/rotational_sweep_geometry.rsRotationalSweepGeometry::edge_sweep_higherswap1provenswap(1, 3)a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array
1016crates/solidcore/src/sweep/rotational_sweep_geometry.rsRotationalSweepGeometry::edge_sweep_higherswap2provenswap(1, 3)a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array
1017crates/solidcore/src/sweep/rotational_sweep_geometry.rsRotationalSweepGeometry::edge_sweep_higherswap3provenswap(1, 3)a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array
1018crates/solidcore/src/sweep/rotational_sweep_geometry.rsRotationalSweepGeometry::edge_sweep_higherswap4provenswap(1, 3)a3d, a_uv and a_orients lengths checked >= 4; roles is a four-element array
1019crates/solidcore/src/sweep/rotational_sweep_geometry.rsremove_firstVec::remove1provenremove(0)each Vec checked nonempty before remove(0)
1020crates/solidcore/src/sweep/rotational_sweep_geometry.rsremove_firstVec::remove2provenremove(0)each Vec checked nonempty before remove(0)
1021crates/solidcore/src/sweep/rotational_sweep_geometry.rsremove_firstVec::remove3provenremove(0)each Vec checked nonempty before remove(0)
1022crates/solidcore/src/sweep/screw.rsScrew::offsetwindows1provenwindows(2)constant non-zero size
1023crates/solidcore/src/sweep/screw.rsScrew::offsetwindows2provenwindows(2)constant non-zero size
1024crates/solidcore/src/sweep/screw.rsStations::weightint-rem1provenj % 2constant non-zero divisor
1025crates/solidcore/src/sweep/screw.rsaxial_radiusf64::clamp1provenclamp(0.0, 1.0)constant bounds, min <= max
1026crates/solidcore/src/sweep/screw.rspathwindows1provenwindows(2)constant non-zero size
1027crates/solidcore/src/sweep/screw.rssweepwindows1provenwindows(2)constant non-zero size
1028crates/solidcore/src/sweep/stations.rsfractionsOrd::clamp1provenclamp(MIN_SKIN_STATIONS, MAX_SKIN_STATIONS)constants 16 <= 2048, so min <= max always
1029crates/solidcore/src/sweep/topology_sweep/store.rsSweepStore::dropVec::drain1provendrain(..)full drain(..) has no invalid bounds
1030crates/solidcore/src/sweep/topology_sweep/store.rsSweepStore::unlock_markVec::remove1provenremove(index)index is rposition() in the same locks Vec
1031crates/solidcore/src/sweep/topology_sweep/store.rsbody_pair_mutsplit_at1provensplit_at_mut(si.max(di))entry() validates both base-adjusted indices against the same slots Vec
1032crates/solidcore/src/topology.rsBrep::add_loopwith_capacity1openVec::with_capacity(edges.len())
1033crates/solidcore/src/topology.rsBrep::end_surface_owner_clearedVec::remove1openremove(i)
1034crates/solidcore/src/topology/brep/local_operation.rslocal_operationwith_capacity1openVec::with_capacity(all_faces.len())
1035crates/solidcore/src/topology/brep/p1.rsBrep::fix_region_orderrotate1provenrotate_left(pos)pos is position() in the same region order Vec
1036crates/solidcore/src/topology/brep/p1.rsBrep::set_region_list_headrotate1provenrotate_left(pos)pos is position() in the same region order Vec
1037crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::insert1proveninsert(2 - ii, Curve::from(top_curve))ii is in 0..2 and all four parallel Vecs have at least two entries
1038crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::insert2proveninsert(2 - ii, OrientType::Same)ii is in 0..2 and all four parallel Vecs have at least two entries
1039crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::insert3proveninsert(2 - ii, None)ii is in 0..2 and all four parallel Vecs have at least two entries
1040crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::insert4proveninsert(2 - ii, None)ii is in 0..2 and all four parallel Vecs have at least two entries
1041crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::remove1provenremove(0)work_eus copies edgeuses after the edgeuses.len() >= 2 check
1042crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::remove2provenremove(0)work_tan.first() succeeds before removing index 0
1043crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::remove3provenremove(i)i is in 0..work_eus.len(); removal immediately breaks the loop
1044crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::remove4provenremove(i)work_tan.get(i) succeeds before work_eus.remove(i), which does not change work_tan
1045crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::remove5provenremove(i)i is in 0..work_eus.len(); removal immediately breaks the loop
1046crates/solidcore/src/topology/brep/p1.rscreate_corner_blendVec::remove6provenremove(i)work_tan.get(i) succeeds before work_eus.remove(i), which does not change work_tan
1047crates/solidcore/src/topology/brep/p1.rscreate_corner_blendrotate1provenrotate_right(1)each parallel Vec has at least two ordered edge entries before padding
1048crates/solidcore/src/topology/brep/p1.rscreate_corner_blendrotate2provenrotate_right(1)each parallel Vec has at least two ordered edge entries before padding
1049crates/solidcore/src/topology/brep/p1.rscreate_corner_blendrotate3provenrotate_right(1)each parallel Vec has at least two ordered edge entries before padding
1050crates/solidcore/src/topology/brep/p1.rscreate_corner_blendrotate4provenrotate_right(1)each parallel Vec has at least two ordered edge entries before padding
1051crates/solidcore/src/topology/brep/p1.rscreate_edge_edge_blendwith_capacity1provenVec::with_capacity(num_loc)constant capacity: num_loc = 11
1052crates/solidcore/src/topology/brep/p1.rscreate_edge_edge_blendwith_capacity2provenVec::with_capacity(num_loc)constant capacity: num_loc = 11
1053crates/solidcore/src/topology/brep/p1.rsmark_loops_to_delete_boundedint-rem1provenrec_level % 2constant non-zero divisor
1054crates/solidcore/src/topology/brep/p1.rsregion_set_listrotate1provenrotate_left(at)at is position() in the same shells Vec
1055crates/solidcore/src/topology/brep/p1.rsreverse_reflection_edgeuseschunks1provenchunks_exact(2)constant non-zero size
1056crates/solidcore/src/topology/brep/p1.rsreverse_reflection_edgeusesint-rem1provenuses.len() % 2constant non-zero divisor
1057crates/solidcore/src/topology/brep/p1.rsreverse_reflection_edgeuseswith_capacity1provenVec::with_capacity(uses.len())uses.len() counts existing EdgeuseId elements; relinked also stores EdgeuseId
1058crates/solidcore/src/topology/brep/p1.rsset_region_is_void_flags_for_nested_solidsVec::remove1provenremove(0)inside while !queue.is_empty()
1059crates/solidcore/src/topology/brep/p1.rsset_region_is_void_flags_for_nested_solidsVec::remove2provenremove(0)guarded by !is_empty()
1060crates/solidcore/src/topology/brep/p1.rsupdate_vertex_edge_intervalsstep_by1provenstep_by(2)constant non-zero step
1061crates/solidcore/src/topology/brep/p1.rsvertexuse_neighbourint-rem1proven(i + 1) % nposition() finds i in list before n = list.len(), so n > 0
1062crates/solidcore/src/topology/brep/p1.rsvertexuse_neighbourint-rem2proven(i + n - 1) % nposition() finds i in list before n = list.len(), so n > 0
1063crates/solidcore/src/topology/brep/p10.rsbuild_regionsVec::insert1proveninsert(pos, i + INSIDE_SHELL)returns Err when pos > len()
1064crates/solidcore/src/topology/brep/p10.rsrelink_radial_listsint-rem1proven(i + 1) % list.len()inside list.iter().enumerate(), so list.len() > 0
1065crates/solidcore/src/topology/brep/p2.rsmake_shell_vertex_topologyVec::insert1proveninsert(0, vu)index 0 is never past the end
1066crates/solidcore/src/topology/brep/p2.rsmate_lamina_edge_to_surfaceVec::remove1openremove(i)
1067crates/solidcore/src/topology/brep/p2.rsmate_lamina_edge_to_surfaceVec::remove2openremove(i)
1068crates/solidcore/src/topology/brep/p2.rsregion_insert_shell_afterVec::insert1openinsert(at + 1, s)
1069crates/solidcore/src/topology/brep/p3.rsBrep::pre_insert_regionVec::insert1proveninsert(0, r)index 0 is never past the end
1070crates/solidcore/src/topology/brep/p3.rsdelete_face_inVec::insert1proveninsert(0, vu)index 0 is never past the end
1071crates/solidcore/src/topology/brep/p3.rsorient_ray_votesint-rem1provenn % 2constant non-zero divisor
1072crates/solidcore/src/topology/brep/p3.rssqueeze_loopsVec::insert1proveninsert(0, vu)index 0 is never past the end
1073crates/solidcore/src/topology/brep/p4.rsdelete_vertex_inchunks1provenchunks(2)constant non-zero size
1074crates/solidcore/src/topology/brep/p4.rsedge_removeVec::remove1provenremove(at)index is position() in the same Vec, with no intervening mutation
1075crates/solidcore/src/topology/brep/p4.rsfaceuse_removeVec::remove1provenremove(at)index is position() in the same Vec, with no intervening mutation
1076crates/solidcore/src/topology/brep/p4.rsshell_remove_faceuseVec::remove1provenremove(at)index is position() in the same Vec, with no intervening mutation
1077crates/solidcore/src/topology/brep/p4.rsvertex_removeVec::remove1provenremove(at)index is position() in the same Vec, with no intervening mutation
1078crates/solidcore/src/topology/brep/p5.rsmake_manifold_inVec::remove1provenremove(index)index is position() in the same Vec, with no intervening mutation
1079crates/solidcore/src/topology/brep/p5.rsremove_vertexuseVec::remove1provenremove(index)index is position() in the same Vec, with no intervening mutation
1080crates/solidcore/src/topology/brep/p7.rsedge_removeVec::remove1openremove(at)
1081crates/solidcore/src/topology/brep/p7.rsglue_edges_generalVec::remove1openremove(at)
1082crates/solidcore/src/topology/brep/p9.rsfaceuse_pre_insert_loopuseVec::insert1proveninsert(0, lu)index 0 is never past the end
1083crates/solidcore/src/topology/brep/p9.rsfaceuse_remove_loopuseVec::remove1provenremove(at)index is position() in the same Vec, with no intervening mutation
1084crates/solidcore/src/topology/brep/p9.rsmake_vertex_split_edge_with_curve_identity_statechunks1provenchunks_exact(2)constant non-zero size
1085crates/solidcore/src/topology/brep/p9.rsmake_vertex_split_edge_with_curve_identity_statechunks2provenchunks_exact(2)constant non-zero size
1086crates/solidcore/src/topology/brep/p9.rsmake_vertex_split_edge_with_curve_identity_statechunks3provenchunks_exact(2)constant non-zero size
1087crates/solidcore/src/topology/brep/p9.rsmake_vertex_split_edge_with_curve_identity_statechunks4provenchunks_exact(2)constant non-zero size
1088crates/solidcore/src/topology/brep/p9.rsmake_vertex_split_edge_with_curve_identity_statechunks5provenchunks_exact(2)constant non-zero size
1089crates/solidcore/src/topology/brep/p9.rsmake_vertex_split_edge_with_curve_identity_stateint-rem1provenoriginal_uses.len() % 2constant non-zero divisor
1090crates/solidcore/src/topology/brep/p9.rsshell_post_insertint-rem1proven(i + 1) % members.len()inside iteration over members, so len() > 0
1091crates/solidcore/src/topology/brep/planar_section.rscreate_planar_section_curvesVec::remove1provenremove(index)inside while index < curves_3d.len()
1092crates/solidcore/src/topology/brep/planar_section.rscreate_planar_section_curvesVec::remove2provenremove(index)uv_curves is resized to curves_3d.len(); removals and force_uv_curves pushes stay paired
1093crates/solidcore/src/topology/brep/validation/assert_valid/loops.rsloop_int-rem1proven(idx1 + idx2) % n1guarded by n1 > 1
1094crates/solidcore/src/topology/brep/validation/assert_valid/loops.rsloop_int-rem2proven(n1 - i1 + off) % n1guarded by n1 > 1
1095crates/solidcore/src/topology/brep/validation/pointers.rsLists::newint-rem1proven(i + 1) % e.edgeuses.len()inside e.edgeuses.iter().enumerate(), so e.edgeuses.len() > 0
1096crates/solidcore/src/topology/brep/validation/pointers.rsLists::newint-rem2proven(i + e.edgeuses.len() - 1) % e.edgeuses.len()inside e.edgeuses.iter().enumerate(), so e.edgeuses.len() > 0
1097crates/solidcore/src/topology/brep/validation/pointers.rscheck_edgesint-rem1provenuses.len() % 2constant non-zero divisor
1098crates/solidcore/src/topology/brep/validation/pointers.rsvalidate_pointersint-rem1proven(j + 1) % uses.len()inside for j in (1..uses.len()).step_by(2), so uses.len() > 1
1099crates/solidcore/src/topology/brep/validation/pointers.rsvalidate_pointersstep_by1provenstep_by(2)constant non-zero step
1100crates/solidcore/src/topology/brep/validation/spatial.rsSpatialIndex::newint-div1proven(end - begin) / 2constant non-zero divisor
1101crates/solidcore/src/topology/brep/validation/spatial.rsSpatialIndex::newint-rem1proven(axis + 1) % 3constant non-zero divisor
1102crates/solidcore/src/topology/brep/validation/spatial.rsSpatialIndex::newint-rem2proven(axis + 1) % 3constant non-zero divisor
1103crates/solidcore/src/topology/brep/vertex_fans.rsremove_vertexuseVec::remove1provenremove(index)index is position() in the same Vec, with no intervening mutation
1104crates/solidcore/src/topology/brep_data_write.rsBrepData::from_brepVec::insert1proveninsert(0, r)index 0 is never past the end
1105crates/solidcore/src/topology/brep_data_write.rsBrepData::from_brepVec::remove1provenremove(i + 1)i is position() after skip(1) in the same regions Vec, so i + 1 < len()
1106crates/solidcore/src/topology/database_io.rsDatabaseReader::read_raw_itemschunks1provenchunks_exact(N)N is a const generic, 1, 4 or 8 at every call
1107crates/solidcore/src/topology/database_io.rsDatabaseReader::read_raw_itemscopy_from_slice1provencopy_from_slice(c)c is a chunks_exact(N) chunk of [u8; N]
1108crates/solidcore/src/topology/database_io.rsInputStream::scan_intint-div1provenmax / 10constant non-zero divisor
1109crates/solidcore/src/topology/edge.rsinsert_afterVec::insert1proveninsert(pos + 1, obj)pos is position() in the same edgeuses Vec, so pos + 1 <= len()
1110crates/solidcore/src/topology/edge.rsis_seam_of_surfacestep_by1provenstep_by(2)constant non-zero step
1111crates/solidcore/src/topology/edge.rsorient_edge_sequencewindows1provenwindows(2)constant non-zero size
1112crates/solidcore/src/topology/edge.rsreset_primary_edgeuserotate1provenrotate_left(pos)pos is position() in list; rotated is an unchanged clone of list
1113crates/solidcore/src/topology/edge.rsset_orientationchunks1provenchunks_exact(2)constant non-zero size
1114crates/solidcore/src/topology/edgeuse/p1.rsedgeuse_lastint-rem1proven(i + list.len() - 1) % list.len()list_of returns Some only after position() finds i in that list, so len() > 0
1115crates/solidcore/src/topology/edgeuse/p1.rsedgeuse_nextint-rem1proven(i + 1) % list.len()list_of returns Some only after position() finds i in that list, so len() > 0
1116crates/solidcore/src/topology/edgeuse/p3.rscreate_uv_trim_curveVec::remove1provenremove(0)guarded by uv_curves.len() == 2; branches remove at most one curve
1117crates/solidcore/src/topology/edgeuse/p3.rscreate_uv_trim_curveVec::remove2provenremove(1)guarded by uv_curves.len() == 2; branches remove at most one curve
1118crates/solidcore/src/topology/edgeuse/p3.rscreate_uv_trim_curveVec::swap_remove1provenswap_remove(kkk)kkk comes from uv_curves.iter().enumerate(), with no intervening Vec mutation
1119crates/solidcore/src/topology/edgeuse/p3.rsevaluate_binormal_uvint-rem1provensteps % 2constant non-zero divisor
1120crates/solidcore/src/topology/edgeuse/p3.rslongest_drop_runwith_capacity1provenVec::with_capacity(pieces.len())pieces.len() counts existing Curve elements, no smaller than (Extent1d, Point3, Point3) via CurveKind::Line
1121crates/solidcore/src/topology/edgeuse/p3.rslongest_drop_runwith_capacity2provenVec::with_capacity(run_pieces.len())run_pieces.len() counts existing Curve elements, which contain the BSplineCurve variant inline
1122crates/solidcore/src/topology/edgeuse/p3.rsremove_seam_curveVec::remove1provenremove(1)only caller pick_seam_curve checks get(1) before calling, and removes at most one curve
1123crates/solidcore/src/topology/edgeuse/p3.rsremove_seam_curveVec::remove2provenremove(0)only caller pick_seam_curve checks get(1) before calling, and removes at most one curve
1124crates/solidcore/src/topology/face/p1.rsfaceuse_removeVec::remove1openremove(at)
1125crates/solidcore/src/topology/face/p1.rsmove_seam_notifiedint-rem1open1 % cnt
1126crates/solidcore/src/topology/face/p1.rsmove_seam_notifiedint-rem2open(jj + 1) % cnt
1127crates/solidcore/src/topology/face/p1.rsmove_seam_notifiedint-rem3open(max_indx + 1) % cnt
1128crates/solidcore/src/topology/face/p1.rssplit_at_seam_mergesrotate1openrotate_left(at)
1129crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div1openpoint_count / trim_curve_cnt
1130crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div2openpoint_count / trim_curve_cnt
1131crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div3openpoint_count / trim_curve_cnt
1132crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div4proventrim_curve_cnt / 2constant non-zero divisor
1133crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div5provenii / 2constant non-zero divisor
1134crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div6opendiv_ceil(2)
1135crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div7openpoint_count / n_classes
1136crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div8openpoint_count / n_classes
1137crates/solidcore/src/topology/face/p2.rspoints_in_faceint-div9openpoint_count / n_classes
1138crates/solidcore/src/topology/face/p2.rspoints_in_faceint-rem1provenii % 2constant non-zero divisor
1139crates/solidcore/src/topology/face/p2.rsremove_suspect_split_at_seam_uv_trim_curvesstep_by1provenstep_by(2)constant non-zero step
1140crates/solidcore/src/topology/face/p2.rstrim_curve_breakswindows1provenwindows(2)constant non-zero size
1141crates/solidcore/src/topology/face/p3.rsis_degeneratesplit_at1opensplit_at_mut(jj)
1142crates/solidcore/src/topology/face/p3.rsloop_orientation_3dwindows1provenwindows(2)constant non-zero size
1143crates/solidcore/src/topology/loopuse.rsis_closed_3dint-rem1proven(ii + 1) % numnum = eus.len() and call is inside eus.iter().enumerate(), so num > 0
1144crates/solidcore/src/topology/part_file.rsread_part_from_dbint-div1proventotal_curves / 1_000_000constant non-zero divisor
1145crates/solidcore/src/topology/part_file.rsread_part_from_dbint-div2proventotal_surfaces / 1_000_000constant non-zero divisor
1146crates/solidcore/src/topology/proto_topology/p1/proto.rsProtoEdge::remove_edge_definitionVec::remove1provenremove(i)i is position() in the same Vec
1147crates/solidcore/src/topology/proto_topology/p1/proto.rsProtoTopologyManager::remove_proto_edgeVec::remove1provenremove(i)i is position() in the same Vec
1148crates/solidcore/src/topology/proto_topology/p1/proto.rsProtoTopologyManager::remove_proto_vertexVec::remove1provenremove(i)i is position() in the same Vec
1149crates/solidcore/src/topology/proto_topology/p1/proto.rsProtoVertex::remove_proto_edgeVec::remove1provenremove(i)i is position() in the same Vec
1150crates/solidcore/src/topology/proto_topology/p1/proto.rsProtoVertex::remove_vertex_definitionVec::remove1provenremove(i)i is position() in the same Vec
1151crates/solidcore/src/topology/proto_topology/p2.rsProtoTopologyManager::combine_proto_edgeVec::remove1openremove(idx)
1152crates/solidcore/src/topology/proto_topology/p3.rsProtoTopologyManager::find_or_create_proto_edgewith_capacity1provenVec::with_capacity(overlapping.len())overlapping.len() counts existing Option<ProtoEdgeId> elements, no smaller than ProtoEdgeId
1153crates/solidcore/src/topology/proto_topology/p3.rsProtoTopologyManager::glue_coincident_brep_verticeswith_capacity1provenVec::with_capacity(defs.len())defs.len() counts existing VertexDefId elements; keep also stores VertexDefId
1154crates/solidcore/src/topology/shell.rsis_inner_shell_ofstep_by1provenstep_by(2)constant non-zero step
1155crates/solidcore/src/topology/shell.rsorder_region_shellsrotate1provenrotate_left(position)position is position() in a clone of the same shell list; classification only edits trim/cache data
1156crates/solidcore/src/topology/shell.rsregion_remove_shellVec::remove1provenremove(index)index is position() in the same Vec, with no intervening mutation
1157crates/solidcore/src/topology/shell.rsremove_and_post_insertVec::remove1provenremove(index)index is position() in the same Vec, with no intervening mutation
1158crates/solidcore/src/topology/shell.rsshell_remove_faceuseVec::remove1provenremove(index)index is position() in the same Vec, with no intervening mutation
1159crates/solidcore/src/topology/topology.rspropagatecopy_from_slice1provencopy_from_slice(&src.marks[..3])both slices are ..3 of marks arrays of length 5
1160crates/solidcore/src/topology/topology.rsremove_keyVec::remove1provenremove(i)index is position() in the same Vec, with no intervening mutation
1161crates/solidcore/src/topology/topology_traverser.rsis_inner_shellchunks1provenchunks_exact_mut(2)constant non-zero size
1162crates/solidcore/src/topology/topology_traverser.rsis_inner_shellchunks2provenchunks_exact(2)constant non-zero size
1163crates/solidcore/src/topology/topology_traverser.rsis_inner_shellint-rem1provenforward % 2constant non-zero divisor
1164crates/solidcore/src/topology/topology_traverser.rsis_inner_shellint-rem2provenbackward % 2constant non-zero divisor
1165crates/solidcore/src/topology/topology_traverser.rsis_inner_shellint-rem3provenforward % 2constant non-zero divisor
1166crates/solidcore/src/topology/topology_traverser.rsis_inner_shellint-rem4provenbackward % 2constant non-zero divisor
1167crates/solidcore/src/topology/topology_traverser.rsis_inner_shellint-rem5provenforward % 2constant non-zero divisor
1168crates/solidcore/src/topology/topology_traverser.rsis_inner_shellint-rem6provenbackward % 2constant non-zero divisor
1169crates/solidcore/src/topology/trimming_tools.rsensure_last_edgeuse_uv_correctrotate1provenrotate_left(if dropped_correctly + 1 < n { dropped_correctly + 1 } else { 0 })rotation is either dropped_correctly + 1 < n or 0, with n = edgeuses.len()
1170crates/solidcore/src/topology/trimming_tools.rsmove_loopuse_firstVec::insert1proveninsert(0, lu)index 0 is never past the end
1171crates/solidcore/src/topology/trimming_tools.rsmove_loopuse_firstVec::remove1provenremove(pos)index is position() in the same Vec, with no intervening mutation
1172crates/solidcore/src/topology/trimming_tools.rsnext_round_the_vertexint-div1provenii / 2constant non-zero divisor
1173crates/solidcore/src/topology/trimming_tools.rsnext_round_the_vertexint-div2provenend / 2constant non-zero divisor
1174crates/solidcore/src/topology/trimming_tools.rsnext_round_the_vertexint-rem1provenend % 2constant non-zero divisor
1175crates/solidcore/src/topology/trimming_tools.rsorder_curves_into_loopsint-div1provenfound_index / 2constant non-zero divisor
1176crates/solidcore/src/topology/trimming_tools.rsorder_curves_into_loopsint-div2proven(found_index - 1) / 2constant non-zero divisor
1177crates/solidcore/src/topology/trimming_tools.rsorder_curves_into_loopsint-rem1provenfound_index % 2constant non-zero divisor
1178crates/solidcore/src/topology/trimming_tools.rsorder_curves_into_loopsint-rem2provenfound_index % 2constant non-zero divisor
1179crates/solidcore/src/topology/trimming_tools/curve_loops.rsCurveLoops::insert_into_loopsVec::insert1proveninsert(idx + 1, new_curve)idx is position() in self.curves, so idx + 1 <= len()
1180crates/solidcore/src/topology/trimming_tools/curve_loops.rsCurveLoops::insert_into_loopsVec::insert2proveninsert(idx + 1, o)returns Err when idx + 1 > self.orients.len()
1181crates/step-export/src/brep_to_model.rsbrep_to_modelwith_capacity1provenVec::with_capacity(65)constant capacity
1182crates/step-export/src/brep_to_model.rsbspline_surfacechunks1provenchunks(v_count)v_count is net.v_count.max(1)
1183crates/step-export/src/brep_to_model.rsbspline_surfacechunks2provenchunks(v_count)v_count is net.v_count.max(1)
1184crates/step-export/src/lib.rsfaceted_shellint-rem1open(index + 1) % len
1185crates/step-export/src/lib.rsfaceted_shellwith_capacity1openVec::with_capacity(face_indices.len())
1186crates/step-export/src/lib.rsfaceted_shellwith_capacity2openVec::with_capacity(face.loops.len())
1187crates/step-export/src/lib.rsfaceted_shellwith_capacity3openVec::with_capacity(edges.len())
1188crates/step-export/src/lib.rsfaceted_shellwith_capacity4openVec::with_capacity(welded.points.len())
1189crates/step-export/src/lib.rsfaceted_shellwith_capacity5openVec::with_capacity(faces.len())
1190crates/step-export/src/lib.rsfaceted_shellwith_capacity6openVec::with_capacity(loops.len())
1191crates/step-export/src/lib.rsquotedwith_capacity1openString::with_capacity(value.len() + 2)
1192crates/step-export/src/lib.rsshellwith_capacity1openVec::with_capacity(body.faces.len())
1193crates/step-export/src/lib.rsshellwith_capacity2openVec::with_capacity(step_shell.faces.len())
1194crates/step-export/src/lib.rsshellwith_capacity3openVec::with_capacity(face.loops.len())
1195crates/step-export/src/lib.rsshellwith_capacity4openVec::with_capacity(edges.len())
1196crates/step-export/src/lib.rsweld_verticeswith_capacity1openVec::with_capacity(body.vertices.len())
1197crates/step-export/src/lib.rswrite_bspline_surfacewith_capacity1openVec::with_capacity(surface.points.len())
1198crates/step-export/src/lib.rswrite_bspline_surfacewith_capacity2openVec::with_capacity(row.len())
1199crates/step-export/src/lib.rswrite_pcurve_edgewith_capacity1openVec::with_capacity(pcurves.len())
1200crates/step-export/src/lib.rswrite_pcurve_edgewith_capacity2openVec::with_capacity(uv.len())
1201crates/step-export/src/geom.rsbspline_pointf64::clamp1provenclamp(lo, hi)check_bspline_curve just above: n > p, knots increasing, no NaN, so lo <= hi
1202crates/step-export/src/map.rsMapper::poly_loopint-rem1proven(k + 1) % vs.len()vs has one entry per point, fewer than 3 refused
1203crates/step-export/src/map.rscheck_knotswindows1provenwindows(2)constant non-zero size
1204crates/step-export/src/map.rsimplied_knotsint-div1proven(n - 1) / dddd == 0 returns Err just above
1205crates/step-export/src/map.rspolygon_planeint-rem1proven(k + 1) % pts.len()inside iteration over pts, so len() > 0