btree_add_i8_cp2d Subroutine

private subroutine btree_add_i8_cp2d(tree, key, value, exists, existing_value, replace)

Arguments

Type IntentOptional Attributes Name
type(btree_i8_cp2d), intent(inout) :: tree
integer(kind=keyt), intent(in) :: key
type(btree_data_cp2d), intent(in) :: value
logical, intent(out), optional :: exists
type(btree_data_cp2d), intent(out), optional :: existing_value
logical, intent(in), optional :: replace

Source Code

      SUBROUTINE btree_add_i8_cp2d (tree, key, value, exists, existing_value, replace)
         TYPE(btree_i8_cp2d), INTENT(INOUT) :: tree
         INTEGER(KIND=keyt), INTENT(IN) :: key
         TYPE(btree_data_cp2d), INTENT(IN) :: value
         LOGICAL, INTENT(OUT), OPTIONAL :: exists
         TYPE(btree_data_cp2d), INTENT(OUT), OPTIONAL :: existing_value
         LOGICAL, INTENT(IN), OPTIONAL :: replace
         !
         TYPE(btree_node_i8_cp2d), POINTER :: node
         INTEGER :: ge_pos, position
         !
         IF (PRESENT(exists)) THEN
            CALL btree_find_full_i8_cp2d (tree, key, node, position, ge_pos, short=.TRUE.)
            IF (position .GT. 0) THEN
               exists = .TRUE.
               existing_value = node%values(position)
               IF (PRESENT(replace)) THEN
                  IF (replace) THEN
                     node%values(position) = value
                  END IF
               END IF
               RETURN
            ELSE
               exists = .FALSE.
            END IF
         ELSE
            CALL btree_find_leaf_i8_cp2d (tree, key, node, ge_pos)
         END IF
         CALL btree_add_into_i8_cp2d (tree, node, key, value, before=ge_pos)
         IF (PRESENT(exists)) existing_value = value
         tree%b%n = tree%b%n + 1
      END SUBROUTINE btree_add_i8_cp2d