Apache Commons Numbers Root Finder ™
Last Published: 31 October 2022
|
Version: 1.1
ApacheCon
Apache
Commons
Numbers Root Finder
Overview
Latest API docs (development)
Javadoc (1.1 release)
Javadoc (1.0 release)
Javadoc (1.0-beta1 release)
Project Documentation
Project Information
Project Reports
JIRA Report
Javadoc
Source Xref
Test Source Xref
Surefire Report
Rat Report
JaCoCo
japicmp
Checkstyle
SpotBugs
PMD
CPD
Commons
Home
License
Components
Sandbox
Dormant
General Information
Security
Volunteering
Contributing Patches
Building Components
Commons Parent Pom
Commons Build Plugin
Releasing Components
Wiki
ASF
How the ASF works
Get Involved
Developer Resources
Code of Conduct
Sponsorship
Thanks
PMD Results
The following document contains the results of
PMD
6.49.0.
Violations By Priority
Priority 3
org/apache/commons/numbers/rootfinder/BrentSolver.java
Rule
Violation
Line
CognitiveComplexity
The method 'brent(DoubleUnaryOperator, double, double, double, double)' has a cognitive complexity of 31, current threshold is 15
158
–
249
NPathComplexity
The method 'brent(DoubleUnaryOperator, double, double, double, double)' has an NPath complexity of 1261, current threshold is 200
158
–
249
Files
org/apache/commons/numbers/rootfinder/BrentSolver.java
Rule
Violation
Priority
Line
CognitiveComplexity
The method 'brent(DoubleUnaryOperator, double, double, double, double)' has a cognitive complexity of 31, current threshold is 15
3
158
–
249
NPathComplexity
The method 'brent(DoubleUnaryOperator, double, double, double, double)' has an NPath complexity of 1261, current threshold is 200
3
158
–
249