s_bpack_linkedlist Module Reference

Data Types

interface  append
 
interface  assignment(=)
 
interface  get_nod
 
interface  s_list
 
interface  s_nod
 **** declarations for s_list type with unlimited polymorphism More...
 
interface  s_nod_score
 

Functions/Subroutines

subroutine s_list_append_item (this, item)
 
subroutine s_list_remove_headitem (this)
 
type(s_list) function s_list_constructor ()
 
subroutine s_list_finalizer (this)
 
subroutine s_list_get_nod (this, inod, nVal, stat, errmsg)
 
subroutine s_list_print_scores (this, FuncScore)
 
integer function s_list_length (self)
 
subroutine s_nod_assign_nod_to_nod (LHS, RHS)
 
type(s_nod) function s_nod_constructor (item)
 
subroutine s_nod_finalizer (this)
 
real(kind=8) function s_nod_score_integer (this)
 
real(kind=8) function s_nod_score_dble (this)
 
recursive subroutine s_mergesort (headRef, FuncScore)
 
recursive subroutine s_sortedmerge (a, b, result, FuncScore)
 
subroutine s_frontbacksplit (source, frontRef, backRef)
 
subroutine s_mergesortunique (this, FuncScore)
 

Function/Subroutine Documentation

◆ s_frontbacksplit()

subroutine s_bpack_linkedlist::s_frontbacksplit ( type(s_nod), pointer  source,
type(s_nod), pointer  frontRef,
type(s_nod), pointer  backRef 
)

◆ s_list_append_item()

subroutine s_bpack_linkedlist::s_list_append_item ( type(s_list), intent(inout)  this,
class(*), intent(in)  item 
)

◆ s_list_constructor()

type(s_list) function s_bpack_linkedlist::s_list_constructor ( )

◆ s_list_finalizer()

subroutine s_bpack_linkedlist::s_list_finalizer ( type(s_list), intent(inout)  this)
Here is the call graph for this function:

◆ s_list_get_nod()

subroutine s_bpack_linkedlist::s_list_get_nod ( type(s_list), intent(in)  this,
integer, intent(in)  inod,
type(s_nod), intent(out)  nVal,
integer, intent(out), optional  stat,
character(*), intent(out), optional  errmsg 
)

◆ s_list_length()

integer function s_bpack_linkedlist::s_list_length ( class(s_list), intent(in)  self)

◆ s_list_print_scores()

subroutine s_bpack_linkedlist::s_list_print_scores ( type(s_list), intent(in)  this,
procedure(s_nod_score FuncScore 
)

◆ s_list_remove_headitem()

subroutine s_bpack_linkedlist::s_list_remove_headitem ( type(s_list), intent(inout)  this)
Here is the call graph for this function:

◆ s_mergesort()

recursive subroutine s_bpack_linkedlist::s_mergesort ( type(s_nod), pointer  headRef,
procedure(s_nod_score FuncScore 
)
Here is the call graph for this function:

◆ s_mergesortunique()

subroutine s_bpack_linkedlist::s_mergesortunique ( type(s_list this,
procedure(s_nod_score FuncScore 
)
Here is the call graph for this function:

◆ s_nod_assign_nod_to_nod()

subroutine s_bpack_linkedlist::s_nod_assign_nod_to_nod ( type(s_nod), intent(inout), target  LHS,
type(s_nod), intent(in), target  RHS 
)
Here is the call graph for this function:

◆ s_nod_constructor()

type(s_nod) function s_bpack_linkedlist::s_nod_constructor ( class(*), intent(in), optional  item)
Here is the call graph for this function:

◆ s_nod_finalizer()

subroutine s_bpack_linkedlist::s_nod_finalizer ( type(s_nod), intent(inout)  this)
Here is the call graph for this function:

◆ s_nod_score_dble()

real(kind=8) function s_bpack_linkedlist::s_nod_score_dble ( type(s_nod this)

◆ s_nod_score_integer()

real(kind=8) function s_bpack_linkedlist::s_nod_score_integer ( type(s_nod this)

◆ s_sortedmerge()

recursive subroutine s_bpack_linkedlist::s_sortedmerge ( type(s_nod), pointer  a,
type(s_nod), pointer  b,
type(s_nod), pointer  result,
procedure(s_nod_score FuncScore 
)