Home / sympy / sympy
AI Slop Code RIsk Monitor

sympy/sympy

A computer algebra system written in pure Python

15.2 Elevated pattern signal View on GitHub

Maintenance and Governance Review

This report summarizes scanner evidence for sympy/sympy, a Python project with 14,995 GitHub stars. SynthScan examined 829,583 lines of code across 1668 source files, recording 11243 pattern matches distributed across 23 syntactic categories. The legacy adjusted pattern signal is 15.2 (Elevated pattern signal); it is not an authorship estimate.

Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.

15.2
Adjusted Signal
15.2
Raw Pattern Score
100%
Time Factor
2026-10-10
Last Push
15.0K
Stars
Python
Language
829.6K
Lines of Code
1.7K
Files
11.2K
Pattern Hits
2026-10-12
Scan Date
0.35
HC Hit Rate

Risk Review · v3

Use each vector to guide manual verification of the underlying findings.

Cognitive Ownership Risk 24.8/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 4916 finding(s).

Hallucinated Dependency & Supply Chain Risk 27.6/100 · MEDIUM

Are imports declared and package/API names verified? 5485 finding(s).

Agent Over-Engineering Ratio 26.8/100 · MEDIUM

Are wrappers, guards, and repeated structures necessary? 3770 finding(s).

PR Review Velocity Impact 59.4/100 · HIGH

Which changes need focused human review? 11243 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.

Severity Breakdown

Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.

CRITICAL 0HIGH 582MEDIUM 393LOW 10268

Directory Score Breakdown

This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.

Pattern Findings

The scanner identified 11243 distinct pattern matches across 23 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. 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 configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.

Unused Imports5199 hits · 3820 pts
SeverityFileLineSnippetContext
LOWconftest.py3CODE
LOWconftest.py3CODE
LOWconftest.py3CODE
LOWisympy.py316CODE
LOWsympy/conftest.py1CODE
LOWsympy/release.py1CODE
LOWsympy/this.py4CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
LOWsympy/__init__.py56CODE
5139 more matches not shown…
Hyper-Verbose Identifiers2837 hits · 2602 pts
SeverityFileLineSnippetContext
LOWsympy/conftest.py76def pytest_collection_modifyitems(config, items):CODE
LOWsympy/series/tests/test_sequences.py294def test_find_linear_recurrence():CODE
LOWsympy/series/tests/test_limits.py211def test_floor_requires_robust_assumptions():CODE
LOWsympy/series/tests/test_limits.py241def test_ceiling_requires_robust_assumptions():CODE
LOWsympy/series/tests/test_limits.py373def test_bessel_functions_at_infinity():CODE
LOWsympy/series/tests/test_order.py326def test_order_conjugate_transpose():CODE
LOWsympy/series/tests/test_order.py339def test_order_noncommutative():CODE
LOWsympy/series/tests/test_order.py397def test_mixing_order_at_zero_and_infinity():CODE
LOWsympy/series/tests/test_order.py441def test_order_failing_due_to_solveset():CODE
LOWsympy/series/tests/test_order.py459def test_performance_of_adding_order():CODE
LOWsympy/series/tests/test_formal.py81def test_rational_independent():CODE
LOWsympy/series/tests/test_formal.py389def test_fps__logarithmic_singularity():CODE
LOWsympy/series/tests/test_formal.py398def test_fps__logarithmic_singularity_fail():CODE
LOWsympy/series/tests/test_series.py204def test_exp_product_positive_factors():CODE
LOWsympy/series/tests/test_gruntz.py98def test_gruntz_evaluation_slow():CODE
LOWsympy/series/tests/test_gruntz.py129def test_gruntz_eval_special_slow():CODE
LOWsympy/series/tests/test_gruntz.py137def test_grunts_eval_special_slow_sometimes_fail():CODE
LOWsympy/series/tests/test_gruntz.py148def test_gruntz_eval_special_fail():CODE
LOWsympy/series/tests/test_approximants.py30def test_pade_approximants_gcdex():CODE
LOWsympy/series/tests/test_approximants.py65def test_pade_approximant_gcdex():CODE
LOWsympy/crypto/crypto.py2452def lfsr_connection_polynomial(s):STRING
LOWsympy/crypto/tests/test_crypto.py74def test_encipher_substitution():CODE
LOWsympy/crypto/tests/test_crypto.py229def test_mutltiprime_rsa_full_example():CODE
LOWsympy/crypto/tests/test_crypto.py331def test_rsa_multiprime_exhanstive():CODE
LOWsympy/crypto/tests/test_crypto.py352def test_rsa_multipower_exhanstive():CODE
LOWsympy/crypto/tests/test_crypto.py431def test_lfsr_autocorrelation():CODE
LOWsympy/crypto/tests/test_crypto.py439def test_lfsr_connection_polynomial():CODE
LOWsympy/crypto/tests/test_crypto.py506def test_encipher_decipher_gm():CODE
LOWsympy/crypto/tests/test_crypto.py536def test_encipher_decipher_bg():CODE
LOWsympy/core/facts.py96def deduce_alpha_implications(implications):STRING
LOWsympy/core/facts.py136def apply_beta_to_alpha_route(alpha_implications, beta_rules):STRING
LOWsympy/core/add.py24def _could_extract_minus_sign(expr):CODE
LOWsympy/core/add.py628 def _eval_is_rational_function(self, syms):CODE
LOWsympy/core/add.py778 def _eval_is_extended_positive(self):CODE
LOWsympy/core/add.py830 def _eval_is_extended_nonnegative(self):CODE
LOWsympy/core/add.py845 def _eval_is_extended_nonpositive(self):CODE
LOWsympy/core/add.py860 def _eval_is_extended_negative(self):CODE
LOWsympy/core/numbers.py997 def _eval_is_extended_negative(self):CODE
LOWsympy/core/numbers.py1004 def _eval_is_extended_positive(self):CODE
LOWsympy/core/random.py105def test_derivative_numerically(f, z, tol=1.0e-6, a=2, b=-1, c=3, d=1):CODE
LOWsympy/core/relational.py654 def indeterminate_addition_possible(L, R, restore):STRING
LOWsympy/core/mul.py1282 def _eval_is_rational_function(self, syms):CODE
LOWsympy/core/mul.py1304 def _eval_is_zero_infinite_helper(self):CODE
LOWsympy/core/mul.py1592 def _eval_is_extended_positive(self):CODE
LOWsympy/core/mul.py1645 def _eval_is_extended_negative(self):CODE
LOWsympy/core/basic.py156def _get_postprocessors_for_type(arg_type):CODE
LOWsympy/core/basic.py2198 def _exec_constructor_postprocessors(cls, obj):CODE
LOWsympy/core/evalf.py1780def _evalf_with_bounded_error(x: Expr, eps: Expr | None = None,STRING
LOWsympy/core/power.py1320 def _eval_is_rational_function(self, syms):CODE
LOWsympy/core/power.py404 def _eval_is_extended_positive(self):STRING
LOWsympy/core/power.py433 def _eval_is_extended_negative(self):STRING
LOWsympy/core/function.py1989 def _get_zero_with_shape_like(cls, expr):CODE
LOWsympy/core/function.py1993 def _dispatch_eval_derivative_n_times(cls, expr, v, count):CODE
LOWsympy/core/assumptions.py230def _load_pre_generated_assumption_rules() -> FactRules:CODE
LOWsympy/core/assumptions.py238def _generate_assumption_rules():CODE
LOWsympy/core/assumptions.py623def _prepare_class_assumptions(cls):CODE
LOWsympy/core/expr.py912 def _eval_is_extended_positive_negative(self, positive):CODE
LOWsympy/core/expr.py951 def _eval_is_extended_positive(self):CODE
LOWsympy/core/expr.py954 def _eval_is_extended_negative(self):CODE
LOWsympy/core/expr.py4060 def _eval_is_rational_function(self, syms):CODE
2777 more matches not shown…
Cross-Language Confusion273 hits · 1536 pts
SeverityFileLineSnippetContext
HIGHsympy/core/relational.py514 left, right = [i.equals(j,STRING
HIGHsympy/core/relational.py521 lr, rl = [i.equals(j, failing_expression=failing_expression)STRING
HIGHsympy/core/relational.py538 left = a.lhs.equals(b.lhs,STRING
HIGHsympy/core/relational.py542 right = a.rhs.equals(b.rhs,STRING
HIGHsympy/core/relational.py882 elif dif.equals(0): # XXX this is expensiveSTRING
HIGHsympy/core/evalf.py454 if not re_im.equals(0):CODE
HIGH⚡sympy/core/power.py1821 bz = b.equals(0)CODE
HIGH⚡sympy/core/power.py1831 bz = b.equals(0)CODE
HIGH⚡sympy/core/power.py1837 return e.equals(0)CODE
HIGHsympy/core/power.py46 | | | undefined, but is convenient in some contexts |STRING
HIGH⚡sympy/core/expr.py738 if b is not None and b is not S.NaN and b.equals(a) is False:CODE
HIGH⚡sympy/core/expr.py742 if b is not None and b is not S.NaN and b.equals(a) is False:CODE
HIGH⚡sympy/core/expr.py747 if b.equals(a) is False:CODE
HIGHsympy/core/expr.py374 ok = self.equals(i)CODE
HIGHsympy/core/expr.py814 fac_zero = [fac.equals(0) for fac in factors]CODE
HIGHsympy/core/expr.py3992 if x.equals(0):CODE
HIGHsympy/core/tests/test_assumptions.py1082 assert e.equals(0) is TrueCODE
HIGH⚡sympy/core/tests/test_expr.py1944 assert meter.equals(0) is FalseCODE
HIGH⚡sympy/core/tests/test_expr.py1948 assert eq.equals(0)CODE
HIGH⚡sympy/core/tests/test_expr.py1957 assert diff.equals(0) is None # should be False, but previously this was False due to wrong intermediate resultCODE
HIGH⚡sympy/core/tests/test_expr.py1967 assert eq.equals(0)CODE
HIGHsympy/core/tests/test_expr.py1992 assert z.equals(0)CODE
HIGHsympy/core/tests/test_expr.py2236 assert f1.equals(f2) is NoneCODE
HIGHsympy/core/tests/test_expr.py2319 assert x.equals(y) is FalseCODE
HIGHsympy/core/tests/test_sympify.py561 assert all(set(i.values()) == {null} for i in (CODE
HIGHsympy/polys/rootoftools.py749 elif poly.length() == 2 and poly.TC():CODE
HIGHsympy/polys/polyroots.py1019 if f.length() == 2 and n > 2:CODE
HIGHsympy/polys/polyroots.py1086 if f.length() == 2:CODE
HIGHsympy/polys/polyroots.py1149 elif f.length() == 2:CODE
HIGHsympy/polys/matrices/tests/test_nullspace.py118def _divide_last(null):CODE
HIGH⚡sympy/polys/matrices/tests/test_nullspace.py137def _check_primitive(null, null_ans):CODE
HIGH⚡sympy/polys/matrices/tests/test_nullspace.py139 null = _to_DM(null, null_ans)CODE
HIGH⚡sympy/polys/matrices/tests/test_nullspace.py144def _check_divided(null, null_ans):CODE
HIGH⚡sympy/polys/matrices/tests/test_nullspace.py146 null = _to_DM(null, null_ans)CODE
HIGH⚡sympy/printing/tests/test_c.py200 assert ccode(x & y) == "x && y"CODE
HIGH⚡sympy/printing/tests/test_c.py201 assert ccode(x | y) == "x || y"CODE
HIGH⚡sympy/printing/tests/test_c.py203 assert ccode(x & y & z) == "x && y && z"CODE
HIGH⚡sympy/printing/tests/test_c.py204 assert ccode(x | y | z) == "x || y || z"CODE
HIGH⚡sympy/printing/tests/test_c.py205 assert ccode((x & y) | z) == "z || x && y"CODE
HIGH⚡sympy/printing/tests/test_c.py205 assert ccode((x & y) | z) == "z || x && y"CODE
HIGH⚡sympy/printing/tests/test_c.py206 assert ccode((x | y) & z) == "z && (x || y)"CODE
HIGH⚡sympy/printing/tests/test_c.py208 assert ccode(x ^ y) == '(x || y) && (!x || !y)'CODE
HIGH⚡sympy/printing/tests/test_c.py209 assert ccode((x ^ y) ^ z) == '(x || y || z) && (x || !y || !z) && (y || !x || !z) && (z || !x || !y)'CODE
HIGH⚡sympy/printing/tests/test_c.py211 assert ccode(Equivalent(x, z ^ y, Implies(z, x))) == '(x || (y || !z) && (z || !y)) && (z && !x || (y || z) && (!y |CODE
HIGH⚡sympy/printing/tests/test_glsl.py105 assert glsl_code(x & y) == "x && y"CODE
HIGH⚡sympy/printing/tests/test_glsl.py106 assert glsl_code(x | y) == "x || y"CODE
HIGH⚡sympy/printing/tests/test_glsl.py108 assert glsl_code(x & y & z) == "x && y && z"CODE
HIGH⚡sympy/printing/tests/test_glsl.py109 assert glsl_code(x | y | z) == "x || y || z"CODE
HIGH⚡sympy/printing/tests/test_glsl.py110 assert glsl_code((x & y) | z) == "z || x && y"CODE
HIGH⚡sympy/printing/tests/test_glsl.py110 assert glsl_code((x & y) | z) == "z || x && y"CODE
HIGH⚡sympy/printing/tests/test_glsl.py111 assert glsl_code((x | y) & z) == "z && (x || y)"CODE
HIGH⚡sympy/printing/tests/test_julia.py143 assert julia_code(x & y) == "x && y"CODE
HIGH⚡sympy/printing/tests/test_julia.py144 assert julia_code(x | y) == "x || y"CODE
HIGH⚡sympy/printing/tests/test_julia.py146 assert julia_code(x & y & z) == "x && y && z"CODE
HIGH⚡sympy/printing/tests/test_julia.py147 assert julia_code(x | y | z) == "x || y || z"CODE
HIGH⚡sympy/printing/tests/test_julia.py148 assert julia_code((x & y) | z) == "z || x && y"CODE
HIGH⚡sympy/printing/tests/test_julia.py148 assert julia_code((x & y) | z) == "z || x && y"CODE
HIGH⚡sympy/printing/tests/test_julia.py149 assert julia_code((x | y) & z) == "z && (x || y)"CODE
HIGH⚡sympy/printing/tests/test_rust.py123 assert rust_code(k & m) == "k && m"CODE
HIGH⚡sympy/printing/tests/test_rust.py124 assert rust_code(k | m) == "k || m"CODE
213 more matches not shown…
Deep Nesting1536 hits · 1430 pts
SeverityFileLineSnippetContext
LOWisympy.py175CODE
LOWsympy/series/sequences.py304CODE
LOWsympy/series/sequences.py1119CODE
LOWsympy/series/sequences.py1229CODE
LOWsympy/series/limits.py70CODE
LOWsympy/series/limits.py198CODE
LOWsympy/series/limits.py265CODE
LOWsympy/series/order.py132CODE
LOWsympy/series/order.py376CODE
LOWsympy/series/order.py462CODE
LOWsympy/series/formal.py31CODE
LOWsympy/series/formal.py418CODE
LOWsympy/series/formal.py789CODE
LOWsympy/series/formal.py1059CODE
LOWsympy/series/formal.py1109CODE
LOWsympy/series/gruntz.py249CODE
LOWsympy/series/gruntz.py372CODE
LOWsympy/series/gruntz.py432CODE
LOWsympy/series/gruntz.py545CODE
LOWsympy/series/gruntz.py666CODE
LOWsympy/series/limitseq.py68CODE
LOWsympy/series/limitseq.py162CODE
LOWsympy/series/fourier.py515CODE
LOWsympy/core/facts.py76CODE
LOWsympy/core/facts.py136CODE
LOWsympy/core/facts.py327CODE
LOWsympy/core/add.py212CODE
LOWsympy/core/add.py477CODE
LOWsympy/core/add.py660CODE
LOWsympy/core/add.py673CODE
LOWsympy/core/add.py701CODE
LOWsympy/core/add.py762CODE
LOWsympy/core/add.py778CODE
LOWsympy/core/add.py830CODE
LOWsympy/core/add.py845CODE
LOWsympy/core/add.py860CODE
LOWsympy/core/add.py1019CODE
LOWsympy/core/add.py1183CODE
LOWsympy/core/exprtools.py33CODE
LOWsympy/core/exprtools.py304CODE
LOWsympy/core/exprtools.py1075CODE
LOWsympy/core/exprtools.py1365CODE
LOWsympy/core/exprtools.py1489CODE
LOWsympy/core/exprtools.py384CODE
LOWsympy/core/exprtools.py581CODE
LOWsympy/core/exprtools.py651CODE
LOWsympy/core/exprtools.py813CODE
LOWsympy/core/traversal.py37CODE
LOWsympy/core/sorting.py11CODE
LOWsympy/core/sorting.py203CODE
LOWsympy/core/symbol.py689CODE
LOWsympy/core/symbol.py902CODE
LOWsympy/core/symbol.py965CODE
LOWsympy/core/numbers.py75CODE
LOWsympy/core/numbers.py4304CODE
LOWsympy/core/numbers.py352CODE
LOWsympy/core/numbers.py487CODE
LOWsympy/core/numbers.py498CODE
LOWsympy/core/numbers.py509CODE
LOWsympy/core/numbers.py782CODE
1476 more matches not shown…
Empty Error Handlers212 hits · 1060 pts
SeverityFileLineSnippetContext
HIGHsetup.py219except Exception:CODE
HIGHsympy/series/limits.py310except ValueError:CODE
HIGHsympy/series/limits.py349except (ValueError, NotImplementedError, PoleError):CODE
HIGHsympy/core/facts.py324except TautologyDetected:CODE
HIGHsympy/core/traversal.py244except TypeError:CODE
HIGHsympy/core/sorting.py153except SympifyError:CODE
HIGHsympy/core/numbers.py1992except ValueError:CODE
HIGHsympy/core/numbers.py829except decimal.InvalidOperation:CODE
HIGHsympy/core/numbers.py1314except (SympifyError, SyntaxError):CODE
HIGHsympy/core/numbers.py1328except ValueError:CODE
HIGHsympy/core/mul.py2046except PolynomialError:CODE
HIGHsympy/core/basic.py2411except SympifyError:CODE
HIGHsympy/core/basic.py1715except SympifyError:CODE
HIGHsympy/core/basic.py1719except SympifyError:CODE
HIGHsympy/core/sympify.py486except TypeError:CODE
HIGHsympy/core/sympify.py470except SympifyError:CODE
HIGHsympy/core/mod.py90except TypeError:CODE
HIGHsympy/core/power.py732except ValueError:CODE
HIGHsympy/core/power.py284except PrecisionExhausted:CODE
HIGHsympy/core/expr.py1033except TypeError:CODE
HIGHsympy/core/expr.py3912except TypeError:CODE
HIGHsympy/core/expr.py888except NotImplementedError:CODE
HIGHsympy/core/expr.py899except (NotAlgebraic, NotImplementedError):CODE
HIGHsympy/core/expr.py948except (NotAlgebraic, NotImplementedError):CODE
HIGHsympy/core/expr.py1243except (TypeError, ValueError):CODE
HIGHsympy/core/tests/test_numbers.py370except ImportError:CODE
HIGHsympy/core/tests/test_sympify.py96except ImportError:CODE
HIGHsympy/core/tests/test_sympify.py628except OverflowError:CODE
HIGHsympy/polys/euclidtools.py1555except HeuristicGCDFailed:CODE
HIGHsympy/polys/euclidtools.py1563except HeuristicGCDFailed:CODE
HIGHsympy/polys/euclidtools.py1591except HeuristicGCDFailed:CODE
HIGHsympy/polys/euclidtools.py1599except HeuristicGCDFailed:CODE
HIGHsympy/polys/rootoftools.py388except KeyError:CODE
HIGHsympy/polys/rootoftools.py993except (UnboundLocalError, ValueError):CODE
HIGHsympy/polys/fields.py432except CoercionFailed:CODE
HIGHsympy/polys/factortools.py1060except EvaluationFailed:CODE
HIGHsympy/polys/polyutils.py117except TypeError: # pragma: no coverCODE
HIGHsympy/polys/polyutils.py105except KeyError:CODE
HIGHsympy/polys/polyutils.py110except KeyError:CODE
HIGHsympy/polys/polyutils.py93except ValueError:CODE
HIGHsympy/polys/polytools.py7831except CoercionFailed:CODE
HIGHsympy/polys/polytools.py1750except CoercionFailed:CODE
HIGHsympy/polys/polytools.py1789except CoercionFailed:CODE
HIGHsympy/polys/polytools.py1826except CoercionFailed:CODE
HIGHsympy/polys/polytools.py1868except CoercionFailed:CODE
HIGHsympy/polys/polytools.py8203except CoercionFailed:CODE
HIGHsympy/polys/polytools.py635except PolynomialError:CODE
HIGHsympy/polys/polytools.py7764except NotImplementedError:CODE
HIGHsympy/polys/polyclasses.py3022except UnificationFailed:CODE
HIGHsympy/polys/polyclasses.py3039except UnificationFailed:CODE
HIGHsympy/polys/partfrac.py115except NotImplementedError:CODE
HIGHsympy/polys/rings.py2606except ValueError:CODE
HIGHsympy/polys/series/ringpython.py383except ExactQuotientFailed:CODE
HIGHsympy/polys/domains/domain.py636except (TypeError, ValueError):CODE
HIGHsympy/polys/domains/domain.py644except (TypeError, ValueError):CODE
HIGHsympy/polys/domains/algebraicfield.py389except CoercionFailed:CODE
HIGHsympy/polys/numberfields/subfield.py237except NotImplementedError:CODE
HIGHsympy/polys/matrices/sdm.py117except KeyError:CODE
HIGHsympy/concrete/summations.py1132except PolynomialError:CODE
HIGHsympy/concrete/summations.py1194except PolynomialError:CODE
152 more matches not shown…
Decorative Section Separators282 hits · 704 pts
SeverityFileLineSnippetContext
MEDIUMsympy/core/power.py286 # ===================================================COMMENT
MEDIUMsympy/core/function.py1505 # -------------------------------------------------------------COMMENT
MEDIUMsympy/ntheory/tests/test_primetest.py174 #-------------COMMENT
MEDIUMsympy/solvers/solvers.py1699 # -----------------------STRING
MEDIUMsympy/solvers/diophantine/diophantine.py1651 # --------------------------STRING
MEDIUMsympy/testing/runtests.py847 # --------------------------------------------------------------------STRING
MEDIUM⚡sympy/sets/fancysets.py846 #---------------------COMMENT
MEDIUM⚡sympy/sets/fancysets.py849 # --------------------COMMENT
MEDIUM⚡sympy/sets/fancysets.py852 #---------------------COMMENT
MEDIUM⚡sympy/sets/fancysets.py855 # --------------------COMMENT
MEDIUM⚡sympy/sets/fancysets.py864 #---------------------COMMENT
MEDIUM⚡sympy/sets/fancysets.py867 # --------------------COMMENT
MEDIUMsympy/sets/handlers/intersection.py168 # -------------------COMMENT
MEDIUMsympy/combinatorics/polyhedron.py834# -----------------------------------------------------------------------COMMENT
MEDIUMsympy/combinatorics/polyhedron.py839# -----------------------------------------------------------------------COMMENT
MEDIUMsympy/combinatorics/fp_groups.py395#==============================================================================COMMENT
MEDIUMsympy/combinatorics/fp_groups.py397#==============================================================================COMMENT
MEDIUMsympy/combinatorics/fp_groups.py956#========================================================================STRING
MEDIUMsympy/combinatorics/fp_groups.py958#========================================================================STRING
MEDIUMsympy/functions/special/polynomials.py41#----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/functions/special/polynomials.py439#----------------------------------------------------------------------------STRING
MEDIUM⚡sympy/functions/special/polynomials.py1002#----------------------------------------------------------------------------STRING
MEDIUM⚡sympy/functions/special/polynomials.py1206#----------------------------------------------------------------------------STRING
MEDIUMsympy/functions/special/polynomials.py286#----------------------------------------------------------------------------STRING
MEDIUMsympy/functions/special/polynomials.py769#----------------------------------------------------------------------------STRING
MEDIUMsympy/functions/elementary/piecewise.py402 # -----------------------------------------------------------------------COMMENT
MEDIUMsympy/functions/elementary/piecewise.py546 # -----------------------------------------------------------------COMMENT
MEDIUMsympy/physics/secondquant.py2856 # ============================COMMENT
MEDIUM⚡sympy/physics/quantum/qft.py40#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qft.py42#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/transforms.py32#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/transforms.py34#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/transforms.py177#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/transforms.py179#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/transforms.py275#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/transforms.py277#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/kind.py76#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/kind.py78#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py48#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py50#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py56 #-------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py58 #-------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/qubit.py85 #-------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/qubit.py87 #-------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py103 #-------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py105 #-------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py113 #-------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/qubit.py115 #-------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/qubit.py435#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/qubit.py437#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/qubit.py535#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/qubit.py537#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/cg.py34#-----------------------------------------------------------------------------COMMENT
MEDIUM⚡sympy/physics/quantum/cg.py36#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/spin.py74#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/spin.py76#-----------------------------------------------------------------------------COMMENT
MEDIUMsympy/physics/quantum/spin.py917#-----------------------------------------------------------------------------STRING
MEDIUMsympy/physics/quantum/spin.py919#-----------------------------------------------------------------------------STRING
MEDIUMsympy/physics/quantum/spin.py1794#-----------------------------------------------------------------------------STRING
MEDIUMsympy/physics/quantum/spin.py1796#-----------------------------------------------------------------------------STRING
222 more matches not shown…
Cross-File Repetition95 hits · 475 pts
SeverityFileLineSnippetContext
HIGHsympy/core/add.py0efficiently extract the coefficient of a summation.STRING
HIGHsympy/core/numbers.py0efficiently extract the coefficient of a summation.STRING
HIGHsympy/core/expr.py0efficiently extract the coefficient of a summation.STRING
HIGHsympy/vector/basisdependent.py0efficiently extract the coefficient of a summation.STRING
HIGHsympy/core/basic.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.STRING
HIGHsympy/core/function.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.STRING
HIGHsympy/core/expr.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.STRING
HIGHsympy/tensor/indexed.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.STRING
HIGHsympy/polys/series/ringpython.py0convert a power series element into the corresponding element of this ring.STRING
HIGHsympy/polys/series/ringflint.py0convert a power series element into the corresponding element of this ring.STRING
HIGHsympy/polys/series/ring.py0convert a power series element into the corresponding element of this ring.STRING
HIGHsympy/polys/series/base.py0convert a power series element into the corresponding element of this ring.STRING
HIGHsympy/polys/series/ringpython.py0return the coefficients of a power series as a list.STRING
HIGHsympy/polys/series/ringflint.py0return the coefficients of a power series as a list.STRING
HIGHsympy/polys/series/base.py0return the coefficients of a power series as a list.STRING
HIGHsympy/polys/series/ringpython.py0check if two power series have the same representation.STRING
HIGHsympy/polys/series/ringflint.py0check if two power series have the same representation.STRING
HIGHsympy/polys/series/base.py0check if two power series have the same representation.STRING
HIGHsympy/polys/series/ringpython.py0check if a arg is a ground element of the power series ring.STRING
HIGHsympy/polys/series/ringflint.py0check if a arg is a ground element of the power series ring.STRING
HIGHsympy/polys/series/base.py0check if a arg is a ground element of the power series ring.STRING
HIGHsympy/polys/domains/field.py0quotient of ``a`` and ``b``, implies ``__truediv__``.STRING
HIGHsympy/polys/domains/gmpyrationalfield.py0quotient of ``a`` and ``b``, implies ``__truediv__``.STRING
HIGHsympy/polys/domains/rationalfield.py0quotient of ``a`` and ``b``, implies ``__truediv__``.STRING
HIGHsympy/polys/domains/field.py0division of ``a`` and ``b``, implies ``__truediv__``.STRING
HIGHsympy/polys/domains/gmpyrationalfield.py0division of ``a`` and ``b``, implies ``__truediv__``.STRING
HIGHsympy/polys/domains/rationalfield.py0division of ``a`` and ``b``, implies ``__truediv__``.STRING
HIGHsympy/polys/matrices/ddm.py0says whether this matrix is diagonal. true can be returned even if the matrix is not square.STRING
HIGHsympy/polys/matrices/domainmatrix.py0says whether this matrix is diagonal. true can be returned even if the matrix is not square.STRING
HIGHsympy/polys/matrices/sdm.py0says whether this matrix is diagonal. true can be returned even if the matrix is not square.STRING
HIGHsympy/printing/str.py0setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).STRING
HIGHsympy/printing/repr.py0setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).STRING
HIGHsympy/printing/latex.py0setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).STRING
HIGHsympy/printing/pretty/pretty.py0setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).STRING
HIGHsympy/liealgebras/type_d.py0this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.STRING
HIGHsympy/liealgebras/type_a.py0this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.STRING
HIGHsympy/liealgebras/type_b.py0this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.STRING
HIGHsympy/liealgebras/type_e.py0this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.STRING
HIGHsympy/liealgebras/type_d.py0the ith simple root for the c series every lie algebra has a unique root system. given a root system q, there is a subseSTRING
HIGHsympy/liealgebras/type_b.py0the ith simple root for the c series every lie algebra has a unique root system. given a root system q, there is a subseSTRING
HIGHsympy/liealgebras/type_c.py0the ith simple root for the c series every lie algebra has a unique root system. given a root system q, there is a subseSTRING
HIGHsympy/liealgebras/type_d.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_e.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_a.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_f.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_b.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_c.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_g.py0generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots bySTRING
HIGHsympy/liealgebras/type_d.py0the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simpleSTRING
HIGHsympy/liealgebras/type_e.py0the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simpleSTRING
HIGHsympy/liealgebras/type_a.py0the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simpleSTRING
HIGHsympy/liealgebras/type_f.py0the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simpleSTRING
HIGHsympy/liealgebras/type_b.py0the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simpleSTRING
HIGHsympy/liealgebras/type_c.py0the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simpleSTRING
HIGHsympy/liealgebras/type_b.py0dimension of the vector space v underlying the lie algebra examples ======== >>> from sympy.liealgebras.cartan_type impoSTRING
HIGHsympy/liealgebras/type_c.py0dimension of the vector space v underlying the lie algebra examples ======== >>> from sympy.liealgebras.cartan_type impoSTRING
HIGHsympy/liealgebras/type_g.py0dimension of the vector space v underlying the lie algebra examples ======== >>> from sympy.liealgebras.cartan_type impoSTRING
HIGHsympy/integrals/tests/test_rde.py0most of these tests come from the examples in bronstein's book.STRING
HIGHsympy/integrals/tests/test_risch.py0most of these tests come from the examples in bronstein's book.STRING
HIGHsympy/integrals/tests/test_prde.py0most of these tests come from the examples in bronstein's book.STRING
35 more matches not shown…
Over-Commented Block216 hits · 212 pts
SeverityFileLineSnippetContext
LOWasv.conf.actions.json21 // https://github.com/sympy/sympy/issues/26239COMMENT
LOWasv.conf.actions.json41 // The tool to use to create environments. May be "conda",COMMENT
LOWasv.conf.actions.json81COMMENT
LOWsympy/series/gruntz.py501 # e really does not depend on x after simplificationCOMMENT
LOWsympy/series/residues.py41COMMENT
LOWsympy/core/backend.py81# Expected behaviour of a SymPy mutable/immutable matrix .simplify() method:COMMENT
LOWsympy/core/containers.py121 # XXX: Basic defines count() as something different, so we can'tCOMMENT
LOWsympy/core/cache.py101 # always call function itself and compare it with cached versionCOMMENT
LOWsympy/core/numbers.py881 elif isinstance(num, tuple) and len(num) in (3, 4):COMMENT
LOWsympy/core/mul.py501 # in c_powersCOMMENT
LOWsympy/core/mul.py1301 return FalseCOMMENT
LOWsympy/core/mul.py1321 # For each argument there is the possibility that is_zero might giveCOMMENT
LOWsympy/core/evalf.py1301 while True:COMMENT
LOWsympy/core/intfunc.py261 # a' = A*a + B*b, b' = C*a + D*bCOMMENT
LOWsympy/core/intfunc.py281 # x'%y" = x' - q*y" < x" - q*y' = x"%y',COMMENT
LOWsympy/core/power.py1461 d = self.exp.xreplace(d).matches(e, d)COMMENT
LOWsympy/core/function.py841 """Stub that should be overridden by new Functions to returnCOMMENT
LOWsympy/core/assumptions.py581 # though that independent code e.g. called indirectly by the handler orCOMMENT
LOWsympy/core/assumptions.py601 # single-threaded context but in multithreaded code it is possible thatCOMMENT
LOWsympy/core/assumptions.py681# in case someone has been using the ManagedProperties class in downstreamCOMMENT
LOWsympy/core/expr.py841 # we can just consider the cases where the approximation appearsCOMMENT
LOWsympy/core/expr.py3941 shift = -digits_to_decimal + dpsCOMMENT
LOWsympy/core/expr.py3961 # to 15 digits:COMMENT
LOWsympy/core/expr.py3981 # if we declared that we had more than 15 digits of precision.COMMENT
LOWsympy/core/tests/test_singleton.py41 assert TestSingleton() is S.TestSingletonCOMMENT
LOWsympy/polys/euclidtools.py1521COMMENT
LOWsympy/polys/rootoftools.py961 by = mp.mpf(str(interval.by))COMMENT
LOWsympy/polys/ring_series.py2021COMMENT
LOWsympy/polys/puiseux.py1"""COMMENT
LOWsympy/polys/matrices/dense.py161 # In cases like GF(p), QQ<sqrt(2)>, RR or CC though multiplication isCOMMENT
LOWsympy/polys/matrices/dense.py301 # Given an n x n matrix A and n x 1 matrix b:COMMENT
LOWsympy/polys/matrices/linsolve.py1#COMMENT
LOWsympy/polys/matrices/domainmatrix.py3081 # Cayley-Hamilton says that a matrix satisfies its own minimalCOMMENT
LOWsympy/polys/matrices/domainmatrix.py3201 if m != n:COMMENT
LOWsympy/polys/matrices/rref.py1# Algorithms for computing the reduced row echelon form of a matrix.COMMENT
LOWsympy/polys/matrices/rref.py281COMMENT
LOWsympy/polys/matrices/rref.py321 if denom_lcm.bit_length() < 50:COMMENT
LOWsympy/polys/matrices/sdm.py1541 #COMMENT
LOWsympy/polys/matrices/sdm.py1741 # removes zero rows we can completely discard the row indices. The firstCOMMENT
LOWsympy/polys/matrices/sdm.py1761 # that column.COMMENT
LOWsympy/polys/matrices/sdm.py1921 https://dl.acm.org/doi/10.1145/271130.271133COMMENT
LOWsympy/polys/matrices/sdm.py1941 # [0, 0, 0, 0, 0, 0, 0, 0, 2, 0]COMMENT
LOWsympy/polys/matrices/sdm.py2221 C[i-1] = MijCOMMENT
LOWsympy/polys/matrices/_dfm.py1#COMMENT
LOWsympy/polys/matrices/_dfm.py21#COMMENT
LOWsympy/polys/matrices/_dfm.py841 # V, nullity = self.rep.nullspace()COMMENT
LOWsympy/polys/matrices/tests/test_xxm.py1#COMMENT
LOWsympy/polys/matrices/tests/test_linsolve.py81 y:8519/15990 + 1784/7995*I,COMMENT
LOWsympy/polys/matrices/tests/test_rref.py521 (COMMENT
LOWsympy/concrete/summations.py621 try:COMMENT
LOWsympy/concrete/tests/test_products.py21def test_karr_convention():COMMENT
LOWsympy/concrete/tests/test_sums_products.py41from sympy.simplify.simplify import simplifyCOMMENT
LOWsympy/concrete/tests/test_sums_products.py61 # the upper limit being *exclusive*.COMMENT
LOWsympy/ntheory/primetest.py781 #if n < 38010307:COMMENT
LOWsympy/ntheory/generate.py41 >>> sieve._listCOMMENT
LOWsympy/ntheory/generate.py61 #COMMENT
LOWsympy/ntheory/generate.py81 #COMMENT
LOWsympy/ntheory/bbp_pi.py1'''COMMENT
LOWsympy/ntheory/partitions_.py181 """COMMENT
LOWsympy/printing/codeprinter.py241 # (temporary variables?)COMMENT
156 more matches not shown…
Self-Referential Comments81 hits · 210 pts
SeverityFileLineSnippetContext
MEDIUMsympy/__init__.py260# This module is slow to import:COMMENT
MEDIUMsympy/polys/rings.py348 # Create a new ring instance.COMMENT
MEDIUMsympy/polys/domains/mpelements.py2# This module is deprecated and should not be used any more. The actualCOMMENT
MEDIUMsympy/polys/domains/algebraicfield.py684 # Create a function to do the conversion efficiently:COMMENT
MEDIUMsympy/polys/matrices/linsolve.py4# This module defines the _linsolve function which is the internal workhorseCOMMENT
MEDIUMsympy/polys/matrices/domainmatrix.py3090 # Define a new polynomial f with f[i] = -(-1)^n*p[i] for i=0..n-1. ThenSTRING
MEDIUMsympy/concrete/summations.py644 # The following code can grows like 2**n where n is theSTRING
MEDIUMsympy/ntheory/generate.py238 # Create the list such that block[x] iff (a + 2x + 1) is prime.COMMENT
MEDIUMsympy/printing/rcode.py212 # This method is called only for inline if constructsCOMMENT
MEDIUMsympy/printing/llvmjitcode.py233 # Create a wrapped double: PyObject* PyFloat_FromDouble(double v)COMMENT
MEDIUMsympy/printing/llvmjitcode.py241 # Create a tuple: PyObject* PyTuple_Pack(Py_ssize_t n, ...)COMMENT
MEDIUMsympy/printing/tests/test_tensorflow.py76# Creating a custom inverse test.COMMENT
MEDIUMsympy/logic/boolalg.py3199 # Create a list of possible replacementsCOMMENT
MEDIUMsympy/logic/boolalg.py3265 # Create a list of possible replacementsCOMMENT
MEDIUMsympy/logic/algorithms/dpll2.py148 # Create the base levelCOMMENT
MEDIUMsympy/logic/algorithms/dpll2.py349 # The following code is not implemented fully, there areCOMMENT
MEDIUMsympy/solvers/ode/nonhomogeneous.py86 # Create a dict root: multiplicity or charrootsSTRING
MEDIUMsympy/solvers/ode/nonhomogeneous.py205 # Create a dict root: multiplicity or charrootsSTRING
MEDIUMsympy/codegen/abstract_nodes.py1"""This module provides containers for python objects that are validSTRING
MEDIUMsympy/codegen/ast.py706 # Create a graph where the nodes are assignments and there is a directed edgeCOMMENT
MEDIUMsympy/codegen/tests/test_applications.py1# This file contains tests that exercise multiple AST nodesCOMMENT
MEDIUMsympy/utilities/lambdify.py929 # Create the function definition code and execute itCOMMENT
MEDIUMsympy/utilities/pkgdata.py1# This module is deprecated and will be removed.COMMENT
MEDIUM⚡sympy/utilities/tests/test_codegen_julia.py48 "# This file is part of 'project'\n"CODE
MEDIUMsympy/utilities/tests/test_codegen_julia.py289 "# This file is part of 'project'\n"CODE
MEDIUMsympy/integrals/laplace.py804 # The following code checks all remaining poles. If t1 is a pole atCOMMENT
MEDIUMsympy/integrals/rationaltools.py1"""This module implements tools for integrating rational functions. """STRING
MEDIUMsympy/integrals/tests/test_integrals.py2160 # Define the symbolsCOMMENT
MEDIUMsympy/integrals/tests/test_integrals.py2164 # Define the integral expressionCOMMENT
MEDIUMsympy/integrals/tests/test_integrals.py2181 # Define the symbol and the integral expressionCOMMENT
MEDIUMsympy/plotting/experimental_lambdify.py407 # Create the final ordered tuples of dictionariesCOMMENT
MEDIUMsympy/plotting/pygletplot/plot_mode.py80 # Create the objectCOMMENT
MEDIUMsympy/plotting/backends/matplotlibbackend/matplotlib.py123 # Create the collectionsCOMMENT
MEDIUMsympy/combinatorics/rewritingsystem.py45 # Create a finite state machine as an instance of the StateMachine objectCOMMENT
MEDIUMsympy/functions/special/hyper.py33 # This method is only needed because hyper._eval_as_leading_term falls backCOMMENT
MEDIUM⚡sympy/functions/special/polynomials.py431 # This function is just kept for backwards compatibilitySTRING
MEDIUM⚡sympy/functions/special/polynomials.py994 # This function is just kept for backwards compatibilitySTRING
MEDIUM⚡sympy/functions/special/polynomials.py1101 # This function is just kept for backwards compatibilitySTRING
MEDIUM⚡sympy/functions/special/polynomials.py1198 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/functions/special/polynomials.py204 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/functions/special/polynomials.py557 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/functions/special/polynomials.py683 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/functions/special/polynomials.py885 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/functions/special/polynomials.py1316 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/functions/special/polynomials.py1442 # This function is just kept for backwards compatibilitySTRING
MEDIUMsympy/tensor/array/expressions/array_expressions.py799 # Create an index, target-position-key array:STRING
MEDIUMsympy/tensor/array/expressions/array_expressions.py2050 # Create a collector for the new diagonal indices:STRING
MEDIUMsympy/geometry/curve.py340 """This function is used to rotate a curve along given point ``pt`` at given angle(in radian).STRING
MEDIUMsympy/physics/mechanics/system.py1518 # Create a list of all of the expressions in the equations of motionCOMMENT
MEDIUMsympy/physics/mechanics/system.py1536 # Create a list of all of the expressions in the equations of motionCOMMENT
MEDIUMsympy/physics/mechanics/wrapping_geometry.py646 """This method is implemented as required by WrappingGeometryBase, use WrappingCone.apex instead."""STRING
MEDIUMsympy/physics/mechanics/lagrange.py212 # Creating the qs, qdots and qdoubledotsCOMMENT
MEDIUMsympy/physics/mechanics/lagrange.py280 # Creating the multipliersCOMMENT
MEDIUMsympy/physics/mechanics/tests/test_lagrange.py46 # Creating the disc 'D'; we create the point that represents the massCOMMENT
MEDIUMsympy/physics/mechanics/tests/test_system.py8# This class is going to be tested using a simple pendulum set up in x and yCOMMENT
MEDIUMsympy/physics/mechanics/tests/test_kane.py276 # Defining the constants and knowns of the systemCOMMENT
MEDIUMsympy/physics/control/lti.py853 >>> #Create a Transfer Function with more than one variableCODE
MEDIUMsympy/physics/control/lti.py907 >>> #Create a Transfer Function with variable poles and zerosCODE
MEDIUMsympy/physics/quantum/kind.py42# Create an instance as many situations need this.COMMENT
MEDIUMsympy/physics/quantum/kind.py56# Create an instance as many situations need this.COMMENT
21 more matches not shown…
Modern Structural Boilerplate172 hits · 174 pts
SeverityFileLineSnippetContext
LOWsympy/__init__.py267__all__ = [CODE
LOWsympy/series/__init__.py20__all__ = ['Order', 'O', 'limit', 'Limit', 'gruntz', 'series', 'approximants',CODE
LOWsympy/crypto/__init__.py19__all__ = [CODE
LOWsympy/core/backend.py113__all__ = [CODE
LOWsympy/core/sorting.py8__all__ = ['default_sort_key', 'ordered']CODE
LOWsympy/core/__init__.py44__all__ = [CODE
LOWsympy/unify/__init__.py12__all__ = [CODE
LOWsympy/polys/rootoftools.py34__all__ = ['CRootOf']CODE
LOWsympy/polys/__init__.py4__all__ = [CODE
LOWsympy/polys/polyoptions.py5__all__ = ["Options"]CODE
LOWsympy/polys/domainmatrix.py13__all__ = ['DomainMatrix']CODE
LOWsympy/polys/orderings.py7__all__ = ["lex", "grlex", "grevlex", "ilex", "igrlex", "igrevlex"]CODE
LOWsympy/polys/series/__init__.py2__all__ = [CODE
LOWsympy/polys/domains/domain.py1579__all__ = ['Domain']CODE
LOWsympy/polys/domains/__init__.py4__all__ = [CODE
LOWsympy/polys/domains/groundtypes.py84__all__ = [CODE
LOWsympy/polys/numberfields/__init__.py4__all__ = [CODE
LOWsympy/polys/numberfields/exceptions.py53__all__ = [CODE
LOWsympy/polys/agca/__init__.py6__all__ = ['homomorphism']CODE
LOWsympy/polys/matrices/__init__.py14__all__ = [CODE
LOWsympy/polys/matrices/exceptions.py64__all__ = [CODE
LOWsympy/polys/matrices/_dfm.py67__all__ = ['DFM']CODE
LOWsympy/concrete/__init__.py5__all__ = [CODE
LOWsympy/holonomic/__init__.py14__all__ = [STRING
LOWsympy/strategies/__init__.py36__all__ = [CODE
LOWsympy/strategies/branch/__init__.py8__all__ = [CODE
LOWsympy/ntheory/__init__.py31__all__ = [CODE
LOWsympy/discrete/__init__.py16__all__ = [CODE
LOWsympy/printing/__init__.py48__all__ = [CODE
LOWsympy/printing/lambdarepr.py10__all__ = [CODE
LOWsympy/printing/dot.py8__all__ = ['dotprint']CODE
LOWsympy/printing/pretty/__init__.py10__all__ = [CODE
LOWsympy/printing/pretty/pretty_symbology.py35__all__ = ['greek_unicode', 'sub', 'sup', 'xsym', 'vobj', 'hobj', 'pretty_symbol',CODE
LOWsympy/algebras/quaternion.py142 def set_norm(self, norm: SExpr | None) -> None:CODE
LOWsympy/algebras/__init__.py4__all__ = ["Quaternion",]CODE
LOWsympy/logic/__init__.py7__all__ = [CODE
LOWsympy/logic/utilities/__init__.py4__all__ = ['load_file']CODE
LOWsympy/solvers/__init__.py45__all__ = [CODE
LOWsympy/solvers/diophantine/__init__.py4__all__ = [CODE
LOWsympy/solvers/diophantine/diophantine.py40__all__ = ['diophantine', 'classify_diop']CODE
LOWsympy/solvers/ode/__init__.py13__all__ = [CODE
LOWsympy/codegen/__init__.py21__all__ = [CODE
LOWsympy/multipledispatch/__init__.py8__all__ = [CODE
LOWsympy/liealgebras/__init__.py4__all__ = ['CartanType']CODE
LOWsympy/utilities/__init__.py18__all__ = [CODE
LOWsympy/utilities/codegen.py101__all__ = [CODE
LOWsympy/utilities/_compilation/__init__.py20__all__ = [CODE
LOWsympy/testing/__init__.py9__all__ = [CODE
LOWsympy/integrals/__init__.py30__all__ = [CODE
LOWsympy/assumptions/__init__.py14__all__ = [CODE
LOWsympy/assumptions/relation/__init__.py12__all__ = ['BinaryRelation', 'AppliedBinaryRelation']CODE
LOWsympy/assumptions/relation/equality.py22__all__ = ['EqualityPredicate', 'UnequalityPredicate', 'StrictGreaterThanPredicate',CODE
LOWsympy/assumptions/relation/binrel.py12__all__ = ["BinaryRelation", "AppliedBinaryRelation"]CODE
LOWsympy/assumptions/handlers/__init__.py10__all__ = [CODE
LOWsympy/plotting/__init__.py10__all__ = [CODE
LOWsympy/plotting/intervalmath/__init__.py7__all__ = [CODE
LOWsympy/plotting/backends/matplotlibbackend/__init__.py6__all__ = ["MatplotlibBackend", "_matplotlib_list"]CODE
LOWsympy/plotting/backends/textbackend/__init__.py4__all__ = ["TextBackend"]CODE
LOWsympy/sets/__init__.py22__all__ = [CODE
LOWsympy/combinatorics/__init__.py19__all__ = [CODE
112 more matches not shown…
AI Structural Patterns91 hits · 86 pts
SeverityFileLineSnippetContext
LOWsympy/crypto/crypto.py767CODE
LOWsympy/crypto/crypto.py791CODE
LOWsympy/crypto/crypto.py891CODE
LOWsympy/crypto/crypto.py961CODE
LOWsympy/crypto/crypto.py1026CODE
LOWsympy/crypto/crypto.py1126CODE
LOWsympy/crypto/crypto.py1167CODE
LOWsympy/crypto/crypto.py2292CODE
LOWsympy/core/exprtools.py1360CODE
LOWsympy/core/numbers.py210CODE
LOWsympy/core/evalf.py1170CODE
LOWsympy/core/function.py2624CODE
LOWsympy/core/expr.py3673CODE
LOWsympy/polys/ring_series.py1386CODE
LOWsympy/polys/ring_series.py1901CODE
LOWsympy/polys/polyroots.py849CODE
LOWsympy/polys/polyroots.py864CODE
LOWsympy/polys/polyroots.py880CODE
LOWsympy/polys/galoistools.py1014CODE
LOWsympy/polys/domains/algebraicfield.py692CODE
LOWsympy/polys/numberfields/minpoly.py212CODE
LOWsympy/polys/numberfields/minpoly.py529CODE
LOWsympy/concrete/summations.py1640CODE
LOWsympy/concrete/summations.py342CODE
LOWsympy/concrete/products.py422CODE
LOWsympy/ntheory/factor_.py1221CODE
LOWsympy/printing/preview.py154CODE
LOWsympy/printing/str.py769CODE
LOWsympy/printing/mathml.py74CODE
LOWsympy/printing/llvmjitcode.py134CODE
LOWsympy/printing/llvmjitcode.py148CODE
LOWsympy/printing/smtlib.py270CODE
LOWsympy/printing/pretty/pretty.py1031CODE
LOWsympy/logic/boolalg.py1764CODE
LOWsympy/logic/boolalg.py3180CODE
LOWsympy/solvers/solveset.py3812CODE
LOWsympy/solvers/ode/ode.py357CODE
LOWsympy/codegen/algorithms.py17CODE
LOWsympy/utilities/autowrap.py547CODE
LOWsympy/utilities/codegen.py1991CODE
LOWsympy/utilities/_compilation/runners.py71CODE
LOWsympy/testing/runtests.py494CODE
LOWsympy/testing/runtests.py995CODE
LOWsympy/assumptions/sathandlers.py100CODE
LOWsympy/assumptions/wrapper.py56CODE
LOWsympy/plotting/experimental_lambdify.py206CODE
LOWsympy/plotting/pygletplot/plot_axes.py14CODE
LOWsympy/plotting/backends/base_backend.py207CODE
LOWsympy/combinatorics/tensor_can.py892CODE
LOWsympy/combinatorics/permutations.py1329CODE
LOWsympy/combinatorics/perm_groups.py1142CODE
LOWsympy/interactive/session.py353CODE
LOWsympy/interactive/printing.py307CODE
LOWsympy/tensor/tensor.py2627CODE
LOWsympy/geometry/polygon.py2878CODE
LOWsympy/physics/hep/gamma_matrices.py198CODE
LOWsympy/physics/hep/gamma_matrices.py221CODE
LOWsympy/physics/mechanics/system.py1328CODE
LOWsympy/physics/mechanics/kane.py264CODE
LOWsympy/physics/mechanics/joint.py136CODE
31 more matches not shown…
Excessive Try-Catch Wrapping73 hits · 64 pts
SeverityFileLineSnippetContext
LOWsetup.py219 except Exception:CODE
MEDIUMsetup.py233 print("Error deleting %s - %s." % (e.filename, e.strerror))CODE
LOWsympy/printing/pycode.py470 except Exception: # noqa: BLE001CODE
LOWsympy/solvers/ode/tests/test_single.py244 except Exception as e:STRING
LOWsympy/testing/pytest.py192 except Exception as e: # noqa: BLE001CODE
MEDIUMsympy/testing/pytest.py189def wrapper():CODE
LOWsympy/testing/runtests.py1234 except Exception: # noqa: BLE001CODE
LOWsympy/testing/runtests.py1279 except Exception:CODE
LOWsympy/testing/runtests.py1304 except Exception: # noqa: BLE001CODE
MEDIUMsympy/plotting/series.py54def wrapper_func(func, *args):CODE
MEDIUMsympy/plotting/series.py1573def _adaptive_sampling(self):CODE
MEDIUMsympy/plotting/series.py1659def _adaptive_sampling(self):CODE
LOWsympy/plotting/series.py89 except Exception as err: # noqa: BLE001CODE
LOWsympy/plotting/series.py1370 except Exception as err: # noqa: BLE001CODE
LOWsympy/plotting/series.py1582 except Exception as err: # noqa: BLE001CODE
LOWsympy/plotting/series.py1670 except Exception as err: # noqa: BLE001CODE
LOWsympy/plotting/pygletplot/plot_mode.py231 except Exception as e:CODE
LOWsympy/plotting/pygletplot/color_scheme.py121 except Exception:CODE
LOWsympy/plotting/pygletplot/color_scheme.py137 except Exception as ex:CODE
LOWsympy/plotting/pygletplot/color_scheme.py223 except Exception:CODE
LOWsympy/plotting/pygletplot/color_scheme.py229 except Exception:CODE
MEDIUMsympy/plotting/pygletplot/color_scheme.py226def __call__(self, x, y, z, u, v):CODE
LOWsympy/plotting/pygletplot/plot_mode_base.py115 except Exception:CODE
LOWsympy/plotting/pygletplot/plot_mode_base.py348 except Exception as e:CODE
MEDIUMsympy/plotting/pygletplot/plot_mode_base.py337def _set_color(self, v):CODE
LOWsympy/plotting/pygletplot/managed_window.py48 except Exception as e:CODE
LOWsympy/plotting/pygletplot/managed_window.py67 except Exception as e:CODE
LOWsympy/interactive/session.py498 except Exception: # noqa: BLE001CODE
LOWsympy/interactive/printing.py95 except Exception as e:CODE
LOWsympy/interactive/printing.py108 except Exception as e:CODE
LOW⚡sympy/parsing/sympy_parser.py1089 except Exception as e: # noqa: BLE001CODE
LOWsympy/parsing/latex/_parse_latex_antlr.py21except Exception:CODE
MEDIUMsympy/parsing/autolev/_listener_autolev_antlr.py1599def exitOutputs2(self, ctx):CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py338 except Exception:CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py344 except Exception:CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py354 except Exception:CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py1365 except Exception:CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py1371 except Exception:CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py1375 except Exception:CODE
LOW⚡sympy/parsing/autolev/_listener_autolev_antlr.py1393 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py250 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py570 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py598 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py619 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py624 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py667 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py916 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py977 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py983 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1037 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1180 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1289 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1291 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1471 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1476 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1582 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1588 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1607 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1668 except Exception:CODE
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1687 except Exception:CODE
13 more matches not shown…
Redundant / Tautological Comments64 hits · 60 pts
SeverityFileLineSnippetContext
LOWsympy/core/relational.py487 # Check if first value has negative signSTRING
LOWsympy/core/sympify.py414 #Check if there exists a converter for any of the types in the mroCOMMENT
LOWsympy/polys/rootconditions.py329 # Check if -1 is a root, since the transformation is not defined in this caseCOMMENT
LOWsympy/polys/polyroots.py569 # Check if f20 has linear factors over domain ZCOMMENT
LOWsympy/ntheory/generate.py526 # Check if n is within the sieve rangeSTRING
LOWsympy/ntheory/factor_.py1496 # Check if it exists in the cacheSTRING
LOWsympy/logic/algorithms/dpll2.py228 # Check if unit prop says the theory is unsat right off the batCOMMENT
LOWsympy/logic/algorithms/dpll2.py319 # Check if we've made the theory unsatCOMMENT
LOWsympy/logic/algorithms/dpll2.py728 # Check if no sentinel update existsCOMMENT
LOWsympy/solvers/solvers.py2243 # Check if there are any non-zero solutions at allSTRING
LOWsympy/solvers/solveset.py2871 # Check if 'symbols' is a set and raise an error if it isSTRING
LOWsympy/solvers/diophantine/diophantine.py580 # Check if the coefficients of y and x obtained are integers or notCOMMENT
LOWsympy/solvers/ode/single.py2834 # Check if b3 = 0 (no first derivative term) or a3 = 0 (no second derivative term)STRING
LOWsympy/solvers/ode/single.py2842 # Check if c3 is of the form A*x^k where k has free symbolsSTRING
LOWsympy/solvers/ode/ode.py2600 # Check if second frobenius series solution exists.STRING
LOWsympy/solvers/ode/riccati.py318 # Check if coefficients are not symbols and floatsSTRING
LOWsympy/solvers/ode/riccati.py365 # Check if degree of numerator is same as denominatorSTRING
LOWsympy/solvers/ode/riccati.py725 # Check if there are any constantsSTRING
LOWsympy/testing/runtests.py1104 # Read the file, convert it to a test, and run it.COMMENT
LOWsympy/plotting/series.py2578 # Check if any point in between is validCOMMENT
LOWsympy/combinatorics/rewritingsystem.py400 # Check if the transition to any new state in possible.COMMENT
LOWsympy/functions/special/bsplines.py65 # Check if arg2 condition smaller than arg1,COMMENT
LOW⚡sympy/functions/elementary/integers.py604 # Check if other <= 0STRING
LOW⚡sympy/functions/elementary/integers.py607 # Check if other >= 1STRING
LOW⚡sympy/functions/elementary/integers.py616 # Check if other < 0STRING
LOW⚡sympy/functions/elementary/integers.py620 # Check if other >= 1STRING
LOW⚡sympy/functions/elementary/integers.py628 # Check if other < 0STRING
LOW⚡sympy/functions/elementary/integers.py631 # Check if other >= 1STRING
LOW⚡sympy/functions/elementary/integers.py640 # Check if other <= 0STRING
LOW⚡sympy/functions/elementary/integers.py643 # Check if other >= 1STRING
LOWsympy/functions/elementary/integers.py701 # Check if other < 0STRING
LOWsympy/functions/elementary/integers.py704 # Check if other >= 1STRING
LOW⚡sympy/tensor/tensor.py2230 # Check if variance of indices needs to be fixed:STRING
LOWsympy/tensor/array/ndim_array.py184 # Check if any index is symbolic:COMMENT
LOWsympy/tensor/array/expressions/from_array_to_matrix.py1005 # Check if expression is a trace:STRING
LOWsympy/tensor/array/expressions/from_indexed_to_array.py209 # Check if there are KroneckerDelta objects:STRING
LOWsympy/tensor/array/expressions/from_indexed_to_array.py271 # Check if all indices are compatible. Otherwise expand the dimensions:STRING
LOWsympy/tensor/array/expressions/array_expressions.py414 # Check if there are nested ArraySum objects:STRING
LOWsympy/tensor/array/expressions/array_expressions.py434 # Check if there are nested permutation and lift them up:STRING
LOWsympy/tensor/tests/test_tensor.py1046 #Check if contract_metric gets into an infinite loop when given a TensMul whose coeff is an AddCOMMENT
LOWsympy/tensor/tests/test_tensor.py1139 #Check if TensAdd.contract_delta can handle the case when the TensAdd has non-TensExpr args.COMMENT
LOWsympy/physics/mechanics/system.py1056 # Check if all joint coordinates and speeds are presentCOMMENT
LOWsympy/physics/mechanics/tests/test_linearize.py335 # Check if passing a function to linear_solver worksCOMMENT
LOWsympy/physics/mechanics/tests/test_actuator.py747 # Check if DuffingSpring correctly initializes its attributesSTRING
LOWsympy/physics/mechanics/tests/test_actuator.py812 # Check if certain properties of DuffingSpring object are immutable after initializationSTRING
LOWsympy/physics/mechanics/tests/test_actuator.py827 # Check if the actual string representation of DuffingSpring instance matches the expected string for each provided STRING
LOWsympy/physics/mechanics/tests/test_actuator.py855 # Check if the absolute value of the difference is below a thresholdSTRING
LOWsympy/physics/continuum_mechanics/beam.py3062 # Check if any of the evaluated reaction exists in another directionCOMMENT
LOWsympy/physics/continuum_mechanics/tests/test_column.py299 c2.apply_support(10) # Check if order of applying supports mattersCODE
LOWsympy/physics/vector/frame.py72 # Check if the other object is a CoordinateSym of the same frame andCOMMENT
LOWsympy/physics/vector/frame.py556 # Check if the dcm wrt that frame has already been calculatedSTRING
LOWsympy/physics/control/lti.py2612 # Check if the system is a StateSpaceSTRING
LOWsympy/physics/control/tests/test_lti.py3290 # Check if the system is SISO or MIMO.COMMENT
LOWsympy/physics/control/tests/test_lti.py4256 # Check if the system is SISO or MIMO.COMMENT
LOWsympy/physics/quantum/density.py48 # Check if arg is a tupleCOMMENT
LOWsympy/physics/quantum/identitysearch.py91 # Check if it's diagonalCOMMENT
LOWsympy/physics/quantum/identitysearch.py94 # Check if the rows indices and columns indices are the sameCOMMENT
LOWsympy/parsing/mathematica.py936 # Check if the regular expression has already been compiled:COMMENT
LOWsympy/vector/vector.py193 # Check if the other is a del operatorCOMMENT
LOWsympy/categories/diagram_drawing.py2143 # Check if there's space to the left.STRING
4 more matches not shown…
AI Slop Vocabulary34 hits · 52 pts
SeverityFileLineSnippetContext
LOWsympy/core/add.py1168 # so we just use the same sort as is used in Add.flatten. When theCOMMENT
LOWsympy/core/operations.py410 # here, we have a number so we just call to _evalf with prec;COMMENT
LOWsympy/core/expr.py512 # Probably this method should just return self.evalf(2).is_Number.COMMENT
LOWsympy/core/expr.py3722 # now, we just use a special case to make multinomial run before mul,COMMENT
LOWsympy/polys/rings.py2440 # Can just use self.flint_poly.to_dict() in case of python-flintCOMMENT
LOWsympy/polys/matrices/_dfm.py587 # time of writng just use Bareiss for all matrices and domains.COMMENT
LOWsympy/polys/matrices/tests/test_xxm.py906 # XXX: Change the signature to just return the nullspace. PossiblyCOMMENT
MEDIUMsympy/concrete/summations.py1649 # robust than the current implementation of ``residue`` which uses a seriesCOMMENT
MEDIUMsympy/printing/pretty/pretty_symbology.py59 """See if unicode output is available and leverage it if possible"""STRING
MEDIUMsympy/solvers/solvers.py1499 # Poly is generally robust enough to convert anything toCOMMENT
LOWsympy/solvers/solvers.py2281 # If there is a non-trivial solution, just set the free variables toSTRING
LOWsympy/solvers/ode/nonhomogeneous.py197 # Can't just call roots because it doesn't return rootof for unsolveableSTRING
LOWsympy/solvers/ode/tests/test_ode.py95 # Maybe this should just use one of the solutions instead of raising...COMMENT
MEDIUMsympy/utilities/tests/test_misc.py140 # expected; Q.prime is more nuanced in its response forCOMMENT
MEDIUMsympy/testing/runtests.py1960 # in conjunction with the ELLIPSIS flag.STRING
MEDIUMsympy/integrals/intpoly.py976 # TODO : This part is quite hacky. Should be made more robust withCOMMENT
LOWsympy/assumptions/tests/test_sathandlers.py18 # The predicate doesn't matter here, so just passCOMMENT
LOWsympy/plotting/intervalmath/interval_arithmetic.py15# Q: Why use numpy? Why not simply use mpmath's interval arithmetic?COMMENT
MEDIUMsympy/combinatorics/free_groups.py171 """Return a tuple of arguments that must be passed to __new__ in order to support pickling this object."""STRING
MEDIUMsympy/tensor/array/expressions/from_array_to_matrix.py1152 # element set to None) and counting their free axes -- this is robustSTRING
LOWsympy/physics/hep/gamma_matrices.py452 # no contractions in `expression`, just return it.STRING
MEDIUMsympy/physics/mechanics/tests/test_kane3.py187 # model to the reference eigen values. Look at the aforementioned paper forCOMMENT
MEDIUMsympy/physics/vector/tests/test_functions.py344 #The use of time_derivative for calculations pertaining to scalarCOMMENT
LOWsympy/physics/quantum/spin.py1074 # we could just use this unless there are cases when this is not trueCOMMENT
LOWsympy/physics/quantum/represent.py266 # vectors are taken. In these cases, we simply return a scalar.COMMENT
LOWsympy/physics/quantum/gate.py224 # If the controls are not met, just returnCOMMENT
LOWsympy/physics/quantum/qapply.py145 if not nc_part: # If we only have a commuting part, just return it.CODE
LOWsympy/physics/quantum/operatorset.py261 # If this fails, just return the classesCOMMENT
LOWsympy/physics/quantum/state.py156 # If height is 1, just return bracketsCOMMENT
LOWsympy/parsing/mathematica.py736 # further ``::`` sections simply add more of them. It binds tighter thanCOMMENT
LOWsympy/parsing/sympy_parser.py1252 # keywords=[]: If ommited, keywords would have the default value of None, it will just return an AttribuCOMMENT
LOWsympy/simplify/trigsimp.py265 # We just add the extragens to gens and analyse them as beforeCOMMENT
MEDIUMsympy/simplify/hyperexpand.py2121 """ Try to apply ``shifter`` in order to bring some element in ``f``STRING
MEDIUMsympy/matrices/eigen.py307 # the multiplicity correct. This is not robust enough in generalSTRING
TODO Padding13 hits · 22 pts
SeverityFileLineSnippetContext
LOWsympy/polys/domains/domain.py629 # TODO: implement this in from_ methodsCOMMENT
LOWsympy/integrals/prde.py840 # TODO: implement thisCOMMENT
LOW⚡sympy/integrals/tests/test_rde.py157 # TODO: Add test for when the degree bound becomes larger after limited_integrateCOMMENT
LOW⚡sympy/integrals/tests/test_rde.py158 # TODO: Add test for db == da - 1 caseCOMMENT
LOW⚡sympy/integrals/tests/test_rde.py161 # TODO: Add testsCOMMENT
LOW⚡sympy/integrals/tests/test_rde.py162 # TODO: Add test for when the degree becomes larger after parametric_log_deriv()COMMENT
LOWsympy/integrals/tests/test_risch.py302 # TODO: Add tests for integrate_hyperexponential() from the bookCOMMENT
LOWsympy/integrals/tests/test_prde.py158 # TODO: Add test for deg(b) <= 0 with b smallCOMMENT
LOWsympy/assumptions/handlers/matrices.py49 # TODO: implement sathandlers system for the matrices.COMMENT
LOWsympy/assumptions/handlers/matrices.py79 # TODO: implement sathandlers system for the matrices.COMMENT
LOWsympy/assumptions/handlers/matrices.py96 # TODO: implement sathandlers system for the matrices.COMMENT
LOWsympy/physics/quantum/tests/test_cartesian.py114 # TODO: Add tests for representationsCOMMENT
LOWsympy/stats/matrix_distributions.py115 ### TODO: Add tests after adding matrix distributions in numpy_rv_mapCOMMENT
Dead Code8 hits · 16 pts
SeverityFileLineSnippetContext
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py56CODE
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py57CODE
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py58CODE
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py60CODE
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py61CODE
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py62CODE
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py64CODE
MEDIUMdoc/ext/docscrape_sphinx.py34CODE
Slop Phrases9 hits · 12 pts
SeverityFileLineSnippetContext
LOWsympy/core/mul.py28# "there are still non-commutative objects -- don't forget to process them"COMMENT
LOWsympy/core/mul.py28# "there are still non-commutative objects -- don't forget to process them"COMMENT
LOWsympy/core/mul.py365 # append non-commutative marker, so we don't forget toCOMMENT
LOWsympy/core/mul.py365 # append non-commutative marker, so we don't forget toCOMMENT
LOWsympy/core/basic.py1505 non-Basic iterable. Don't forget to unpackCODE
LOWsympy/solvers/tests/test_inequalities.py473 # make sure to include conditions under which solution is validCOMMENT
MEDIUMsympy/integrals/integrals.py1236 For demonstration purposes, this interval will only be split into 2CODE
LOWsympy/interactive/printing.py141 # If you're adding another type, make sure you add it to printable_typesCOMMENT
LOWsympy/categories/diagram_drawing.py697 # Don't forget to assure the proper ordering of the verticesSTRING
Structural Annotation Overuse14 hits · 10 pts
SeverityFileLineSnippetContext
LOWsympy/core/basic.py2199 # WARNING: This API is experimental.COMMENT
LOWsympy/polys/densetools.py1545 # Step 0: h = x / f mod x**(n-1)STRING
LOWsympy/ntheory/primetest.py739 # Step 2: deterministic Miller-Rabin testing for numbers < 2^64. See:STRING
LOWsympy/ntheory/primetest.py796 # Step 3: BPSW.STRING
LOW⚡sympy/solvers/ode/riccati.py800 # Step 1 : Convert to Normal FormSTRING
LOW⚡sympy/solvers/ode/riccati.py810 # Step 3 : a(x) is 0STRING
LOW⚡sympy/solvers/ode/riccati.py815 # Step 4 : a(x) is a non-zero constantSTRING
LOW⚡sympy/solvers/ode/riccati.py819 # Step 5 : Find poles and valuation at infinitySTRING
LOW⚡sympy/solvers/ode/riccati.py855 # Step 10 : Check if a valid solution exists. If yes, also checkSTRING
LOW⚡sympy/solvers/ode/riccati.py859 # Step 11 : Find polynomial solutions of degree m for the auxiliary equationSTRING
LOW⚡sympy/solvers/ode/riccati.py862 # Step 12 : If valid polynomial solution exists, append solution.STRING
LOWsympy/solvers/ode/riccati.py836 # Step 7 : Iterate over all possible combinations and return solutionsSTRING
LOWsympy/solvers/ode/riccati.py885 # Step 15 : Inverse transform the solutions of the equation in normal formSTRING
LOWsympy/interactive/tests/test_ipython.py22# WARNING: These tests will modify the existing IPython environment. IPythonCOMMENT
Synthetic Comment Markers2 hits · 10 pts
SeverityFileLineSnippetContext
HIGHAGENTS.md29- **If an entire commit is generated by AI, this should be specified in theCODE
HIGH.github/PULL_REQUEST_TEMPLATE.md44like it was generated by AI then the PR will be closed. -->CODE
Verbosity Indicators15 hits · 10 pts
SeverityFileLineSnippetContext
LOWsympy/polys/densetools.py1545 # Step 0: h = x / f mod x**(n-1)STRING
LOWsympy/ntheory/primetest.py739 # Step 2: deterministic Miller-Rabin testing for numbers < 2^64. See:STRING
LOWsympy/ntheory/primetest.py796 # Step 3: BPSW.STRING
LOWsympy/solvers/ode/systems.py1338 To check if the equations are constant coefficient, we need to check if all the terms inCODE
LOWsympy/solvers/ode/systems.py1341 To check if the equations are homogeneous or not, we need to check if b is a zero matrixCODE
LOW⚡sympy/solvers/ode/riccati.py800 # Step 1 : Convert to Normal FormSTRING
LOW⚡sympy/solvers/ode/riccati.py810 # Step 3 : a(x) is 0STRING
LOW⚡sympy/solvers/ode/riccati.py815 # Step 4 : a(x) is a non-zero constantSTRING
LOW⚡sympy/solvers/ode/riccati.py819 # Step 5 : Find poles and valuation at infinitySTRING
LOW⚡sympy/solvers/ode/riccati.py855 # Step 10 : Check if a valid solution exists. If yes, also checkSTRING
LOW⚡sympy/solvers/ode/riccati.py859 # Step 11 : Find polynomial solutions of degree m for the auxiliary equationSTRING
LOW⚡sympy/solvers/ode/riccati.py862 # Step 12 : If valid polynomial solution exists, append solution.STRING
LOWsympy/solvers/ode/riccati.py836 # Step 7 : Iterate over all possible combinations and return solutionsSTRING
LOWsympy/solvers/ode/riccati.py885 # Step 15 : Inverse transform the solutions of the equation in normal formSTRING
LOWsympy/simplify/hyperexpand.py965 self._poly variable. This variable stores a polynomial. By conventionSTRING
Fake / Example Data13 hits · 4 pts
SeverityFileLineSnippetContext
LOW⚡sympy/tensor/tensor.py3541 dummy_data.sort(key=lambda x: x[3])STRING
LOW⚡sympy/tensor/tensor.py3542 return indices, free, free_names, dummy_dataSTRING
LOW⚡sympy/tensor/tensor.py3545 def _dummy_data_to_dum(dummy_data):STRING
LOW⚡sympy/tensor/tensor.py3546 return [(p2a, p2b) for (i, p1a, p1b, p2a, p2b) in dummy_data]STRING
LOW⚡sympy/tensor/tensor.py3555 indices, free, free_names, dummy_data = TensMul._indices_to_free_dum(args_indices)STRING
LOW⚡sympy/tensor/tensor.py3565 for old_index, pos1cov, pos1contra, pos2cov, pos2contra in dummy_data:STRING
LOW⚡sympy/tensor/tensor.py3585 indices, free, free_names, dummy_data = TensMul._indices_to_free_dum(args_indices)STRING
LOW⚡sympy/tensor/tensor.py3587 dum = TensMul._dummy_data_to_dum(dummy_data)STRING
LOWsympy/tensor/tensor.py3501 dummy_data = []STRING
LOWsympy/tensor/tensor.py3526 dummy_data.append((index, pos1, other_pos1, pos2, other_pos2))STRING
LOWsympy/tensor/tensor.py3528 dummy_data.append((-index, other_pos1, pos1, other_pos2, pos2))STRING
LOWsympy/tensor/tensor.py4197 indices, free, free_names, dummy_data = TensMul._indices_to_free_dum(args_indices)STRING
LOWsympy/tensor/tensor.py4198 dum = TensMul._dummy_data_to_dum(dummy_data)STRING
Modern AI Meta-Vocabulary1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUMsympy/utilities/tests/test_enumerative.py12# first some functions only useful as test scaffolding - these provideCOMMENT
Overly Generic Function Names3 hits · 2 pts
SeverityFileLineSnippetContext
LOWsympy/core/tests/test_eval.py92def test_function():CODE
LOWsympy/parsing/tests/test_c_parser.py940 def test_function():CODE
LOWsympy/parsing/tests/test_fortran_parser.py279 def test_function():STRING