algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 14:04:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add automatic linter (#4214)

Browse Source
This commit is contained in:
acbin
2023-06-09 20:05:14 +08:00
committed by GitHub
parent 00282efd8b
commit 415a04ea7f
188 changed files with 661 additions and 1133 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/com/thealgorithms/maths/EulerMethod.java
View File

@ -53,8 +53,7 @@ public class EulerMethod {
* @param differentialEquation The differential equation to be solved.
* @return The next y-value.
*/
public static double eulerStep(double xCurrent, double stepSize, double yCurrent,
BiFunction<Double, Double, Double> differentialEquation) {
public static double eulerStep(double xCurrent, double stepSize, double yCurrent, BiFunction<Double, Double, Double> differentialEquation) {
if (stepSize <= 0) {
throw new IllegalArgumentException("stepSize should be greater than zero");
}
@ -73,8 +72,7 @@ public class EulerMethod {
* @return The points constituting the solution of the differential
* equation.
*/
public static ArrayList<double[]> eulerFull(double xStart, double xEnd, double stepSize,
double yStart, BiFunction<Double, Double, Double> differentialEquation) {
public static ArrayList<double[]> eulerFull(double xStart, double xEnd, double stepSize, double yStart, BiFunction<Double, Double, Double> differentialEquation) {
if (xStart >= xEnd) {
throw new IllegalArgumentException("xEnd should be greater than xStart");
}