Home / sympy / sympy
Repository Analysis

sympy/sympy

A computer algebra system written in pure Python

14.9 Low AI signal View on GitHub
14.9
Adjusted Score
14.9
Raw Score
100%
Time Factor
2026-05-30
Last Push
14,656
Stars
Python
Language
811,403
Lines of Code
1645
Files
10626
Pattern Hits
2026-05-31
Scan Date

Score History

Severity Breakdown

CRITICAL 0HIGH 596MEDIUM 389LOW 9641

Pattern Findings

10626 matches across 16 categories. Click a row to expand file-level details.

Unused Imports5135 hits · 3780 pts
SeverityFileLineSnippet
LOWconftest.py3
LOWconftest.py3
LOWconftest.py3
LOWisympy.py316
LOWsympy/conftest.py1
LOWsympy/release.py1
LOWsympy/this.py4
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
LOWsympy/__init__.py56
5075 more matches not shown…
Hyper-Verbose Identifiers2611 hits · 2428 pts
SeverityFileLineSnippet
LOWsympy/conftest.py76def pytest_collection_modifyitems(config, items):
LOWsympy/series/tests/test_sequences.py294def test_find_linear_recurrence():
LOWsympy/series/tests/test_limits.py211def test_floor_requires_robust_assumptions():
LOWsympy/series/tests/test_limits.py241def test_ceiling_requires_robust_assumptions():
LOWsympy/series/tests/test_limits.py373def test_bessel_functions_at_infinity():
LOWsympy/series/tests/test_order.py326def test_order_conjugate_transpose():
LOWsympy/series/tests/test_order.py339def test_order_noncommutative():
LOWsympy/series/tests/test_order.py397def test_mixing_order_at_zero_and_infinity():
LOWsympy/series/tests/test_order.py441def test_order_failing_due_to_solveset():
LOWsympy/series/tests/test_order.py459def test_performance_of_adding_order():
LOWsympy/series/tests/test_formal.py81def test_rational_independent():
LOWsympy/series/tests/test_formal.py389def test_fps__logarithmic_singularity():
LOWsympy/series/tests/test_formal.py398def test_fps__logarithmic_singularity_fail():
LOWsympy/series/tests/test_series.py204def test_exp_product_positive_factors():
LOWsympy/series/tests/test_gruntz.py98def test_gruntz_evaluation_slow():
LOWsympy/series/tests/test_gruntz.py129def test_gruntz_eval_special_slow():
LOWsympy/series/tests/test_gruntz.py137def test_grunts_eval_special_slow_sometimes_fail():
LOWsympy/series/tests/test_gruntz.py148def test_gruntz_eval_special_fail():
LOWsympy/series/tests/test_approximants.py30def test_pade_approximants_gcdex():
LOWsympy/series/tests/test_approximants.py65def test_pade_approximant_gcdex():
LOWsympy/crypto/crypto.py2452def lfsr_connection_polynomial(s):
LOWsympy/crypto/tests/test_crypto.py74def test_encipher_substitution():
LOWsympy/crypto/tests/test_crypto.py229def test_mutltiprime_rsa_full_example():
LOWsympy/crypto/tests/test_crypto.py331def test_rsa_multiprime_exhanstive():
LOWsympy/crypto/tests/test_crypto.py352def test_rsa_multipower_exhanstive():
LOWsympy/crypto/tests/test_crypto.py431def test_lfsr_autocorrelation():
LOWsympy/crypto/tests/test_crypto.py439def test_lfsr_connection_polynomial():
LOWsympy/crypto/tests/test_crypto.py506def test_encipher_decipher_gm():
LOWsympy/crypto/tests/test_crypto.py536def test_encipher_decipher_bg():
LOWsympy/core/facts.py96def deduce_alpha_implications(implications):
LOWsympy/core/facts.py136def apply_beta_to_alpha_route(alpha_implications, beta_rules):
LOWsympy/core/add.py24def _could_extract_minus_sign(expr):
LOWsympy/core/add.py614 def _eval_is_rational_function(self, syms):
LOWsympy/core/add.py764 def _eval_is_extended_positive(self):
LOWsympy/core/add.py816 def _eval_is_extended_nonnegative(self):
LOWsympy/core/add.py831 def _eval_is_extended_nonpositive(self):
LOWsympy/core/add.py846 def _eval_is_extended_negative(self):
LOWsympy/core/numbers.py1027 def _eval_is_extended_negative(self):
LOWsympy/core/numbers.py1034 def _eval_is_extended_positive(self):
LOWsympy/core/random.py105def test_derivative_numerically(f, z, tol=1.0e-6, a=2, b=-1, c=3, d=1):
LOWsympy/core/mul.py1284 def _eval_is_rational_function(self, syms):
LOWsympy/core/mul.py1306 def _eval_is_zero_infinite_helper(self):
LOWsympy/core/mul.py1594 def _eval_is_extended_positive(self):
LOWsympy/core/mul.py1647 def _eval_is_extended_negative(self):
LOWsympy/core/basic.py156def _get_postprocessors_for_type(arg_type):
LOWsympy/core/basic.py2122 def _exec_constructor_postprocessors(cls, obj):
LOWsympy/core/evalf.py1763def _evalf_with_bounded_error(x: Expr, eps: Expr | None = None,
LOWsympy/core/power.py1318 def _eval_is_rational_function(self, syms):
LOWsympy/core/power.py404 def _eval_is_extended_positive(self):
LOWsympy/core/power.py433 def _eval_is_extended_negative(self):
LOWsympy/core/function.py1930 def _get_zero_with_shape_like(cls, expr):
LOWsympy/core/function.py1934 def _dispatch_eval_derivative_n_times(cls, expr, v, count):
LOWsympy/core/assumptions.py230def _load_pre_generated_assumption_rules() -> FactRules:
LOWsympy/core/assumptions.py238def _generate_assumption_rules():
LOWsympy/core/assumptions.py623def _prepare_class_assumptions(cls):
LOWsympy/core/expr.py911 def _eval_is_extended_positive_negative(self, positive):
LOWsympy/core/expr.py950 def _eval_is_extended_positive(self):
LOWsympy/core/expr.py953 def _eval_is_extended_negative(self):
LOWsympy/core/expr.py4016 def _eval_derivative_matrix_lines(self, x):
LOWsympy/core/expr.py4054 def _eval_is_rational_function(self, syms):
2551 more matches not shown…
Cross-File Repetition321 hits · 1605 pts
SeverityFileLineSnippet
HIGHsympy/core/add.py0efficiently extract the coefficient of a summation.
HIGHsympy/core/numbers.py0efficiently extract the coefficient of a summation.
HIGHsympy/core/numbers.py0efficiently extract the coefficient of a summation.
HIGHsympy/core/expr.py0efficiently extract the coefficient of a summation.
HIGHsympy/vector/basisdependent.py0efficiently extract the coefficient of a summation.
HIGHsympy/core/relational.py0a boolean argument can only be used in eq and ne; all other relationals expect real expressions.
HIGHsympy/logic/boolalg.py0a boolean argument can only be used in eq and ne; all other relationals expect real expressions.
HIGHsympy/logic/boolalg.py0a boolean argument can only be used in eq and ne; all other relationals expect real expressions.
HIGHsympy/core/basic.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.
HIGHsympy/core/function.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.
HIGHsympy/core/expr.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.
HIGHsympy/core/expr.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.
HIGHsympy/tensor/indexed.py0the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.
HIGHsympy/polys/polyclasses.py0convert ``f`` to a list representation with native coefficients.
HIGHsympy/polys/polyclasses.py0convert ``f`` to a list representation with native coefficients.
HIGHsympy/polys/polyclasses.py0convert ``f`` to a list representation with native coefficients.
HIGHsympy/polys/polyclasses.py0convert ``f`` to a list representation with native coefficients.
HIGHsympy/polys/polyclasses.py0returns all non-zero terms from ``f`` in lex order.
HIGHsympy/polys/polyclasses.py0returns all non-zero terms from ``f`` in lex order.
HIGHsympy/polys/polyclasses.py0returns all non-zero terms from ``f`` in lex order.
HIGHsympy/polys/polyclasses.py0subtract an element of the ground domain from ``f``.
HIGHsympy/polys/polyclasses.py0subtract an element of the ground domain from ``f``.
HIGHsympy/polys/polyclasses.py0subtract an element of the ground domain from ``f``.
HIGHsympy/polys/polyclasses.py0subtract an element of the ground domain from ``f``.
HIGHsympy/polys/polyclasses.py0multiply ``f`` by a an element of the ground domain.
HIGHsympy/polys/polyclasses.py0multiply ``f`` by a an element of the ground domain.
HIGHsympy/polys/polyclasses.py0multiply ``f`` by a an element of the ground domain.
HIGHsympy/polys/polyclasses.py0quotient of ``f`` by a an element of the ground domain.
HIGHsympy/polys/polyclasses.py0quotient of ``f`` by a an element of the ground domain.
HIGHsympy/polys/polyclasses.py0quotient of ``f`` by a an element of the ground domain.
HIGHsympy/polys/polyclasses.py0subtract two multivariate polynomials ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0subtract two multivariate polynomials ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0subtract two multivariate polynomials ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0multiply two multivariate polynomials ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0multiply two multivariate polynomials ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0multiply two multivariate polynomials ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0polynomial exact pseudo-quotient of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0polynomial exact pseudo-quotient of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0polynomial exact pseudo-quotient of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0polynomial division with remainder of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0polynomial division with remainder of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0polynomial division with remainder of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0computes polynomial exact quotient of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0computes polynomial exact quotient of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0computes polynomial exact quotient of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0computes the ``m``-th order indefinite integral of ``f`` in ``x_j``.
HIGHsympy/polys/polyclasses.py0computes the ``m``-th order indefinite integral of ``f`` in ``x_j``.
HIGHsympy/polys/polyclasses.py0computes the ``m``-th order indefinite integral of ``f`` in ``x_j``.
HIGHsympy/polys/polyclasses.py0computes subresultant prs sequence of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0computes subresultant prs sequence of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0computes subresultant prs sequence of ``f`` and ``g``.
HIGHsympy/polys/polyclasses.py0returns gcd of ``f`` and ``g`` and their cofactors.
HIGHsympy/polys/polyclasses.py0returns gcd of ``f`` and ``g`` and their cofactors.
HIGHsympy/polys/polyclasses.py0returns gcd of ``f`` and ``g`` and their cofactors.
HIGHsympy/polys/polyclasses.py0cancel common factors in a rational function ``f/g``.
HIGHsympy/polys/polyclasses.py0cancel common factors in a rational function ``f/g``.
HIGHsympy/polys/polyclasses.py0cancel common factors in a rational function ``f/g``.
HIGHsympy/polys/polyclasses.py0cancel common factors in a rational function ``f/g``.
HIGHsympy/polys/polyclasses.py0cancel common factors in a rational function ``f/g``.
HIGHsympy/polys/polyclasses.py0computes functional composition of ``f`` and ``g``.
261 more matches not shown…
Cross-Language Confusion274 hits · 1541 pts
SeverityFileLineSnippet
HIGHsympy/core/relational.py393 left, right = [i.equals(j,
HIGHsympy/core/relational.py400 lr, rl = [i.equals(j, failing_expression=failing_expression)
HIGHsympy/core/relational.py417 left = a.lhs.equals(b.lhs,
HIGHsympy/core/relational.py421 right = a.rhs.equals(b.rhs,
HIGHsympy/core/relational.py446 elif dif.equals(0): # XXX this is expensive
HIGHsympy/core/evalf.py454 if not re_im.equals(0):
HIGHsympy/core/power.py1819 bz = b.equals(0)
HIGHsympy/core/power.py1829 bz = b.equals(0)
HIGHsympy/core/power.py1835 return e.equals(0)
HIGHsympy/core/power.py46 | | | undefined, but is convenient in some contexts |
HIGHsympy/core/expr.py737 if b is not None and b is not S.NaN and b.equals(a) is False:
HIGHsympy/core/expr.py741 if b is not None and b is not S.NaN and b.equals(a) is False:
HIGHsympy/core/expr.py746 if b.equals(a) is False:
HIGHsympy/core/expr.py373 ok = self.equals(i)
HIGHsympy/core/expr.py813 fac_zero = [fac.equals(0) for fac in factors]
HIGHsympy/core/expr.py3909 if i.equals(0):
HIGHsympy/core/expr.py3982 if x.equals(0):
HIGHsympy/core/tests/test_assumptions.py1053 assert e.equals(0) is True
HIGHsympy/core/tests/test_expr.py1938 assert meter.equals(0) is False
HIGHsympy/core/tests/test_expr.py1942 assert eq.equals(0)
HIGHsympy/core/tests/test_expr.py1951 assert diff.equals(0) is None # should be False, but previously this was False due to wrong intermediate result
HIGHsympy/core/tests/test_expr.py1961 assert eq.equals(0)
HIGHsympy/core/tests/test_expr.py1986 assert z.equals(0)
HIGHsympy/core/tests/test_expr.py2229 assert f1.equals(f2) is None
HIGHsympy/core/tests/test_expr.py2297 assert x.equals(y) is False
HIGHsympy/core/tests/test_sympify.py557 assert all(set(i.values()) == {null} for i in (
HIGHsympy/polys/rootoftools.py749 elif poly.length() == 2 and poly.TC():
HIGHsympy/polys/polyroots.py1018 if f.length() == 2 and n > 2:
HIGHsympy/polys/polyroots.py1085 if f.length() == 2:
HIGHsympy/polys/polyroots.py1148 elif f.length() == 2:
HIGHsympy/polys/matrices/tests/test_nullspace.py118def _divide_last(null):
HIGHsympy/polys/matrices/tests/test_nullspace.py137def _check_primitive(null, null_ans):
HIGHsympy/polys/matrices/tests/test_nullspace.py139 null = _to_DM(null, null_ans)
HIGHsympy/polys/matrices/tests/test_nullspace.py144def _check_divided(null, null_ans):
HIGHsympy/polys/matrices/tests/test_nullspace.py146 null = _to_DM(null, null_ans)
HIGHsympy/printing/tests/test_c.py200 assert ccode(x & y) == "x && y"
HIGHsympy/printing/tests/test_c.py201 assert ccode(x | y) == "x || y"
HIGHsympy/printing/tests/test_c.py203 assert ccode(x & y & z) == "x && y && z"
HIGHsympy/printing/tests/test_c.py204 assert ccode(x | y | z) == "x || y || z"
HIGHsympy/printing/tests/test_c.py205 assert ccode((x & y) | z) == "z || x && y"
HIGHsympy/printing/tests/test_c.py205 assert ccode((x & y) | z) == "z || x && y"
HIGHsympy/printing/tests/test_c.py206 assert ccode((x | y) & z) == "z && (x || y)"
HIGHsympy/printing/tests/test_c.py208 assert ccode(x ^ y) == '(x || y) && (!x || !y)'
HIGHsympy/printing/tests/test_c.py209 assert ccode((x ^ y) ^ z) == '(x || y || z) && (x || !y || !z) && (y || !x || !z) && (z || !x || !y)'
HIGHsympy/printing/tests/test_c.py211 assert ccode(Equivalent(x, z ^ y, Implies(z, x))) == '(x || (y || !z) && (z || !y)) && (z && !x || (y || z) && (!y |
HIGHsympy/printing/tests/test_glsl.py105 assert glsl_code(x & y) == "x && y"
HIGHsympy/printing/tests/test_glsl.py106 assert glsl_code(x | y) == "x || y"
HIGHsympy/printing/tests/test_glsl.py108 assert glsl_code(x & y & z) == "x && y && z"
HIGHsympy/printing/tests/test_glsl.py109 assert glsl_code(x | y | z) == "x || y || z"
HIGHsympy/printing/tests/test_glsl.py110 assert glsl_code((x & y) | z) == "z || x && y"
HIGHsympy/printing/tests/test_glsl.py110 assert glsl_code((x & y) | z) == "z || x && y"
HIGHsympy/printing/tests/test_glsl.py111 assert glsl_code((x | y) & z) == "z && (x || y)"
HIGHsympy/printing/tests/test_julia.py143 assert julia_code(x & y) == "x && y"
HIGHsympy/printing/tests/test_julia.py144 assert julia_code(x | y) == "x || y"
HIGHsympy/printing/tests/test_julia.py146 assert julia_code(x & y & z) == "x && y && z"
HIGHsympy/printing/tests/test_julia.py147 assert julia_code(x | y | z) == "x || y || z"
HIGHsympy/printing/tests/test_julia.py148 assert julia_code((x & y) | z) == "z || x && y"
HIGHsympy/printing/tests/test_julia.py148 assert julia_code((x & y) | z) == "z || x && y"
HIGHsympy/printing/tests/test_julia.py149 assert julia_code((x | y) & z) == "z && (x || y)"
HIGHsympy/printing/tests/test_rust.py123 assert rust_code(k & m) == "k && m"
214 more matches not shown…
Deep Nesting1510 hits · 1430 pts
SeverityFileLineSnippet
LOWisympy.py175
LOWsympy/series/sequences.py304
LOWsympy/series/sequences.py1119
LOWsympy/series/sequences.py1229
LOWsympy/series/limits.py70
LOWsympy/series/limits.py198
LOWsympy/series/limits.py265
LOWsympy/series/order.py132
LOWsympy/series/order.py376
LOWsympy/series/order.py462
LOWsympy/series/formal.py31
LOWsympy/series/formal.py418
LOWsympy/series/formal.py789
LOWsympy/series/formal.py1059
LOWsympy/series/formal.py1109
LOWsympy/series/gruntz.py249
LOWsympy/series/gruntz.py368
LOWsympy/series/gruntz.py428
LOWsympy/series/gruntz.py541
LOWsympy/series/gruntz.py662
LOWsympy/series/limitseq.py68
LOWsympy/series/limitseq.py162
LOWsympy/series/fourier.py515
LOWsympy/core/facts.py76
LOWsympy/core/facts.py136
LOWsympy/core/facts.py327
LOWsympy/core/add.py198
LOWsympy/core/add.py463
LOWsympy/core/add.py646
LOWsympy/core/add.py659
LOWsympy/core/add.py687
LOWsympy/core/add.py748
LOWsympy/core/add.py764
LOWsympy/core/add.py816
LOWsympy/core/add.py831
LOWsympy/core/add.py846
LOWsympy/core/add.py1005
LOWsympy/core/add.py1169
LOWsympy/core/exprtools.py33
LOWsympy/core/exprtools.py982
LOWsympy/core/exprtools.py1272
LOWsympy/core/exprtools.py1396
LOWsympy/core/exprtools.py291
LOWsympy/core/exprtools.py488
LOWsympy/core/exprtools.py558
LOWsympy/core/exprtools.py720
LOWsympy/core/traversal.py37
LOWsympy/core/sorting.py11
LOWsympy/core/sorting.py203
LOWsympy/core/symbol.py689
LOWsympy/core/symbol.py902
LOWsympy/core/symbol.py965
LOWsympy/core/numbers.py75
LOWsympy/core/numbers.py4346
LOWsympy/core/numbers.py352
LOWsympy/core/numbers.py487
LOWsympy/core/numbers.py498
LOWsympy/core/numbers.py509
LOWsympy/core/numbers.py812
LOWsympy/core/numbers.py951
1450 more matches not shown…
Decorative Section Separators281 hits · 674 pts
SeverityFileLineSnippet
MEDIUMsympy/core/power.py286 # ===================================================
MEDIUMsympy/core/function.py1446 # -------------------------------------------------------------
MEDIUMsympy/ntheory/tests/test_primetest.py174 #-------------
MEDIUMsympy/solvers/solvers.py1683 # -----------------------
MEDIUMsympy/solvers/diophantine/diophantine.py1651 # --------------------------
MEDIUMsympy/testing/runtests.py851 # --------------------------------------------------------------------
MEDIUMsympy/sets/fancysets.py841 #---------------------
MEDIUMsympy/sets/fancysets.py844 # --------------------
MEDIUMsympy/sets/fancysets.py847 #---------------------
MEDIUMsympy/sets/fancysets.py850 # --------------------
MEDIUMsympy/sets/fancysets.py859 #---------------------
MEDIUMsympy/sets/fancysets.py862 # --------------------
MEDIUMsympy/sets/handlers/intersection.py168 # -------------------
MEDIUMsympy/combinatorics/polyhedron.py834# -----------------------------------------------------------------------
MEDIUMsympy/combinatorics/polyhedron.py839# -----------------------------------------------------------------------
MEDIUMsympy/combinatorics/fp_groups.py395#==============================================================================
MEDIUMsympy/combinatorics/fp_groups.py397#==============================================================================
MEDIUMsympy/combinatorics/fp_groups.py956#========================================================================
MEDIUMsympy/combinatorics/fp_groups.py958#========================================================================
MEDIUMsympy/functions/special/polynomials.py41#----------------------------------------------------------------------------
MEDIUMsympy/functions/special/polynomials.py439#----------------------------------------------------------------------------
MEDIUMsympy/functions/special/polynomials.py1002#----------------------------------------------------------------------------
MEDIUMsympy/functions/special/polynomials.py1206#----------------------------------------------------------------------------
MEDIUMsympy/functions/special/polynomials.py286#----------------------------------------------------------------------------
MEDIUMsympy/functions/special/polynomials.py769#----------------------------------------------------------------------------
MEDIUMsympy/functions/elementary/piecewise.py402 # -----------------------------------------------------------------------
MEDIUMsympy/functions/elementary/piecewise.py546 # -----------------------------------------------------------------
MEDIUMsympy/physics/secondquant.py2856 # ============================
MEDIUMsympy/physics/quantum/qft.py40#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qft.py42#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/transforms.py32#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/transforms.py34#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/transforms.py177#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/transforms.py179#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/transforms.py275#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/transforms.py277#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/kind.py76#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/kind.py78#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py48#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py50#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py56 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py58 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py85 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py87 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py103 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py105 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py113 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py115 #-------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py435#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py437#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py535#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/qubit.py537#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/cg.py34#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/cg.py36#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/spin.py74#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/spin.py76#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/spin.py917#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/spin.py919#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/spin.py1794#-----------------------------------------------------------------------------
MEDIUMsympy/physics/quantum/spin.py1796#-----------------------------------------------------------------------------
221 more matches not shown…
Self-Referential Comments80 hits · 206 pts
SeverityFileLineSnippet
MEDIUMsympy/__init__.py260# This module is slow to import:
MEDIUMsympy/polys/rings.py293 # Create a new ring instance.
MEDIUMsympy/polys/domains/mpelements.py2# This module is deprecated and should not be used any more. The actual
MEDIUMsympy/polys/domains/algebraicfield.py646 # Create a function to do the conversion efficiently:
MEDIUMsympy/polys/matrices/linsolve.py4# This module defines the _linsolve function which is the internal workhorse
MEDIUMsympy/polys/matrices/domainmatrix.py3082 # Define a new polynomial f with f[i] = -(-1)^n*p[i] for i=0..n-1. Then
MEDIUMsympy/concrete/summations.py644 # The following code can grows like 2**n where n is the
MEDIUMsympy/ntheory/generate.py226 # Create the list such that block[x] iff (a + 2x + 1) is prime.
MEDIUMsympy/printing/rcode.py212 # This method is called only for inline if constructs
MEDIUMsympy/printing/llvmjitcode.py233 # Create a wrapped double: PyObject* PyFloat_FromDouble(double v)
MEDIUMsympy/printing/llvmjitcode.py241 # Create a tuple: PyObject* PyTuple_Pack(Py_ssize_t n, ...)
MEDIUMsympy/printing/tests/test_tensorflow.py76# Creating a custom inverse test.
MEDIUMsympy/logic/boolalg.py3199 # Create a list of possible replacements
MEDIUMsympy/logic/boolalg.py3265 # Create a list of possible replacements
MEDIUMsympy/logic/algorithms/dpll2.py132 # Create the base level
MEDIUMsympy/solvers/ode/nonhomogeneous.py86 # Create a dict root: multiplicity or charroots
MEDIUMsympy/solvers/ode/nonhomogeneous.py205 # Create a dict root: multiplicity or charroots
MEDIUMsympy/codegen/abstract_nodes.py1"""This module provides containers for python objects that are valid
MEDIUMsympy/codegen/ast.py706 # Create a graph where the nodes are assignments and there is a directed edge
MEDIUMsympy/codegen/tests/test_applications.py1# This file contains tests that exercise multiple AST nodes
MEDIUMsympy/utilities/lambdify.py929 # Create the function definition code and execute it
MEDIUMsympy/utilities/pkgdata.py1# This module is deprecated and will be removed.
MEDIUMsympy/utilities/tests/test_codegen_julia.py48 "# This file is part of 'project'\n"
MEDIUMsympy/utilities/tests/test_codegen_julia.py289 "# This file is part of 'project'\n"
MEDIUMsympy/integrals/laplace.py804 # The following code checks all remaining poles. If t1 is a pole at
MEDIUMsympy/integrals/rationaltools.py1"""This module implements tools for integrating rational functions. """
MEDIUMsympy/integrals/tests/test_integrals.py2149 # Define the symbols
MEDIUMsympy/integrals/tests/test_integrals.py2153 # Define the integral expression
MEDIUMsympy/integrals/tests/test_integrals.py2170 # Define the symbol and the integral expression
MEDIUMsympy/plotting/experimental_lambdify.py407 # Create the final ordered tuples of dictionaries
MEDIUMsympy/plotting/pygletplot/plot_mode.py79 # Create the object
MEDIUMsympy/plotting/backends/matplotlibbackend/matplotlib.py123 # Create the collections
MEDIUMsympy/combinatorics/rewritingsystem.py45 # Create a finite state machine as an instance of the StateMachine object
MEDIUMsympy/functions/special/hyper.py33 # This method is only needed because hyper._eval_as_leading_term falls back
MEDIUMsympy/functions/special/polynomials.py431 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py994 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py1101 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py1198 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py204 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py557 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py683 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py885 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py1316 # This function is just kept for backwards compatibility
MEDIUMsympy/functions/special/polynomials.py1442 # This function is just kept for backwards compatibility
MEDIUMsympy/tensor/array/expressions/array_expressions.py543 # Create an index, target-position-key array:
MEDIUMsympy/tensor/array/expressions/array_expressions.py1795 # Create a collector for the new diagonal indices:
MEDIUMsympy/geometry/curve.py340 """This function is used to rotate a curve along given point ``pt`` at given angle(in radian).
MEDIUMsympy/physics/mechanics/system.py1508 # Create a list of all of the expressions in the equations of motion
MEDIUMsympy/physics/mechanics/system.py1526 # Create a list of all of the expressions in the equations of motion
MEDIUMsympy/physics/mechanics/wrapping_geometry.py646 """This method is implemented as required by WrappingGeometryBase, use WrappingCone.apex instead."""
MEDIUMsympy/physics/mechanics/lagrange.py160 # Creating the qs, qdots and qdoubledots
MEDIUMsympy/physics/mechanics/lagrange.py200 # Creating the multipliers
MEDIUMsympy/physics/mechanics/tests/test_lagrange.py45 # Creating the disc 'D'; we create the point that represents the mass
MEDIUMsympy/physics/mechanics/tests/test_system.py8# This class is going to be tested using a simple pendulum set up in x and y
MEDIUMsympy/physics/mechanics/tests/test_kane.py271 # Defining the constants and knowns of the system
MEDIUMsympy/physics/control/lti.py853 >>> #Create a Transfer Function with more than one variable
MEDIUMsympy/physics/control/lti.py907 >>> #Create a Transfer Function with variable poles and zeros
MEDIUMsympy/physics/quantum/kind.py42# Create an instance as many situations need this.
MEDIUMsympy/physics/quantum/kind.py56# Create an instance as many situations need this.
MEDIUMsympy/physics/quantum/kind.py72# Create an instance as many situations need this.
20 more matches not shown…
Over-Commented Block207 hits · 204 pts
SeverityFileLineSnippet
LOWasv.conf.actions.json21 // https://github.com/sympy/sympy/issues/26239
LOWasv.conf.actions.json41 // The tool to use to create environments. May be "conda",
LOWasv.conf.actions.json81
LOWsympy/core/backend.py81# Expected behaviour of a SymPy mutable/immutable matrix .simplify() method:
LOWsympy/core/containers.py121 # XXX: Basic defines count() as something different, so we can't
LOWsympy/core/cache.py101 # always call function itself and compare it with cached version
LOWsympy/core/mul.py501 # in c_powers
LOWsympy/core/mul.py1301 if any(a.is_zero is not False for a in self.args):
LOWsympy/core/mul.py1321 # would be indicated by None.
LOWsympy/core/intfunc.py261 # a' = A*a + B*b, b' = C*a + D*b
LOWsympy/core/intfunc.py281 # x'%y" = x' - q*y" < x" - q*y' = x"%y',
LOWsympy/core/power.py1461 return Expr.matches(self, expr, repl_dict)
LOWsympy/core/function.py561 try:
LOWsympy/core/function.py801 args = [a.as_leading_term(x, logx=logx) for a in self.args]
LOWsympy/core/assumptions.py581 # though that independent code e.g. called indirectly by the handler or
LOWsympy/core/assumptions.py601 # single-threaded context but in multithreaded code it is possible that
LOWsympy/core/assumptions.py681# in case someone has been using the ManagedProperties class in downstream
LOWsympy/core/expr.py841 # to be zero -- we try to prove it via minimal_polynomial.
LOWsympy/core/expr.py3921 precs = [f._prec for f in x.atoms(Float)]
LOWsympy/core/expr.py3941 # The default precision is 15 digits and if we ask
LOWsympy/core/expr.py3961 # and rescaling that gives
LOWsympy/core/tests/test_singleton.py41 # performance benefit of being able to use 'is' (this only matters in very
LOWsympy/core/tests/test_relational.py981 # at a lower and higher precision bracket the value of pi
LOWsympy/core/tests/test_expr.py2061 assert a.round(25) == Float('3.000000000000000000000000000', '')
LOWsympy/polys/euclidtools.py1521
LOWsympy/polys/rootoftools.py961 by = mp.mpf(str(interval.by))
LOWsympy/polys/puiseux.py1"""
LOWsympy/polys/matrices/dense.py161 # In cases like GF(p), QQ<sqrt(2)>, RR or CC though multiplication is
LOWsympy/polys/matrices/dense.py301 # Given an n x n matrix A and n x 1 matrix b:
LOWsympy/polys/matrices/linsolve.py1#
LOWsympy/polys/matrices/domainmatrix.py3201
LOWsympy/polys/matrices/rref.py1# Algorithms for computing the reduced row echelon form of a matrix.
LOWsympy/polys/matrices/rref.py281
LOWsympy/polys/matrices/rref.py321 if denom_lcm.bit_length() < 50:
LOWsympy/polys/matrices/sdm.py1701 # The algorithm then processes each row Ai one at a time. Previously seen
LOWsympy/polys/matrices/sdm.py1881 # nonzero elements. We will build the RREF matrix starting from an empty
LOWsympy/polys/matrices/sdm.py1901 # fully reduced rows because we can handle them more efficiently when
LOWsympy/polys/matrices/sdm.py2181 a = Mij
LOWsympy/polys/matrices/_dfm.py1#
LOWsympy/polys/matrices/_dfm.py21#
LOWsympy/polys/matrices/_dfm.py661 # TODO: Implement similar algorithms for DDM and SDM.
LOWsympy/polys/matrices/_dfm.py821
LOWsympy/polys/matrices/tests/test_xxm.py1#
LOWsympy/polys/matrices/tests/test_linsolve.py81 y:8519/15990 + 1784/7995*I,
LOWsympy/polys/matrices/tests/test_rref.py521 (
LOWsympy/concrete/summations.py621 try:
LOWsympy/concrete/tests/test_products.py21def test_karr_convention():
LOWsympy/concrete/tests/test_sums_products.py41from sympy.simplify.simplify import simplify
LOWsympy/concrete/tests/test_sums_products.py61 # the upper limit being *exclusive*.
LOWsympy/ntheory/primetest.py781 #if n < 38010307:
LOWsympy/ntheory/generate.py41 >>> sieve._list
LOWsympy/ntheory/generate.py61 #
LOWsympy/ntheory/generate.py81 #
LOWsympy/ntheory/bbp_pi.py1'''
LOWsympy/ntheory/partitions_.py181 """
LOWsympy/printing/codeprinter.py241 # (temporary variables?)
LOWsympy/printing/rcode.py181 # from sympy.functions.elementary.piecewise import Piecewise
LOWsympy/printing/rust.py21# + Complex_
LOWsympy/printing/rust.py41 real, integer, bool_
LOWsympy/printing/rust.py81 "floor": (floor, float_floor),
147 more matches not shown…
Excessive Try-Catch Wrapping74 hits · 72 pts
SeverityFileLineSnippet
LOWsetup.py217 except Exception:
MEDIUMsetup.py231 print("Error deleting %s - %s." % (e.filename, e.strerror))
LOWsympy/printing/pycode.py432 except Exception: # noqa: BLE001
LOWsympy/solvers/ode/tests/test_single.py244 except Exception as e:
LOWsympy/testing/pytest.py192 except Exception as e: # noqa: BLE001
MEDIUMsympy/testing/pytest.py189def wrapper():
LOWsympy/testing/runtests.py1238 except Exception: # noqa: BLE001
LOWsympy/testing/runtests.py1283 except Exception:
LOWsympy/testing/runtests.py1308 except Exception: # noqa: BLE001
MEDIUMsympy/plotting/series.py54def wrapper_func(func, *args):
MEDIUMsympy/plotting/series.py1573def _adaptive_sampling(self):
MEDIUMsympy/plotting/series.py1659def _adaptive_sampling(self):
LOWsympy/plotting/series.py89 except Exception as err: # noqa: BLE001
LOWsympy/plotting/series.py1370 except Exception as err: # noqa: BLE001
LOWsympy/plotting/series.py1582 except Exception as err: # noqa: BLE001
LOWsympy/plotting/series.py1670 except Exception as err: # noqa: BLE001
LOWsympy/plotting/pygletplot/plot_mode.py230 except Exception as e:
LOWsympy/plotting/pygletplot/color_scheme.py120 except Exception:
LOWsympy/plotting/pygletplot/color_scheme.py136 except Exception as ex:
LOWsympy/plotting/pygletplot/color_scheme.py222 except Exception:
LOWsympy/plotting/pygletplot/color_scheme.py228 except Exception:
MEDIUMsympy/plotting/pygletplot/color_scheme.py225def __call__(self, x, y, z, u, v):
LOWsympy/plotting/pygletplot/plot_mode_base.py114 except Exception:
LOWsympy/plotting/pygletplot/plot_mode_base.py347 except Exception as e:
MEDIUMsympy/plotting/pygletplot/plot_mode_base.py336def _set_color(self, v):
LOWsympy/plotting/pygletplot/managed_window.py47 except Exception as e:
LOWsympy/plotting/pygletplot/managed_window.py66 except Exception as e:
LOWsympy/interactive/session.py487 except Exception: # noqa: BLE001
LOWsympy/interactive/printing.py94 except Exception as e:
LOWsympy/interactive/printing.py107 except Exception as e:
LOWsympy/physics/mechanics/tests/test_kane.py456 except Exception as e:
LOWsympy/parsing/sympy_parser.py1089 except Exception as e: # noqa: BLE001
LOWsympy/parsing/latex/_parse_latex_antlr.py20except Exception:
MEDIUMsympy/parsing/autolev/_listener_autolev_antlr.py1598def exitOutputs2(self, ctx):
LOWsympy/parsing/autolev/_listener_autolev_antlr.py337 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py343 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py353 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1364 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1370 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1374 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1392 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py249 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py569 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py597 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py618 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py623 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py666 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py915 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py976 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py982 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1036 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1179 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1288 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1290 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1470 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1475 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1581 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1587 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1606 except Exception:
LOWsympy/parsing/autolev/_listener_autolev_antlr.py1667 except Exception:
14 more matches not shown…
Redundant / Tautological Comments64 hits · 61 pts
SeverityFileLineSnippet
LOWsympy/core/relational.py366 # Check if first value has negative sign
LOWsympy/core/sympify.py414 #Check if there exists a converter for any of the types in the mro
LOWsympy/polys/rootconditions.py329 # Check if -1 is a root, since the transformation is not defined in this case
LOWsympy/polys/polyroots.py568 # Check if f20 has linear factors over domain Z
LOWsympy/ntheory/generate.py514 # Check if n is within the sieve range
LOWsympy/ntheory/factor_.py1496 # Check if it exists in the cache
LOWsympy/logic/algorithms/dpll2.py202 # Check if unit prop says the theory is unsat right off the bat
LOWsympy/logic/algorithms/dpll2.py274 # Check if we've made the theory unsat
LOWsympy/logic/algorithms/dpll2.py413 # Check if no sentinel update exists
LOWsympy/solvers/solvers.py2226 # Check if there are any non-zero solutions at all
LOWsympy/solvers/solveset.py2858 # Check if 'symbols' is a set and raise an error if it is
LOWsympy/solvers/diophantine/diophantine.py580 # Check if the coefficients of y and x obtained are integers or not
LOWsympy/solvers/ode/single.py2834 # Check if b3 = 0 (no first derivative term) or a3 = 0 (no second derivative term)
LOWsympy/solvers/ode/single.py2842 # Check if c3 is of the form A*x^k where k has free symbols
LOWsympy/solvers/ode/ode.py2535 # Check if second frobenius series solution exists.
LOWsympy/solvers/ode/riccati.py318 # Check if coefficients are not symbols and floats
LOWsympy/solvers/ode/riccati.py365 # Check if degree of numerator is same as denominator
LOWsympy/solvers/ode/riccati.py722 # Check if there are any constants
LOWsympy/testing/runtests.py1108 # Read the file, convert it to a test, and run it.
LOWsympy/plotting/series.py2578 # Check if any point in between is valid
LOWsympy/combinatorics/rewritingsystem.py400 # Check if the transition to any new state in possible.
LOWsympy/functions/special/bsplines.py65 # Check if arg2 condition smaller than arg1,
LOWsympy/functions/elementary/integers.py604 # Check if other <= 0
LOWsympy/functions/elementary/integers.py607 # Check if other >= 1
LOWsympy/functions/elementary/integers.py616 # Check if other < 0
LOWsympy/functions/elementary/integers.py620 # Check if other >= 1
LOWsympy/functions/elementary/integers.py628 # Check if other < 0
LOWsympy/functions/elementary/integers.py631 # Check if other >= 1
LOWsympy/functions/elementary/integers.py640 # Check if other <= 0
LOWsympy/functions/elementary/integers.py643 # Check if other >= 1
LOWsympy/functions/elementary/integers.py701 # Check if other < 0
LOWsympy/functions/elementary/integers.py704 # Check if other >= 1
LOWsympy/tensor/tensor.py2230 # Check if variance of indices needs to be fixed:
LOWsympy/tensor/array/ndim_array.py184 # Check if any index is symbolic:
LOWsympy/tensor/array/expressions/from_array_to_matrix.py815 # Check if expression is a trace:
LOWsympy/tensor/array/expressions/from_indexed_to_array.py171 # Check if there are KroneckerDelta objects:
LOWsympy/tensor/array/expressions/from_indexed_to_array.py230 # Check if all indices are compatible. Otherwise expand the dimensions:
LOWsympy/tensor/array/expressions/array_expressions.py270 # Check if there are nested ArraySum objects:
LOWsympy/tensor/array/expressions/array_expressions.py290 # Check if there are nested permutation and lift them up:
LOWsympy/tensor/tests/test_tensor.py1039 #Check if contract_metric gets into an infinite loop when given a TensMul whose coeff is an Add
LOWsympy/tensor/tests/test_tensor.py1132 #Check if TensAdd.contract_delta can handle the case when the TensAdd has non-TensExpr args.
LOWsympy/physics/mechanics/system.py1046 # Check if all joint coordinates and speeds are present
LOWsympy/physics/mechanics/tests/test_linearize.py331 # Check if passing a function to linear_solver works
LOWsympy/physics/mechanics/tests/test_actuator.py747 # Check if DuffingSpring correctly initializes its attributes
LOWsympy/physics/mechanics/tests/test_actuator.py812 # Check if certain properties of DuffingSpring object are immutable after initialization
LOWsympy/physics/mechanics/tests/test_actuator.py827 # Check if the actual string representation of DuffingSpring instance matches the expected string for each provided
LOWsympy/physics/mechanics/tests/test_actuator.py855 # Check if the absolute value of the difference is below a threshold
LOWsympy/physics/continuum_mechanics/beam.py3062 # Check if any of the evaluated reaction exists in another direction
LOWsympy/physics/continuum_mechanics/tests/test_column.py299 c2.apply_support(10) # Check if order of applying supports matters
LOWsympy/physics/vector/frame.py72 # Check if the other object is a CoordinateSym of the same frame and
LOWsympy/physics/vector/frame.py556 # Check if the dcm wrt that frame has already been calculated
LOWsympy/physics/control/lti.py2612 # Check if the system is a StateSpace
LOWsympy/physics/control/tests/test_lti.py3290 # Check if the system is SISO or MIMO.
LOWsympy/physics/control/tests/test_lti.py4256 # Check if the system is SISO or MIMO.
LOWsympy/physics/quantum/density.py48 # Check if arg is a tuple
LOWsympy/physics/quantum/identitysearch.py91 # Check if it's diagonal
LOWsympy/physics/quantum/identitysearch.py94 # Check if the rows indices and columns indices are the same
LOWsympy/parsing/mathematica.py684 # Check if the regular expression has already been compiled:
LOWsympy/vector/vector.py193 # Check if the other is a del operator
LOWsympy/categories/diagram_drawing.py2143 # Check if there's space to the left.
4 more matches not shown…
AI Slop Vocabulary33 hits · 52 pts
SeverityFileLineSnippet
LOWsympy/core/add.py1154 # so we just use the same sort as is used in Add.flatten. When the
LOWsympy/core/operations.py410 # here, we have a number so we just call to _evalf with prec;
LOWsympy/core/expr.py511 # Probably this method should just return self.evalf(2).is_Number.
LOWsympy/core/expr.py3721 # now, we just use a special case to make multinomial run before mul,
LOWsympy/polys/rings.py2687 # Can just use self.flint_poly.to_dict() in case of python-flint
LOWsympy/polys/matrices/_dfm.py572 # time of writng just use Bareiss for all matrices and domains.
LOWsympy/polys/matrices/tests/test_xxm.py854 # XXX: Change the signature to just return the nullspace. Possibly
MEDIUMsympy/concrete/summations.py1649 # robust than the current implementation of ``residue`` which uses a series
MEDIUMsympy/printing/pretty/pretty_symbology.py59 """See if unicode output is available and leverage it if possible"""
MEDIUMsympy/solvers/solvers.py1483 # Poly is generally robust enough to convert anything to
LOWsympy/solvers/solvers.py2264 # If there is a non-trivial solution, just set the free variables to
LOWsympy/solvers/ode/nonhomogeneous.py197 # Can't just call roots because it doesn't return rootof for unsolveable
LOWsympy/solvers/ode/tests/test_ode.py94 # Maybe this should just use one of the solutions instead of raising...
MEDIUMsympy/utilities/tests/test_misc.py140 # expected; Q.prime is more nuanced in its response for
MEDIUMsympy/testing/runtests.py1964 # in conjunction with the ELLIPSIS flag.
MEDIUMsympy/integrals/intpoly.py976 # TODO : This part is quite hacky. Should be made more robust with
LOWsympy/assumptions/tests/test_sathandlers.py18 # The predicate doesn't matter here, so just pass
LOWsympy/plotting/intervalmath/interval_arithmetic.py15# Q: Why use numpy? Why not simply use mpmath's interval arithmetic?
MEDIUMsympy/combinatorics/free_groups.py171 """Return a tuple of arguments that must be passed to __new__ in order to support pickling this object."""
LOWsympy/physics/hep/gamma_matrices.py452 # no contractions in `expression`, just return it.
MEDIUMsympy/physics/mechanics/tests/test_kane3.py187 # model to the reference eigen values. Look at the aforementioned paper for
LOWsympy/physics/mechanics/tests/test_kane.py506 # Note that we just use the explicit kinematics for the linear velocities
MEDIUMsympy/physics/vector/tests/test_functions.py344 #The use of time_derivative for calculations pertaining to scalar
LOWsympy/physics/quantum/spin.py1074 # we could just use this unless there are cases when this is not true
LOWsympy/physics/quantum/represent.py241 # vectors are taken. In these cases, we simply return a scalar.
LOWsympy/physics/quantum/gate.py224 # If the controls are not met, just return
LOWsympy/physics/quantum/qapply.py145 if not nc_part: # If we only have a commuting part, just return it.
LOWsympy/physics/quantum/operatorset.py261 # If this fails, just return the classes
LOWsympy/physics/quantum/state.py156 # If height is 1, just return brackets
LOWsympy/parsing/sympy_parser.py1239 # keywords=[]: If ommited, keywords would have the default value of None, it will just return an Attribu
LOWsympy/simplify/trigsimp.py265 # We just add the extragens to gens and analyse them as before
MEDIUMsympy/simplify/hyperexpand.py2121 """ Try to apply ``shifter`` in order to bring some element in ``f``
MEDIUMsympy/matrices/eigen.py307 # the multiplicity correct. This is not robust enough in general
Dead Code8 hits · 16 pts
SeverityFileLineSnippet
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py56
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py57
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py58
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py60
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py61
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py62
MEDIUMsympy/matrices/expressions/tests/test_derivatives.py64
MEDIUMdoc/ext/docscrape_sphinx.py34
Slop Phrases9 hits · 12 pts
SeverityFileLineSnippet
LOWsympy/core/mul.py28# "there are still non-commutative objects -- don't forget to process them"
LOWsympy/core/mul.py28# "there are still non-commutative objects -- don't forget to process them"
LOWsympy/core/mul.py365 # append non-commutative marker, so we don't forget to
LOWsympy/core/mul.py365 # append non-commutative marker, so we don't forget to
LOWsympy/core/basic.py1503 non-Basic iterable. Don't forget to unpack
LOWsympy/solvers/tests/test_inequalities.py472 # make sure to include conditions under which solution is valid
MEDIUMsympy/integrals/integrals.py1236 For demonstration purposes, this interval will only be split into 2
LOWsympy/interactive/printing.py140 # If you're adding another type, make sure you add it to printable_types
LOWsympy/categories/diagram_drawing.py697 # Don't forget to assure the proper ordering of the vertices
Verbosity Indicators15 hits · 10 pts
SeverityFileLineSnippet
LOWsympy/polys/densetools.py1545 # Step 0: h = x / f mod x**(n-1)
LOWsympy/ntheory/primetest.py739 # Step 2: deterministic Miller-Rabin testing for numbers < 2^64. See:
LOWsympy/ntheory/primetest.py796 # Step 3: BPSW.
LOWsympy/solvers/ode/systems.py1338 To check if the equations are constant coefficient, we need to check if all the terms in
LOWsympy/solvers/ode/systems.py1341 To check if the equations are homogeneous or not, we need to check if b is a zero matrix
LOWsympy/solvers/ode/riccati.py802 # Step 1 : Convert to Normal Form
LOWsympy/solvers/ode/riccati.py812 # Step 3 : a(x) is 0
LOWsympy/solvers/ode/riccati.py816 # Step 4 : a(x) is a non-zero constant
LOWsympy/solvers/ode/riccati.py820 # Step 5 : Find poles and valuation at infinity
LOWsympy/solvers/ode/riccati.py837 # Step 7 : Iterate over all possible combinations and return solutions
LOWsympy/solvers/ode/riccati.py856 # Step 10 : Check if a valid solution exists. If yes, also check
LOWsympy/solvers/ode/riccati.py860 # Step 11 : Find polynomial solutions of degree m for the auxiliary equation
LOWsympy/solvers/ode/riccati.py863 # Step 12 : If valid polynomial solution exists, append solution.
LOWsympy/solvers/ode/riccati.py885 # Step 15 : Inverse transform the solutions of the equation in normal form
LOWsympy/simplify/hyperexpand.py965 self._poly variable. This variable stores a polynomial. By convention
Synthetic Comment Markers1 hit · 5 pts
SeverityFileLineSnippet
HIGH.github/PULL_REQUEST_TEMPLATE.md41like it was generated by AI then the PR will be closed. -->
Overly Generic Function Names3 hits · 2 pts
SeverityFileLineSnippet
LOWsympy/core/tests/test_eval.py92def test_function():
LOWsympy/parsing/tests/test_c_parser.py940 def test_function():
LOWsympy/parsing/tests/test_fortran_parser.py279 def test_function():