Fix unbound type issues

Author: MilesCranmer

src/AsArray.jl

@@ -3,8 +3,12 @@ module AsArrayModule
 using ..EquationModule: AbstractExpressionNode, tree_mapreduce, count_nodes
 
 function as_array(
-    ::Type{I}, trees::Vararg{N,M}; buffer::Union{AbstractArray,Nothing}=nothing
+    ::Type{I},
+    tree::N,
+    additional_trees::Vararg{N,M};
+    buffer::Union{AbstractArray,Nothing}=nothing,
 ) where {T,N<:AbstractExpressionNode{T},I,M}
+    trees = (tree, additional_trees...)
     each_num_nodes = (t -> count_nodes(t; break_sharing=Val(true))).(trees)
     num_nodes = sum(each_num_nodes)
 

src/EvaluateEquation.jl

@@ -98,10 +98,10 @@ function eval_tree_array(
     return eval_tree_array(tree, cX, operators; turbo, bumper)
 end
 function eval_tree_array(
-    trees::NTuple{M,N}, cX::AbstractMatrix{T}, operators::OperatorEnum; kws...
+    trees::Tuple{N,Vararg{N,M}}, cX::AbstractMatrix{T}, operators::OperatorEnum; kws...
 ) where {T<:Number,N<:AbstractExpressionNode{T},M}
-    outs = ntuple(i -> eval_tree_array(trees[i], cX, operators; kws...)[1], Val(M))
-    return ntuple(i -> first(outs[i]), Val(M)), ntuple(i -> last(outs[i]), Val(M))
+    outs = ntuple(i -> eval_tree_array(trees[i], cX, operators; kws...)[1], Val(M + 1))
+    return ntuple(i -> first(outs[i]), Val(M + 1)), ntuple(i -> last(outs[i]), Val(M + 1))
 end
 
 get_nuna(::Type{<:OperatorEnum{B,U}}) where {B,U} = counttuple(U)