sympy/sympy

13.9

Adjusted Score

13.9

Raw Score

100%

Time Factor

2026-07-10

Last Push

14.8K

Stars

Python

Language

814.0K

Lines of Code

1.6K

Files

10.7K

Pattern Hits

2026-07-14

Scan Date

0.22

HC Hit Rate

What These Metrics Mean

Adjusted Score: Primary synthetic code indicator. Raw score normalised per 1,000 lines of code and multiplied by the temporal discount factor. This is the definitive comparative metric — use it to rank repositories by AI authorship density.
Raw Score: The unmodified sum of all severity-weighted, context-multiplied pattern match scores before temporal discounting. Reflects the absolute signal strength independent of when the repository was last active.
Time Factor: The temporal discount multiplier (0–100%) applied to the raw score. Repositories last updated before ChatGPT's launch (Nov 2022) receive a 5% factor. Full signal is only assigned to repositories active in the post-adoption era (Jan 2024+).
Pattern Hits: Total count of individual pattern matches across all files and categories. A high hit count with a low score may indicate a very large codebase with isolated AI snippets; a low count with a high score indicates dense, concentrated AI signatures.
HC Hit Rate: High+Critical pattern hits per file, averaged across the repository. This orthogonal signal catches repositories where a few files are densely packed with high-severity AI tells — a strong indicator even when the normalised score appears moderate due to codebase size.
Lines of Code / Files: Total lines and files analysed. The scanner examines 94 file extensions. These denominators are used to normalise the score, enabling fair comparison between repositories of vastly different sizes.

Score History

This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.

Severity Breakdown

Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.

CRITICAL 0HIGH 369MEDIUM 390LOW 9969

Directory Score Breakdown

This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.

Pattern Findings

The scanner identified 10728 distinct pattern matches across 22 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.

Unused Imports5137 hits · 3765 pts

Severity	File	Line	Context
LOW	conftest.py	3	CODE
LOW	conftest.py	3	CODE
LOW	conftest.py	3	CODE
LOW	isympy.py	316	CODE
LOW	sympy/conftest.py	1	CODE
LOW	sympy/release.py	1	CODE
LOW	sympy/this.py	4	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
LOW	sympy/__init__.py	56	CODE
5077 more matches not shown…

Hyper-Verbose Identifiers2633 hits · 2452 pts

Severity	File	Line	Snippet	Context
LOW	sympy/conftest.py	76	def pytest_collection_modifyitems(config, items):	CODE
LOW	sympy/series/tests/test_sequences.py	294	def test_find_linear_recurrence():	CODE
LOW	sympy/series/tests/test_limits.py	211	def test_floor_requires_robust_assumptions():	CODE
LOW	sympy/series/tests/test_limits.py	241	def test_ceiling_requires_robust_assumptions():	CODE
LOW	sympy/series/tests/test_limits.py	373	def test_bessel_functions_at_infinity():	CODE
LOW	sympy/series/tests/test_order.py	326	def test_order_conjugate_transpose():	CODE
LOW	sympy/series/tests/test_order.py	339	def test_order_noncommutative():	CODE
LOW	sympy/series/tests/test_order.py	397	def test_mixing_order_at_zero_and_infinity():	CODE
LOW	sympy/series/tests/test_order.py	441	def test_order_failing_due_to_solveset():	CODE
LOW	sympy/series/tests/test_order.py	459	def test_performance_of_adding_order():	CODE
LOW	sympy/series/tests/test_formal.py	81	def test_rational_independent():	CODE
LOW	sympy/series/tests/test_formal.py	389	def test_fps__logarithmic_singularity():	CODE
LOW	sympy/series/tests/test_formal.py	398	def test_fps__logarithmic_singularity_fail():	CODE
LOW	sympy/series/tests/test_series.py	204	def test_exp_product_positive_factors():	CODE
LOW	sympy/series/tests/test_gruntz.py	98	def test_gruntz_evaluation_slow():	CODE
LOW	sympy/series/tests/test_gruntz.py	129	def test_gruntz_eval_special_slow():	CODE
LOW	sympy/series/tests/test_gruntz.py	137	def test_grunts_eval_special_slow_sometimes_fail():	CODE
LOW	sympy/series/tests/test_gruntz.py	148	def test_gruntz_eval_special_fail():	CODE
LOW	sympy/series/tests/test_approximants.py	30	def test_pade_approximants_gcdex():	CODE
LOW	sympy/series/tests/test_approximants.py	65	def test_pade_approximant_gcdex():	CODE
LOW	sympy/crypto/crypto.py	2452	def lfsr_connection_polynomial(s):	STRING
LOW	sympy/crypto/tests/test_crypto.py	74	def test_encipher_substitution():	CODE
LOW	sympy/crypto/tests/test_crypto.py	229	def test_mutltiprime_rsa_full_example():	CODE
LOW	sympy/crypto/tests/test_crypto.py	331	def test_rsa_multiprime_exhanstive():	CODE
LOW	sympy/crypto/tests/test_crypto.py	352	def test_rsa_multipower_exhanstive():	CODE
LOW	sympy/crypto/tests/test_crypto.py	431	def test_lfsr_autocorrelation():	CODE
LOW	sympy/crypto/tests/test_crypto.py	439	def test_lfsr_connection_polynomial():	CODE
LOW	sympy/crypto/tests/test_crypto.py	506	def test_encipher_decipher_gm():	CODE
LOW	sympy/crypto/tests/test_crypto.py	536	def test_encipher_decipher_bg():	CODE
LOW	sympy/core/facts.py	96	def deduce_alpha_implications(implications):	STRING
LOW	sympy/core/facts.py	136	def apply_beta_to_alpha_route(alpha_implications, beta_rules):	STRING
LOW	sympy/core/add.py	24	def _could_extract_minus_sign(expr):	CODE
LOW	sympy/core/add.py	628	def _eval_is_rational_function(self, syms):	CODE
LOW	sympy/core/add.py	778	def _eval_is_extended_positive(self):	CODE
LOW	sympy/core/add.py	830	def _eval_is_extended_nonnegative(self):	CODE
LOW	sympy/core/add.py	845	def _eval_is_extended_nonpositive(self):	CODE
LOW	sympy/core/add.py	860	def _eval_is_extended_negative(self):	CODE
LOW	sympy/core/numbers.py	997	def _eval_is_extended_negative(self):	CODE
LOW	sympy/core/numbers.py	1004	def _eval_is_extended_positive(self):	CODE
LOW	sympy/core/random.py	105	def test_derivative_numerically(f, z, tol=1.0e-6, a=2, b=-1, c=3, d=1):	CODE
LOW	sympy/core/mul.py	1284	def _eval_is_rational_function(self, syms):	CODE
LOW	sympy/core/mul.py	1306	def _eval_is_zero_infinite_helper(self):	CODE
LOW	sympy/core/mul.py	1594	def _eval_is_extended_positive(self):	CODE
LOW	sympy/core/mul.py	1647	def _eval_is_extended_negative(self):	CODE
LOW	sympy/core/basic.py	156	def _get_postprocessors_for_type(arg_type):	CODE
LOW	sympy/core/basic.py	2168	def _exec_constructor_postprocessors(cls, obj):	CODE
LOW	sympy/core/evalf.py	1763	def _evalf_with_bounded_error(x: Expr, eps: Expr \| None = None,	STRING
LOW	sympy/core/power.py	1318	def _eval_is_rational_function(self, syms):	CODE
LOW	sympy/core/power.py	404	def _eval_is_extended_positive(self):	STRING
LOW	sympy/core/power.py	433	def _eval_is_extended_negative(self):	STRING
LOW	sympy/core/function.py	1930	def _get_zero_with_shape_like(cls, expr):	CODE
LOW	sympy/core/function.py	1934	def _dispatch_eval_derivative_n_times(cls, expr, v, count):	CODE
LOW	sympy/core/assumptions.py	230	def _load_pre_generated_assumption_rules() -> FactRules:	CODE
LOW	sympy/core/assumptions.py	238	def _generate_assumption_rules():	CODE
LOW	sympy/core/assumptions.py	623	def _prepare_class_assumptions(cls):	CODE
LOW	sympy/core/expr.py	912	def _eval_is_extended_positive_negative(self, positive):	CODE
LOW	sympy/core/expr.py	951	def _eval_is_extended_positive(self):	CODE
LOW	sympy/core/expr.py	954	def _eval_is_extended_negative(self):	CODE
LOW	sympy/core/expr.py	4026	def _eval_derivative_matrix_lines(self, x):	CODE
LOW	sympy/core/expr.py	4064	def _eval_is_rational_function(self, syms):	CODE
2573 more matches not shown…

Cross-Language Confusion273 hits · 1536 pts

Severity	File	Line	Snippet	Context
HIGH	sympy/core/relational.py	393	left, right = [i.equals(j,	STRING
HIGH	sympy/core/relational.py	400	lr, rl = [i.equals(j, failing_expression=failing_expression)	STRING
HIGH	sympy/core/relational.py	417	left = a.lhs.equals(b.lhs,	STRING
HIGH	sympy/core/relational.py	421	right = a.rhs.equals(b.rhs,	STRING
HIGH	sympy/core/relational.py	446	elif dif.equals(0): # XXX this is expensive	STRING
HIGH	sympy/core/evalf.py	454	if not re_im.equals(0):	CODE
HIGH⚡	sympy/core/power.py	1819	bz = b.equals(0)	CODE
HIGH⚡	sympy/core/power.py	1829	bz = b.equals(0)	CODE
HIGH⚡	sympy/core/power.py	1835	return e.equals(0)	CODE
HIGH	sympy/core/power.py	46	\| \| \| undefined, but is convenient in some contexts \|	STRING
HIGH⚡	sympy/core/expr.py	738	if b is not None and b is not S.NaN and b.equals(a) is False:	CODE
HIGH⚡	sympy/core/expr.py	742	if b is not None and b is not S.NaN and b.equals(a) is False:	CODE
HIGH⚡	sympy/core/expr.py	747	if b.equals(a) is False:	CODE
HIGH	sympy/core/expr.py	374	ok = self.equals(i)	CODE
HIGH	sympy/core/expr.py	814	fac_zero = [fac.equals(0) for fac in factors]	CODE
HIGH	sympy/core/expr.py	3992	if x.equals(0):	CODE
HIGH	sympy/core/tests/test_assumptions.py	1053	assert e.equals(0) is True	CODE
HIGH⚡	sympy/core/tests/test_expr.py	1938	assert meter.equals(0) is False	CODE
HIGH⚡	sympy/core/tests/test_expr.py	1942	assert eq.equals(0)	CODE
HIGH⚡	sympy/core/tests/test_expr.py	1951	assert diff.equals(0) is None # should be False, but previously this was False due to wrong intermediate result	CODE
HIGH⚡	sympy/core/tests/test_expr.py	1961	assert eq.equals(0)	CODE
HIGH	sympy/core/tests/test_expr.py	1986	assert z.equals(0)	CODE
HIGH	sympy/core/tests/test_expr.py	2230	assert f1.equals(f2) is None	CODE
HIGH	sympy/core/tests/test_expr.py	2298	assert x.equals(y) is False	CODE
HIGH	sympy/core/tests/test_sympify.py	557	assert all(set(i.values()) == {null} for i in (	CODE
HIGH	sympy/polys/rootoftools.py	749	elif poly.length() == 2 and poly.TC():	CODE
HIGH	sympy/polys/polyroots.py	1019	if f.length() == 2 and n > 2:	CODE
HIGH	sympy/polys/polyroots.py	1086	if f.length() == 2:	CODE
HIGH	sympy/polys/polyroots.py	1149	elif f.length() == 2:	CODE
HIGH	sympy/polys/matrices/tests/test_nullspace.py	118	def _divide_last(null):	CODE
HIGH⚡	sympy/polys/matrices/tests/test_nullspace.py	137	def _check_primitive(null, null_ans):	CODE
HIGH⚡	sympy/polys/matrices/tests/test_nullspace.py	139	null = _to_DM(null, null_ans)	CODE
HIGH⚡	sympy/polys/matrices/tests/test_nullspace.py	144	def _check_divided(null, null_ans):	CODE
HIGH⚡	sympy/polys/matrices/tests/test_nullspace.py	146	null = _to_DM(null, null_ans)	CODE
HIGH⚡	sympy/printing/tests/test_c.py	200	assert ccode(x & y) == "x && y"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	201	assert ccode(x \| y) == "x \|\| y"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	203	assert ccode(x & y & z) == "x && y && z"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	204	assert ccode(x \| y \| z) == "x \|\| y \|\| z"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	205	assert ccode((x & y) \| z) == "z \|\| x && y"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	205	assert ccode((x & y) \| z) == "z \|\| x && y"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	206	assert ccode((x \| y) & z) == "z && (x \|\| y)"	CODE
HIGH⚡	sympy/printing/tests/test_c.py	208	assert ccode(x ^ y) == '(x \|\| y) && (!x \|\| !y)'	CODE
HIGH⚡	sympy/printing/tests/test_c.py	209	assert ccode((x ^ y) ^ z) == '(x \|\| y \|\| z) && (x \|\| !y \|\| !z) && (y \|\| !x \|\| !z) && (z \|\| !x \|\| !y)'	CODE
HIGH⚡	sympy/printing/tests/test_c.py	211	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.py	105	assert glsl_code(x & y) == "x && y"	CODE
HIGH⚡	sympy/printing/tests/test_glsl.py	106	assert glsl_code(x \| y) == "x \|\| y"	CODE
HIGH⚡	sympy/printing/tests/test_glsl.py	108	assert glsl_code(x & y & z) == "x && y && z"	CODE
HIGH⚡	sympy/printing/tests/test_glsl.py	109	assert glsl_code(x \| y \| z) == "x \|\| y \|\| z"	CODE
HIGH⚡	sympy/printing/tests/test_glsl.py	110	assert glsl_code((x & y) \| z) == "z \|\| x && y"	CODE
HIGH⚡	sympy/printing/tests/test_glsl.py	110	assert glsl_code((x & y) \| z) == "z \|\| x && y"	CODE
HIGH⚡	sympy/printing/tests/test_glsl.py	111	assert glsl_code((x \| y) & z) == "z && (x \|\| y)"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	143	assert julia_code(x & y) == "x && y"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	144	assert julia_code(x \| y) == "x \|\| y"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	146	assert julia_code(x & y & z) == "x && y && z"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	147	assert julia_code(x \| y \| z) == "x \|\| y \|\| z"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	148	assert julia_code((x & y) \| z) == "z \|\| x && y"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	148	assert julia_code((x & y) \| z) == "z \|\| x && y"	CODE
HIGH⚡	sympy/printing/tests/test_julia.py	149	assert julia_code((x \| y) & z) == "z && (x \|\| y)"	CODE
HIGH⚡	sympy/printing/tests/test_rust.py	123	assert rust_code(k & m) == "k && m"	CODE
HIGH⚡	sympy/printing/tests/test_rust.py	124	assert rust_code(k \| m) == "k \|\| m"	CODE
213 more matches not shown…

Deep Nesting1507 hits · 1421 pts

Severity	File	Line	Context
LOW	isympy.py	175	CODE
LOW	sympy/series/sequences.py	304	CODE
LOW	sympy/series/sequences.py	1119	CODE
LOW	sympy/series/sequences.py	1229	CODE
LOW	sympy/series/limits.py	70	CODE
LOW	sympy/series/limits.py	198	CODE
LOW	sympy/series/limits.py	265	CODE
LOW	sympy/series/order.py	132	CODE
LOW	sympy/series/order.py	376	CODE
LOW	sympy/series/order.py	462	CODE
LOW	sympy/series/formal.py	31	CODE
LOW	sympy/series/formal.py	418	CODE
LOW	sympy/series/formal.py	789	CODE
LOW	sympy/series/formal.py	1059	CODE
LOW	sympy/series/formal.py	1109	CODE
LOW	sympy/series/gruntz.py	249	CODE
LOW	sympy/series/gruntz.py	368	CODE
LOW	sympy/series/gruntz.py	428	CODE
LOW	sympy/series/gruntz.py	541	CODE
LOW	sympy/series/gruntz.py	662	CODE
LOW	sympy/series/limitseq.py	68	CODE
LOW	sympy/series/limitseq.py	162	CODE
LOW	sympy/series/fourier.py	515	CODE
LOW	sympy/core/facts.py	76	CODE
LOW	sympy/core/facts.py	136	CODE
LOW	sympy/core/facts.py	327	CODE
LOW	sympy/core/add.py	212	CODE
LOW	sympy/core/add.py	477	CODE
LOW	sympy/core/add.py	660	CODE
LOW	sympy/core/add.py	673	CODE
LOW	sympy/core/add.py	701	CODE
LOW	sympy/core/add.py	762	CODE
LOW	sympy/core/add.py	778	CODE
LOW	sympy/core/add.py	830	CODE
LOW	sympy/core/add.py	845	CODE
LOW	sympy/core/add.py	860	CODE
LOW	sympy/core/add.py	1019	CODE
LOW	sympy/core/add.py	1183	CODE
LOW	sympy/core/exprtools.py	33	CODE
LOW	sympy/core/exprtools.py	982	CODE
LOW	sympy/core/exprtools.py	1272	CODE
LOW	sympy/core/exprtools.py	1396	CODE
LOW	sympy/core/exprtools.py	291	CODE
LOW	sympy/core/exprtools.py	488	CODE
LOW	sympy/core/exprtools.py	558	CODE
LOW	sympy/core/exprtools.py	720	CODE
LOW	sympy/core/traversal.py	37	CODE
LOW	sympy/core/sorting.py	11	CODE
LOW	sympy/core/sorting.py	203	CODE
LOW	sympy/core/symbol.py	689	CODE
LOW	sympy/core/symbol.py	902	CODE
LOW	sympy/core/symbol.py	965	CODE
LOW	sympy/core/numbers.py	75	CODE
LOW	sympy/core/numbers.py	4300	CODE
LOW	sympy/core/numbers.py	352	CODE
LOW	sympy/core/numbers.py	487	CODE
LOW	sympy/core/numbers.py	498	CODE
LOW	sympy/core/numbers.py	509	CODE
LOW	sympy/core/numbers.py	782	CODE
LOW	sympy/core/numbers.py	921	CODE
1447 more matches not shown…

Decorative Section Separators281 hits · 704 pts

Severity	File	Line	Snippet	Context
MEDIUM	sympy/core/power.py	286	# ===================================================	COMMENT
MEDIUM	sympy/core/function.py	1446	# -------------------------------------------------------------	COMMENT
MEDIUM	sympy/ntheory/tests/test_primetest.py	174	#-------------	COMMENT
MEDIUM	sympy/solvers/solvers.py	1683	# -----------------------	STRING
MEDIUM	sympy/solvers/diophantine/diophantine.py	1651	# --------------------------	STRING
MEDIUM	sympy/testing/runtests.py	851	# --------------------------------------------------------------------	STRING
MEDIUM⚡	sympy/sets/fancysets.py	841	#---------------------	COMMENT
MEDIUM⚡	sympy/sets/fancysets.py	844	# --------------------	COMMENT
MEDIUM⚡	sympy/sets/fancysets.py	847	#---------------------	COMMENT
MEDIUM⚡	sympy/sets/fancysets.py	850	# --------------------	COMMENT
MEDIUM⚡	sympy/sets/fancysets.py	859	#---------------------	COMMENT
MEDIUM⚡	sympy/sets/fancysets.py	862	# --------------------	COMMENT
MEDIUM	sympy/sets/handlers/intersection.py	168	# -------------------	COMMENT
MEDIUM	sympy/combinatorics/polyhedron.py	834	# -----------------------------------------------------------------------	COMMENT
MEDIUM	sympy/combinatorics/polyhedron.py	839	# -----------------------------------------------------------------------	COMMENT
MEDIUM	sympy/combinatorics/fp_groups.py	395	#==============================================================================	COMMENT
MEDIUM	sympy/combinatorics/fp_groups.py	397	#==============================================================================	COMMENT
MEDIUM	sympy/combinatorics/fp_groups.py	956	#========================================================================	STRING
MEDIUM	sympy/combinatorics/fp_groups.py	958	#========================================================================	STRING
MEDIUM	sympy/functions/special/polynomials.py	41	#----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/functions/special/polynomials.py	439	#----------------------------------------------------------------------------	STRING
MEDIUM⚡	sympy/functions/special/polynomials.py	1002	#----------------------------------------------------------------------------	STRING
MEDIUM⚡	sympy/functions/special/polynomials.py	1206	#----------------------------------------------------------------------------	STRING
MEDIUM	sympy/functions/special/polynomials.py	286	#----------------------------------------------------------------------------	STRING
MEDIUM	sympy/functions/special/polynomials.py	769	#----------------------------------------------------------------------------	STRING
MEDIUM	sympy/functions/elementary/piecewise.py	402	# -----------------------------------------------------------------------	COMMENT
MEDIUM	sympy/functions/elementary/piecewise.py	546	# -----------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/secondquant.py	2856	# ============================	COMMENT
MEDIUM⚡	sympy/physics/quantum/qft.py	40	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qft.py	42	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/transforms.py	32	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/transforms.py	34	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/transforms.py	177	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/transforms.py	179	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/transforms.py	275	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/transforms.py	277	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/kind.py	76	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/kind.py	78	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	48	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	50	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	56	#-------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	58	#-------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/qubit.py	85	#-------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/qubit.py	87	#-------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	103	#-------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	105	#-------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	113	#-------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/qubit.py	115	#-------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/qubit.py	435	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/qubit.py	437	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/qubit.py	535	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/qubit.py	537	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/cg.py	34	#-----------------------------------------------------------------------------	COMMENT
MEDIUM⚡	sympy/physics/quantum/cg.py	36	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/spin.py	74	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/spin.py	76	#-----------------------------------------------------------------------------	COMMENT
MEDIUM	sympy/physics/quantum/spin.py	917	#-----------------------------------------------------------------------------	STRING
MEDIUM	sympy/physics/quantum/spin.py	919	#-----------------------------------------------------------------------------	STRING
MEDIUM	sympy/physics/quantum/spin.py	1794	#-----------------------------------------------------------------------------	STRING
MEDIUM	sympy/physics/quantum/spin.py	1796	#-----------------------------------------------------------------------------	STRING
221 more matches not shown…

Cross-File Repetition95 hits · 475 pts

Severity	File	Line	Snippet	Context
HIGH	sympy/core/add.py	0	efficiently extract the coefficient of a summation.	STRING
HIGH	sympy/core/numbers.py	0	efficiently extract the coefficient of a summation.	STRING
HIGH	sympy/core/expr.py	0	efficiently extract the coefficient of a summation.	STRING
HIGH	sympy/vector/basisdependent.py	0	efficiently extract the coefficient of a summation.	STRING
HIGH	sympy/core/basic.py	0	the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.	STRING
HIGH	sympy/core/function.py	0	the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.	STRING
HIGH	sympy/core/expr.py	0	the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.	STRING
HIGH	sympy/tensor/indexed.py	0	the expr_free_symbols property is deprecated. use free_symbols to get the free symbols of an expression.	STRING
HIGH	sympy/polys/series/ringpython.py	0	convert a power series element into the corresponding element of this ring.	STRING
HIGH	sympy/polys/series/ringflint.py	0	convert a power series element into the corresponding element of this ring.	STRING
HIGH	sympy/polys/series/ring.py	0	convert a power series element into the corresponding element of this ring.	STRING
HIGH	sympy/polys/series/base.py	0	convert a power series element into the corresponding element of this ring.	STRING
HIGH	sympy/polys/series/ringpython.py	0	return the coefficients of a power series as a list.	STRING
HIGH	sympy/polys/series/ringflint.py	0	return the coefficients of a power series as a list.	STRING
HIGH	sympy/polys/series/base.py	0	return the coefficients of a power series as a list.	STRING
HIGH	sympy/polys/series/ringpython.py	0	check if two power series have the same representation.	STRING
HIGH	sympy/polys/series/ringflint.py	0	check if two power series have the same representation.	STRING
HIGH	sympy/polys/series/base.py	0	check if two power series have the same representation.	STRING
HIGH	sympy/polys/series/ringpython.py	0	check if a arg is a ground element of the power series ring.	STRING
HIGH	sympy/polys/series/ringflint.py	0	check if a arg is a ground element of the power series ring.	STRING
HIGH	sympy/polys/series/base.py	0	check if a arg is a ground element of the power series ring.	STRING
HIGH	sympy/polys/domains/field.py	0	quotient of ``a`` and ``b``, implies ``__truediv__``.	STRING
HIGH	sympy/polys/domains/gmpyrationalfield.py	0	quotient of ``a`` and ``b``, implies ``__truediv__``.	STRING
HIGH	sympy/polys/domains/rationalfield.py	0	quotient of ``a`` and ``b``, implies ``__truediv__``.	STRING
HIGH	sympy/polys/domains/field.py	0	division of ``a`` and ``b``, implies ``__truediv__``.	STRING
HIGH	sympy/polys/domains/gmpyrationalfield.py	0	division of ``a`` and ``b``, implies ``__truediv__``.	STRING
HIGH	sympy/polys/domains/rationalfield.py	0	division of ``a`` and ``b``, implies ``__truediv__``.	STRING
HIGH	sympy/polys/matrices/ddm.py	0	says whether this matrix is diagonal. true can be returned even if the matrix is not square.	STRING
HIGH	sympy/polys/matrices/domainmatrix.py	0	says whether this matrix is diagonal. true can be returned even if the matrix is not square.	STRING
HIGH	sympy/polys/matrices/sdm.py	0	says whether this matrix is diagonal. true can be returned even if the matrix is not square.	STRING
HIGH	sympy/printing/str.py	0	setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).	STRING
HIGH	sympy/printing/repr.py	0	setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).	STRING
HIGH	sympy/printing/latex.py	0	setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).	STRING
HIGH	sympy/printing/pretty/pretty.py	0	setting permutation.print_cyclic is deprecated. instead use init_printing(perm_cyclic={perm_cyclic}).	STRING
HIGH	sympy/liealgebras/type_d.py	0	this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.	STRING
HIGH	sympy/liealgebras/type_a.py	0	this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.	STRING
HIGH	sympy/liealgebras/type_b.py	0	this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.	STRING
HIGH	sympy/liealgebras/type_e.py	0	this is a method just to generate roots with a -1 in the ith position and a 1 in the jth position.	STRING
HIGH	sympy/liealgebras/type_d.py	0	the ith simple root for the c series every lie algebra has a unique root system. given a root system q, there is a subse	STRING
HIGH	sympy/liealgebras/type_b.py	0	the ith simple root for the c series every lie algebra has a unique root system. given a root system q, there is a subse	STRING
HIGH	sympy/liealgebras/type_c.py	0	the ith simple root for the c series every lie algebra has a unique root system. given a root system q, there is a subse	STRING
HIGH	sympy/liealgebras/type_d.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_e.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_a.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_f.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_b.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_c.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_g.py	0	generate all the positive roots of a_n this is half of all of the roots of a_n; by multiplying all the positive roots by	STRING
HIGH	sympy/liealgebras/type_d.py	0	the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simple	STRING
HIGH	sympy/liealgebras/type_e.py	0	the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simple	STRING
HIGH	sympy/liealgebras/type_a.py	0	the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simple	STRING
HIGH	sympy/liealgebras/type_f.py	0	the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simple	STRING
HIGH	sympy/liealgebras/type_b.py	0	the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simple	STRING
HIGH	sympy/liealgebras/type_c.py	0	the cartan matrix for c_n the cartan matrix matrix for a lie algebra is generated by assigning an ordering to the simple	STRING
HIGH	sympy/liealgebras/type_b.py	0	dimension of the vector space v underlying the lie algebra examples ======== >>> from sympy.liealgebras.cartan_type impo	STRING
HIGH	sympy/liealgebras/type_c.py	0	dimension of the vector space v underlying the lie algebra examples ======== >>> from sympy.liealgebras.cartan_type impo	STRING
HIGH	sympy/liealgebras/type_g.py	0	dimension of the vector space v underlying the lie algebra examples ======== >>> from sympy.liealgebras.cartan_type impo	STRING
HIGH	sympy/integrals/tests/test_rde.py	0	most of these tests come from the examples in bronstein's book.	STRING
HIGH	sympy/integrals/tests/test_risch.py	0	most of these tests come from the examples in bronstein's book.	STRING
HIGH	sympy/integrals/tests/test_prde.py	0	most of these tests come from the examples in bronstein's book.	STRING
35 more matches not shown…

Over-Commented Block210 hits · 208 pts

Severity	File	Line	Snippet	Context
LOW	asv.conf.actions.json	21	// https://github.com/sympy/sympy/issues/26239	COMMENT
LOW	asv.conf.actions.json	41	// The tool to use to create environments. May be "conda",	COMMENT
LOW	asv.conf.actions.json	81		COMMENT
LOW	sympy/series/residues.py	41		COMMENT
LOW	sympy/core/backend.py	81	# Expected behaviour of a SymPy mutable/immutable matrix .simplify() method:	COMMENT
LOW	sympy/core/containers.py	121	# XXX: Basic defines count() as something different, so we can't	COMMENT
LOW	sympy/core/cache.py	101	# always call function itself and compare it with cached version	COMMENT
LOW	sympy/core/numbers.py	881	elif isinstance(num, tuple) and len(num) in (3, 4):	COMMENT
LOW	sympy/core/mul.py	501	# in c_powers	COMMENT
LOW	sympy/core/mul.py	1301	if any(a.is_zero is not False for a in self.args):	COMMENT
LOW	sympy/core/mul.py	1321	# would be indicated by None.	COMMENT
LOW	sympy/core/intfunc.py	261	# a' = Aa + Bb, b' = Ca + Db	COMMENT
LOW	sympy/core/intfunc.py	281	# x'%y" = x' - qy" < x" - qy' = x"%y',	COMMENT
LOW	sympy/core/power.py	1461	return Expr.matches(self, expr, repl_dict)	COMMENT
LOW	sympy/core/function.py	561	try:	COMMENT
LOW	sympy/core/function.py	801	args = [a.as_leading_term(x, logx=logx) for a in self.args]	COMMENT
LOW	sympy/core/assumptions.py	581	# though that independent code e.g. called indirectly by the handler or	COMMENT
LOW	sympy/core/assumptions.py	601	# single-threaded context but in multithreaded code it is possible that	COMMENT
LOW	sympy/core/assumptions.py	681	# in case someone has been using the ManagedProperties class in downstream	COMMENT
LOW	sympy/core/expr.py	841	# we can just consider the cases where the approximation appears	COMMENT
LOW	sympy/core/expr.py	3941	shift = -digits_to_decimal + dps	COMMENT
LOW	sympy/core/expr.py	3961	# to 15 digits:	COMMENT
LOW	sympy/core/expr.py	3981	# if we declared that we had more than 15 digits of precision.	COMMENT
LOW	sympy/core/tests/test_singleton.py	41	# performance benefit of being able to use 'is' (this only matters in very	COMMENT
LOW	sympy/core/tests/test_relational.py	981	# at a lower and higher precision bracket the value of pi	COMMENT
LOW	sympy/core/tests/test_expr.py	2061	assert a.round(10) == Float('3.000000000000000000000000000', '')	COMMENT
LOW	sympy/polys/euclidtools.py	1521		COMMENT
LOW	sympy/polys/rootoftools.py	961	by = mp.mpf(str(interval.by))	COMMENT
LOW	sympy/polys/puiseux.py	1	"""	COMMENT
LOW	sympy/polys/domains/algebraicfield.py	621	"""Construct the converter to convert back to Expr"""	COMMENT
LOW	sympy/polys/matrices/dense.py	161	# In cases like GF(p), QQ<sqrt(2)>, RR or CC though multiplication is	COMMENT
LOW	sympy/polys/matrices/dense.py	301	# Given an n x n matrix A and n x 1 matrix b:	COMMENT
LOW	sympy/polys/matrices/linsolve.py	1	#	COMMENT
LOW	sympy/polys/matrices/domainmatrix.py	3201		COMMENT
LOW	sympy/polys/matrices/rref.py	1	# Algorithms for computing the reduced row echelon form of a matrix.	COMMENT
LOW	sympy/polys/matrices/rref.py	281		COMMENT
LOW	sympy/polys/matrices/rref.py	321	if denom_lcm.bit_length() < 50:	COMMENT
LOW	sympy/polys/matrices/sdm.py	1701	# The algorithm then processes each row Ai one at a time. Previously seen	COMMENT
LOW	sympy/polys/matrices/sdm.py	1881	# nonzero elements. We will build the RREF matrix starting from an empty	COMMENT
LOW	sympy/polys/matrices/sdm.py	1901	# fully reduced rows because we can handle them more efficiently when	COMMENT
LOW	sympy/polys/matrices/sdm.py	2181	a = Mij	COMMENT
LOW	sympy/polys/matrices/_dfm.py	1	#	COMMENT
LOW	sympy/polys/matrices/_dfm.py	21	#	COMMENT
LOW	sympy/polys/matrices/_dfm.py	661	# TODO: Implement similar algorithms for DDM and SDM.	COMMENT
LOW	sympy/polys/matrices/_dfm.py	821		COMMENT
LOW	sympy/polys/matrices/tests/test_xxm.py	1	#	COMMENT
LOW	sympy/polys/matrices/tests/test_linsolve.py	81	y:8519/15990 + 1784/7995*I,	COMMENT
LOW	sympy/polys/matrices/tests/test_rref.py	521	(	COMMENT
LOW	sympy/concrete/summations.py	621	try:	COMMENT
LOW	sympy/concrete/tests/test_products.py	21	def test_karr_convention():	COMMENT
LOW	sympy/concrete/tests/test_sums_products.py	41	from sympy.simplify.simplify import simplify	COMMENT
LOW	sympy/concrete/tests/test_sums_products.py	61	# the upper limit being exclusive.	COMMENT
LOW	sympy/ntheory/primetest.py	781	#if n < 38010307:	COMMENT
LOW	sympy/ntheory/generate.py	41	>>> sieve._list	COMMENT
LOW	sympy/ntheory/generate.py	61	#	COMMENT
LOW	sympy/ntheory/generate.py	81	#	COMMENT
LOW	sympy/ntheory/bbp_pi.py	1	'''	COMMENT
LOW	sympy/ntheory/partitions_.py	181	"""	COMMENT
LOW	sympy/printing/codeprinter.py	241	# (temporary variables?)	COMMENT
LOW	sympy/printing/rcode.py	181	# from sympy.functions.elementary.piecewise import Piecewise	COMMENT
150 more matches not shown…

Self-Referential Comments80 hits · 206 pts

Severity	File	Line	Snippet	Context
MEDIUM	sympy/__init__.py	260	# This module is slow to import:	COMMENT
MEDIUM	sympy/polys/rings.py	293	# Create a new ring instance.	COMMENT
MEDIUM	sympy/polys/domains/mpelements.py	2	# This module is deprecated and should not be used any more. The actual	COMMENT
MEDIUM	sympy/polys/domains/algebraicfield.py	676	# Create a function to do the conversion efficiently:	COMMENT
MEDIUM	sympy/polys/matrices/linsolve.py	4	# This module defines the _linsolve function which is the internal workhorse	COMMENT
MEDIUM	sympy/polys/matrices/domainmatrix.py	3082	# Define a new polynomial f with f[i] = -(-1)^n*p[i] for i=0..n-1. Then	STRING
MEDIUM	sympy/concrete/summations.py	644	# The following code can grows like 2**n where n is the	STRING
MEDIUM	sympy/ntheory/generate.py	226	# Create the list such that block[x] iff (a + 2x + 1) is prime.	COMMENT
MEDIUM	sympy/printing/rcode.py	212	# This method is called only for inline if constructs	COMMENT
MEDIUM	sympy/printing/llvmjitcode.py	233	# Create a wrapped double: PyObject* PyFloat_FromDouble(double v)	COMMENT
MEDIUM	sympy/printing/llvmjitcode.py	241	# Create a tuple: PyObject* PyTuple_Pack(Py_ssize_t n, ...)	COMMENT
MEDIUM	sympy/printing/tests/test_tensorflow.py	76	# Creating a custom inverse test.	COMMENT
MEDIUM	sympy/logic/boolalg.py	3199	# Create a list of possible replacements	COMMENT
MEDIUM	sympy/logic/boolalg.py	3265	# Create a list of possible replacements	COMMENT
MEDIUM	sympy/logic/algorithms/dpll2.py	132	# Create the base level	COMMENT
MEDIUM	sympy/solvers/ode/nonhomogeneous.py	86	# Create a dict root: multiplicity or charroots	STRING
MEDIUM	sympy/solvers/ode/nonhomogeneous.py	205	# Create a dict root: multiplicity or charroots	STRING
MEDIUM	sympy/codegen/abstract_nodes.py	1	"""This module provides containers for python objects that are valid	STRING
MEDIUM	sympy/codegen/ast.py	706	# Create a graph where the nodes are assignments and there is a directed edge	COMMENT
MEDIUM	sympy/codegen/tests/test_applications.py	1	# This file contains tests that exercise multiple AST nodes	COMMENT
MEDIUM	sympy/utilities/lambdify.py	929	# Create the function definition code and execute it	COMMENT
MEDIUM	sympy/utilities/pkgdata.py	1	# This module is deprecated and will be removed.	COMMENT
MEDIUM⚡	sympy/utilities/tests/test_codegen_julia.py	48	"# This file is part of 'project'\n"	CODE
MEDIUM	sympy/utilities/tests/test_codegen_julia.py	289	"# This file is part of 'project'\n"	CODE
MEDIUM	sympy/integrals/laplace.py	804	# The following code checks all remaining poles. If t1 is a pole at	COMMENT
MEDIUM	sympy/integrals/rationaltools.py	1	"""This module implements tools for integrating rational functions. """	STRING
MEDIUM	sympy/integrals/tests/test_integrals.py	2154	# Define the symbols	COMMENT
MEDIUM	sympy/integrals/tests/test_integrals.py	2158	# Define the integral expression	COMMENT
MEDIUM	sympy/integrals/tests/test_integrals.py	2175	# Define the symbol and the integral expression	COMMENT
MEDIUM	sympy/plotting/experimental_lambdify.py	407	# Create the final ordered tuples of dictionaries	COMMENT
MEDIUM	sympy/plotting/pygletplot/plot_mode.py	79	# Create the object	COMMENT
MEDIUM	sympy/plotting/backends/matplotlibbackend/matplotlib.py	123	# Create the collections	COMMENT
MEDIUM	sympy/combinatorics/rewritingsystem.py	45	# Create a finite state machine as an instance of the StateMachine object	COMMENT
MEDIUM	sympy/functions/special/hyper.py	33	# This method is only needed because hyper._eval_as_leading_term falls back	COMMENT
MEDIUM⚡	sympy/functions/special/polynomials.py	431	# This function is just kept for backwards compatibility	STRING
MEDIUM⚡	sympy/functions/special/polynomials.py	994	# This function is just kept for backwards compatibility	STRING
MEDIUM⚡	sympy/functions/special/polynomials.py	1101	# This function is just kept for backwards compatibility	STRING
MEDIUM⚡	sympy/functions/special/polynomials.py	1198	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/functions/special/polynomials.py	204	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/functions/special/polynomials.py	557	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/functions/special/polynomials.py	683	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/functions/special/polynomials.py	885	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/functions/special/polynomials.py	1316	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/functions/special/polynomials.py	1442	# This function is just kept for backwards compatibility	STRING
MEDIUM	sympy/tensor/array/expressions/array_expressions.py	543	# Create an index, target-position-key array:	STRING
MEDIUM	sympy/tensor/array/expressions/array_expressions.py	1795	# Create a collector for the new diagonal indices:	STRING
MEDIUM	sympy/geometry/curve.py	340	"""This function is used to rotate a curve along given point ``pt`` at given angle(in radian).	STRING
MEDIUM	sympy/physics/mechanics/system.py	1518	# Create a list of all of the expressions in the equations of motion	COMMENT
MEDIUM	sympy/physics/mechanics/system.py	1536	# Create a list of all of the expressions in the equations of motion	COMMENT
MEDIUM	sympy/physics/mechanics/wrapping_geometry.py	646	"""This method is implemented as required by WrappingGeometryBase, use WrappingCone.apex instead."""	STRING
MEDIUM	sympy/physics/mechanics/lagrange.py	211	# Creating the qs, qdots and qdoubledots	COMMENT
MEDIUM	sympy/physics/mechanics/lagrange.py	254	# Creating the multipliers	COMMENT
MEDIUM	sympy/physics/mechanics/tests/test_lagrange.py	45	# Creating the disc 'D'; we create the point that represents the mass	COMMENT
MEDIUM	sympy/physics/mechanics/tests/test_system.py	8	# This class is going to be tested using a simple pendulum set up in x and y	COMMENT
MEDIUM	sympy/physics/mechanics/tests/test_kane.py	276	# Defining the constants and knowns of the system	COMMENT
MEDIUM	sympy/physics/control/lti.py	853	>>> #Create a Transfer Function with more than one variable	CODE
MEDIUM	sympy/physics/control/lti.py	907	>>> #Create a Transfer Function with variable poles and zeros	CODE
MEDIUM	sympy/physics/quantum/kind.py	42	# Create an instance as many situations need this.	COMMENT
MEDIUM	sympy/physics/quantum/kind.py	56	# Create an instance as many situations need this.	COMMENT
MEDIUM⚡	sympy/physics/quantum/kind.py	72	# Create an instance as many situations need this.	COMMENT
20 more matches not shown…

Modern Structural Boilerplate171 hits · 174 pts

Severity	File	Line	Snippet	Context
LOW	sympy/__init__.py	267	__all__ = [	CODE
LOW	sympy/series/__init__.py	20	__all__ = ['Order', 'O', 'limit', 'Limit', 'gruntz', 'series', 'approximants',	CODE
LOW	sympy/crypto/__init__.py	19	__all__ = [	CODE
LOW	sympy/core/backend.py	113	__all__ = [	CODE
LOW	sympy/core/sorting.py	8	__all__ = ['default_sort_key', 'ordered']	CODE
LOW	sympy/core/__init__.py	44	__all__ = [	CODE
LOW	sympy/unify/__init__.py	12	__all__ = [	CODE
LOW	sympy/polys/rootoftools.py	34	__all__ = ['CRootOf']	CODE
LOW	sympy/polys/__init__.py	4	__all__ = [	CODE
LOW	sympy/polys/polyoptions.py	5	__all__ = ["Options"]	CODE
LOW	sympy/polys/domainmatrix.py	13	__all__ = ['DomainMatrix']	CODE
LOW	sympy/polys/orderings.py	7	__all__ = ["lex", "grlex", "grevlex", "ilex", "igrlex", "igrevlex"]	CODE
LOW	sympy/polys/series/__init__.py	2	__all__ = [	CODE
LOW	sympy/polys/domains/domain.py	1577	__all__ = ['Domain']	CODE
LOW	sympy/polys/domains/__init__.py	4	__all__ = [	CODE
LOW	sympy/polys/domains/groundtypes.py	84	__all__ = [	CODE
LOW	sympy/polys/numberfields/__init__.py	4	__all__ = [	CODE
LOW	sympy/polys/numberfields/exceptions.py	53	__all__ = [	CODE
LOW	sympy/polys/agca/__init__.py	6	__all__ = ['homomorphism']	CODE
LOW	sympy/polys/matrices/__init__.py	14	__all__ = [	CODE
LOW	sympy/polys/matrices/exceptions.py	64	__all__ = [	CODE
LOW	sympy/polys/matrices/_dfm.py	67	__all__ = ['DFM']	CODE
LOW	sympy/concrete/__init__.py	5	__all__ = [	CODE
LOW	sympy/holonomic/__init__.py	14	__all__ = [	STRING
LOW	sympy/strategies/__init__.py	36	__all__ = [	CODE
LOW	sympy/strategies/branch/__init__.py	8	__all__ = [	CODE
LOW	sympy/ntheory/__init__.py	31	__all__ = [	CODE
LOW	sympy/discrete/__init__.py	16	__all__ = [	CODE
LOW	sympy/printing/__init__.py	48	__all__ = [	CODE
LOW	sympy/printing/lambdarepr.py	10	__all__ = [	CODE
LOW	sympy/printing/dot.py	8	__all__ = ['dotprint']	CODE
LOW	sympy/printing/pretty/__init__.py	10	__all__ = [	CODE
LOW	sympy/printing/pretty/pretty_symbology.py	35	__all__ = ['greek_unicode', 'sub', 'sup', 'xsym', 'vobj', 'hobj', 'pretty_symbol',	CODE
LOW	sympy/algebras/quaternion.py	142	def set_norm(self, norm: SExpr \| None) -> None:	CODE
LOW	sympy/algebras/__init__.py	4	__all__ = ["Quaternion",]	CODE
LOW	sympy/logic/__init__.py	7	__all__ = [	CODE
LOW	sympy/logic/utilities/__init__.py	4	__all__ = ['load_file']	CODE
LOW	sympy/solvers/__init__.py	45	__all__ = [	CODE
LOW	sympy/solvers/diophantine/__init__.py	4	__all__ = [	CODE
LOW	sympy/solvers/diophantine/diophantine.py	40	__all__ = ['diophantine', 'classify_diop']	CODE
LOW	sympy/solvers/ode/__init__.py	13	__all__ = [	CODE
LOW	sympy/codegen/__init__.py	21	__all__ = [	CODE
LOW	sympy/multipledispatch/__init__.py	8	__all__ = [	CODE
LOW	sympy/liealgebras/__init__.py	4	__all__ = ['CartanType']	CODE
LOW	sympy/utilities/__init__.py	18	__all__ = [	CODE
LOW	sympy/utilities/codegen.py	101	__all__ = [	CODE
LOW	sympy/utilities/_compilation/__init__.py	20	__all__ = [	CODE
LOW	sympy/testing/__init__.py	9	__all__ = [	CODE
LOW	sympy/integrals/__init__.py	30	__all__ = [	CODE
LOW	sympy/assumptions/__init__.py	14	__all__ = [	CODE
LOW	sympy/assumptions/relation/__init__.py	12	__all__ = ['BinaryRelation', 'AppliedBinaryRelation']	CODE
LOW	sympy/assumptions/relation/equality.py	22	__all__ = ['EqualityPredicate', 'UnequalityPredicate', 'StrictGreaterThanPredicate',	CODE
LOW	sympy/assumptions/relation/binrel.py	12	__all__ = ["BinaryRelation", "AppliedBinaryRelation"]	CODE
LOW	sympy/assumptions/handlers/__init__.py	10	__all__ = [	CODE
LOW	sympy/plotting/__init__.py	10	__all__ = [	CODE
LOW	sympy/plotting/intervalmath/__init__.py	7	__all__ = [	CODE
LOW	sympy/plotting/backends/matplotlibbackend/__init__.py	6	__all__ = ["MatplotlibBackend", "_matplotlib_list"]	CODE
LOW	sympy/plotting/backends/textbackend/__init__.py	4	__all__ = ["TextBackend"]	CODE
LOW	sympy/sets/__init__.py	22	__all__ = [	CODE
LOW	sympy/combinatorics/__init__.py	18	__all__ = [	CODE
111 more matches not shown…

AI Structural Patterns92 hits · 88 pts

Severity	File	Line	Context
LOW	sympy/crypto/crypto.py	767	CODE
LOW	sympy/crypto/crypto.py	791	CODE
LOW	sympy/crypto/crypto.py	891	CODE
LOW	sympy/crypto/crypto.py	961	CODE
LOW	sympy/crypto/crypto.py	1026	CODE
LOW	sympy/crypto/crypto.py	1126	CODE
LOW	sympy/crypto/crypto.py	1167	CODE
LOW	sympy/crypto/crypto.py	2292	CODE
LOW	sympy/core/exprtools.py	1267	CODE
LOW	sympy/core/numbers.py	210	CODE
LOW	sympy/core/evalf.py	1170	CODE
LOW	sympy/core/function.py	2565	CODE
LOW	sympy/core/expr.py	3673	CODE
LOW	sympy/polys/ring_series.py	1353	CODE
LOW	sympy/polys/ring_series.py	1870	CODE
LOW	sympy/polys/polyroots.py	849	CODE
LOW	sympy/polys/polyroots.py	864	CODE
LOW	sympy/polys/polyroots.py	880	CODE
LOW	sympy/polys/galoistools.py	1014	CODE
LOW	sympy/polys/domains/algebraicfield.py	684	CODE
LOW	sympy/polys/numberfields/minpoly.py	212	CODE
LOW	sympy/polys/numberfields/minpoly.py	529	CODE
LOW	sympy/concrete/summations.py	1640	CODE
LOW	sympy/concrete/summations.py	342	CODE
LOW	sympy/concrete/products.py	422	CODE
LOW	sympy/ntheory/factor_.py	1221	CODE
LOW	sympy/printing/preview.py	154	CODE
LOW	sympy/printing/str.py	765	CODE
LOW	sympy/printing/mathml.py	74	CODE
LOW	sympy/printing/llvmjitcode.py	134	CODE
LOW	sympy/printing/llvmjitcode.py	148	CODE
LOW	sympy/printing/smtlib.py	270	CODE
LOW	sympy/printing/pretty/pretty.py	1014	CODE
LOW	sympy/logic/boolalg.py	1764	CODE
LOW	sympy/logic/boolalg.py	3180	CODE
LOW	sympy/solvers/solveset.py	3765	CODE
LOW	sympy/solvers/ode/ode.py	357	CODE
LOW	sympy/codegen/algorithms.py	17	CODE
LOW	sympy/utilities/autowrap.py	547	CODE
LOW	sympy/utilities/codegen.py	1991	CODE
LOW	sympy/utilities/_compilation/runners.py	71	CODE
LOW	sympy/testing/runtests.py	500	CODE
LOW	sympy/testing/runtests.py	999	CODE
LOW	sympy/assumptions/sathandlers.py	100	CODE
LOW	sympy/assumptions/wrapper.py	56	CODE
LOW	sympy/plotting/experimental_lambdify.py	206	CODE
LOW	sympy/plotting/pygletplot/plot_axes.py	13	CODE
LOW	sympy/plotting/backends/base_backend.py	207	CODE
LOW	sympy/combinatorics/tensor_can.py	892	CODE
LOW	sympy/combinatorics/permutations.py	1329	CODE
LOW	sympy/combinatorics/perm_groups.py	1136	CODE
LOW	sympy/interactive/session.py	342	CODE
LOW	sympy/interactive/printing.py	306	CODE
LOW	sympy/tensor/tensor.py	2627	CODE
LOW	sympy/geometry/polygon.py	2878	CODE
LOW	sympy/physics/hep/gamma_matrices.py	198	CODE
LOW	sympy/physics/hep/gamma_matrices.py	221	CODE
LOW	sympy/physics/mechanics/system.py	1328	CODE
LOW	sympy/physics/mechanics/kane.py	266	CODE
LOW	sympy/physics/mechanics/joint.py	136	CODE
32 more matches not shown…

Excessive Try-Catch Wrapping74 hits · 72 pts

Severity	File	Line	Snippet	Context
LOW	setup.py	217	except Exception:	CODE
MEDIUM	setup.py	231	print("Error deleting %s - %s." % (e.filename, e.strerror))	CODE
LOW	sympy/printing/pycode.py	432	except Exception: # noqa: BLE001	CODE
LOW	sympy/solvers/ode/tests/test_single.py	244	except Exception as e:	STRING
LOW	sympy/testing/pytest.py	192	except Exception as e: # noqa: BLE001	CODE
MEDIUM	sympy/testing/pytest.py	189	def wrapper():	CODE
LOW	sympy/testing/runtests.py	1238	except Exception: # noqa: BLE001	CODE
LOW	sympy/testing/runtests.py	1283	except Exception:	CODE
LOW	sympy/testing/runtests.py	1308	except Exception: # noqa: BLE001	CODE
MEDIUM	sympy/plotting/series.py	54	def wrapper_func(func, *args):	CODE
MEDIUM	sympy/plotting/series.py	1573	def _adaptive_sampling(self):	CODE
MEDIUM	sympy/plotting/series.py	1659	def _adaptive_sampling(self):	CODE
LOW	sympy/plotting/series.py	89	except Exception as err: # noqa: BLE001	CODE
LOW	sympy/plotting/series.py	1370	except Exception as err: # noqa: BLE001	CODE
LOW	sympy/plotting/series.py	1582	except Exception as err: # noqa: BLE001	CODE
LOW	sympy/plotting/series.py	1670	except Exception as err: # noqa: BLE001	CODE
LOW	sympy/plotting/pygletplot/plot_mode.py	230	except Exception as e:	CODE
LOW	sympy/plotting/pygletplot/color_scheme.py	120	except Exception:	CODE
LOW	sympy/plotting/pygletplot/color_scheme.py	136	except Exception as ex:	CODE
LOW	sympy/plotting/pygletplot/color_scheme.py	222	except Exception:	CODE
LOW	sympy/plotting/pygletplot/color_scheme.py	228	except Exception:	CODE
MEDIUM	sympy/plotting/pygletplot/color_scheme.py	225	def __call__(self, x, y, z, u, v):	CODE
LOW	sympy/plotting/pygletplot/plot_mode_base.py	114	except Exception:	CODE
LOW	sympy/plotting/pygletplot/plot_mode_base.py	347	except Exception as e:	CODE
MEDIUM	sympy/plotting/pygletplot/plot_mode_base.py	336	def _set_color(self, v):	CODE
LOW	sympy/plotting/pygletplot/managed_window.py	47	except Exception as e:	CODE
LOW	sympy/plotting/pygletplot/managed_window.py	66	except Exception as e:	CODE
LOW	sympy/interactive/session.py	487	except Exception: # noqa: BLE001	CODE
LOW	sympy/interactive/printing.py	94	except Exception as e:	CODE
LOW	sympy/interactive/printing.py	107	except Exception as e:	CODE
LOW	sympy/physics/mechanics/tests/test_kane.py	464	except Exception as e:	CODE
LOW⚡	sympy/parsing/sympy_parser.py	1089	except Exception as e: # noqa: BLE001	CODE
LOW	sympy/parsing/latex/_parse_latex_antlr.py	20	except Exception:	CODE
MEDIUM	sympy/parsing/autolev/_listener_autolev_antlr.py	1598	def exitOutputs2(self, ctx):	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	337	except Exception:	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	343	except Exception:	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	353	except Exception:	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	1364	except Exception:	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	1370	except Exception:	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	1374	except Exception:	CODE
LOW⚡	sympy/parsing/autolev/_listener_autolev_antlr.py	1392	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	249	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	569	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	597	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	618	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	623	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	666	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	915	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	976	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	982	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1036	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1179	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1288	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1290	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1470	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1475	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1581	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1587	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1606	except Exception:	CODE
LOW	sympy/parsing/autolev/_listener_autolev_antlr.py	1667	except Exception:	CODE
14 more matches not shown…

Redundant / Tautological Comments64 hits · 60 pts

Severity	File	Line	Snippet	Context
LOW	sympy/core/relational.py	366	# Check if first value has negative sign	STRING
LOW	sympy/core/sympify.py	414	#Check if there exists a converter for any of the types in the mro	COMMENT
LOW	sympy/polys/rootconditions.py	329	# Check if -1 is a root, since the transformation is not defined in this case	COMMENT
LOW	sympy/polys/polyroots.py	569	# Check if f20 has linear factors over domain Z	COMMENT
LOW	sympy/ntheory/generate.py	514	# Check if n is within the sieve range	STRING
LOW	sympy/ntheory/factor_.py	1496	# Check if it exists in the cache	STRING
LOW	sympy/logic/algorithms/dpll2.py	202	# Check if unit prop says the theory is unsat right off the bat	COMMENT
LOW	sympy/logic/algorithms/dpll2.py	274	# Check if we've made the theory unsat	COMMENT
LOW	sympy/logic/algorithms/dpll2.py	413	# Check if no sentinel update exists	COMMENT
LOW	sympy/solvers/solvers.py	2227	# Check if there are any non-zero solutions at all	STRING
LOW	sympy/solvers/solveset.py	2858	# Check if 'symbols' is a set and raise an error if it is	STRING
LOW	sympy/solvers/diophantine/diophantine.py	580	# Check if the coefficients of y and x obtained are integers or not	COMMENT
LOW	sympy/solvers/ode/single.py	2834	# Check if b3 = 0 (no first derivative term) or a3 = 0 (no second derivative term)	STRING
LOW	sympy/solvers/ode/single.py	2842	# Check if c3 is of the form A*x^k where k has free symbols	STRING
LOW	sympy/solvers/ode/ode.py	2598	# Check if second frobenius series solution exists.	STRING
LOW	sympy/solvers/ode/riccati.py	318	# Check if coefficients are not symbols and floats	STRING
LOW	sympy/solvers/ode/riccati.py	365	# Check if degree of numerator is same as denominator	STRING
LOW	sympy/solvers/ode/riccati.py	722	# Check if there are any constants	STRING
LOW	sympy/testing/runtests.py	1108	# Read the file, convert it to a test, and run it.	COMMENT
LOW	sympy/plotting/series.py	2578	# Check if any point in between is valid	COMMENT
LOW	sympy/combinatorics/rewritingsystem.py	400	# Check if the transition to any new state in possible.	COMMENT
LOW	sympy/functions/special/bsplines.py	65	# Check if arg2 condition smaller than arg1,	COMMENT
LOW⚡	sympy/functions/elementary/integers.py	604	# Check if other <= 0	STRING
LOW⚡	sympy/functions/elementary/integers.py	607	# Check if other >= 1	STRING
LOW⚡	sympy/functions/elementary/integers.py	616	# Check if other < 0	STRING
LOW⚡	sympy/functions/elementary/integers.py	620	# Check if other >= 1	STRING
LOW⚡	sympy/functions/elementary/integers.py	628	# Check if other < 0	STRING
LOW⚡	sympy/functions/elementary/integers.py	631	# Check if other >= 1	STRING
LOW⚡	sympy/functions/elementary/integers.py	640	# Check if other <= 0	STRING
LOW⚡	sympy/functions/elementary/integers.py	643	# Check if other >= 1	STRING
LOW	sympy/functions/elementary/integers.py	701	# Check if other < 0	STRING
LOW	sympy/functions/elementary/integers.py	704	# Check if other >= 1	STRING
LOW⚡	sympy/tensor/tensor.py	2230	# Check if variance of indices needs to be fixed:	STRING
LOW	sympy/tensor/array/ndim_array.py	184	# Check if any index is symbolic:	COMMENT
LOW	sympy/tensor/array/expressions/from_array_to_matrix.py	815	# Check if expression is a trace:	STRING
LOW	sympy/tensor/array/expressions/from_indexed_to_array.py	171	# Check if there are KroneckerDelta objects:	STRING
LOW	sympy/tensor/array/expressions/from_indexed_to_array.py	230	# Check if all indices are compatible. Otherwise expand the dimensions:	STRING
LOW	sympy/tensor/array/expressions/array_expressions.py	270	# Check if there are nested ArraySum objects:	STRING
LOW	sympy/tensor/array/expressions/array_expressions.py	290	# Check if there are nested permutation and lift them up:	STRING
LOW	sympy/tensor/tests/test_tensor.py	1046	#Check if contract_metric gets into an infinite loop when given a TensMul whose coeff is an Add	COMMENT
LOW	sympy/tensor/tests/test_tensor.py	1139	#Check if TensAdd.contract_delta can handle the case when the TensAdd has non-TensExpr args.	COMMENT
LOW	sympy/physics/mechanics/system.py	1056	# Check if all joint coordinates and speeds are present	COMMENT
LOW	sympy/physics/mechanics/tests/test_linearize.py	335	# Check if passing a function to linear_solver works	COMMENT
LOW	sympy/physics/mechanics/tests/test_actuator.py	747	# Check if DuffingSpring correctly initializes its attributes	STRING
LOW	sympy/physics/mechanics/tests/test_actuator.py	812	# Check if certain properties of DuffingSpring object are immutable after initialization	STRING
LOW	sympy/physics/mechanics/tests/test_actuator.py	827	# Check if the actual string representation of DuffingSpring instance matches the expected string for each provided	STRING
LOW	sympy/physics/mechanics/tests/test_actuator.py	855	# Check if the absolute value of the difference is below a threshold	STRING
LOW	sympy/physics/continuum_mechanics/beam.py	3062	# Check if any of the evaluated reaction exists in another direction	COMMENT
LOW	sympy/physics/continuum_mechanics/tests/test_column.py	299	c2.apply_support(10) # Check if order of applying supports matters	CODE
LOW	sympy/physics/vector/frame.py	72	# Check if the other object is a CoordinateSym of the same frame and	COMMENT
LOW	sympy/physics/vector/frame.py	556	# Check if the dcm wrt that frame has already been calculated	STRING
LOW	sympy/physics/control/lti.py	2612	# Check if the system is a StateSpace	STRING
LOW	sympy/physics/control/tests/test_lti.py	3290	# Check if the system is SISO or MIMO.	COMMENT
LOW	sympy/physics/control/tests/test_lti.py	4256	# Check if the system is SISO or MIMO.	COMMENT
LOW	sympy/physics/quantum/density.py	48	# Check if arg is a tuple	COMMENT
LOW	sympy/physics/quantum/identitysearch.py	91	# Check if it's diagonal	COMMENT
LOW	sympy/physics/quantum/identitysearch.py	94	# Check if the rows indices and columns indices are the same	COMMENT
LOW	sympy/parsing/mathematica.py	684	# Check if the regular expression has already been compiled:	COMMENT
LOW	sympy/vector/vector.py	193	# Check if the other is a del operator	COMMENT
LOW	sympy/categories/diagram_drawing.py	2143	# Check if there's space to the left.	STRING
4 more matches not shown…

AI Slop Vocabulary33 hits · 52 pts

Severity	File	Line	Snippet	Context
LOW	sympy/core/add.py	1168	# so we just use the same sort as is used in Add.flatten. When the	COMMENT
LOW	sympy/core/operations.py	410	# here, we have a number so we just call to _evalf with prec;	COMMENT
LOW	sympy/core/expr.py	512	# Probably this method should just return self.evalf(2).is_Number.	COMMENT
LOW	sympy/core/expr.py	3722	# now, we just use a special case to make multinomial run before mul,	COMMENT
LOW	sympy/polys/rings.py	2687	# Can just use self.flint_poly.to_dict() in case of python-flint	COMMENT
LOW	sympy/polys/matrices/_dfm.py	572	# time of writng just use Bareiss for all matrices and domains.	COMMENT
LOW	sympy/polys/matrices/tests/test_xxm.py	854	# XXX: Change the signature to just return the nullspace. Possibly	COMMENT
MEDIUM	sympy/concrete/summations.py	1649	# robust than the current implementation of ``residue`` which uses a series	COMMENT
MEDIUM	sympy/printing/pretty/pretty_symbology.py	59	"""See if unicode output is available and leverage it if possible"""	STRING
MEDIUM	sympy/solvers/solvers.py	1483	# Poly is generally robust enough to convert anything to	COMMENT
LOW	sympy/solvers/solvers.py	2265	# If there is a non-trivial solution, just set the free variables to	STRING
LOW	sympy/solvers/ode/nonhomogeneous.py	197	# Can't just call roots because it doesn't return rootof for unsolveable	STRING
LOW	sympy/solvers/ode/tests/test_ode.py	95	# Maybe this should just use one of the solutions instead of raising...	COMMENT
MEDIUM	sympy/utilities/tests/test_misc.py	140	# expected; Q.prime is more nuanced in its response for	COMMENT
MEDIUM	sympy/testing/runtests.py	1964	# in conjunction with the ELLIPSIS flag.	STRING
MEDIUM	sympy/integrals/intpoly.py	976	# TODO : This part is quite hacky. Should be made more robust with	COMMENT
LOW	sympy/assumptions/tests/test_sathandlers.py	18	# The predicate doesn't matter here, so just pass	COMMENT
LOW	sympy/plotting/intervalmath/interval_arithmetic.py	15	# Q: Why use numpy? Why not simply use mpmath's interval arithmetic?	COMMENT
MEDIUM	sympy/combinatorics/free_groups.py	171	"""Return a tuple of arguments that must be passed to __new__ in order to support pickling this object."""	STRING
LOW	sympy/physics/hep/gamma_matrices.py	452	# no contractions in `expression`, just return it.	STRING
MEDIUM	sympy/physics/mechanics/tests/test_kane3.py	187	# model to the reference eigen values. Look at the aforementioned paper for	COMMENT
LOW	sympy/physics/mechanics/tests/test_kane.py	514	# Note that we just use the explicit kinematics for the linear velocities	COMMENT
MEDIUM	sympy/physics/vector/tests/test_functions.py	344	#The use of time_derivative for calculations pertaining to scalar	COMMENT
LOW	sympy/physics/quantum/spin.py	1074	# we could just use this unless there are cases when this is not true	COMMENT
LOW	sympy/physics/quantum/represent.py	241	# vectors are taken. In these cases, we simply return a scalar.	COMMENT
LOW	sympy/physics/quantum/gate.py	224	# If the controls are not met, just return	COMMENT
LOW	sympy/physics/quantum/qapply.py	145	if not nc_part: # If we only have a commuting part, just return it.	CODE
LOW	sympy/physics/quantum/operatorset.py	261	# If this fails, just return the classes	COMMENT
LOW	sympy/physics/quantum/state.py	156	# If height is 1, just return brackets	COMMENT
LOW	sympy/parsing/sympy_parser.py	1239	# keywords=[]: If ommited, keywords would have the default value of None, it will just return an Attribu	COMMENT
LOW	sympy/simplify/trigsimp.py	265	# We just add the extragens to gens and analyse them as before	COMMENT
MEDIUM	sympy/simplify/hyperexpand.py	2121	""" Try to apply ``shifter`` in order to bring some element in ``f``	STRING
MEDIUM	sympy/matrices/eigen.py	307	# the multiplicity correct. This is not robust enough in general	STRING

TODO Padding14 hits · 24 pts

Severity	File	Line	Snippet	Context
LOW	sympy/polys/domains/domain.py	623	# TODO: implement this in from_ methods	COMMENT
LOW	sympy/integrals/prde.py	159	# TODO: Add test	COMMENT
LOW	sympy/integrals/prde.py	823	# TODO: implement this	COMMENT
LOW⚡	sympy/integrals/tests/test_rde.py	137	# TODO: Add test for when the degree bound becomes larger after limited_integrate	COMMENT
LOW⚡	sympy/integrals/tests/test_rde.py	138	# TODO: Add test for db == da - 1 case	COMMENT
LOW⚡	sympy/integrals/tests/test_rde.py	141	# TODO: Add tests	COMMENT
LOW⚡	sympy/integrals/tests/test_rde.py	142	# TODO: Add test for when the degree becomes larger after parametric_log_deriv()	COMMENT
LOW	sympy/integrals/tests/test_risch.py	251	# TODO: Add tests for integrate_hyperexponential() from the book	COMMENT
LOW	sympy/integrals/tests/test_prde.py	148	# TODO: Add test for deg(b) <= 0 with b small	COMMENT
LOW	sympy/assumptions/handlers/matrices.py	49	# TODO: implement sathandlers system for the matrices.	COMMENT
LOW	sympy/assumptions/handlers/matrices.py	79	# TODO: implement sathandlers system for the matrices.	COMMENT
LOW	sympy/assumptions/handlers/matrices.py	96	# TODO: implement sathandlers system for the matrices.	COMMENT
LOW	sympy/physics/quantum/tests/test_cartesian.py	114	# TODO: Add tests for representations	COMMENT
LOW	sympy/stats/matrix_distributions.py	115	### TODO: Add tests after adding matrix distributions in numpy_rv_map	COMMENT

Dead Code8 hits · 16 pts

Severity	File	Line	Context
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	56	CODE
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	57	CODE
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	58	CODE
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	60	CODE
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	61	CODE
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	62	CODE
MEDIUM	sympy/matrices/expressions/tests/test_derivatives.py	64	CODE
MEDIUM	doc/ext/docscrape_sphinx.py	34	CODE

Slop Phrases9 hits · 12 pts

Severity	File	Line	Snippet	Context
LOW	sympy/core/mul.py	28	# "there are still non-commutative objects -- don't forget to process them"	COMMENT
LOW	sympy/core/mul.py	28	# "there are still non-commutative objects -- don't forget to process them"	COMMENT
LOW	sympy/core/mul.py	365	# append non-commutative marker, so we don't forget to	COMMENT
LOW	sympy/core/mul.py	365	# append non-commutative marker, so we don't forget to	COMMENT
LOW	sympy/core/basic.py	1503	non-Basic iterable. Don't forget to unpack	CODE
LOW	sympy/solvers/tests/test_inequalities.py	472	# make sure to include conditions under which solution is valid	COMMENT
MEDIUM	sympy/integrals/integrals.py	1236	For demonstration purposes, this interval will only be split into 2	CODE
LOW	sympy/interactive/printing.py	140	# If you're adding another type, make sure you add it to printable_types	COMMENT
LOW	sympy/categories/diagram_drawing.py	697	# Don't forget to assure the proper ordering of the vertices	STRING

Structural Annotation Overuse14 hits · 10 pts

Severity	File	Line	Snippet	Context
LOW	sympy/core/basic.py	2169	# WARNING: This API is experimental.	COMMENT
LOW	sympy/polys/densetools.py	1545	# Step 0: h = x / f mod x**(n-1)	STRING
LOW	sympy/ntheory/primetest.py	739	# Step 2: deterministic Miller-Rabin testing for numbers < 2^64. See:	STRING
LOW	sympy/ntheory/primetest.py	796	# Step 3: BPSW.	STRING
LOW⚡	sympy/solvers/ode/riccati.py	802	# Step 1 : Convert to Normal Form	STRING
LOW⚡	sympy/solvers/ode/riccati.py	812	# Step 3 : a(x) is 0	STRING
LOW⚡	sympy/solvers/ode/riccati.py	816	# Step 4 : a(x) is a non-zero constant	STRING
LOW⚡	sympy/solvers/ode/riccati.py	820	# Step 5 : Find poles and valuation at infinity	STRING
LOW⚡	sympy/solvers/ode/riccati.py	856	# Step 10 : Check if a valid solution exists. If yes, also check	STRING
LOW⚡	sympy/solvers/ode/riccati.py	860	# Step 11 : Find polynomial solutions of degree m for the auxiliary equation	STRING
LOW⚡	sympy/solvers/ode/riccati.py	863	# Step 12 : If valid polynomial solution exists, append solution.	STRING
LOW	sympy/solvers/ode/riccati.py	837	# Step 7 : Iterate over all possible combinations and return solutions	STRING
LOW	sympy/solvers/ode/riccati.py	885	# Step 15 : Inverse transform the solutions of the equation in normal form	STRING
LOW	sympy/interactive/tests/test_ipython.py	22	# WARNING: These tests will modify the existing IPython environment. IPython	COMMENT

Verbosity Indicators15 hits · 10 pts

Severity	File	Line	Snippet	Context
LOW	sympy/polys/densetools.py	1545	# Step 0: h = x / f mod x**(n-1)	STRING
LOW	sympy/ntheory/primetest.py	739	# Step 2: deterministic Miller-Rabin testing for numbers < 2^64. See:	STRING
LOW	sympy/ntheory/primetest.py	796	# Step 3: BPSW.	STRING
LOW	sympy/solvers/ode/systems.py	1338	To check if the equations are constant coefficient, we need to check if all the terms in	CODE
LOW	sympy/solvers/ode/systems.py	1341	To check if the equations are homogeneous or not, we need to check if b is a zero matrix	CODE
LOW⚡	sympy/solvers/ode/riccati.py	802	# Step 1 : Convert to Normal Form	STRING
LOW⚡	sympy/solvers/ode/riccati.py	812	# Step 3 : a(x) is 0	STRING
LOW⚡	sympy/solvers/ode/riccati.py	816	# Step 4 : a(x) is a non-zero constant	STRING
LOW⚡	sympy/solvers/ode/riccati.py	820	# Step 5 : Find poles and valuation at infinity	STRING
LOW⚡	sympy/solvers/ode/riccati.py	856	# Step 10 : Check if a valid solution exists. If yes, also check	STRING
LOW⚡	sympy/solvers/ode/riccati.py	860	# Step 11 : Find polynomial solutions of degree m for the auxiliary equation	STRING
LOW⚡	sympy/solvers/ode/riccati.py	863	# Step 12 : If valid polynomial solution exists, append solution.	STRING
LOW	sympy/solvers/ode/riccati.py	837	# Step 7 : Iterate over all possible combinations and return solutions	STRING
LOW	sympy/solvers/ode/riccati.py	885	# Step 15 : Inverse transform the solutions of the equation in normal form	STRING
LOW	sympy/simplify/hyperexpand.py	965	self._poly variable. This variable stores a polynomial. By convention	STRING

Synthetic Comment Markers1 hit · 5 pts

Severity	File	Line	Snippet	Context
HIGH	.github/PULL_REQUEST_TEMPLATE.md	41	like it was generated by AI then the PR will be closed. -->	CODE

Fake / Example Data13 hits · 4 pts

Severity	File	Line	Snippet	Context
LOW⚡	sympy/tensor/tensor.py	3541	dummy_data.sort(key=lambda x: x[3])	STRING
LOW⚡	sympy/tensor/tensor.py	3542	return indices, free, free_names, dummy_data	STRING
LOW⚡	sympy/tensor/tensor.py	3545	def _dummy_data_to_dum(dummy_data):	STRING
LOW⚡	sympy/tensor/tensor.py	3546	return [(p2a, p2b) for (i, p1a, p1b, p2a, p2b) in dummy_data]	STRING
LOW⚡	sympy/tensor/tensor.py	3555	indices, free, free_names, dummy_data = TensMul._indices_to_free_dum(args_indices)	STRING
LOW⚡	sympy/tensor/tensor.py	3565	for old_index, pos1cov, pos1contra, pos2cov, pos2contra in dummy_data:	STRING
LOW⚡	sympy/tensor/tensor.py	3585	indices, free, free_names, dummy_data = TensMul._indices_to_free_dum(args_indices)	STRING
LOW⚡	sympy/tensor/tensor.py	3587	dum = TensMul._dummy_data_to_dum(dummy_data)	STRING
LOW	sympy/tensor/tensor.py	3501	dummy_data = []	STRING
LOW	sympy/tensor/tensor.py	3526	dummy_data.append((index, pos1, other_pos1, pos2, other_pos2))	STRING
LOW	sympy/tensor/tensor.py	3528	dummy_data.append((-index, other_pos1, pos1, other_pos2, pos2))	STRING
LOW	sympy/tensor/tensor.py	4197	indices, free, free_names, dummy_data = TensMul._indices_to_free_dum(args_indices)	STRING
LOW	sympy/tensor/tensor.py	4198	dum = TensMul._dummy_data_to_dum(dummy_data)	STRING

Modern AI Meta-Vocabulary1 hit · 3 pts

Severity	File	Line	Snippet	Context
MEDIUM	sympy/utilities/tests/test_enumerative.py	12	# first some functions only useful as test scaffolding - these provide	COMMENT

Overly Generic Function Names3 hits · 2 pts

Severity	File	Line	Snippet	Context
LOW	sympy/core/tests/test_eval.py	92	def test_function():	CODE
LOW	sympy/parsing/tests/test_c_parser.py	940	def test_function():	CODE
LOW	sympy/parsing/tests/test_fortran_parser.py	279	def test_function():	STRING

Analysis Overview

What These Metrics Mean

Score History

Severity Breakdown

Directory Score Breakdown

Pattern Findings