GridSorting.f90 File Reference

Go to the source code of this file.

Modules
module	gridsorting

Functions/Subroutines
subroutine, public	gridsorting::quicksortgrid (array, arraySize, idxToGlobal, z_only)
subroutine	init ()
logical(lgp) function	lessthan (n, m)
real(dp) function, dimension(3)	get_global_xyz (gc, use_only_z)
	Utility function to convert global cell. More...
subroutine	swap (a, b)
subroutine	rshift (left, right)

Function/Subroutine Documentation

get_global_xyz()

real(dp) function, dimension(3) quicksortgrid::get_global_xyz ( type(globalcelltype)  gc, logical(lgp)  use_only_z  )

private

Parameters

gc	the global cell id
use_only_z	only z coordinate is needed or available, skip transform

Returns

return xyz

Definition at line 55 of file GridSorting.f90.

      type(GlobalCellType) :: gc !< the global cell id
      logical(LGP) :: use_only_z !< only z coordinate is needed or available, skip transform
      real(DP), dimension(3) :: global_xyz !< return xyz
      ! local
      real(DP) :: x, y, z
      real(DP) :: xc, yc, xo, yo, angrot
 
      z = dhalf * (gc%v_model%dis_top%get(gc%index) + &
                   gc%v_model%dis_bot%get(gc%index))
 
      x = dzero
      y = dzero
      if (.not. use_only_z) then
        xc = gc%v_model%dis_xc%get(gc%index)
        yc = gc%v_model%dis_yc%get(gc%index)
        xo = gc%v_model%dis_xorigin%get()
        yo = gc%v_model%dis_yorigin%get()
        angrot = gc%v_model%dis_angrot%get()
        call dis_transform_xy(xc, yc, xo, yo, angrot, x, y)
      end if
 
      global_xyz = [x, y, z]
 

Here is the call graph for this function:

Here is the caller graph for this function:

init()

subroutine quicksortgrid::init

private

Definition at line 24 of file GridSorting.f90.

Here is the caller graph for this function:

lessthan()

logical(lgp) function quicksortgrid::lessthan ( integer(i4b), intent(in)  n, integer(i4b), intent(in)  m  )

private

Definition at line 29 of file GridSorting.f90.

      integer(I4B), intent(in) :: n
      integer(I4B), intent(in) :: m
      logical(LGP) :: isLess
      ! local
      real(DP), dimension(3) :: xyz_n, xyz_m
 
      ! get coordinates as 3-vectors
      xyz_n = get_global_xyz(idxtoglobal(array(n)), z_only)
      xyz_m = get_global_xyz(idxtoglobal(array(m)), z_only)
 
      ! compare
      if (.not. is_close(xyz_n(3), xyz_m(3), 10 * epsilon(xyz_n(3)))) then
        isless = xyz_n(3) > xyz_m(3)
      else if (.not. is_close(xyz_n(2), xyz_m(2), 10 * epsilon(xyz_n(2)))) then
        isless = xyz_n(2) > xyz_m(2)
      else if (.not. is_close(xyz_n(1), xyz_m(1), 10 * epsilon(xyz_n(1)))) then
        isless = xyz_n(1) < xyz_m(1)
      else
        isless = .false.
      end if
 

Here is the call graph for this function:

rshift()

subroutine quicksortgrid::rshift ( integer, intent(in)  left, integer, intent(in)  right  )

private

Definition at line 93 of file GridSorting.f90.

      integer, intent(in) :: left, right
      integer :: hold
 
      hold = array(right)
      array(left + 1:right) = array(left:right - 1)
      array(left) = hold
 

swap()

subroutine quicksortgrid::swap ( integer, intent(in)  a, integer, intent(in)  b  )

private

Definition at line 82 of file GridSorting.f90.

      integer, intent(in) :: a, b
      integer :: hold
 
      hold = array(a)
      array(a) = array(b)
      array(b) = hold