timearrayseriesmodule Module Reference

Data Types
type	timearrayseriestype

Functions/Subroutines
subroutine, public	constructtimearrayseries (newTas, filename)
	Allocate a new TimeArraySeriesType object. More...
subroutine	tas_init (this, fname, modelname, iout, tasname, autoDeallocate)
	Initialize the time array series. More...
subroutine	getaveragevalues (this, nvals, values, time0, time1)
	Populate an array time-weighted average value for a specified time span. More...
integer(i4b) function	getinunit (this)
	Return unit number. More...
subroutine	get_surrounding_records (this, time, taEarlier, taLater)
	Get surrounding records. More...
logical function	read_next_array (this)
	Read next time array from input file and append to list. More...
subroutine	get_values_at_time (this, nvals, values, time)
	Return an array of values for a specified time, same units as time-series values. More...
subroutine	get_integrated_values (this, nvals, values, time0, time1)
	Populates an array with integrated values for a specified time span. More...
subroutine	deallocatebackward (this, fromNode)
	Deallocate fromNode and all previous nodes in list; reassign firstNode. More...
subroutine	get_latest_preceding_node (this, time, tslNode)
	Return pointer to ListNodeType object for the node representing the latest preceding time in the time series. More...
subroutine	tas_da (this)
	Deallocate memory. More...
type(timearrayseriestype) function, pointer, public	castastimearrayseriestype (obj)
	Cast an unlimited polymorphic object as class(TimeArraySeriesType) More...
type(timearrayseriestype) function, pointer, public	gettimearrayseriesfromlist (list, indx)
	Get time array from list. More...

Function/Subroutine Documentation

castastimearrayseriestype()

type(timearrayseriestype) function, pointer, public timearrayseriesmodule::castastimearrayseriestype

(

class(*), intent(inout), pointer

obj

)

Definition at line 787 of file TimeArraySeries.f90.

    ! -- dummy
    class(*), pointer, intent(inout) :: obj
    ! -- return
    type(TimeArraySeriesType), pointer :: res
    !
    res => null()
    if (.not. associated(obj)) return
    !
    select type (obj)
    type is (timearrayseriestype)
      res => obj
    end select
    !
    ! -- Return
    return

Here is the caller graph for this function:

constructtimearrayseries()

subroutine, public timearrayseriesmodule::constructtimearrayseries	(	type(timearrayseriestype), intent(out), pointer	newTas,
		character(len=*), intent(in)	filename
	)

Definition at line 59 of file TimeArraySeries.f90.

    ! -- dummy
    type(TimeArraySeriesType), pointer, intent(out) :: newTas
    character(len=*), intent(in) :: filename
    ! -- local
    logical :: lex
    ! -- formats
10  format('Error: Time-array-series file "', a, '" does not exist.')
    !
    ! -- Allocate a new object of type TimeArraySeriesType
    allocate (newtas)
    allocate (newtas%list)
    !
    ! -- Ensure that input file exists
    inquire (file=filename, exist=lex)
    if (.not. lex) then
      write (errmsg, 10) trim(filename)
      call store_error(errmsg, terminate=.true.)
    end if
    newtas%datafile = filename
    !
    ! -- Return
    return

Here is the call graph for this function:

deallocatebackward()

subroutine timearrayseriesmodule::deallocatebackward ( class(timearrayseriestype), intent(inout)  this, type(listnodetype), intent(inout), pointer  fromNode  )

private

Definition at line 650 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    type(ListNodeType), pointer, intent(inout) :: fromNode
    !
    ! -- local
    type(ListNodeType), pointer :: current => null()
    type(ListNodeType), pointer :: prev => null()
    type(TimeArrayType), pointer :: ta => null()
    class(*), pointer :: obj => null()
    !
    if (associated(fromnode)) then
      ! -- reassign firstNode
      if (associated(fromnode%nextNode)) then
        this%list%firstNode => fromnode%nextNode
      else
        this%list%firstNode => null()
      end if
      ! -- deallocate fromNode and all previous nodes
      current => fromnode
      do while (associated(current))
        prev => current%prevNode
        obj => current%GetItem()
        ta => castastimearraytype(obj)
        ! -- Deallocate the contents of this time array,
        !    then remove it from the list
        call ta%da()
        call this%list%RemoveNode(current, .true.)
        current => prev
      end do
      fromnode => null()
    end if
    !
    ! -- Return
    return

Here is the call graph for this function:

get_integrated_values()

subroutine timearrayseriesmodule::get_integrated_values ( class(timearrayseriestype), intent(inout)  this, integer(i4b), intent(in)  nvals, real(dp), dimension(nvals), intent(inout)  values, real(dp), intent(in)  time0, real(dp), intent(in)  time1  )

private

Units: (ts-value-unit)*time

Definition at line 518 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    integer(I4B), intent(in) :: nvals
    real(DP), dimension(nvals), intent(inout) :: values
    real(DP), intent(in) :: time0
    real(DP), intent(in) :: time1
    ! -- local
    integer(I4B) :: i
    real(DP) :: area, currTime, nextTime, ratio0, ratio1, t0, &
                t01, t1, timediff, value, value0, value1, valuediff
    logical :: ldone
    type(ListNodeType), pointer :: precNode => null()
    type(ListNodeType), pointer :: currNode => null(), nextnode => null()
    type(TimeArrayType), pointer :: currRecord => null(), nextrecord => null()
    class(*), pointer :: currObj => null(), nextobj => null()
    ! -- formats
10  format('Error encountered while performing integration', &
           ' for time-array series "', a, '" for time interval: ', &
           g12.5, ' to ', g12.5)
    !
    values = dzero
    value = dzero
    ldone = .false.
    t1 = -done
    call this%get_latest_preceding_node(time0, precnode)
    if (associated(precnode)) then
      currnode => precnode
      do while (.not. ldone)
        currobj => currnode%GetItem()
        currrecord => castastimearraytype(currobj)
        currtime = currrecord%taTime
        if (currtime < time1) then
          if (.not. associated(currnode%nextNode)) then
            ! -- try to read the next array
            if (.not. this%read_next_array()) then
              write (errmsg, 10) trim(this%Name), time0, time1
              call store_error(errmsg)
              call store_error_unit(this%inunit)
            end if
          end if
          if (associated(currnode%nextNode)) then
            nextnode => currnode%nextNode
            nextobj => nextnode%GetItem()
            nextrecord => castastimearraytype(nextobj)
            nexttime = nextrecord%taTime
            ! -- determine lower and upper limits of time span of interest
            !    within current interval
            if (currtime >= time0) then
              t0 = currtime
            else
              t0 = time0
            end if
            if (nexttime <= time1) then
              t1 = nexttime
            else
              t1 = time1
            end if
            ! -- For each element, find area of rectangle
            !    or trapezoid delimited by t0 and t1.
            t01 = t1 - t0
            select case (this%iMethod)
            case (stepwise)
              do i = 1, nvals
                ! -- compute area of a rectangle
                value0 = currrecord%taArray(i)
                area = value0 * t01
                ! -- add area to integrated value
                values(i) = values(i) + area
              end do
            case (linear)
              do i = 1, nvals
                ! -- compute area of a trapezoid
                timediff = nexttime - currtime
                ratio0 = (t0 - currtime) / timediff
                ratio1 = (t1 - currtime) / timediff
                valuediff = nextrecord%taArray(i) - currrecord%taArray(i)
                value0 = currrecord%taArray(i) + ratio0 * valuediff
                value1 = currrecord%taArray(i) + ratio1 * valuediff
                area = 0.5d0 * t01 * (value0 + value1)
                ! -- add area to integrated value
                values(i) = values(i) + area
              end do
            end select
          else
            write (errmsg, 10) trim(this%Name), time0, time1
            call store_error(errmsg)
            call store_error('(Probable programming error)', terminate=.true.)
          end if
        else
          ! Current node time = time1 so should be done
          ldone = .true.
        end if
        !
        ! -- Are we done yet?
        if (t1 >= time1) then
          ldone = .true.
        else
          if (.not. associated(currnode%nextNode)) then
            ! -- try to read the next array
            if (.not. this%read_next_array()) then
              write (errmsg, 10) trim(this%Name), time0, time1
              call store_error(errmsg)
              call this%parser%StoreErrorUnit()
            end if
          end if
          if (associated(currnode%nextNode)) then
            currnode => currnode%nextNode
          else
            write (errmsg, 10) trim(this%Name), time0, time1
            call store_error(errmsg)
            call store_error('(Probable programming error)', terminate=.true.)
          end if
        end if
      end do
    end if
    !
    if (this%autoDeallocate) then
      if (associated(precnode)) then
        if (associated(precnode%prevNode)) then
          call this%DeallocateBackward(precnode%prevNode)
        end if
      end if
    end if
    !
    ! -- Return
    return

Here is the call graph for this function:

get_latest_preceding_node()

subroutine timearrayseriesmodule::get_latest_preceding_node ( class(timearrayseriestype), intent(inout)  this, real(dp), intent(in)  time, type(listnodetype), intent(inout), pointer  tslNode  )

private

Definition at line 690 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    real(DP), intent(in) :: time
    type(ListNodeType), pointer, intent(inout) :: tslNode
    ! -- local
    real(DP) :: time0
    type(ListNodeType), pointer :: currNode => null()
    type(ListNodeType), pointer :: node0 => null()
    type(TimeArrayType), pointer :: ta => null()
    type(TimeArrayType), pointer :: ta0 => null()
    class(*), pointer :: obj => null()
    !
    tslnode => null()
    if (associated(this%list%firstNode)) then
      currnode => this%list%firstNode
    else
      call store_error('probable programming error in &
                       &get_latest_preceding_node', &
                       terminate=.true.)
    end if
    !
    continue
    ! -- If the next node is earlier than time of interest, advance along
    !    linked list until the next node is later than time of interest.
    do
      if (associated(currnode)) then
        if (associated(currnode%nextNode)) then
          obj => currnode%nextNode%GetItem()
          ta => castastimearraytype(obj)
          if (ta%taTime < time .or. is_close(ta%taTime, time)) then
            currnode => currnode%nextNode
          else
            exit
          end if
        else
          ! -- read another record
          if (.not. this%read_next_array()) exit
        end if
      else
        exit
      end if
    end do
    !
    if (associated(currnode)) then
      !
      ! -- find earlier record
      node0 => currnode
      obj => node0%GetItem()
      ta0 => castastimearraytype(obj)
      time0 = ta0%taTime
      do while (time0 > time)
        if (associated(node0%prevNode)) then
          node0 => node0%prevNode
          obj => node0%GetItem()
          ta0 => castastimearraytype(obj)
          time0 = ta0%taTime
        else
          exit
        end if
      end do
    end if
    !
    if (time0 <= time) tslnode => node0
    !
    ! -- Return
    return

Here is the call graph for this function:

get_surrounding_records()

subroutine timearrayseriesmodule::get_surrounding_records ( class(timearrayseriestype), intent(inout)  this, real(dp), intent(in)  time, type(timearraytype), intent(inout), pointer  taEarlier, type(timearraytype), intent(inout), pointer  taLater  )

private

Definition at line 259 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    real(DP), intent(in) :: time
    type(TimeArrayType), pointer, intent(inout) :: taEarlier
    type(TimeArrayType), pointer, intent(inout) :: taLater
    ! -- local
    real(DP) :: time0, time1
    type(ListNodeType), pointer :: currNode => null()
    type(ListNodeType), pointer :: node0 => null()
    type(ListNodeType), pointer :: node1 => null()
    type(TimeArrayType), pointer :: ta => null(), ta0 => null(), ta1 => null()
    class(*), pointer :: obj
    !
    taearlier => null()
    talater => null()
    !
    if (associated(this%list%firstNode)) then
      currnode => this%list%firstNode
    end if
    !
    ! -- If the next node is earlier than time of interest, advance along
    !    linked list until the next node is later than time of interest.
    do
      if (associated(currnode)) then
        if (associated(currnode%nextNode)) then
          obj => currnode%nextNode%GetItem()
          ta => castastimearraytype(obj)
          if (ta%taTime <= time) then
            currnode => currnode%nextNode
          else
            exit
          end if
        else
          ! -- read another array
          if (.not. this%read_next_array()) exit
        end if
      else
        exit
      end if
    end do
    !
    if (associated(currnode)) then
      !
      ! -- find earlier record
      node0 => currnode
      obj => node0%GetItem()
      ta0 => castastimearraytype(obj)
      time0 = ta0%taTime
      do while (time0 > time)
        if (associated(node0%prevNode)) then
          node0 => node0%prevNode
          obj => node0%GetItem()
          ta0 => castastimearraytype(obj)
          time0 = ta0%taTime
        else
          exit
        end if
      end do
      !
      ! -- find later record
      node1 => currnode
      obj => node1%GetItem()
      ta1 => castastimearraytype(obj)
      time1 = ta1%taTime
      do while (time1 < time)
        if (associated(node1%nextNode)) then
          node1 => node1%nextNode
          obj => node1%GetItem()
          ta1 => castastimearraytype(obj)
          time1 = ta1%taTime
        else
          ! -- get next array
          if (.not. this%read_next_array()) then
            ! -- end of file reached, so exit loop
            exit
          end if
        end if
      end do
      !
    end if
    !
    if (time0 <= time) taearlier => ta0
    if (time1 >= time) talater => ta1
    !
    ! -- Return
    return

Here is the call graph for this function:

get_values_at_time()

subroutine timearrayseriesmodule::get_values_at_time	(	class(timearrayseriestype), intent(inout)	this,
		integer(i4b), intent(in)	nvals,
		real(dp), dimension(nvals), intent(inout)	values,
		real(dp), intent(in)	time
	)

Definition at line 430 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    integer(I4B), intent(in) :: nvals
    real(DP), dimension(nvals), intent(inout) :: values
    real(DP), intent(in) :: time ! time of interest
    ! -- local
    integer(I4B) :: i, ierr
    real(DP) :: ratio, time0, time1, timediff, timediffi, val0, val1, &
                valdiff
    type(TimeArrayType), pointer :: taEarlier => null()
    type(TimeArrayType), pointer :: taLater => null()
    ! -- formats
10  format('Error getting array at time ', g10.3, &
           ' for time-array series "', a, '"')
    !
    ierr = 0
    call this%get_surrounding_records(time, taearlier, talater)
    if (associated(taearlier)) then
      if (associated(talater)) then
        ! -- values are available for both earlier and later times
        if (this%iMethod == stepwise) then
          ! -- Just populate values from elements of earlier time array
          values = taearlier%taArray
        elseif (this%iMethod == linear) then
          ! -- perform linear interpolation
          time0 = taearlier%taTime
          time1 = talater%tatime
          timediff = time1 - time0
          timediffi = time - time0
          if (timediff > 0) then
            ratio = timediffi / timediff
          else
            ! -- should not happen if TS does not contain duplicate times
            ratio = 0.5d0
          end if
          ! -- Iterate through all elements and perform interpolation.
          do i = 1, nvals
            val0 = taearlier%taArray(i)
            val1 = talater%taArray(i)
            valdiff = val1 - val0
            values(i) = val0 + (ratio * valdiff)
          end do
        else
          ierr = 1
        end if
      else
        if (is_close(taearlier%taTime, time)) then
          values = taearlier%taArray
        else
          ! -- Only earlier time is available, and it is not time of interest;
          !    however, if method is STEPWISE, use value for earlier time.
          if (this%iMethod == stepwise) then
            values = taearlier%taArray
          else
            ierr = 1
          end if
        end if
      end if
    else
      if (associated(talater)) then
        if (is_close(talater%taTime, time)) then
          values = talater%taArray
        else
          ! -- only later time is available, and it is not time of interest
          ierr = 1
        end if
      else
        ! -- Neither earlier nor later time is available.
        !    This should never happen!
        ierr = 1
      end if
    end if
    !
    if (ierr > 0) then
      write (errmsg, 10) time, trim(this%Name)
      call store_error(errmsg)
      call store_error_unit(this%inunit)
    end if
    !
    ! -- Return
    return

Here is the call graph for this function:

getaveragevalues()

subroutine timearrayseriesmodule::getaveragevalues ( class(timearrayseriestype), intent(inout)  this, integer(i4b), intent(in)  nvals, real(dp), dimension(nvals), intent(inout)  values, real(dp), intent(in)  time0, real(dp), intent(in)  time1  )

private

Definition at line 215 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    integer(I4B), intent(in) :: nvals
    real(DP), dimension(nvals), intent(inout) :: values
    real(DP), intent(in) :: time0
    real(DP), intent(in) :: time1
    ! -- local
    integer(I4B) :: i
    real(DP) :: timediff
    !
    timediff = time1 - time0
    if (timediff > 0) then
      call this%get_integrated_values(nvals, values, time0, time1)
      do i = 1, nvals
        values(i) = values(i) / timediff
      end do
    else
      ! -- time0 and time1 are the same, so skip the integration step.
      call this%get_values_at_time(nvals, values, time0)
    end if
    !
    ! -- Return
    return

getinunit()

integer(i4b) function timearrayseriesmodule::getinunit ( class(timearrayseriestype)  this )

private

Definition at line 243 of file TimeArraySeries.f90.

    ! -- return
    integer(I4B) :: GetInunit
    ! -- dummy
    class(TimeArraySeriesType) :: this
    !
    getinunit = this%inunit
    !
    ! -- Return
    return

gettimearrayseriesfromlist()

type(timearrayseriestype) function, pointer, public timearrayseriesmodule::gettimearrayseriesfromlist	(	type(listtype), intent(inout)	list,
		integer, intent(in)	indx
	)

Definition at line 807 of file TimeArraySeries.f90.

    ! -- dummy
    type(ListType), intent(inout) :: list
    integer, intent(in) :: indx
    ! -- return
    type(TimeArraySeriesType), pointer :: res
    ! -- local
    class(*), pointer :: obj
    !
    obj => list%GetItem(indx)
    res => castastimearrayseriestype(obj)
    !
    ! -- Return
    return

Here is the call graph for this function:

read_next_array()

logical function timearrayseriesmodule::read_next_array ( class(timearrayseriestype), intent(inout)  this )

private

Definition at line 350 of file TimeArraySeries.f90.

    ! -- modules
    use constantsmodule, only: lenmempath
    use memorymanagermodule, only: mem_setptr
    use memoryhelpermodule, only: create_mem_path
    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    ! -- local
    integer(I4B) :: i, ierr, istart, istat, istop, lloc, nrow, ncol, &
                    nodesperlayer
    logical :: lopen, isFound
    type(TimeArrayType), pointer :: ta => null()
    character(len=LENMEMPATH) :: mempath
    integer(I4B), dimension(:), contiguous, pointer :: mshape
    !
    ! -- initialize
    istart = 1
    istat = 0
    istop = 1
    lloc = 1
    nullify (mshape)
    !
    ! -- create mempath
    mempath = create_mem_path(component=this%modelname, subcomponent='DIS')
    !
    ! -- set mshape pointer
    call mem_setptr(mshape, 'MSHAPE', mempath)
    !
    ! Get dimensions for supported discretization type
    if (size(mshape) == 2) then
      nodesperlayer = mshape(2)
      nrow = 1
      ncol = mshape(2)
    else if (size(mshape) == 3) then
      nodesperlayer = mshape(2) * mshape(3)
      nrow = mshape(2)
      ncol = mshape(3)
    else
      errmsg = 'Time array series is not supported for selected &
               &discretization type.'
      call store_error(errmsg)
      call this%parser%StoreErrorUnit()
    end if
    !
    read_next_array = .false.
    inquire (unit=this%inunit, opened=lopen)
    if (lopen) then
      call constructtimearray(ta, this%modelname)
      ! -- read a time and an array from the input file
      ! -- Get a TIME block and read the time
      call this%parser%GetBlock('TIME', isfound, ierr, &
                                supportopenclose=.false.)
      if (isfound) then
        ta%taTime = this%parser%GetDouble()
        ! -- Read the array
        call readarray(this%parser%iuactive, ta%taArray, this%Name, &
                       size(mshape), ncol, nrow, 1, nodesperlayer, &
                       this%iout, 0, 0)
        !
        ! -- multiply values by sfac
        do i = 1, nodesperlayer
          ta%taArray(i) = ta%taArray(i) * this%sfac
        end do
        !
        ! -- append the new time array to the list
        call addtimearraytolist(this%list, ta)
        read_next_array = .true.
        !
        ! -- make sure block is closed
        call this%parser%terminateblock()
      end if
    end if
    !
    ! -- Return
    return

Here is the call graph for this function:

tas_da()

subroutine timearrayseriesmodule::tas_da ( class(timearrayseriestype), intent(inout)  this )

private

Definition at line 761 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    ! -- local
    integer :: i, n
    type(TimeArrayType), pointer :: ta => null()
    !
    ! -- Deallocate contents of each time array in list
    n = this%list%Count()
    do i = 1, n
      ta => gettimearrayfromlist(this%list, i)
      call ta%da()
    end do
    !
    ! -- Deallocate the list of time arrays
    call this%list%Clear(.true.)
    deallocate (this%list)
    !
    ! -- Return
    return

Here is the call graph for this function:

tas_init()

subroutine timearrayseriesmodule::tas_init ( class(timearrayseriestype), intent(inout)  this, character(len=*), intent(in)  fname, character(len=*), intent(in)  modelname, integer(i4b), intent(in)  iout, character(len=*), intent(inout)  tasname, logical, intent(in), optional  autoDeallocate  )

private

Definition at line 88 of file TimeArraySeries.f90.

    ! -- dummy
    class(TimeArraySeriesType), intent(inout) :: this
    character(len=*), intent(in) :: fname
    character(len=*), intent(in) :: modelname
    integer(I4B), intent(in) :: iout
    character(len=*), intent(inout) :: tasname
    logical, optional, intent(in) :: autoDeallocate
    ! -- local
    integer(I4B) :: istatus
    integer(I4B) :: ierr
    integer(I4B) :: inunit
    character(len=40) :: keyword, keyvalue
    logical :: found, continueread, endOfBlock
    !
    ! -- initialize some variables
    if (present(autodeallocate)) this%autoDeallocate = autodeallocate
    this%dataFile = fname
    allocate (this%list)
    !
    ! -- assign members
    this%modelname = modelname
    this%iout = iout
    !
    ! -- open time-array series input file
    inunit = getunit()
    this%inunit = inunit
    call openfile(inunit, 0, fname, 'TAS6')
    !
    ! -- initialize block parser
    call this%parser%Initialize(this%inunit, this%iout)
    !
    ! -- read ATTRIBUTES block
    continueread = .false.
    ierr = 0
    !
    ! -- get BEGIN line of ATTRIBUTES block
    call this%parser%GetBlock('ATTRIBUTES', found, ierr, &
                              supportopenclose=.true.)
    if (.not. found) then
      errmsg = 'Error: Attributes block not found in file: '// &
               trim(fname)
      call store_error(errmsg)
      call this%parser%StoreErrorUnit()
    end if
    !
    ! -- parse ATTRIBUTES entries
    do
      ! -- read line from input
      call this%parser%GetNextLine(endofblock)
      if (endofblock) exit
      !
      ! -- get the keyword
      call this%parser%GetStringCaps(keyword)
      !
      ! -- get the word following the keyword (the key value)
      call this%parser%GetStringCaps(keyvalue)
      select case (keyword)
      case ('NAME')
        this%Name = keyvalue
        tasname = keyvalue
      case ('METHOD')
        select case (keyvalue)
        case ('STEPWISE')
          this%iMethod = stepwise
        case ('LINEAR')
          this%iMethod = linear
        case default
          errmsg = 'Unknown interpolation method: "'//trim(keyvalue)//'"'
          call store_error(errmsg)
          call this%parser%StoreErrorUnit()
        end select
      case ('AUTODEALLOCATE')
        this%autoDeallocate = (keyvalue == 'TRUE')
      case ('SFAC')
        read (keyvalue, *, iostat=istatus) this%sfac
        if (istatus /= 0) then
          errmsg = 'Error reading numeric SFAC value from "'//trim(keyvalue) &
                   //'"'
          call store_error(errmsg)
          call this%parser%StoreErrorUnit()
        end if
      case default
        errmsg = 'Unknown option found in ATTRIBUTES block: "'// &
                 trim(keyword)//'"'
        call store_error(errmsg)
        call this%parser%StoreErrorUnit()
      end select
    end do
    !
    ! -- ensure that NAME and METHOD have been specified
    if (this%Name == '') then
      errmsg = 'Name not specified for time array series in file: '// &
               trim(this%dataFile)
      call store_error(errmsg)
      call this%parser%StoreErrorUnit()
    end if
    if (this%iMethod == undefined) then
      errmsg = 'Interpolation method not specified for time'// &
               ' array series in file: '//trim(this%dataFile)
      call store_error(errmsg)
      call this%parser%StoreErrorUnit()
    end if
    !
    ! -- handle any errors encountered so far
    if (count_errors() > 0) then
      errmsg = 'Error(s) encountered initializing time array series from file: ' &
               //trim(this%dataFile)
      call store_error(errmsg)
      call this%parser%StoreErrorUnit()
    end if
    !
    ! -- try to read first time array into linked list
    if (.not. this%read_next_array()) then
      errmsg = 'Error encountered reading time-array data from file: '// &
               trim(this%dataFile)
      call store_error(errmsg)
      call this%parser%StoreErrorUnit()
    end if
    !
    ! -- Return
    return

Here is the call graph for this function: