Clean up

JuliaGameTheoreticPlanning · Apr 16, 2024 · d3c2e97 · d3c2e97
1 parent 3138603
commit d3c2e97
Show file tree

Hide file tree

Showing 2 changed files with 0 additions and 10 deletions.
diff --git a/src/Internals.jl b/src/Internals.jl
@@ -2,14 +2,6 @@ module Internals
 
 using FastDifferentiation: FastDifferentiation as FD
 
-function parameterize(f::Vector, θ)
-    f
-end
-
-function parameterize(f, θ)
-    f(θ)
-end
-
 function infer_problem_size(lower_bounds, upper_bounds)
     if lower_bounds isa AbstractVector
         length(lower_bounds)

diff --git a/src/parametric_problem.jl b/src/parametric_problem.jl
@@ -93,7 +93,6 @@ function ParametricMCP(
         _jacobian_z! =
             SymbolicUtils.build_function(jacobian_z, [z_symbolic; θ_symbolic]; in_place = true)
         rows, cols, _ = SparseArrays.findnz(jacobian_z)
-        # TODO: constant entry detection
         constant_entries = get_constant_entries(jacobian_z, z_symbolic)
         SparseFunction(rows, cols, size(jacobian_z), constant_entries) do result, z, θ
             _jacobian_z!(result, [z; θ])
@@ -109,7 +108,6 @@ function ParametricMCP(
                 in_place = true,
             )
             rows, cols, _ = SparseArrays.findnz(jacobian_θ)
-            # TODO: constant entry detection
             constant_entries = get_constant_entries(jacobian_θ, θ_symbolic)
             SparseFunction(rows, cols, size(jacobian_θ), constant_entries) do result, z, θ
                 _jacobian_θ!(result, [z; θ])