Complexes implemented as a list, fast insertion and deletion
To define a list, we use type NodeComplexe which contains one object
Can extend the description here.
More...
Public Attributes | |
type(nodecomplexe), pointer | p_first |
pointer on first and last node, last necessary for reaching the end | |
type(nodecomplexe), pointer | p_last |
type(nodecomplexe), pointer | p_current |
only pointer, associated to current node, never allocated | |
real(kind=8) | max_energy |
real(kind=8) | rmsd_min |
integer | nb_complexe |
actual number of complexes, maximum nb of complexes in record | |
logical | one_run |
option for rmsd_min | |
logical | one_conf |
Complexes implemented as a list, fast insertion and deletion
To define a list, we use type NodeComplexe which contains one object
Can extend the description here.
integer mod_record::listcomplexe::nb_complexe |
actual number of complexes, maximum nb of complexes in record
logical mod_record::listcomplexe::one_conf |
logical mod_record::listcomplexe::one_run |
option for rmsd_min
type ( nodecomplexe ), pointer mod_record::listcomplexe::p_current |
only pointer, associated to current node, never allocated
type ( nodecomplexe ), pointer mod_record::listcomplexe::p_first |
pointer on first and last node, last necessary for reaching the end
type ( nodecomplexe ), pointer mod_record::listcomplexe::p_last |