more cleanup

Author: vyudu

docs/src/systems/DiscreteSystem.md

@@ -634,8 +634,6 @@ function reorder_vars!(state::TearingState, var_eq_matching, eq_ordering, var_or
     end
     new_fullvars = state.fullvars[var_ordering]
 
-    @show new_graph
-    @show new_var_to_diff
     # Update system structure 
     @set! state.structure.graph = complete(new_graph)
     @set! state.structure.var_to_diff = new_var_to_diff
@@ -650,8 +648,6 @@ Set the system equations, unknowns, observables post-tearing.
 function update_simplified_system!(state::TearingState, neweqs, solved_eqs, dummy_sub, var_eq_matching, extra_unknowns; 
         cse_hack = true, array_hack = true)
     @unpack solvable_graph, var_to_diff, eq_to_diff, graph = state.structure
-    @show graph
-    @show var_to_diff
     diff_to_var = invview(var_to_diff)
 
     ispresent = let var_to_diff = var_to_diff, graph = graph
@@ -671,12 +667,7 @@ function update_simplified_system!(state::TearingState, neweqs, solved_eqs, dumm
     unknowns = Any[v
                    for (i, v) in enumerate(state.fullvars)
                    if diff_to_var[i] === nothing && ispresent(i)]
-    @show unknowns
-    @show state.fullvars
-    @show 𝑑neighbors(graph, 5)
-    @show neweqs
     unknowns = [unknowns; extra_unknowns]
-    @show unknowns
     @set! sys.unknowns = unknowns
 
     obs, subeqs, deps = cse_and_array_hacks(

src/structural_transformation/symbolics_tearing.jl

@@ -140,14 +140,14 @@ get_fullvars(ts::TransformationState) = ts.fullvars
 has_equations(::TransformationState) = true
 
 Base.@kwdef mutable struct SystemStructure
-    """Maps the (index of) a variable to the (index of) the variable describing its derivative."""
+    """Maps the index of variable x to the index of variable D(x)."""
     var_to_diff::DiffGraph
-    """Maps the (index of) an equation."""
+    """Maps the index of an equation."""
     eq_to_diff::DiffGraph
     # Can be access as
     # `graph` to automatically look at the bipartite graph
     # or as `torn` to assert that tearing has run.
-    """Graph that maps equations to variables that appear in them."""
+    """Graph that connects equations to variables that appear in them."""
     graph::BipartiteGraph{Int, Nothing}
     """Graph that connects equations to the variable they will be solved for during simplification."""
     solvable_graph::Union{BipartiteGraph{Int, Nothing}, Nothing}
@@ -464,15 +464,10 @@ function lower_order_var(dervar, t)
     diffvar
 end
 
-"""
-    Shift variable x by the largest shift s such that x(k-s) appears in the system of equations.
-    The lowest-shift term will have.
-"""
 function shift_discrete_system(ts::TearingState)
     @unpack fullvars, sys = ts
     discvars = OrderedSet()
     eqs = equations(sys)
-
     for eq in eqs
         vars!(discvars, eq; op = Union{Sample, Hold})
     end