Mercurial > repos > public > sbplib_julia
view src/Grids/EquidistantGrid.jl @ 381:dacbcba33d7d
Refactor EquidistantGrid to not store spacing or inverse spacing
author | Jonatan Werpers <jonatan@werpers.com> |
---|---|
date | Wed, 30 Sep 2020 21:49:48 +0200 |
parents | 64ad8ec0eae0 |
children | 16dc5b19843d |
line wrap: on
line source
# EquidistantGrid is a grid with equidistant grid spacing per coordinat # direction. The domain is defined through the two points P1 = x̄₁, P2 = x̄₂ # by the exterior product of the vectors obtained by projecting (x̄₂-x̄₁) onto # the coordinate directions. E.g for a 2D grid with x̄₁=(-1,0) and x̄₂=(1,2) # the domain is defined as (-1,1)x(0,2). export EquidistantGrid struct EquidistantGrid{Dim,T<:Real} <: AbstractGrid size::NTuple{Dim, Int} limit_lower::NTuple{Dim, T} limit_upper::NTuple{Dim, T} # General constructor function EquidistantGrid(size::NTuple{Dim, Int}, limit_lower::NTuple{Dim, T}, limit_upper::NTuple{Dim, T}) where Dim where T @assert all(size.>0) @assert all(limit_upper.-limit_lower .!= 0) return new{Dim,T}(size, limit_lower, limit_upper) end end function EquidistantGrid(size::Int, limit_lower::T, limit_upper::T) where T return EquidistantGrid((size,),(limit_lower,),(limit_upper,)) end function Base.eachindex(grid::EquidistantGrid) CartesianIndices(grid.size) end Base.size(g::EquidistantGrid) = g.size # Returns the number of dimensions of an EquidistantGrid. # # @Input: grid - an EquidistantGrid # @Return: dimension - The dimension of the grid function dimension(grid::EquidistantGrid) return length(grid.size) end """ spacing(grid::EquidistantGrid) The spacing between the grid points of the grid. """ spacing(grid::EquidistantGrid) = abs.(grid.limit_upper.-grid.limit_lower)./(grid.size.-1) # TODO: Evaluate if divisions affect performance export spacing """ spacing(grid::EquidistantGrid) The reciprocal of the spacing between the grid points of the grid. """ inverse_spacing(grid::EquidistantGrid) = 1 ./ spacing(grid) export inverse_spacing # Computes the points of an EquidistantGrid as an array of tuples with # the same dimension as the grid. # # @Input: grid - an EquidistantGrid # @Return: points - the points of the grid. function points(grid::EquidistantGrid) # TODO: Make this return an abstract array? indices = Tuple.(CartesianIndices(grid.size)) h = spacing(grid) return broadcast(I -> grid.limit_lower .+ (I.-1).*h, indices) end """ restrict(::EquidistantGrid, dim) Pick out given dimensions from the grid and return a grid for them """ function restrict(grid::EquidistantGrid, dim) size = grid.size[dim] limit_lower = grid.limit_lower[dim] limit_upper = grid.limit_upper[dim] return EquidistantGrid(size, limit_lower, limit_upper) end export restrict