anchor.diff:  
       ! Beginning of main routine for enumeration
       open(23,file="VERSION.enum")
  -    write(23,'(A)') "v2.0.4-46-g47e4-dirty"
  +    write(23,'(A)') "v2.0.4-49-g067d-dirty"
       close(23)
   
       ![TODO] Get rid of all the junk that crept in (writing files, making inactives table, etc. These should all be in routines so that this main routine is still readable)
  
positive.code:     integer OpIndxInSuperCellList, RowInDxGTable
      integer, allocatable :: arrow_basis(:,:)
      integer, pointer :: temp_perms(:,:) => null()
      logical :: arrows
  
      if (.not. present(use_arrows)) then
         arrows = .false.
      else
         arrows = use_arrows
      end if
  
      ! build the arrow basis.
      if (present(surf)) then
        if (surf .eqv. .True.) then
         allocate(arrow_basis(3,4))
         arrow_basis(:,1) = (/1,0,0/)
         arrow_basis(:,2) = (/-1,0,0/)
         arrow_basis(:,3) = (/0,1,0/)
         arrow_basis(:,4) = (/0,-1,0/)
        endif
      else
         allocate(arrow_basis(3,6))
         arrow_basis(:,1) = (/1,0,0/)
  
negative.code:     dRPList%nL = nOp  ! Number of operations that fix the parent
      dRPList%RotIndx => null() !lattice (but may permute the d-vectors)
      
      do iOp = 1, nOp ! Try each operation in turn and see how the
                      ! d-vectors are permuted for each
         rd = matmul(rot(:,:,iOp),d)+spread(shift(:,iOp),2,nD) ! Rotate each d and add the shift
  