d_bpack_linkedlist Module Reference

Data Types

interface  append
 
interface  assignment(=)
 
interface  d_list
 
interface  d_nod
 **** declarations for d_list type with unlimited polymorphism More...
 
interface  d_nod_score
 
interface  get_nod
 

Functions/Subroutines

subroutine d_list_append_item (this, item)
 
subroutine d_list_remove_headitem (this)
 
type(d_list) function d_list_constructor ()
 
subroutine d_list_finalizer (this)
 
subroutine d_list_get_nod (this, inod, nVal, stat, errmsg)
 
subroutine d_list_print_scores (this, FuncScore)
 
integer function d_list_length (self)
 
subroutine d_nod_assign_nod_to_nod (LHS, RHS)
 
type(d_nod) function d_nod_constructor (item)
 
subroutine d_nod_finalizer (this)
 
real(kind=8) function d_nod_score_integer (this)
 
real(kind=8) function d_nod_score_dble (this)
 
recursive subroutine d_mergesort (headRef, FuncScore)
 
recursive subroutine d_sortedmerge (a, b, result, FuncScore)
 
subroutine d_frontbacksplit (source, frontRef, backRef)
 
subroutine d_mergesortunique (this, FuncScore)
 

Function/Subroutine Documentation

◆ d_frontbacksplit()

subroutine d_bpack_linkedlist::d_frontbacksplit ( type(d_nod), pointer  source,
type(d_nod), pointer  frontRef,
type(d_nod), pointer  backRef 
)

◆ d_list_append_item()

subroutine d_bpack_linkedlist::d_list_append_item ( type(d_list), intent(inout)  this,
class(*), intent(in)  item 
)

◆ d_list_constructor()

type(d_list) function d_bpack_linkedlist::d_list_constructor ( )

◆ d_list_finalizer()

subroutine d_bpack_linkedlist::d_list_finalizer ( type(d_list), intent(inout)  this)
Here is the call graph for this function:

◆ d_list_get_nod()

subroutine d_bpack_linkedlist::d_list_get_nod ( type(d_list), intent(in)  this,
integer, intent(in)  inod,
type(d_nod), intent(out)  nVal,
integer, intent(out), optional  stat,
character(*), intent(out), optional  errmsg 
)

◆ d_list_length()

integer function d_bpack_linkedlist::d_list_length ( class(d_list), intent(in)  self)

◆ d_list_print_scores()

subroutine d_bpack_linkedlist::d_list_print_scores ( type(d_list), intent(in)  this,
procedure(d_nod_score FuncScore 
)

◆ d_list_remove_headitem()

subroutine d_bpack_linkedlist::d_list_remove_headitem ( type(d_list), intent(inout)  this)
Here is the call graph for this function:

◆ d_mergesort()

recursive subroutine d_bpack_linkedlist::d_mergesort ( type(d_nod), pointer  headRef,
procedure(d_nod_score FuncScore 
)
Here is the call graph for this function:

◆ d_mergesortunique()

subroutine d_bpack_linkedlist::d_mergesortunique ( type(d_list this,
procedure(d_nod_score FuncScore 
)
Here is the call graph for this function:

◆ d_nod_assign_nod_to_nod()

subroutine d_bpack_linkedlist::d_nod_assign_nod_to_nod ( type(d_nod), intent(inout), target  LHS,
type(d_nod), intent(in), target  RHS 
)
Here is the call graph for this function:

◆ d_nod_constructor()

type(d_nod) function d_bpack_linkedlist::d_nod_constructor ( class(*), intent(in), optional  item)
Here is the call graph for this function:

◆ d_nod_finalizer()

subroutine d_bpack_linkedlist::d_nod_finalizer ( type(d_nod), intent(inout)  this)
Here is the call graph for this function:

◆ d_nod_score_dble()

real(kind=8) function d_bpack_linkedlist::d_nod_score_dble ( type(d_nod this)

◆ d_nod_score_integer()

real(kind=8) function d_bpack_linkedlist::d_nod_score_integer ( type(d_nod this)

◆ d_sortedmerge()

recursive subroutine d_bpack_linkedlist::d_sortedmerge ( type(d_nod), pointer  a,
type(d_nod), pointer  b,
type(d_nod), pointer  result,
procedure(d_nod_score FuncScore 
)