Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
class(tem_varSys_op_type), | intent(in) | :: | fun |
Description of the method to obtain the variables, here some preset values might be stored, like the space time function to use or the required variables. |
||
type(tem_varSys_type), | intent(in) | :: | varSys |
The variable system to obtain the variable from. |
||
type(tem_time_type), | intent(in) | :: | time |
Point in time at which to evaluate the variable. |
||
integer, | intent(in) | :: | iLevel |
Level on which values are requested |
||
integer, | intent(in) | :: | idx(:) |
Index of points in the growing array and variable val array to return. Size: most times nVals, if contiguous arrays are used it depends on the number of first indices |
||
integer, | intent(in), | optional | :: | idxLen(:) |
With idx as start index in contiguous memory, idxLength defines length of each contiguous memory Size: dependes on number of first index for contiguous array, but the sum of all idxLen is equal to nVals |
|
integer, | intent(in) | :: | nVals |
Number of values to obtain for this variable (vectorized access). |
||
real(kind=rk), | intent(out) | :: | res(:) |
Resulting values for the requested variable. Dimension: n requested entries x nComponents of this variable Access: (iElem-1)*fun%nComponents + iComp |
subroutine tem_varSys_getValOfIndex_dummy(fun, varSys, time, iLevel, &
& idx, idxLen, nVals, res)
!> Description of the method to obtain the variables, here some preset
!! values might be stored, like the space time function to use or the
!! required variables.
class(tem_varSys_op_type), intent(in) :: fun
!> The variable system to obtain the variable from.
type(tem_varSys_type), intent(in) :: varSys
!> Point in time at which to evaluate the variable.
type(tem_time_type), intent(in) :: time
!> Level on which values are requested
integer, intent(in) :: iLevel
!> Index of points in the growing array and variable val array to
!! return.
!! Size: most times nVals, if contiguous arrays are used it depends
!! on the number of first indices
integer, intent(in) :: idx(:)
!> With idx as start index in contiguous memory,
!! idxLength defines length of each contiguous memory
!! Size: dependes on number of first index for contiguous array,
!! but the sum of all idxLen is equal to nVals
integer, optional, intent(in) :: idxLen(:)
!> Number of values to obtain for this variable (vectorized access).
integer, intent(in) :: nVals
!> Resulting values for the requested variable.
!!
!! Dimension: n requested entries x nComponents of this variable
!! Access: (iElem-1)*fun%nComponents + iComp
real(kind=rk), intent(out) :: res(:)
write(*,*) 'time%sim:', time%sim
write(*,*) 'iLevel:', iLevel
write(*,*) 'idx(1):', idx(1)
if (present(idxLen)) write(*,*) 'offset_bit(1):', idxLen(1)
write(*,*) 'nVals:', nVals
res = 0.0_rk
call tem_abort('Not implemented for '//trim(varSys%varName%val(fun%myPos)) &
& //':is dummy getValOfIndex')
end subroutine tem_varSys_getValOfIndex_dummy