vec_dp_append Subroutine

private pure subroutine vec_dp_append(self, values, err)

Append many elements, growing once rather than once per element.

Type Bound

vector_dp_t

Arguments

Type IntentOptional Attributes Name
class(vector_dp_t), intent(inout) :: self
real(kind=dp), intent(in) :: values(:)
type(error_t), intent(inout), optional :: err

Calls

proc~~vec_dp_append~~CallsGraph proc~vec_dp_append vector_dp_t%vec_dp_append proc~error_raise error_raise proc~vec_dp_append->proc~error_raise proc~vec_dp_capacity vector_dp_t%vec_dp_capacity proc~vec_dp_append->proc~vec_dp_capacity proc~vec_dp_grow vec_dp_grow proc~vec_dp_append->proc~vec_dp_grow proc~error_set error_t%error_set proc~error_raise->proc~error_set proc~vec_dp_grow->proc~error_raise proc~vec_dp_grow->proc~vec_dp_capacity

Variables

Type Visibility Attributes Name Initial
integer(kind=default_int), private :: n_new

Source Code

   pure subroutine vec_dp_append(self, values, err)
      !! Append many elements, growing once rather than once per element.
      class(vector_dp_t), intent(inout) :: self
      real(dp), intent(in) :: values(:)
      type(error_t), intent(inout), optional :: err

      integer(default_int) :: n_new

      n_new = size(values, kind=default_int)
      if (n_new == 0) return

      ! Rearranged from `n_items + n_new > MAX` so that the sum is never
      ! formed; the subtraction cannot overflow because `n_items` is
      ! non-negative and PIC_VECTOR_MAX_CAPACITY is `huge`.
      if (n_new > PIC_VECTOR_MAX_CAPACITY - self%n_items) then
         call error_raise(err, ERROR_ALLOC, &
                          "vector_dp_t: append would exceed PIC_VECTOR_MAX_CAPACITY.")
         return
      end if

      call vec_dp_grow(self, self%n_items + n_new, err)
      if (self%n_items + n_new > vec_dp_capacity(self)) return

      self%items(self%n_items + 1:self%n_items + n_new) = values
      self%n_items = self%n_items + n_new
   end subroutine vec_dp_append