anchor.diff:            dap = 0
             do iD = 1, nD ! Loop over each row in the (d,g) table
                ! LA^-1(v_i+(RAL^-1)G)
  +             ! v_i is the lattice vector that must be added to return a rotated d-vector to the unit cell
                rgp = matmul(Tinv,(-spread(RPList(iH)%v(:,iD,iOp),2,n)+matmul(matmul(Op(iH)%rot(:,:,iOp),T),g)))
                rag = transpose(matmul(transpose(arrow_basis),op(iH)%rot(:,:,iOp)))
                if (.not. equal(rgp,nint(rgp),eps)) stop "Transform left big fractional parts"
  
positive.code:     ! have 1 label ["inactive sites" or "spectator sites"]). By removing these from the enumeration
      ! itself (adding them back in afterwards) reduces unnecessary combinatoric explosion.
      call make_inactive_table(k,nD, equivalencies,nDFull,labelFull,dFull,d,label,digit,digitFull,inactives)
  !del    write(*,'("crange orig:")')
  !del  do i = 1, size(crange,1)
  !del     write(*,'(10(1x,i2))') crange(i,:)
  !del  enddo
      ! Are we going to use a set of fixed cells? Or loop over all possible cells?
      call check_for_fixed_cells(fixed_cells,nMin,nMax) ! fixed_cells will be .true. on exit if `fixed_cells.in` exists
  
  
negative.code:                    ! efficient...unless there are arrows present in the
                     ! enumeration or the multinomial of possible
                     ! arrangements is too large for enum3 to handle.
                     if (origCrossOutAlgorithm .or. (any(site_res == 0)&
                           .and. (multinomial(iRange(iC,:)) < max_binomial)&
                           .and. (arrows .eqv. .false.))) then
  