|
|
|
|
@ -185,11 +185,12 @@ module psb_const_mod
|
|
|
|
|
! The up/down constant are defined in pairs having
|
|
|
|
|
! opposite values. We make use of this fact in the heapsort routine.
|
|
|
|
|
!
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_sort_up_ = 1, psb_sort_down_ = -1
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_lsort_up_ = 2, psb_lsort_down_ = -2
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_asort_up_ = 3, psb_asort_down_ = -3
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_alsort_up_ = 4, psb_alsort_down_ = -4
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_sort_ovw_idx_ = 0, psb_sort_keep_idx_ = 1
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_sort_up_ = 1, psb_sort_down_ = -1
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_lsort_up_ = 2, psb_lsort_down_ = -2
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_asort_up_ = 3, psb_asort_down_ = -3
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_alsort_up_ = 4, psb_alsort_down_ = -4
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_sort_ovw_idx_ = 0, psb_sort_keep_idx_ = 1
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_sort_reord_x_ = 0, psb_sort_noreord_x_ = 1
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_heap_resize = 200
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_find_any_ = 0
|
|
|
|
|
integer(psb_ipk_), parameter :: psb_find_first_ge_ = 1
|
|
|
|
|
@ -282,7 +283,7 @@ module psb_const_mod
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_parm_differs_among_procs_=550
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_entry_out_of_bounds_=551
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_inconsistent_index_lists_=552
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_partfunc_toomuchprocs_=570
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_partfunc_toomanyprocs_=570
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_partfunc_toofewprocs_=575
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_partfunc_wrong_pid_=580
|
|
|
|
|
integer(psb_ipk_), parameter, public :: psb_err_no_optional_arg_=581
|
|
|
|
|
|