format

SciML · Feb 11, 2025 · 31b052d · 31b052d
1 parent f01244c
commit 31b052d
Show file tree

Hide file tree

Showing 4 changed files with 17 additions and 16 deletions.
diff --git a/ext/IntegralsFastGaussQuadratureExt.jl b/ext/IntegralsFastGaussQuadratureExt.jl
@@ -27,7 +27,7 @@ end
 function composite_gauss_legendre(f::F, p, lb, ub, nodes, weights, subintervals) where {F}
     h = (ub - lb) / subintervals
     I = gauss_legendre(f, p, lb, lb + h, nodes, weights)
-    for i in 1:subintervals-1
+    for i in 1:(subintervals - 1)
         _lb = lb + i * h
         _ub = _lb + h
         I += gauss_legendre(f, p, _lb, _ub, nodes, weights)

diff --git a/src/algorithms_sampled.jl b/src/algorithms_sampled.jl
@@ -10,7 +10,7 @@ Example with sampled data:
 ```julia
 using Integrals
 f = x -> x^2
-x = range(0, 1, length=20)
+x = range(0, 1, length = 20)
 y = f.(x)
 problem = SampledIntegralProblem(y, x)
 method = TrapezoidalRule()
@@ -31,7 +31,7 @@ Example with equidistant data:
 ```julia
 using Integrals
 f = x -> x^2
-x = range(0, 1, length=20)
+x = range(0, 1, length = 20)
 y = f.(x)
 problem = SampledIntegralProblem(y, x)
 method = SimpsonsRule()

diff --git a/test/derivative_tests.jl b/test/derivative_tests.jl
@@ -15,7 +15,8 @@ alg_req = Dict(
         allows_iip = false),
     GaussLegendre(n = 50) => (nout = Inf, min_dim = 1, max_dim = 1, allows_batch = false,
         allows_iip = false),
-    GaussLegendre(n = 50, subintervals=3) => (nout = Inf, min_dim = 1, max_dim = 1, allows_batch = false,
+    GaussLegendre(n = 50, subintervals = 3) => (
+        nout = Inf, min_dim = 1, max_dim = 1, allows_batch = false,
         allows_iip = false),
     QuadGKJL() => (nout = Inf, allows_batch = true, min_dim = 1, max_dim = 1,
         allows_iip = true),

diff --git a/test/gaussian_quadrature_tests.jl b/test/gaussian_quadrature_tests.jl
@@ -99,19 +99,19 @@ sol = solve(prob, alg)
 @test sol.u ≈ -240.25235266303063249920743158729
 
 # Gauss-Legendre with array-valued integrands
-prob = IntegralProblem((x,p)->[1,2], (-1,1))
-sol = solve(prob, GaussLegendre(;n=5))
-@test sol.u ≈ 2*[1,2]
+prob = IntegralProblem((x, p) -> [1, 2], (-1, 1))
+sol = solve(prob, GaussLegendre(; n = 5))
+@test sol.u ≈ 2 * [1, 2]
 
-prob = IntegralProblem((x,p)->[1 2; 3 4], (-1,1))
-sol = solve(prob, GaussLegendre(;n=5))
-@test sol.u ≈ 2*[1 2; 3 4]
+prob = IntegralProblem((x, p) -> [1 2; 3 4], (-1, 1))
+sol = solve(prob, GaussLegendre(; n = 5))
+@test sol.u ≈ 2 * [1 2; 3 4]
 
 # Composite Gauss-Legendre with array-valued integrands
-prob = IntegralProblem((x,p)->[1,2], (-1,1))
-sol = solve(prob, GaussLegendre(;n=5, subintervals=5))
-@test sol.u ≈ 2*[1,2]
+prob = IntegralProblem((x, p) -> [1, 2], (-1, 1))
+sol = solve(prob, GaussLegendre(; n = 5, subintervals = 5))
+@test sol.u ≈ 2 * [1, 2]
 
-prob = IntegralProblem((x,p)->[1 2; 3 4], (-1,1))
-sol = solve(prob, GaussLegendre(;n=5, subintervals=5))
-@test sol.u ≈ 2*[1 2; 3 4]
+prob = IntegralProblem((x, p) -> [1 2; 3 4], (-1, 1))
+sol = solve(prob, GaussLegendre(; n = 5, subintervals = 5))
+@test sol.u ≈ 2 * [1 2; 3 4]