Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Variables
Type
Visibility
Attributes
Name
Initial
integer,
private
::
i
Source Code
pure subroutine fragment_lookup_init(this,estimated_entries)!! Initialize hash table with estimated sizeclass(fragment_lookup_t),intent(inout)::thisinteger(int64),intent(in)::estimated_entriesinteger::i! Use prime number close to estimated size for better distributionthis%table_size=next_prime_internal(int(estimated_entries*1.3_dp))allocate(this%table(this%table_size))! Initialize all entries as emptydo i=1,this%table_sizenullify(this%table(i)%next)end dothis%n_entries=0this%initialized=.true.end subroutine fragment_lookup_init