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.
Source Code
module subroutine create_inverse_permutation(self)implicit none class(type_reordering),intent(inout)::selfinteger(int32)::iif(.not.self%is_reordered_perm)then! call error_message(932, c_opt="Inverse Permutation")return end if if(self%num_nodes<=0)return if(allocated(self%iperm))call deallocate_array(self%iperm)call allocate_array(self%iperm,self%num_nodes)do i=1,self%num_nodesself%iperm(self%perm(i))=iend doself%is_reordered_iperm=.true.end subroutine create_inverse_permutation