ptrhashtableiteratormodule Module Reference

Data Types
interface	ptrhashtableiteratortype
	An iterator used to iterate through a PtrHashTable. More...

Functions/Subroutines
type(ptrhashtableiteratortype) function	constructor (buckets)
	Constructor to create a PtrHashTableIterator. More...
type(logical) function	has_next (this)
	Indicates if there is a next node in the iteration chain. More...
subroutine	next (this)
	Increment the iterator to the next node. More...
class(*) function, pointer	value (this)
	Get the value the iterator is pointing to. More...

Function/Subroutine Documentation

constructor()

type(ptrhashtableiteratortype) function ptrhashtableiteratormodule::constructor ( type(keyvaluelisttype), dimension(:), intent(in), target  buckets )

private

Definition at line 32 of file PtrHashTableIterator.f90.

    type(KeyValueListType), target, dimension(:), intent(in) :: buckets
    type(PtrHashTableIteratorType) :: iterator
    ! -- local
    type(KeyValueListType), pointer :: first_bucket
 
    iterator%buckets => buckets
 
    first_bucket => iterator%buckets(1)
    allocate (iterator%current_bucket_iterator, source=first_bucket%iterator())
 

Here is the caller graph for this function:

has_next()

type(logical) function ptrhashtableiteratormodule::has_next ( class(ptrhashtableiteratortype)  this )

private

Definition at line 48 of file PtrHashTableIterator.f90.

    class(PtrHashTableIteratorType) :: this
    type(logical) :: res
    ! -- local
    type(KeyValueListType), pointer :: bucket
    integer(I4B) :: bucket_index
 
    !
    ! -- check if there are more values in the current bucket
    if (this%current_bucket_iterator%has_next()) then
      res = .true.
      return
    end if
 
    !
    ! -- check if there is a next bucket which has values.
    ! -- if so then there is more to iterate through.
    do bucket_index = this%curent_bucket_index + 1, size(this%buckets)
      bucket => this%buckets(bucket_index)
      if (bucket%count() > 0) then
        res = .true.
        return
      end if
    end do
 
    res = .false.
 

next()

subroutine ptrhashtableiteratormodule::next ( class(ptrhashtableiteratortype)  this )

private

Definition at line 80 of file PtrHashTableIterator.f90.

    class(PtrHashTableIteratorType) :: this
    ! -- local
    type(KeyValueListType), pointer :: bucket !< a bucket
    integer(I4B) :: bucket_index
 
    !
    ! -- If the current bucket doesn't have anymore values continue to the next
    if (.not. this%current_bucket_iterator%has_next()) then
      do bucket_index = this%curent_bucket_index + 1, size(this%buckets)
        bucket => this%buckets(bucket_index)
        if (bucket%count() > 0) then
          deallocate (this%current_bucket_iterator)
          allocate (this%current_bucket_iterator, source=bucket%iterator())
          this%curent_bucket_index = bucket_index
          exit
        end if
      end do
    end if
 
    call this%current_bucket_iterator%next()
 

value()

class(*) function, pointer ptrhashtableiteratormodule::value ( class(ptrhashtableiteratortype)  this )

private

Definition at line 107 of file PtrHashTableIterator.f90.

    class(PtrHashTableIteratorType) :: this
    class(*), pointer :: res
 
    res => this%current_bucket_iterator%value()