|
|
@ -4,10 +4,12 @@ module neighbors
|
|
|
|
use elements
|
|
|
|
use elements
|
|
|
|
use subroutines
|
|
|
|
use subroutines
|
|
|
|
use functions
|
|
|
|
use functions
|
|
|
|
|
|
|
|
use box
|
|
|
|
|
|
|
|
|
|
|
|
integer, allocatable :: nei_list(:,:), nei_num(:), nn(:)
|
|
|
|
integer, allocatable :: nei_list(:,:), nei_num(:), nn(:), periodvec(:,:,:)
|
|
|
|
real(kind=dp), allocatable :: init_vec(:,:,:), output(:), microrotation(:,:)
|
|
|
|
real(kind=dp), allocatable :: init_vec(:,:,:), output(:), microrotation(:,:)
|
|
|
|
public
|
|
|
|
public
|
|
|
|
|
|
|
|
|
|
|
|
contains
|
|
|
|
contains
|
|
|
|
|
|
|
|
|
|
|
|
subroutine build_cell_list(numinlist, r_list, rc_off, cell_num, num_in_cell, cell_list, which_cell)
|
|
|
|
subroutine build_cell_list(numinlist, r_list, rc_off, cell_num, num_in_cell, cell_list, which_cell)
|
|
|
@ -82,44 +84,68 @@ module neighbors
|
|
|
|
integer, intent(in) :: n
|
|
|
|
integer, intent(in) :: n
|
|
|
|
real(kind=dp), dimension(3,n) :: r_list
|
|
|
|
real(kind=dp), dimension(3,n) :: r_list
|
|
|
|
|
|
|
|
|
|
|
|
integer :: i, c(3), ci, cj, ck, num_nei, nei
|
|
|
|
integer :: i, j, c(3),cn(3), ci, cj, ck, num_nei, nei, v(3), period_dir(3)
|
|
|
|
!Variables for cell list code
|
|
|
|
!Variables for cell list code
|
|
|
|
integer, dimension(3) ::cell_num
|
|
|
|
integer, dimension(3) ::cell_num
|
|
|
|
integer, allocatable :: num_in_cell(:,:,:), cell_list(:,:,:,:)
|
|
|
|
integer, allocatable :: num_in_cell(:,:,:), cell_list(:,:,:,:)
|
|
|
|
integer :: which_cell(3,n)
|
|
|
|
integer :: which_cell(3,n)
|
|
|
|
|
|
|
|
real(kind=dp) :: r(3), box_len(3)
|
|
|
|
|
|
|
|
logical :: period_bd(3)
|
|
|
|
|
|
|
|
|
|
|
|
!First reallocate the neighbor list codes
|
|
|
|
!First reallocate the neighbor list codes
|
|
|
|
if (allocated(nei_list)) then
|
|
|
|
if (allocated(nei_list)) then
|
|
|
|
deallocate(nei_list,nei_num)
|
|
|
|
deallocate(nei_list,nei_num, periodvec)
|
|
|
|
end if
|
|
|
|
end if
|
|
|
|
|
|
|
|
|
|
|
|
allocate(nei_list(100,n),nei_num(n))
|
|
|
|
allocate(nei_list(100,n),nei_num(n), periodvec(3,100,n))
|
|
|
|
nei_list=0
|
|
|
|
nei_list=0
|
|
|
|
|
|
|
|
periodvec=0
|
|
|
|
nei_num=0
|
|
|
|
nei_num=0
|
|
|
|
|
|
|
|
|
|
|
|
!Now first pass the position list and and point num to the cell algorithm
|
|
|
|
!Now first pass the position list and and point num to the cell algorithm
|
|
|
|
call build_cell_list(n, r_list, rc_off, cell_num, num_in_cell, cell_list, which_cell)
|
|
|
|
call build_cell_list(n, r_list, rc_off, cell_num, num_in_cell, cell_list, which_cell)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
do i=1, 3
|
|
|
|
|
|
|
|
if (box_bc(i:i) == 'p') then
|
|
|
|
|
|
|
|
period_bd(i) = .true.
|
|
|
|
|
|
|
|
else
|
|
|
|
|
|
|
|
period_bd(i)=.false.
|
|
|
|
|
|
|
|
end if
|
|
|
|
|
|
|
|
box_len(i) = box_bd(2*i) - box_bd(2*i-1)
|
|
|
|
|
|
|
|
end do
|
|
|
|
!Now loop over every point and find it's neighbors
|
|
|
|
!Now loop over every point and find it's neighbors
|
|
|
|
pointloop: do i = 1, n
|
|
|
|
pointloop: do i = 1, n
|
|
|
|
|
|
|
|
|
|
|
|
!First check to see if the point is a filler point, if so then skip it
|
|
|
|
!First check to see if the point is a filler point, if so then skip it
|
|
|
|
if(r_list(1,i) < box_bd(1)) cycle
|
|
|
|
if(r_list(1,i) < box_bd(1)) cycle
|
|
|
|
|
|
|
|
|
|
|
|
!c is the position of the cell that the point
|
|
|
|
!c is the position of the cell that the point belongs to
|
|
|
|
c = which_cell(:,i)
|
|
|
|
c = which_cell(:,i)
|
|
|
|
|
|
|
|
|
|
|
|
!Loop over all neighboring cells
|
|
|
|
!Loop over all neighboring cells
|
|
|
|
do ci = -1, 1, 1
|
|
|
|
do ci = -1, 1, 1
|
|
|
|
do cj = -1, 1, 1
|
|
|
|
do cj = -1, 1, 1
|
|
|
|
do ck = -1, 1, 1
|
|
|
|
do ck = -1, 1, 1
|
|
|
|
!First check to make sure that the neighboring cell exists
|
|
|
|
!First try to apply periodic boundaries
|
|
|
|
|
|
|
|
v=(/ ck, cj, ci /)
|
|
|
|
|
|
|
|
cn=0
|
|
|
|
|
|
|
|
period_dir=0
|
|
|
|
|
|
|
|
do j=1, 3
|
|
|
|
|
|
|
|
if ((c(j) + v(j) == 0).and.period_bd(j)) then
|
|
|
|
|
|
|
|
cn(j) = cell_num(j)
|
|
|
|
|
|
|
|
period_dir(j) = 1
|
|
|
|
|
|
|
|
else if ((c(j) + v(j) > cell_num(j)).and.period_bd(j)) then
|
|
|
|
|
|
|
|
cn(j) = 1
|
|
|
|
|
|
|
|
period_dir(j) = -1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
else if ((c(j)+v(j) >= 1) .and. (c(j)+v(j) <= cell_num(j))) then
|
|
|
|
|
|
|
|
cn(j) = c(j) + v(j)
|
|
|
|
|
|
|
|
end if
|
|
|
|
|
|
|
|
end do
|
|
|
|
if(any((c + (/ ck, cj, ci /)) == 0)) cycle
|
|
|
|
if(any((c + (/ ck, cj, ci /)) == 0)) cycle
|
|
|
|
if( (c(1) + ck > cell_num(1)).or.(c(2) + cj > cell_num(2)).or. &
|
|
|
|
|
|
|
|
(c(3) + ci > cell_num(3))) cycle
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
do num_nei = 1, num_in_cell(c(1) + ck, c(2) + cj, c(3) + ci)
|
|
|
|
do num_nei = 1, num_in_cell(cn(1),cn(2),cn(3))
|
|
|
|
nei = cell_list(num_nei,c(1) + ck, c(2) + cj, c(3) + ci)
|
|
|
|
nei = cell_list(num_nei,cn(1),cn(2),cn(3))
|
|
|
|
|
|
|
|
|
|
|
|
!Check to make sure the atom isn't the same index as the atom we are checking
|
|
|
|
!Check to make sure the atom isn't the same index as the atom we are checking
|
|
|
|
!and that the neighbor hasn't already been deleted
|
|
|
|
!and that the neighbor hasn't already been deleted
|
|
|
@ -127,10 +153,13 @@ module neighbors
|
|
|
|
|
|
|
|
|
|
|
|
!Now check to see if it is in the cutoff radius, if it is add it to the neighbor list for that
|
|
|
|
!Now check to see if it is in the cutoff radius, if it is add it to the neighbor list for that
|
|
|
|
!atom and calculate the initial neighbor vector
|
|
|
|
!atom and calculate the initial neighbor vector
|
|
|
|
if (norm2(r_list(:,nei)-r_list(:,i)) < rc_off) then
|
|
|
|
|
|
|
|
|
|
|
|
r = r_list(:,nei) + period_dir*box_len
|
|
|
|
|
|
|
|
if (norm2(r-r_list(:,i)) < rc_off) then
|
|
|
|
|
|
|
|
|
|
|
|
nei_num(i) = nei_num(i) + 1
|
|
|
|
nei_num(i) = nei_num(i) + 1
|
|
|
|
nei_list(nei_num(i), i) = nei
|
|
|
|
nei_list(nei_num(i), i) = nei
|
|
|
|
|
|
|
|
periodvec(:,nei_num(i),i) = period_dir
|
|
|
|
|
|
|
|
|
|
|
|
end if
|
|
|
|
end if
|
|
|
|
end if
|
|
|
|
end if
|
|
|
|