SciPy library main repository
This report presents the forensic synthetic code analysis of scipy/scipy, a Python project with 14,816 GitHub stars. SynthScan v2.0 examined 927,950 lines of code across 1866 source files, recording 5810 pattern matches distributed across 18 syntactic categories. The overall adjusted score of 7.0 places this repository in the Low AI signal band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 5810 distinct pattern matches across 18 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .spin/cmds.py | 1077 | def _count_physical_cores_linux(): | CODE |
| LOW | .spin/cmds.py | 1121 | def _count_physical_cores_darwin(): | CODE |
| LOW | .spin/cmds.py | 1131 | def _count_physical_cores_freebsd(): | CODE |
| LOW | tools/check_xp_untested.py | 49 | def pytest_collection_modifyitems(self, session, config, items): | CODE |
| LOW | tools/check_python_h_first.py | 66 | def check_python_h_included_first(name_to_check: str) -> int: | CODE |
| LOW | tools/generate_f2pymod.py | 109 | def find_and_remove_repl_patterns(astr): | CODE |
| LOW | benchmarks/process_global_benchmarks.py | 5 | def process_global_benchmarks(f): | CODE |
| LOW | benchmarks/benchmarks/optimize.py | 210 | def run_differentialevolution(self): | CODE |
| LOW | benchmarks/benchmarks/cluster_hierarchy_disjoint_set.py | 37 | def time_merge_already_merged(self, n): | CODE |
| LOW | benchmarks/benchmarks/ndimage_interpolation.py | 53 | def time_geometric_transform_mapping(self, shape, order, mode): | CODE |
| LOW | benchmarks/benchmarks/sparse_csgraph.py | 60 | def time_strongly_connected_components(self, kind): | CODE |
| LOW | benchmarks/benchmarks/spatial.py | 181 | def time_query_ball_point_nosort(self, mnr, p, probe_radius, boxsize, leafsize): | CODE |
| LOW | benchmarks/benchmarks/spatial.py | 225 | def time_sparse_distance_matrix(self, mn1n2, p, probe_radius, | CODE |
| LOW⚡ | benchmarks/benchmarks/spatial.py | 275 | def time_count_neighbors_deep(self, mn1n2, Nr): | CODE |
| LOW⚡ | benchmarks/benchmarks/spatial.py | 282 | def time_count_neighbors_shallow(self, mn1n2, Nr): | CODE |
| LOW⚡ | benchmarks/benchmarks/spatial.py | 289 | def generate_spherical_points(num_points): | CODE |
| LOW | benchmarks/benchmarks/spatial.py | 315 | def time_spherical_voronoi_calculation(self, num_points): | CODE |
| LOW | benchmarks/benchmarks/spatial.py | 330 | def time_spherical_polygon_vertex_sorting(self, num_points): | CODE |
| LOW | benchmarks/benchmarks/spatial.py | 352 | def time_spherical_polygon_area_calculation(self, num_points, ndim): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 184 | def track_truncnorm_stats_error(self, case, moment): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 295 | def track_distribution_ppf_roundtrip(self, dist_name): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 306 | def track_distribution_ppf_roundtrip_extrema(self, dist_name): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 316 | def track_distribution_isf_roundtrip(self, dist_name): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 327 | def track_distribution_isf_roundtrip_extrema(self, dist_name): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 457 | def time_gaussian_kde_evaluate(self, length): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 529 | def time_binned_statistic_dd_reuse_bin(self, statistic): | CODE |
| LOW | benchmarks/benchmarks/stats.py | 741 | def time_wasserstein_distance(self, n_size): | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 272 | def time_smooth_bivariate_spline(self, n_samples): | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 275 | def time_lsq_bivariate_spline(self, n_samples): | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 309 | def time_rect_bivariate_spline(self, size, s): | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 375 | def time_rgi_setup_interpolator(self, ndim, max_coord_size, | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 416 | def time_rgi_setup_interpolator(self, ndim, n_samples, method): | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 456 | def time_rgi_setup_interpolator(self, ndim, n_samples): | CODE |
| LOW | benchmarks/benchmarks/interpolate.py | 537 | def time_rgi_setup_interpolator(self, ndim, max_coord_size, | CODE |
| LOW | benchmarks/benchmarks/sparse_csgraph_matching.py | 27 | def time_maximum_bipartite_matching(self, n, density): | CODE |
| LOW | benchmarks/benchmarks/fft_basic.py | 123 | def time_next_fast_len_cached(self, size): | CODE |
| LOW | …hmarks/benchmarks/tests/test_go_benchmark_functions.py | 51 | def test_bounds_access_subscriptable(self): | CODE |
| LOW | doc/source/array_api_capabilities_table.py | 34 | def _get_flat_table_and_backends( | CODE |
| LOW | doc/source/array_api_capabilities_table.py | 101 | def _get_generated_doc_link_for_function(self, module, func): | CODE |
| LOW | …bprojects/pyprima/pyprima/pyprima/tests/test_bounds.py | 4 | def test_eliminate_fixed_bounds(): | CODE |
| LOW | …jects/pyprima/pyprima/pyprima/tests/test_end_to_end.py | 10 | def test_end_to_end_no_constraints(): | CODE |
| LOW | …jects/pyprima/pyprima/pyprima/tests/test_end_to_end.py | 21 | def test_end_to_end_linear_constraints(minimize_with_debugging): | CODE |
| LOW | …jects/pyprima/pyprima/pyprima/tests/test_end_to_end.py | 30 | def test_end_to_end_nonlinear_constraint(): | CODE |
| LOW⚡ | …ts/pyprima/pyprima/pyprima/tests/test_miscellaneous.py | 21 | def test_callback_no_terminate(): | CODE |
| LOW⚡ | …ts/pyprima/pyprima/pyprima/tests/test_miscellaneous.py | 31 | def test_rhoend_without_rhobeg(): | CODE |
| LOW⚡ | …ts/pyprima/pyprima/pyprima/tests/test_miscellaneous.py | 36 | def test_rhobeg_without_rhoend(): | CODE |
| LOW | …ts/pyprima/pyprima/pyprima/tests/test_miscellaneous.py | 62 | def test_minimize_constraint_violation(): | CODE |
| LOW | …a/pyprima/src/pyprima/common/_nonlinear_constraints.py | 3 | def transform_constraint_function(nlc): | CODE |
| LOW | …rima/pyprima/src/pyprima/common/_linear_constraints.py | 5 | def combine_multiple_linear_constraints(constraints): | CODE |
| LOW | scipy/conftest.py | 374 | def _backends_kwargs_from_request(request, skip_or_xfail): | CODE |
| LOW | scipy/conftest.py | 459 | def skip_or_xfail_xp_backends(request: pytest.FixtureRequest, | CODE |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 3420 | def _append_singleton_leaf_node(Z, p, n, level, lvs, ivl, leaf_label_func, | STRING |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 3446 | def _append_nonsingleton_leaf_node(Z, p, n, level, lvs, ivl, leaf_label_func, | STRING |
| LOW⚡ | scipy/cluster/hierarchy/_hierarchy_impl.py | 3464 | def _append_contraction_marks(Z, iv, i, n, contraction_marks, xp): | STRING |
| LOW⚡ | scipy/cluster/hierarchy/_hierarchy_impl.py | 3471 | def _append_contraction_marks_sub(Z, iv, i, n, contraction_marks, xp): | STRING |
| LOW⚡ | scipy/cluster/hierarchy/_hierarchy_impl.py | 3480 | def _dendrogram_calculate_info(Z, p, truncate_mode, | STRING |
| LOW | scipy/cluster/hierarchy/tests/test_disjoint_set.py | 98 | def test_linear_union_sequence(n, direction): | CODE |
| LOW⚡ | scipy/cluster/hierarchy/tests/test_hierarchy.py | 87 | def test_linkage_non_finite_elements_in_distance_matrix(self, xp): | CODE |
| LOW⚡ | scipy/cluster/hierarchy/tests/test_hierarchy.py | 93 | def test_linkage_empty_distance_matrix(self, xp): | CODE |
| LOW⚡ | scipy/cluster/hierarchy/tests/test_hierarchy.py | 260 | def test_mlab_linkage_conversion_empty(self, xp): | CODE |
| 2362 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | pyproject.toml | 1 | # Note that in maintenance branches, all build dependencies should | COMMENT |
| LOW | tools/check_test_name.py | 121 | for _node in node.body: | COMMENT |
| LOW | tools/ninjatracing.py | 1 | # Copyright 2018 Nico Weber | COMMENT |
| LOW | benchmarks/asv.conf.json | 21 | // "install_command": ["in-dir={env_dir} python -mpip install {wheel_file}"], | COMMENT |
| LOW | benchmarks/asv.conf.json | 61 | // If missing or the empty string, the tool will be automatically | COMMENT |
| LOW | benchmarks/benchmarks/test_functions.py | 201 | #basinhopping | COMMENT |
| LOW | …hmarks/benchmarks/go_benchmark_functions/go_funcs_S.py | 261 | # is a multimodal minimization problem defined as follows: | COMMENT |
| LOW | .github/workflows/wheels.yml | 121 | fi | COMMENT |
| LOW | .github/workflows/codeql.yml | 1 | # For most projects, this workflow file will not need changing; you simply need | COMMENT |
| LOW | .github/workflows/codeql.yml | 61 | # Add any setup steps before running the `github/codeql-action/init` action. | COMMENT |
| LOW | .github/workflows/gpu-ci.yml | 1 | name: GPU jobs | COMMENT |
| LOW | .github/workflows/linux_blas.yml | 1 | name: BLAS tests (Linux) | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/user_r.h | 141 | returns False. Use (a > REALmax/2) instead of (a == REALmax). | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/user_r.h | 221 | Note: may fail if more than 1 hour elapsed time | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/user_r.h | 281 | number generator [CACM 31:1195 '88]. It is included with Qhull. | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/user_r.h | 301 | COMMENT | |
| LOW | subprojects/qhull_r/libqhull_r/rboxlib_r.c | 21 | #include <setjmp.h> | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/stat_r.h | 441 | #define wadd_(id, val) {MAYdebugx; qh->qhstat.stats[id].r += (val);} | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/qhull_ra.h | 21 | full parens around (x?y:z) | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/qhull_ra.h | 41 | #include <math.h> | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/qhull_ra.h | 81 | #define trace1(args) {if (qh->IStracing >= 1) qh_fprintf args;} | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/qset_r.c | 21 | #include "libqhull_r.h" /* for qhT and QHULL_CRTDBG */ | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/libqhull_r.h | 101 | >--------------------------------</a><a name="boolT">-</a> | COMMENT |
| LOW | subprojects/qhull_r/libqhull_r/libqhull_r.h | 181 | */ | COMMENT |
| LOW | subprojects/duccfft/ducc0/infra/threading.h | 61 | // Mutex, UniqueLock, LockGuard, CondVar, set_active_pool(), | COMMENT |
| LOW | subprojects/duccfft/ducc0/infra/threading.h | 81 | #include <optional> | COMMENT |
| LOW | subprojects/duccfft/ducc0/infra/useful_macros.h | 61 | #define DUCC0_PREFETCH_W(addr) __builtin_prefetch(addr,1); | COMMENT |
| LOW | subprojects/duccfft/ducc0/infra/simd.h | 121 | using detail_simd::simd_exists; | COMMENT |
| LOW | subprojects/duccfft/ducc0/infra/simd.h | 141 | #elif defined(__GNUC__) | COMMENT |
| LOW | subprojects/duccfft/ducc0/infra/simd.h | 161 | #if defined(__ARM_FEATURE_SVE) && defined(__ARM_FEATURE_SVE_BITS) | COMMENT |
| LOW | subprojects/duccfft/ducc0/fft/fftnd_impl.h | 61 | #include <numeric> | COMMENT |
| LOW | subprojects/duccfft/ducc0/fft/fft1d_impl.h | 61 | COMMENT | |
| LOW | subprojects/duccfft/ducc0/bindings/pybind_utils.h | 41 | * You should have received a copy of the GNU General Public License | COMMENT |
| LOW | subprojects/duccfft/ducc0/bindings/pybind_utils.h | 61 | #include <nanobind/stl/variant.h> | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/update.py | 161 | # the "pole position" in his comments. CONMAT, CVAL, FVAL, and SIMI are updated accordingly. | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/update.py | 221 | if 0 <= jopt < num_vars: | COMMENT |
| LOW | …prima/pyprima/pyprima/src/pyprima/cobyla/initialize.py | 41 | assert num_constraints >= 0, f'M >= 0 {srname}' | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobyla.py | 341 | if xu is not None: | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 241 | # Powell did, we should use the UNUPDATED version, namely ZDASAV. | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 341 | sqrtd = max(np.sqrt(ss*dd + sd*sd), abs(sd), np.sqrt(ss * dd)) | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 361 | # !if (dd <= 0) then | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 461 | #====================# | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 481 | # delta = delta_in | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 41 | # Local variables | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 81 | COMMENT | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 121 | # Postconditions | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 141 | # We must initialize shortd, ratio, and jdrop_tr because these get defined on | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 161 | gamma3 = np.maximum(1, np.minimum(0.75 * gamma2, 1.5)) | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 181 | # Increase the penalty parameter CPEN, if needed, so that | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 201 | COMMENT | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 221 | d = trstlp(A, -conmat[:, num_vars], delta, g) | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 301 | # N.B.: | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 321 | # hence a bad model) rather than an improperly large DELTA, and it might | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 361 | # 2. If SIM[:, NUM_VARS] and RHO remain unchanged, then ADEQUATE_GEO will become True after at | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 381 | # especially for linearly constrained problems due to the factor TENTH (= ETA1). | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 401 | # make it work in COBYLA. As in NEWUOA, we recorded the errors of the recent models, and set | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 421 | # distinction makes no practical difference for CUTEst problems with at most 100 variables | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 441 | # is orthogonal to the face opposite to SIM(:, JDROP_GEO) and has a length of 0.5*DELTA, | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 601 | assert np.size(simi, 0) == num_vars and np.size(simi, 1) == num_vars | COMMENT |
| LOW | …pyprima/pyprima/pyprima/src/pyprima/cobyla/geometry.py | 41 | assert all(np.max(abs(sim[:, :num_vars]), axis=0) > 0) | COMMENT |
| 838 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | tools/write_release_and_log.py | 40 | # ---------------------------- | COMMENT |
| MEDIUM | tools/write_release_and_log.py | 42 | # ---------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 26 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 28 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 54 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 56 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 82 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 84 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 120 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 126 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 158 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 160 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | tools/generate_cython_abi_tests.py | 233 | # --------------------------------------------------------------------------- | STRING |
| MEDIUM | tools/generate_cython_abi_tests.py | 235 | # --------------------------------------------------------------------------- | STRING |
| MEDIUM | tools/authors.py | 174 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | tools/authors.py | 176 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | tools/authors.py | 233 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | …nchmarks/go_benchmark_functions/go_funcs_univariate.py | 6 | #----------------------------------------------------------------------- | COMMENT |
| MEDIUM | …nchmarks/go_benchmark_functions/go_funcs_univariate.py | 8 | #----------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | .github/workflows/linux_intel_oneAPI.yml | 12 | # ┌───────────── minute (0 - 59) | COMMENT |
| MEDIUM⚡ | .github/workflows/linux_intel_oneAPI.yml | 13 | # │ ┌───────────── hour (0 - 23) | COMMENT |
| MEDIUM⚡ | .github/workflows/linux_intel_oneAPI.yml | 14 | # │ │ ┌───────────── day of the month (1 - 31) | COMMENT |
| MEDIUM⚡ | .github/workflows/linux_intel_oneAPI.yml | 15 | # │ │ │ ┌───────────── month (1 - 12 or JAN-DEC) | COMMENT |
| MEDIUM⚡ | .github/workflows/linux_intel_oneAPI.yml | 16 | # │ │ │ │ ┌───────────── day of the week (0 - 6 or SUN-SAT) | COMMENT |
| MEDIUM⚡ | .github/workflows/windows_intel_oneAPI.yml | 13 | # ┌───────────── minute (0 - 59) | COMMENT |
| MEDIUM⚡ | .github/workflows/windows_intel_oneAPI.yml | 14 | # │ ┌───────────── hour (0 - 23) | COMMENT |
| MEDIUM⚡ | .github/workflows/windows_intel_oneAPI.yml | 15 | # │ │ ┌───────────── day of the month (1 - 31) | COMMENT |
| MEDIUM⚡ | .github/workflows/windows_intel_oneAPI.yml | 16 | # │ │ │ ┌───────────── month (1 - 12 or JAN-DEC) | COMMENT |
| MEDIUM⚡ | .github/workflows/windows_intel_oneAPI.yml | 17 | # │ │ │ │ ┌───────────── day of the week (0 - 6 or SUN-SAT) | COMMENT |
| MEDIUM⚡ | .github/workflows/array_api.yml | 12 | # ┌───────────── minute (0 - 59) | COMMENT |
| MEDIUM⚡ | .github/workflows/array_api.yml | 13 | # │ ┌───────────── hour (0 - 23) | COMMENT |
| MEDIUM⚡ | .github/workflows/array_api.yml | 14 | # │ │ ┌───────────── day of the month (1 - 31) | COMMENT |
| MEDIUM⚡ | .github/workflows/array_api.yml | 15 | # │ │ │ ┌───────────── month (1 - 12 or JAN-DEC) | COMMENT |
| MEDIUM⚡ | .github/workflows/array_api.yml | 16 | # │ │ │ │ ┌───────────── day of the week (0 - 6 or SUN-SAT) | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 279 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 281 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 286 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 288 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 317 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 319 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 327 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM⚡ | doc/source/conf.py | 329 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 29 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 31 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 199 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 201 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 300 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 302 | # ----------------------------------------------------------------------------- | COMMENT |
| MEDIUM | doc/source/conf.py | 344 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | doc/source/conf.py | 346 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | doc/source/conf.py | 391 | # ----------------------------------------------------------------------------- | STRING |
| MEDIUM | doc/source/conf.py | 393 | # ----------------------------------------------------------------------------- | STRING |
| MEDIUM | doc/source/conf.py | 422 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | doc/source/conf.py | 424 | #------------------------------------------------------------------------------ | STRING |
| MEDIUM | doc/source/conf.py | 436 | # ----------------------------------------------------------------------------- | STRING |
| MEDIUM | doc/source/conf.py | 438 | # ----------------------------------------------------------------------------- | STRING |
| MEDIUM | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 80 | # ================== | COMMENT |
| MEDIUM | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 82 | # ================== | COMMENT |
| MEDIUM | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 104 | # ================ | COMMENT |
| MEDIUM | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 106 | # ================ | COMMENT |
| 178 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | …hmarks/benchmarks/go_benchmark_functions/go_funcs_S.py | 260 | # This class defines the Schmidt-Vetters global optimization problem. This | COMMENT |
| MEDIUM | .github/label-filename.yml | 1 | # This file contains globs for automatically adding labels based on changed files, | COMMENT |
| MEDIUM | .github/label-title-on-close.yml | 1 | # This file contains regexes for automatically adding labels to PRs which have been merged. | COMMENT |
| MEDIUM | .github/label-title.yml | 1 | # This file contains regexes for automatically adding labels based on issue/PR titles, | COMMENT |
| MEDIUM | .github/workflows/linux_blas.yml | 3 | # This file is meant for testing LP64/ILP64 BLAS/LAPACK flavors and build | COMMENT |
| MEDIUM | doc/source/conf.py | 562 | # Create the admonition node, to be populated by `nested_parse` | STRING |
| MEDIUM | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobyla.py | 520 | # Define the indices of the nontrivial bound constraints. | COMMENT |
| MEDIUM | …pyprima/pyprima/pyprima/src/pyprima/cobyla/geometry.py | 51 | # The following code is Powell's scheme for defining JDROP. | COMMENT |
| MEDIUM | …ts/pyprima/pyprima/pyprima/src/pyprima/common/infos.py | 26 | # The following codes are used by ERROR STOP as stop-codes, which should be default integers. | COMMENT |
| MEDIUM | scipy/cluster/hierarchy/_hierarchy_impl.py | 1369 | # Create a list full of None's to store the node objects | COMMENT |
| MEDIUM | scipy/cluster/hierarchy/_hierarchy_impl.py | 1372 | # Create the nodes corresponding to the n original objects. | COMMENT |
| MEDIUM | scipy/ndimage/interpolation.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/ndimage/morphology.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/ndimage/fourier.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/ndimage/filters.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/ndimage/measurements.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/decomp_qr.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/misc.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/decomp_cholesky.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/decomp_lu.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/decomp_svd.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/_matfuncs_sqrtm.py | 73 | # Define the index range covered by each block. | COMMENT |
| MEDIUM | scipy/linalg/matfuncs.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/basic.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/decomp.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/special_matrices.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/decomp_schur.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/linalg/_special_matrices.py | 257 | # This function is a slightly modified version of the | STRING |
| MEDIUM | scipy/linalg/tests/test_decomp.py | 3119 | # Create an array with boundary offset 4 | COMMENT |
| MEDIUM | scipy/linalg/tests/test_decomp.py | 3134 | # Create an array with boundary offset 4 | COMMENT |
| MEDIUM | scipy/linalg/tests/test_decomp.py | 3147 | # Create an array with boundary offset 8 | COMMENT |
| MEDIUM | scipy/linalg/tests/test_lapack.py | 1264 | # Create the RFP array manually (n is even!) | COMMENT |
| MEDIUM | scipy/linalg/tests/test_lapack.py | 1316 | # Create the TP array manually | COMMENT |
| MEDIUM | scipy/linalg/tests/test_procrustes.py | 91 | # Create a perturbed input matrix. | COMMENT |
| MEDIUM | scipy/optimize/tnc.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/optimize.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/linesearch.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/nonlin.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/lbfgsb.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/zeros.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/_shgo.py | 768 | # Initialize return object | COMMENT |
| MEDIUM | scipy/optimize/slsqp.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/minpack.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/_basinhopping.py | 43 | """This class implements the core of the basinhopping algorithm. | STRING |
| MEDIUM | scipy/optimize/_slsqp_py.py | 573 | # The following functions modify their first input argument in-place. | COMMENT |
| MEDIUM | scipy/optimize/minpack2.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/cobyla.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/moduleTNC.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/optimize/_differentialevolution.py | 540 | """This class implements the differential evolution solver | STRING |
| MEDIUM | scipy/optimize/_differentialevolution.py | 1054 | # Create an array for population of candidate solutions. | STRING |
| MEDIUM | scipy/optimize/_differentialevolution.py | 1087 | # Create an array for population of candidate solutions. | STRING |
| MEDIUM | scipy/optimize/_dcsrch.py | 342 | # Initialize local variables. | COMMENT |
| MEDIUM | scipy/optimize/_dcsrch.py | 402 | # Define the modified function and derivative values. | COMMENT |
| MEDIUM | scipy/optimize/tests/test_nnls.py | 89 | # The following code sets up a system of equations such that | COMMENT |
| MEDIUM | scipy/optimize/tests/test_nnls.py | 147 | # The following code sets up a system of equations such that | COMMENT |
| MEDIUM | scipy/optimize/_shgo_lib/_complex.py | 1098 | # Create the vertex origin | COMMENT |
| MEDIUM | scipy/integrate/quadpack.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/integrate/vode.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/integrate/lsoda.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| MEDIUM | scipy/integrate/dop.py | 1 | # This file is not meant for public use and will be removed in SciPy v2.0.0. | COMMENT |
| 153 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 44 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 45 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 46 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 47 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 48 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 49 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 50 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 51 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 52 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 53 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 54 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 55 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 56 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 57 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 58 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 59 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 60 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 61 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 62 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 63 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 64 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 65 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 66 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 67 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 68 | CODE | |
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 69 | CODE | |
| LOW | …arks/benchmarks/go_benchmark_functions/go_benchmark.py | 4 | CODE | |
| LOW | doc/source/tutorial/conftest.py | 1 | CODE | |
| LOW | …ojects/pyprima/pyprima/pyprima/src/pyprima/__init__.py | 2 | CODE | |
| LOW | scipy/conftest.py | 35 | CODE | |
| LOW | scipy/conftest.py | 77 | CODE | |
| LOW | scipy/conftest.py | 84 | CODE | |
| LOW | scipy/__init__.py | 55 | CODE | |
| LOW | scipy/__init__.py | 47 | CODE | |
| LOW | scipy/__init__.py | 82 | CODE | |
| LOW | scipy/_distributor_init.py | 16 | CODE | |
| LOW | scipy/cluster/__init__.py | 27 | CODE | |
| LOW | scipy/cluster/__init__.py | 27 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| LOW | scipy/cluster/hierarchy/__init__.py | 100 | CODE | |
| 609 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .spin/cmds.py | 64 | CODE | |
| LOW | .spin/cmds.py | 188 | CODE | |
| LOW | .spin/cmds.py | 1140 | CODE | |
| LOW | tools/check_python_h_first.py | 66 | CODE | |
| LOW | tools/refguide_check.py | 207 | CODE | |
| LOW | tools/refguide_check.py | 495 | CODE | |
| LOW | tools/numpydoc_lint.py | 616 | CODE | |
| LOW | tools/refguide_summaries.py | 43 | CODE | |
| LOW | tools/check_unicode.py | 26 | CODE | |
| LOW | tools/check_test_name.py | 96 | CODE | |
| LOW | tools/generate_f2pymod.py | 68 | CODE | |
| LOW | tools/generate_f2pymod.py | 140 | CODE | |
| LOW | tools/generate_f2pymod.py | 224 | CODE | |
| LOW | benchmarks/benchmarks/optimize.py | 543 | CODE | |
| LOW | benchmarks/benchmarks/lsq_problems.py | 466 | CODE | |
| LOW | benchmarks/benchmarks/linalg.py | 112 | CODE | |
| LOW | benchmarks/benchmarks/common.py | 80 | CODE | |
| LOW | benchmarks/benchmarks/common.py | 230 | CODE | |
| LOW | benchmarks/benchmarks/stats.py | 220 | CODE | |
| LOW | benchmarks/benchmarks/stats.py | 387 | CODE | |
| LOW | benchmarks/benchmarks/sparse.py | 102 | CODE | |
| LOW | benchmarks/benchmarks/fft_basic.py | 245 | CODE | |
| LOW | benchmarks/benchmarks/fft_basic.py | 284 | CODE | |
| LOW | …hmarks/benchmarks/go_benchmark_functions/go_funcs_D.py | 242 | CODE | |
| LOW | benchmarks/benchmarks/cutest/dfovec.py | 6 | CODE | |
| LOW | benchmarks/benchmarks/cutest/calfun.py | 16 | CODE | |
| LOW | benchmarks/benchmarks/cutest/dfoxs.py | 6 | CODE | |
| LOW | doc/source/array_api_capabilities_table.py | 110 | CODE | |
| LOW | …ojects/pyprima/pyprima/pyprima/src/pyprima/__init__.py | 24 | CODE | |
| LOW | …ojects/pyprima/pyprima/pyprima/src/pyprima/__init__.py | 37 | CODE | |
| LOW | …ojects/pyprima/pyprima/pyprima/src/pyprima/__init__.py | 79 | CODE | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobyla.py | 487 | CODE | |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 116 | CODE | |
| LOW | …ts/pyprima/pyprima/pyprima/src/pyprima/common/ratio.py | 14 | CODE | |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 27 | CODE | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/common/linalg.py | 59 | CODE | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/common/linalg.py | 106 | CODE | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/common/linalg.py | 198 | CODE | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/common/linalg.py | 234 | CODE | |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/preproc.py | 20 | CODE | |
| LOW | …pyprima/pyprima/pyprima/src/pyprima/common/_project.py | 17 | CODE | |
| LOW | scipy/conftest.py | 111 | CODE | |
| LOW | scipy/conftest.py | 374 | CODE | |
| LOW | scipy/conftest.py | 596 | CODE | |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 2423 | CODE | |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 2817 | CODE | |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 3480 | CODE | |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 1118 | CODE | |
| LOW | scipy/ndimage/_ni_support.py | 37 | CODE | |
| LOW | scipy/ndimage/_ni_support.py | 78 | CODE | |
| LOW | scipy/ndimage/_ni_support.py | 110 | CODE | |
| LOW | scipy/ndimage/_support_alternative_backends.py | 37 | CODE | |
| LOW | scipy/ndimage/_support_alternative_backends.py | 38 | CODE | |
| LOW | scipy/ndimage/_support_alternative_backends.py | 40 | CODE | |
| LOW | scipy/ndimage/_filters.py | 1928 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 216 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1292 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1987 | CODE | |
| LOW | scipy/linalg/_matfuncs_inv_ssq.py | 311 | CODE | |
| LOW | scipy/linalg/_matfuncs_inv_ssq.py | 516 | CODE | |
| 431 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …nchmarks/benchmarks/go_benchmark_functions/__init__.py | 71 | __all__ = [s for s in dir() if not s.startswith('_')] | CODE |
| LOW | …chmarks/benchmarks/linprog_benchmark_files/__init__.py | 19 | __all__ = [s for s in dir() if not s.startswith('_')] | CODE |
| LOW | scipy/cluster/__init__.py | 25 | __all__ = ['vq', 'hierarchy'] | CODE |
| LOW | scipy/cluster/hierarchy/__init__.py | 109 | __all__ = ['ClusterNode', 'ClusterWarning', 'DisjointSet', 'average', 'centroid', | CODE |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 55 | __all__ = ['ClusterNode', 'ClusterWarning', 'DisjointSet', | CODE |
| LOW | scipy/cluster/vq/_vq_impl.py | 14 | __all__ = ['ClusterError', 'kmeans', 'kmeans2', 'py_vq', 'vq', 'whiten'] | CODE |
| LOW | scipy/cluster/vq/__init__.py | 77 | __all__ = ["ClusterError", "kmeans", "kmeans2", "vq", "whiten"] | CODE |
| LOW | scipy/ndimage/interpolation.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/ndimage/_measurements.py | 37 | __all__ = ['label', 'find_objects', 'labeled_comprehension', 'sum', 'mean', | CODE |
| LOW | scipy/ndimage/_ni_docstrings.py | 6 | __all__ = ['docfiller'] | CODE |
| LOW | scipy/ndimage/morphology.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/ndimage/fourier.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/ndimage/_fourier.py | 36 | __all__ = ['fourier_gaussian', 'fourier_uniform', 'fourier_ellipsoid', | CODE |
| LOW | scipy/ndimage/_filters.py | 45 | __all__ = ['correlate1d', 'convolve1d', 'gaussian_filter1d', 'gaussian_filter', | CODE |
| LOW | scipy/ndimage/_morphology.py | 39 | __all__ = ['iterate_structure', 'generate_binary_structure', 'binary_erosion', | CODE |
| LOW | scipy/ndimage/filters.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/ndimage/measurements.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/ndimage/_interpolation.py | 44 | __all__ = ['spline_filter1d', 'spline_filter', 'geometric_transform', | CODE |
| LOW | scipy/linalg/decomp_qr.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/misc.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_sketches.py | 11 | __all__ = ['clarkson_woodruff_transform'] | CODE |
| LOW | scipy/linalg/decomp_cholesky.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_decomp_cholesky.py | 14 | __all__ = ['cholesky', 'cho_factor', 'cho_solve', 'cholesky_banded', | CODE |
| LOW | scipy/linalg/decomp_lu.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/decomp_svd.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_procrustes.py | 11 | __all__ = ['orthogonal_procrustes'] | CODE |
| LOW | scipy/linalg/_matfuncs_sqrtm.py | 7 | __all__ = [] | CODE |
| LOW | scipy/linalg/matfuncs.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_decomp_qr.py | 15 | __all__ = ['qr', 'qr_multiply', 'rq'] | CODE |
| LOW | scipy/linalg/_decomp_svd.py | 14 | __all__ = ['svd', 'svdvals', 'diagsvd', 'orth', 'subspace_angles', 'null_space'] | CODE |
| LOW | scipy/linalg/_decomp.py | 15 | __all__ = ['eig', 'eigvals', 'eigh', 'eigvalsh', | CODE |
| LOW | scipy/linalg/__init__.py | 229 | __all__ = [s for s in dir() if not s.startswith('_')] | CODE |
| LOW | scipy/linalg/_matfuncs.py | 22 | __all__ = ['expm', 'cosm', 'sinm', 'tanm', 'coshm', 'sinhm', 'tanhm', 'logm', | CODE |
| LOW | scipy/linalg/_decomp_lu.py | 16 | __all__ = ['lu', 'lu_solve', 'lu_factor'] | CODE |
| LOW | scipy/linalg/_decomp_schur.py | 12 | __all__ = ['schur', 'rsf2csf'] | CODE |
| LOW | scipy/linalg/_solvers.py | 25 | __all__ = ['solve_sylvester', | CODE |
| LOW | scipy/linalg/basic.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_decomp_polar.py | 6 | __all__ = ['polar'] | CODE |
| LOW | scipy/linalg/decomp.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/interpolative.py | 363 | __all__ = [ | STRING |
| LOW | scipy/linalg/blas.py | 233 | __all__ = ['get_blas_funcs', 'find_best_blas_type'] | CODE |
| LOW | scipy/linalg/special_matrices.py | 7 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_decomp_ldl.py | 12 | __all__ = ['ldl'] | CODE |
| LOW | scipy/linalg/_decomp_cossin.py | 8 | __all__ = ['cossin'] | CODE |
| LOW | scipy/linalg/decomp_schur.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/linalg/_decomp_qz.py | 10 | __all__ = ['qz', 'ordqz'] | CODE |
| LOW | scipy/linalg/_expm_frechet.py | 7 | __all__ = ['expm_frechet', 'expm_cond'] | CODE |
| LOW | scipy/linalg/_basic.py | 21 | __all__ = ['solve', 'solve_triangular', 'solveh_banded', 'solve_banded', | CODE |
| LOW | scipy/linalg/_misc.py | 8 | __all__ = ['LinAlgError', 'LinAlgWarning', 'norm', 'bandwidth'] | CODE |
| LOW | scipy/linalg/lapack.py | 917 | __all__ = ['get_lapack_funcs'] | CODE |
| LOW⚡ | scipy/linalg/_special_matrices.py | 10 | __all__ = ['toeplitz', 'circulant', 'hankel', | CODE |
| LOW | scipy/optimize/tnc.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/optimize/optimize.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/optimize/linesearch.py | 8 | __all__ = ["line_search"] # noqa: F822 | CODE |
| LOW | scipy/optimize/nonlin.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/optimize/_root.py | 8 | __all__ = ['root'] | CODE |
| LOW | scipy/optimize/lbfgsb.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/optimize/zeros.py | 8 | __all__ = [ # noqa: F822 | CODE |
| LOW | scipy/optimize/_cobyla_py.py | 20 | __all__ = ['fmin_cobyla'] | CODE |
| LOW | scipy/optimize/_shgo.py | 19 | __all__ = ['shgo'] | CODE |
| 270 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobyla.py | 56 | CODE | |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/common/linalg.py | 132 | CODE | |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/preproc.py | 20 | CODE | |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 3028 | CODE | |
| LOW | scipy/cluster/hierarchy/_hierarchy_impl.py | 3480 | CODE | |
| LOW | scipy/ndimage/_filters.py | 206 | CODE | |
| LOW | scipy/ndimage/_filters.py | 1928 | CODE | |
| LOW | scipy/ndimage/_filters.py | 2298 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 305 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 407 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 546 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 676 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1174 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1292 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1449 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1541 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1633 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1754 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1816 | CODE | |
| LOW | scipy/ndimage/_morphology.py | 1902 | CODE | |
| LOW | scipy/ndimage/_interpolation.py | 229 | CODE | |
| LOW | scipy/linalg/_decomp.py | 312 | CODE | |
| LOW | scipy/linalg/_decomp.py | 971 | CODE | |
| LOW | scipy/linalg/_generate_pyx.py | 737 | CODE | |
| LOW | scipy/optimize/_linprog_ip.py | 839 | CODE | |
| LOW | scipy/optimize/_root.py | 280 | CODE | |
| LOW | scipy/optimize/_root.py | 338 | CODE | |
| LOW | scipy/optimize/_cobyla_py.py | 23 | CODE | |
| LOW | scipy/optimize/_cobyla_py.py | 186 | CODE | |
| LOW | scipy/optimize/_shgo.py | 22 | CODE | |
| LOW | scipy/optimize/_shgo.py | 489 | CODE | |
| LOW | scipy/optimize/_optimize.py | 577 | CODE | |
| LOW | scipy/optimize/_optimize.py | 701 | CODE | |
| LOW | scipy/optimize/_optimize.py | 1201 | CODE | |
| LOW | scipy/optimize/_optimize.py | 1345 | CODE | |
| LOW | scipy/optimize/_optimize.py | 1536 | CODE | |
| LOW | scipy/optimize/_optimize.py | 1719 | CODE | |
| LOW | scipy/optimize/_optimize.py | 1881 | CODE | |
| LOW | scipy/optimize/_optimize.py | 2001 | CODE | |
| LOW | scipy/optimize/_optimize.py | 2436 | CODE | |
| LOW | scipy/optimize/_optimize.py | 3271 | CODE | |
| LOW | scipy/optimize/_optimize.py | 3413 | CODE | |
| LOW | scipy/optimize/_linprog_doc.py | 8 | CODE | |
| LOW | scipy/optimize/_linprog_doc.py | 292 | CODE | |
| LOW | scipy/optimize/_linprog_doc.py | 533 | CODE | |
| LOW | scipy/optimize/_linprog_doc.py | 761 | CODE | |
| LOW | scipy/optimize/_linprog_doc.py | 1092 | CODE | |
| LOW | scipy/optimize/_linprog_doc.py | 1278 | CODE | |
| LOW | scipy/optimize/_minimize.py | 54 | CODE | |
| LOW | scipy/optimize/_lbfgsb_py.py | 93 | CODE | |
| LOW | scipy/optimize/_lbfgsb_py.py | 272 | CODE | |
| LOW | scipy/optimize/_zeros_py.py | 122 | CODE | |
| LOW | scipy/optimize/_basinhopping.py | 351 | CODE | |
| LOW | scipy/optimize/_linprog.py | 178 | CODE | |
| LOW | scipy/optimize/_slsqp_py.py | 71 | CODE | |
| LOW | scipy/optimize/_slsqp_py.py | 220 | CODE | |
| LOW | scipy/optimize/_elementwise.py | 650 | CODE | |
| LOW | scipy/optimize/_linesearch.py | 39 | CODE | |
| LOW | scipy/optimize/_linesearch.py | 110 | CODE | |
| LOW | scipy/optimize/_linesearch.py | 204 | CODE | |
| 163 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/check_unicode.py | 42 | # Read the file as bytes, and check for any bytes greater than 127. | COMMENT |
| LOW | tools/ninjatracing.py | 103 | # Check if any event duration is greater than the duration from ninja. | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 290 | # Set sdirn to the direction of the next change to the current vector of variables | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 322 | # Set sdirn to the direction of the next change to the current vector of variables. | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 377 | # Set dnew to the new variables if step is the steplength, and reduce cviol to the corresponding | COMMENT |
| LOW | …rima/pyprima/pyprima/src/pyprima/cobyla/trustregion.py | 388 | # Set vmultd to the vmultc vector that would occur if d became dnew. A device is included to | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 330 | delta = rho # Set delta to rho when it is close to or below. | CODE |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobylb.py | 335 | # Set JDROP_TR to the index of the vertex to be replaced with X. JDROP_TR = 0 means there | COMMENT |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 77 | elif iprint > 0: # Print the message to the standard out. | CODE |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 79 | else: # Print the message to a file named FNAME. | CODE |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 118 | # Print the message. | COMMENT |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 140 | elif iprint > 0: # Print the message to the standard out. | CODE |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 142 | else: # Print the message to a file named FNAME. | CODE |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 184 | # Print the message. | COMMENT |
| LOW⚡ | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 210 | elif iprint > 0: # Print the message to the standard out. | CODE |
| LOW⚡ | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 212 | else: # Print the message to a file named FNAME. | CODE |
| LOW⚡ | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 215 | # Print the message. | COMMENT |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 241 | elif iprint > 0: # Print the message to the standard out. | CODE |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 243 | else: # Print the message to a file named FNAME. | CODE |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/message.py | 281 | # Print the message. | COMMENT |
| LOW | scipy/conftest.py | 337 | # Check if ``uses_xp_capabilities`` mark is present. | COMMENT |
| LOW | scipy/linalg/_decomp.py | 610 | # Check if we had a successful exit | STRING |
| LOW | scipy/linalg/_generate_pyx.py | 99 | # Check if scipy's cython_blas exports blas_int (ILP64 support). | STRING |
| LOW | scipy/linalg/_generate_pyx.py | 198 | # Check if scipy's cython_lapack exports blas_int (ILP64 support). | STRING |
| LOW | scipy/linalg/_solvers.py | 844 | # Check if the data matrices q, r are (sufficiently) hermitian | STRING |
| LOW | scipy/linalg/_solvers.py | 855 | # Check if the generalized case is required with omitted arguments | STRING |
| LOW | scipy/linalg/tests/test_decomp.py | 2242 | # Check if the result is actually correct & check overwrite behavior | COMMENT |
| LOW | scipy/optimize/_shgo.py | 539 | # Check if bounds are correctly specified | COMMENT |
| LOW | scipy/optimize/_linprog_simplex.py | 368 | # Check if any artificial variables are still in the basis. | COMMENT |
| LOW | scipy/optimize/_hessian_update_strategy.py | 404 | # Check if curvature condition is violated | COMMENT |
| LOW | scipy/optimize/_dual_annealing.py | 439 | # Check if is valid value | COMMENT |
| LOW | scipy/optimize/_trustregion_exact.py | 327 | # Check if factorization succeeded | COMMENT |
| LOW | scipy/optimize/_trustregion_exact.py | 383 | # Check if the factorization have succeeded | COMMENT |
| LOW | scipy/optimize/tests/test_optimize.py | 51 | # Verify if check_grad is able to estimate the derivative of the | COMMENT |
| LOW | scipy/optimize/tests/test_optimize.py | 75 | # Check if the epsilon parameter is being considered. | COMMENT |
| LOW | scipy/optimize/tests/test__dual_annealing.py | 337 | # Check if update is accepted. | COMMENT |
| LOW⚡ | scipy/optimize/tests/test_trustregion_exact.py | 92 | # Check if the leading submatrix is singular. | COMMENT |
| LOW⚡ | scipy/optimize/tests/test_trustregion_exact.py | 95 | # Check if `v` fulfil the specified properties | COMMENT |
| LOW⚡ | scipy/optimize/tests/test_trustregion_exact.py | 119 | # Check if the leading submatrix is singular. | COMMENT |
| LOW⚡ | scipy/optimize/tests/test_trustregion_exact.py | 122 | # Check if `v` fulfil the specified properties | COMMENT |
| LOW | scipy/optimize/tests/test_trustregion_exact.py | 144 | # Check if the leading submatrix is singular | COMMENT |
| LOW | scipy/optimize/tests/test_trustregion_exact.py | 147 | # Check if `v` fulfil the specified properties | COMMENT |
| LOW⚡ | scipy/optimize/tests/test_trustregion_exact.py | 356 | # Check if it respect k_trf | COMMENT |
| LOW⚡ | scipy/optimize/tests/test_trustregion_exact.py | 363 | # Check if it respect k_opt | COMMENT |
| LOW | scipy/optimize/_shgo_lib/_complex.py | 448 | # Check if generator already exists | COMMENT |
| LOW | scipy/optimize/_shgo_lib/_complex.py | 1116 | # Check if connected, else s_i is not a simplex | COMMENT |
| LOW | scipy/optimize/_lsq/common.py | 120 | # Check if J has full rank and try Gauss-Newton step. | COMMENT |
| LOW | scipy/optimize/_lsq/trf.py | 167 | # Check if reflection step is available. | COMMENT |
| LOW | scipy/optimize/_trustregion_constr/qp_subproblem.py | 217 | # Check if intersection is feasible | COMMENT |
| LOW | scipy/optimize/_trustregion_constr/qp_subproblem.py | 592 | # Check if ``x`` is inside the box and start counter if it is not. | COMMENT |
| LOW | scipy/optimize/_trustregion_constr/projections.py | 47 | # Check if norms are zero | COMMENT |
| LOW | scipy/integrate/tests/test_integrate.py | 277 | # Check if solout works even if it is set after the initial value. | COMMENT |
| LOW | scipy/io/_netcdf.py | 605 | # Read file headers and set data. | COMMENT |
| LOW | scipy/io/_idl.py | 798 | # Check if the end of the file has been reached | COMMENT |
| LOW | scipy/io/_idl.py | 826 | # Set f to be the decompressed file, and skip the first four bytes | COMMENT |
| LOW | scipy/io/_idl.py | 841 | # Close the file | COMMENT |
| LOW | scipy/io/tests/test_netcdf.py | 135 | # Read file from fileobj, with mmap | COMMENT |
| LOW⚡ | scipy/io/tests/test_netcdf.py | 438 | # Open the file in append mode and add data | COMMENT |
| LOW⚡ | scipy/io/tests/test_netcdf.py | 444 | # Read the file and check that append worked | COMMENT |
| LOW⚡ | scipy/io/tests/test_netcdf.py | 452 | # Read the file and check that 'data' was not saved as user defined | COMMENT |
| 39 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | pixi.toml | 565 | # Note: we need BLAS support in Meson merged before we can simply use `-Dblas=mkl` | COMMENT |
| LOW | tools/gh_lists.py | 83 | # just use the first 80 characters, with ellipses. | COMMENT |
| LOW | benchmarks/benchmarks/optimize.py | 546 | # if so, then just return the ret_value | COMMENT |
| LOW | benchmarks/benchmarks/common.py | 316 | # Unknown, just return whatever is here. | COMMENT |
| LOW | .github/ccache/action.yml | 24 | # Note: we can't simply use restore followed by save because composite actions | COMMENT |
| MEDIUM | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/update.py | 138 | # Essentially jopt = np.argmin(phi). However, we keep jopt = num_vars unless there | COMMENT |
| LOW | …s/pyprima/pyprima/pyprima/src/pyprima/cobyla/cobyla.py | 454 | # In MATLAB/Python/Julia/R implementation, we should simply set MAXHIST = MAXFUN and initialize | COMMENT |
| LOW | …/pyprima/pyprima/pyprima/src/pyprima/common/preproc.py | 101 | # We cannot simply set MAXFILT = MIN(MAXFILT, MAXHISTMEM/...), as they may not have | COMMENT |
| MEDIUM | scipy/linalg/tests/test_decomp_lu.py | 190 | # Those matrices are more robust to detect problems in permutation | COMMENT |
| MEDIUM | scipy/linalg/src/_matfuncs_expm.c | 1097 | // We utilize the unused powers of Am as scratch memory depending on m value. | COMMENT |
| MEDIUM | scipy/linalg/src/_matfuncs_expm.c | 1312 | // We utilize the unused powers of Am as scratch memory depending on m value. | COMMENT |
| MEDIUM | scipy/linalg/src/_matfuncs_expm.c | 1530 | // We utilize the unused powers of Am as scratch memory depending on m value. | COMMENT |
| MEDIUM | scipy/linalg/src/_matfuncs_expm.c | 1866 | // We utilize the unused powers of Am as scratch memory depending on m value. | COMMENT |
| LOW | scipy/optimize/_optimize.py | 3210 | # If this is the case, then we can just return (0, 0) | STRING |
| MEDIUM | scipy/optimize/_bracket.py | 290 | # To facilitate this, `work.active` contains a unit integer index of | COMMENT |
| LOW | scipy/optimize/_lsq/least_squares.py | 70 | # lmdif and just use lmder. | COMMENT |
| LOW | scipy/optimize/_lsq/dogbox.py | 135 | # the bounds, and just return it constrained version if not. But in a | COMMENT |
| MEDIUM | scipy/optimize/_lsq/common.py | 721 | """Scale Jacobian and residuals for a robust loss function. | STRING |
| LOW | scipy/optimize/_trustregion_constr/tr_interior_point.py | 88 | # and just set both equality and inequality | COMMENT |
| MEDIUM | scipy/optimize/src/nnls.c | 27 | // Essentially a permuted gemv operation via BLAS ddot, in NumPy notation; | COMMENT |
| LOW | scipy/integrate/_quadrature.py | 127 | # Cannot just use the broadcasted arrays that are returned | STRING |
| MEDIUM | scipy/integrate/_lebedev.py | 52 | # combined with radial quadratures to provide robust cubature formulae. For | COMMENT |
| LOW⚡ | scipy/_lib/_util.py | 902 | # whenever mdhaber/marray#89 is resolved, could just return `res` | COMMENT |
| LOW | scipy/special/_mptestutils.py | 53 | # Outside of linspace range; just return a logspace. | COMMENT |
| LOW | scipy/special/_mptestutils.py | 56 | # Outside of logspace range; just return a linspace | COMMENT |
| LOW | scipy/special/_support_alternative_backends.py | 200 | # set in JAX. One cannot just use xp_promote for the input dtypes because | COMMENT |
| LOW | scipy/special/_support_alternative_backends.py | 207 | # JAX uses NumPy dtypes so we can just pass these directly to | COMMENT |
| LOW | scipy/special/tests/test_ufunc_signatures.py | 104 | # since we only care about dtypes and not values here, just use an appropriately | COMMENT |
| MEDIUM | scipy/differentiate/_differentiate.py | 239 | https://www.mathworks.com/matlabcentral/fileexchange/13490-adaptive-robust-numerical-differentiation | STRING |
| LOW | scipy/interpolate/_rbfinterp.py | 474 | # If this number is below 1e6 we just use 1e6 | STRING |
| LOW | scipy/interpolate/_interpolate.py | 418 | # For slinear or zero order spline, we just pass nans through. | COMMENT |
| LOW | scipy/sparse/_coo.py | 141 | # index overflow. This is why we can't simply call | COMMENT |
| MEDIUM | scipy/sparse/linalg/_svdp.py | 242 | # work arrays to utilize BLAS level 3 operations. In almost all relevant | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_eigen/arpack/arpack.py | 19 | # may use eigsh(), but eigsh() will simply call eigs() | COMMENT |
| MEDIUM | scipy/sparse/linalg/_eigen/tests/test_svds.py | 863 | # I can't see a robust relationship between `ncv` and relevant outputs | COMMENT |
| MEDIUM | scipy/sparse/linalg/tests/test_propack.py | 35 | # It is not very robust to arbitrary seeding since partial reorthogonalization | COMMENT |
| MEDIUM | scipy/sparse/tests/test_base.py | 955 | # comprehensive test | COMMENT |
| LOW | scipy/signal/_ltisys.py | 2217 | # Zero input: just use matrix exponential | STRING |
| MEDIUM | scipy/signal/tests/_scipy_spectral_test_shim.py | 1 | """Helpers to utilize existing stft / istft tests for testing `ShortTimeFFT`. | STRING |
| MEDIUM | scipy/signal/windows/_windows.py | 2207 | # sufficiently smooth functions, and more robust than relying on an | STRING |
| MEDIUM | scipy/stats/_stats_py.py | 9626 | # To facilitate comparison with [1], we'll use variable names that | STRING |
| MEDIUM | scipy/stats/_stats_py.py | 10674 | # Written to match [1] Equation 27 closely to facilitate review. | STRING |
| MEDIUM | scipy/stats/_qmvnt.py | 244 | # included in this file to facilitate the resolution of gh-8367, gh-16142, and | COMMENT |
| MEDIUM | scipy/stats/_discrete_distns.py | 1558 | # Thus, we can leverage the following: | STRING |
| LOW | scipy/stats/_continuous_distns.py | 470 | # Without this check, this function would just return the | COMMENT |
| LOW | scipy/stats/_continuous_distns.py | 3675 | # Without this check, this function would just return the | COMMENT |
| LOW | scipy/stats/_continuous_distns.py | 6286 | # Without this check, this function would just return the | STRING |
| LOW | scipy/stats/_continuous_distns.py | 8527 | # to handle inside pearson3._pdf) or negative. So just return True | STRING |
| LOW | scipy/stats/_distribution_infrastructure.py | 101 | # mind NaNs; they just return NaN. The behavior "If x_i is NaN, the result | COMMENT |
| MEDIUM | scipy/stats/_distribution_infrastructure.py | 1115 | # cases. That would be a bit more robust, but it would also be quite | STRING |
| MEDIUM | scipy/stats/_distribution_infrastructure.py | 1932 | # raises a distribution-specific error message to facilitate | STRING |
| MEDIUM | scipy/stats/tests/test_mstats_basic.py | 1098 | # method is robust to outliers: brekdown point of 50% | COMMENT |
| MEDIUM | scipy/stats/tests/test_continuous_basic.py | 143 | # TODO: multiple checks in this function are not robust, tweaking the | COMMENT |
| MEDIUM | scipy/stats/tests/test_hypotests.py | 2004 | # because games_howell leverage _tukey_hsd_iv() | STRING |
| LOW | scipy/stats/tests/test_axis_nan_policy.py | 262 | # For some functions, nan_policy='propagate' should not just return NaNs | COMMENT |
| MEDIUM | scipy/stats/tests/test_correlation.py | 394 | # method is robust to outliers: breakdown point of 50% | COMMENT |
| LOW | scipy/stats/tests/test_distributions.py | 5045 | # this try-except wrapper and just call the function. | COMMENT |
| MEDIUM | scipy/stats/tests/data/_mvt.py | 8 | # Defined to facilitate comparison between translation and source | COMMENT |
| MEDIUM | scipy/stats/tests/data/_mvt.py | 14 | # Defined to facilitate comparison between translation and source | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | scipy/linalg/_matfuncs_inv_ssq.py | 0 | efficiently estimate the 1-norm of a^p. parameters ---------- a : ndarray matrix whose 1-norm of a power is to be comput | STRING |
| HIGH | scipy/sparse/linalg/_expm_multiply.py | 0 | efficiently estimate the 1-norm of a^p. parameters ---------- a : ndarray matrix whose 1-norm of a power is to be comput | STRING |
| HIGH | scipy/sparse/linalg/_matfuncs.py | 0 | efficiently estimate the 1-norm of a^p. parameters ---------- a : ndarray matrix whose 1-norm of a power is to be comput | STRING |
| HIGH | scipy/linalg/tests/test_cython_abi.py | 0 | regression test for the cython_special binary interface. the __pyx_capi__ dict of each module contains pycapsule objects | STRING |
| HIGH | scipy/optimize/tests/test_cython_abi.py | 0 | regression test for the cython_special binary interface. the __pyx_capi__ dict of each module contains pycapsule objects | STRING |
| HIGH | scipy/special/tests/test_cython_abi.py | 0 | regression test for the cython_special binary interface. the __pyx_capi__ dict of each module contains pycapsule objects | STRING |
| HIGH | scipy/linalg/tests/test_cython_abi.py | 0 | return {name: signature} for every entry in module.__pyx_capi__. | STRING |
| HIGH | scipy/optimize/tests/test_cython_abi.py | 0 | return {name: signature} for every entry in module.__pyx_capi__. | STRING |
| HIGH | scipy/special/tests/test_cython_abi.py | 0 | return {name: signature} for every entry in module.__pyx_capi__. | STRING |
| HIGH | scipy/io/_mmio.py | 0 | the default value for `spmatrix` is changing to `false` in v1.20. that means the default return type will be a sparse ar | STRING |
| HIGH | scipy/io/_fast_matrix_market/__init__.py | 0 | the default value for `spmatrix` is changing to `false` in v1.20. that means the default return type will be a sparse ar | STRING |
| HIGH | scipy/io/_harwell_boeing/hb.py | 0 | the default value for `spmatrix` is changing to `false` in v1.20. that means the default return type will be a sparse ar | STRING |
| HIGH | scipy/io/matlab/_mio.py | 0 | the default value for `spmatrix` is changing to `false` in v1.20. that means the default return type will be a sparse ar | STRING |
| HIGH | scipy/sparse/_bsr.py | 0 | swap the members of x if this is a column-oriented matrix | STRING |
| HIGH | scipy/sparse/_csr.py | 0 | swap the members of x if this is a column-oriented matrix | STRING |
| HIGH | scipy/sparse/_csc.py | 0 | swap the members of x if this is a column-oriented matrix | STRING |
| HIGH | scipy/sparse/_csr.py | 0 | returns a copy of row i of the matrix, as a (1 x n) sparse matrix (row vector). | STRING |
| HIGH | scipy/sparse/_csc.py | 0 | returns a copy of row i of the matrix, as a (1 x n) sparse matrix (row vector). | STRING |
| HIGH | scipy/sparse/_matrix.py | 0 | returns a copy of row i of the matrix, as a (1 x n) sparse matrix (row vector). | STRING |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .spin/cmds.py | 1085 | except Exception: | CODE |
| LOW | .spin/cmds.py | 1106 | except Exception: | CODE |
| LOW | .spin/cmds.py | 1172 | except Exception as e: | CODE |
| MEDIUM | .spin/cmds.py | 1077 | def _count_physical_cores_linux(): | CODE |
| MEDIUM | .spin/cmds.py | 1096 | def _count_physical_cores_win32(): | CODE |
| LOW | tools/refguide_check.py | 240 | except Exception: | CODE |
| LOW | tools/refguide_check.py | 411 | except Exception: | CODE |
| LOW | benchmarks/benchmarks/optimize.py | 581 | except Exception: | CODE |
| LOW | benchmarks/benchmarks/sparse.py | 285 | except Exception: | CODE |
| LOW⚡ | doc/source/conf.py | 484 | except Exception: | STRING |
| LOW⚡ | doc/source/conf.py | 489 | except Exception: | STRING |
| LOW⚡ | doc/source/conf.py | 496 | except Exception: | STRING |
| LOW | doc/source/conf.py | 472 | except Exception: | STRING |
| LOW | scipy/conftest.py | 37 | except Exception: | CODE |
| LOW | scipy/conftest.py | 78 | except Exception: | CODE |
| LOW | scipy/conftest.py | 85 | except Exception: | CODE |
| LOW | scipy/conftest.py | 134 | except Exception: # observed in gh-14441: (ImportError, AttributeError) | CODE |
| LOW | scipy/conftest.py | 154 | except Exception: | CODE |
| LOW⚡ | scipy/cluster/hierarchy/tests/test_hierarchy.py | 77 | except Exception: | CODE |
| LOW | scipy/ndimage/_morphology.py | 2373 | except Exception as e: | CODE |
| LOW⚡ | scipy/linalg/tests/test_lapack.py | 2562 | except Exception as e: | CODE |
| LOW⚡ | scipy/linalg/tests/test_lapack.py | 2577 | except Exception as e: | CODE |
| LOW | scipy/optimize/_linprog_ip.py | 109 | except Exception: | CODE |
| LOW | scipy/optimize/_linprog_ip.py | 146 | except Exception: | CODE |
| LOW | scipy/optimize/_minimize.py | 1116 | except Exception as e: | CODE |
| LOW | scipy/optimize/_linprog_util.py | 879 | except Exception: | CODE |
| LOW | scipy/optimize/_remove_redundancy.py | 195 | except Exception: | CODE |
| LOW | scipy/optimize/tests/test_zeros.py | 95 | except Exception: | CODE |
| LOW | scipy/optimize/_shgo_lib/_vertex.py | 455 | except Exception: | CODE |
| MEDIUM | scipy/optimize/_shgo_lib/_vertex.py | 234 | def __getitem__(self, x, nn=None): | CODE |
| LOW | scipy/integrate/_quadrature.py | 1030 | except Exception: | STRING |
| LOW | scipy/integrate/_quadrature.py | 1090 | except Exception as e: | STRING |
| LOW | scipy/integrate/_quadrature.py | 1100 | except Exception as e: | STRING |
| LOW | scipy/_lib/tests/test_array_api.py | 320 | except Exception as e: | CODE |
| LOW | scipy/_lib/tests/test_array_api.py | 362 | except Exception as e: | CODE |
| LOW | scipy/special/_mptestutils.py | 412 | except Exception: | CODE |
| MEDIUM | scipy/special/_mptestutils.py | 409 | def wrap(*a, **kw): | CODE |
| LOW | scipy/special/tests/test_mpmath.py | 209 | except Exception: | CODE |
| LOW | scipy/interpolate/_rgi.py | 297 | except Exception as e: | CODE |
| LOW | scipy/interpolate/_rgi.py | 302 | except Exception: | CODE |
| LOW | scipy/interpolate/_cubic.py | 1039 | except Exception as e: | CODE |
| LOW | scipy/interpolate/_rbfinterp_xp.py | 73 | except Exception: | CODE |
| LOW | scipy/interpolate/_fitpack_impl.py | 310 | except Exception: | CODE |
| LOW | scipy/interpolate/_fitpack_impl.py | 345 | except Exception: | CODE |
| LOW | scipy/interpolate/_fitpack_impl.py | 366 | except Exception: | CODE |
| LOW | scipy/interpolate/_fitpack_impl.py | 393 | except Exception: | CODE |
| LOW | scipy/interpolate/_fitpack_impl.py | 739 | except Exception: | CODE |
| LOW | scipy/sparse/_compressed.py | 88 | except Exception as e: | CODE |
| LOW | scipy/sparse/_compressed.py | 108 | except Exception as e: | CODE |
| LOW | scipy/sparse/_bsr.py | 108 | except Exception as e: | CODE |
| LOW | scipy/sparse/_bsr.py | 126 | except Exception as e: | CODE |
| LOW | scipy/sparse/_dia.py | 53 | except Exception as e: | CODE |
| LOW | scipy/sparse/_dia.py | 72 | except Exception as e: | CODE |
| LOW | scipy/sparse/_dok.py | 46 | except Exception as e: | CODE |
| LOW | scipy/sparse/linalg/_interface.py | 452 | except Exception as e: | CODE |
| LOW | scipy/sparse/linalg/_eigen/lobpcg/lobpcg.py | 85 | except Exception: | CODE |
| LOW | scipy/sparse/linalg/_eigen/lobpcg/lobpcg.py | 112 | except Exception as e: | CODE |
| LOW | scipy/sparse/linalg/_eigen/lobpcg/lobpcg.py | 556 | except Exception as e: | CODE |
| LOW | scipy/sparse/linalg/_eigen/lobpcg/lobpcg.py | 576 | except Exception as e: | CODE |
| LOW | scipy/sparse/linalg/_eigen/lobpcg/lobpcg.py | 592 | except Exception as e: | CODE |
| 28 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | scipy/ndimage/_filters.py | 2118 | behavior in the presence of NaNs is undefined, and memory consumption scales with | STRING |
| HIGH | scipy/optimize/_nnls.py | 10 | Solve ``argmin_x || Ax - b ||_2^2`` for ``x>=0``. | STRING |
| HIGH | scipy/interpolate/_fitpack_repro.py | 626 | minimize || W^{1/2} (Y - B c) ||^2 + s * c^T @ R @ c | STRING |
| HIGH | scipy/sparse/_data.py | 542 | is undefined, so the index ``0`` is returned for that row/column. | CODE |
| HIGH | scipy/sparse/_data.py | 574 | is undefined, so the index ``0`` is returned for that row/column. | CODE |
| HIGH | scipy/sparse/csgraph/__init__.py | 142 | accomplished over either G[i, j] or G[j, i]. If both edges are not null, | CODE |
| HIGH⚡ | scipy/stats/_binned_statistic.py | 664 | if np.iscomplexobj(null): | CODE |
| HIGH⚡ | scipy/stats/_binned_statistic.py | 666 | result.fill(null) | CODE |
| HIGH | scipy/stats/_mgc.py | 235 | statistic, under the null, at least as extreme as the observed test | CODE |
| HIGH | scipy/stats/_stats_py.py | 2999 | NaN (undefined). Non-positive observations will also produce NaNs in the | CODE |
| HIGH | scipy/stats/_stats_py.py | 6378 | # If df is undefined, variances are zero (assumes n1 > 0 & n2 > 0). | STRING |
| HIGH | scipy/stats/_resampling.py | 2066 | >>> unique = np.unique(null) | CODE |
| HIGH | scipy/stats/_resampling.py | 2079 | >>> incorrect_pvalue = np.count_nonzero(null >= r) / len(null) | CODE |
| HIGH | scipy/stats/_resampling.py | 2087 | >>> correct_pvalue = np.count_nonzero(null >= r - 1e-14) / len(null) | CODE |
| HIGH | scipy/stats/_mstats_basic.py | 1739 | # If df is undefined, variances are zero. | STRING |
| HIGH | scipy/stats/_distribution_infrastructure.py | 1756 | if _isnull(tol): | STRING |
| HIGH | scipy/stats/_distribution_infrastructure.py | 2004 | rtol = None if _isnull(self.tol) else self.tol | STRING |
| HIGH | scipy/stats/_distribution_infrastructure.py | 2033 | xrtol = None if _isnull(self.tol) else self.tol | STRING |
| HIGH⚡ | scipy/stats/tests/test_multivariate.py | 3415 | # distribution, so a low p-value represents rejecting the null, i.e. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | scipy/integrate/src/lsoda.c | 947 | // Step 1: Initialize based on jstart | COMMENT |
| LOW | scipy/integrate/src/lsoda.c | 1005 | // Step 4: Handle corrector results | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 68 | // Step 2: Determine the interval of valid decimal representations. | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 75 | // Step 3: Convert to a decimal power base using 64-bit arithmetic. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 154 | // Step 4: Find the shortest decimal representation in the interval of valid representations. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 231 | // Step 5: Print the decimal representation. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 309 | // Step 1: Decode the floating-point number, and unify normalized and subnormal cases. | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 109 | // Step 2: Determine the interval of valid decimal representations. | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 117 | // Step 3: Convert to a decimal power base using 128-bit arithmetic. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 205 | // Step 4: Find the shortest decimal representation in the interval of valid representations. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 315 | // Step 5: Print the decimal representation. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 455 | // Step 1: Decode the floating-point number, and unify normalized and subnormal cases. | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 267 | // Step 4: Store the interval [left_edge, right_edge] | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 272 | // Step 5: Move past this interval for the next search | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 561 | // Step 4: Store the interval [left_edge, right_edge] | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 566 | // Step 5: Move past this interval for the next search | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | scipy/integrate/src/lsoda.c | 947 | // Step 1: Initialize based on jstart | COMMENT |
| LOW | scipy/integrate/src/lsoda.c | 1005 | // Step 4: Handle corrector results | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 68 | // Step 2: Determine the interval of valid decimal representations. | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 75 | // Step 3: Convert to a decimal power base using 64-bit arithmetic. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 154 | // Step 4: Find the shortest decimal representation in the interval of valid representations. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 231 | // Step 5: Print the decimal representation. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/f2s.c | 309 | // Step 1: Decode the floating-point number, and unify normalized and subnormal cases. | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 109 | // Step 2: Determine the interval of valid decimal representations. | COMMENT |
| LOW⚡ | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 117 | // Step 3: Convert to a decimal power base using 128-bit arithmetic. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 205 | // Step 4: Find the shortest decimal representation in the interval of valid representations. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 315 | // Step 5: Print the decimal representation. | COMMENT |
| LOW | …x_market/fast_matrix_market/dependencies/ryu/ryu/d2s.c | 455 | // Step 1: Decode the floating-point number, and unify normalized and subnormal cases. | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 267 | // Step 4: Store the interval [left_edge, right_edge] | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 272 | // Step 5: Move past this interval for the next search | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 561 | // Step 4: Store the interval [left_edge, right_edge] | COMMENT |
| LOW⚡ | scipy/sparse/linalg/_propack/PROPACK/src/common.c | 566 | // Step 5: Move past this interval for the next search | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | scipy/sparse/linalg/_isolve/minres.py | 299 | # In this version we look at the diagonals of R in the | COMMENT |
| HIGH | scipy/stats/tests/test_stats.py | 1462 | # Simple test - Based on the above ``test_spearmanr_vs_r`` | COMMENT |
| HIGH | scipy/stats/tests/test_stats.py | 5916 | # whole number. In this example, the paper notes that 1 value is | COMMENT |
| HIGH | scipy/stats/tests/test_hypotests.py | 449 | # ( In this implementation, SF(U) includes PMF(U) ) | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | .github/workflows/codeql.yml | 53 | # If you are analyzing a compiled language, you can modify the 'build-mode' for that language to customize how | COMMENT |
| MEDIUM | scipy/linalg/tests/test_solvers.py | 837 | # Feel free to adjust this to test fewer dtypes or random selections rather than | COMMENT |
| LOW | scipy/optimize/_differentialevolution.py | 1132 | # make sure you're using a float array | STRING |
| LOW | scipy/io/matlab/_mio5_params.py | 5 | If you make changes in this file, don't forget to change mio5_utils.pyx | STRING |
| LOW | scipy/special/tests/test_basic.py | 2967 | # make sure to test both float and complex values; a different | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | scipy/optimize/tests/test__remove_redundancy.py | 5 | # TODO: add tests for: | COMMENT |