tem_appendLongListUnique Subroutine

private subroutine tem_appendLongListUnique(firstEntry, entryPos, nItems, added)

append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list


type(tem_longList), pointer:: firstEntry

linked list of resulting elements building the neighbor

integer(kind=long_k), intent(in) :: entryPos

Add that element

integer, intent(inout) :: nItems

how many items are in list

logical, intent(out), optional :: added

has the current item been added?

Called by

proc~~tem_appendlonglistunique~~CalledByGraph proc~tem_appendlonglistunique tem_appendLongListUnique interface~appendunique appendUnique interface~appendunique->proc~tem_appendlonglistunique



type(tem_longList), private, pointer:: currPos
logical, private :: found