AbstractTimeIntegrationMethod (#61)

* AbstractTimeIntegrationMethod

* set version to v2.8.1

Author: ranocha

Project.toml

@@ -1,7 +1,7 @@
 name = "RootedTrees"
 uuid = "47965b36-3f3e-11e9-0dcf-4570dfd42a8c"
 authors = ["Hendrik Ranocha <mail@ranocha.de> and contributors"]
-version = "2.8.0"
+version = "2.8.1"
 
 [deps]
 Latexify = "23fbe1c1-3f47-55db-b15f-69d7ec21a316"

src/time_integration_methods.jl

@@ -1,12 +1,15 @@
 
+abstract type AbstractTimeIntegrationMethod end
+
+
 """
     RungeKuttaMethod(A, b, c=vec(sum(A, dims=2)))
 
 Represent a Runge-Kutta method with Butcher coefficients `A`, `b`, and `c`.
 If `c` is not provided, the usual "row sum" requirement of consistency with
 autonomous problems is applied.
 """
-struct RungeKuttaMethod{T, MatT<:AbstractMatrix{T}, VecT<:AbstractVector{T}}
+struct RungeKuttaMethod{T, MatT<:AbstractMatrix{T}, VecT<:AbstractVector{T}} <: AbstractTimeIntegrationMethod
   A::MatT
   b::VecT
   c::VecT
@@ -160,7 +163,7 @@ methods, which are applied to partitioned problems of the form
   SIAM Journal on Numerical Analysis 34.5 (1997): 1926-1947.
   [DOI: 10.1137/S0036142995292128](https://doi.org/10.1137/S0036142995292128)
 """
-struct AdditiveRungeKuttaMethod{T, RKs<:AbstractVector{<:RungeKuttaMethod{T}}}
+struct AdditiveRungeKuttaMethod{T, RKs<:AbstractVector{<:RungeKuttaMethod{T}}} <: AbstractTimeIntegrationMethod
   rks::RKs
 end