Mercurial > repos > public > sbplib_julia
diff SbpOperators/src/SbpOperators.jl @ 249:7cb4492ccd60 boundary_conditions
Refactor package SbpOperators
author | Vidar Stiernström <vidar.stiernstrom@it.uu.se> |
---|---|
date | Thu, 27 Jun 2019 14:18:48 +0200 |
parents | d9e262cb2e8d |
children | d1004b881da1 |
line wrap: on
line diff
--- a/SbpOperators/src/SbpOperators.jl Thu Jun 27 13:36:04 2019 +0200 +++ b/SbpOperators/src/SbpOperators.jl Thu Jun 27 14:18:48 2019 +0200 @@ -3,205 +3,8 @@ using RegionIndices include("stencil.jl") - -export D2, closureSize, apply, readOperator, apply_e, apply_d, apply_e_T, apply_d_T - -abstract type ConstantStencilOperator end - -# Apply for different regions Lower/Interior/Upper or Unknown region -@inline function apply(op::ConstantStencilOperator, h::Real, v::AbstractVector, i::Index{Lower}) - return @inbounds h*h*apply(op.closureStencils[Int(i)], v, Int(i)) -end - -@inline function apply(op::ConstantStencilOperator, h::Real, v::AbstractVector, i::Index{Interior}) - return @inbounds h*h*apply(op.innerStencil, v, Int(i)) -end - -@inline function apply(op::ConstantStencilOperator, h::Real, v::AbstractVector, i::Index{Upper}) - N = length(v) - return @inbounds h*h*Int(op.parity)*apply_backwards(op.closureStencils[N-Int(i)+1], v, Int(i)) -end - -@inline function apply(op::ConstantStencilOperator, h::Real, v::AbstractVector, index::Index{Unknown}) - cSize = closureSize(op) - N = length(v) - - i = Int(index) - - if 0 < i <= cSize - return apply(op, h, v, Index{Lower}(i)) - elseif cSize < i <= N-cSize - return apply(op, h, v, Index{Interior}(i)) - elseif N-cSize < i <= N - return apply(op, h, v, Index{Upper}(i)) - else - error("Bounds error") # TODO: Make this more standard - end -end - - -# Wrapper functions for using regular indecies without specifying regions -@inline function apply(op::ConstantStencilOperator, h::Real, v::AbstractVector, i::Int) - return apply(op, h, v, Index{Unknown}(i)) -end - -@enum Parity begin - odd = -1 - even = 1 -end - -struct D2{T,N,M,K} <: ConstantStencilOperator - quadratureClosure::NTuple{M,T} - innerStencil::Stencil{T,N} - closureStencils::NTuple{M,Stencil{T,K}} - eClosure::Stencil{T,M} - dClosure::Stencil{T,M} - parity::Parity -end - -function closureSize(D::D2)::Int - return length(D.quadratureClosure) -end - -function readOperator(D2fn, Hfn) - d = readSectionedFile(D2fn) - h = readSectionedFile(Hfn) - - # Create inner stencil - innerStencilWeights = stringToTuple(Float64, d["inner_stencil"][1]) - width = length(innerStencilWeights) - r = (-div(width,2), div(width,2)) - - innerStencil = Stencil(r, innerStencilWeights) - - # Create boundary stencils - boundarySize = length(d["boundary_stencils"]) - closureStencils = Vector{typeof(innerStencil)}() # TBD: is the the right way to get the correct type? - - for i ∈ 1:boundarySize - stencilWeights = stringToTuple(Float64, d["boundary_stencils"][i]) - width = length(stencilWeights) - r = (1-i,width-i) - closureStencils = (closureStencils..., Stencil(r, stencilWeights)) - end - - quadratureClosure = pad_tuple(stringToTuple(Float64, h["closure"][1]), boundarySize) - eClosure = Stencil((0,boundarySize-1), pad_tuple(stringToTuple(Float64, d["e"][1]), boundarySize)) - dClosure = Stencil((0,boundarySize-1), pad_tuple(stringToTuple(Float64, d["d1"][1]), boundarySize)) - - d2 = D2( - quadratureClosure, - innerStencil, - closureStencils, - eClosure, - dClosure, - even - ) - - return d2 -end - - -function apply_e_T(op::D2, v::AbstractVector, ::Type{Lower}) - @boundscheck if length(v) < closureSize(op) - throw(BoundsError()) - end - apply(op.eClosure,v,1) -end - -function apply_e_T(op::D2, v::AbstractVector, ::Type{Upper}) - @boundscheck if length(v) < closureSize(op) - throw(BoundsError()) - end - apply(flip(op.eClosure),v,length(v)) -end - - -function apply_e(op::D2, v::Number, N::Integer, i::Integer, ::Type{Lower}) - @boundscheck if !(0<length(i) <= N) - throw(BoundsError()) - end - op.eClosure[i-1]*v -end - -function apply_e(op::D2, v::Number, N::Integer, i::Integer, ::Type{Upper}) - @boundscheck if !(0<length(i) <= N) - throw(BoundsError()) - end - op.eClosure[N-i]*v -end - -function apply_d_T(op::D2, h_inv::Real, v::AbstractVector, ::Type{Lower}) - @boundscheck if length(v) < closureSize(op) - throw(BoundsError()) - end - h_inv*apply(op.dClosure,v,1) -end - -function apply_d_T(op::D2, h_inv::Real, v::AbstractVector, ::Type{Upper}) - @boundscheck if length(v) < closureSize(op) - throw(BoundsError()) - end - -h_inv*apply(flip(op.dClosure),v,length(v)) -end - -function apply_d(op::D2, h_inv::Real, v::Number, N::Integer, i::Integer, ::Type{Lower}) - @boundscheck if !(0<length(i) <= N) - throw(BoundsError()) - end - h_inv*op.dClosure[i-1]*v -end - -function apply_d(op::D2, h_inv::Real, v::Number, N::Integer, i::Integer, ::Type{Upper}) - @boundscheck if !(0<length(i) <= N) - throw(BoundsError()) - end - -h_inv*op.dClosure[N-i]*v -end - - -function readSectionedFile(filename)::Dict{String, Vector{String}} - f = open(filename) - sections = Dict{String, Vector{String}}() - currentKey = "" - - for ln ∈ eachline(f) - if ln == "" || ln[1] == '#' # Skip comments and empty lines - continue - end - - if isletter(ln[1]) # Found start of new section - if ~haskey(sections, ln) - sections[ln] = Vector{String}() - end - currentKey = ln - continue - end - - push!(sections[currentKey], ln) - end - - return sections -end - -function stringToTuple(T::DataType, s::String) - return Tuple(stringToVector(T,s)) -end - -function stringToVector(T::DataType, s::String) - return T.(eval.(Meta.parse.(split(s)))) -end - - -function pad_tuple(t::NTuple{N, T}, n::Integer) where {N,T} - if N >= n - return t - else - return pad_tuple((t..., zero(T)), n) - end -end - -sbp_operators_path() = (@__DIR__) * "/../operators/" -export sbp_operators_path +include("constantstenciloperator.jl") +include("d2.jl") +include("readoperator.jl") end # module