anchor.diff:            indent = indent + 2
             do k = 1, t % n_macro_bins
                write(UNIT=UNIT_TALLY, FMT='(1X,2A,1X,A,"+/- ",A)') & 
  -                  space(1:indent), macro_name(abs(t % macro_bins(k) % scalar)), &
  +                  repeat(" ", indent), macro_name(abs(t % macro_bins(k) % scalar)), &
                     real_to_str(t % scores(score_index,k) % val), &
                     trim(real_to_str(t % scores(score_index,k) % val_sq))
             end do
  
positive.code:           end do find_bin
  
            ! Print filter information
            write(UNIT=UNIT_TALLY, FMT='(1X,2A,1X,A)') space(1:indent), &
                 trim(filter_name(j)), trim(get_label(t, j, bins(j)))
  
            ! Determine scoring index for this bin combination -- note that unlike
  
negative.code:     integer :: score_index             ! index in scores array for filters
      logical :: file_exists             ! does tallies.out file already exists? 
      logical :: has_filter(TALLY_TYPES) ! does tally have this filter?
      character(MAX_FILE_LEN) :: filename                  ! name of output file
      character(15)           :: filter_name(TALLY_TYPES)  ! names of tally filters
      character(27)           :: macro_name(N_MACRO_TYPES) ! names of macro scores
      type(TallyObject), pointer :: t
  
      ! Skip if there are no tallies
  