anchor.diff:                  do j = lo + 1, hi
                       tmp = list(:,j)
                       do i = j - 1, 1, -1
  -                        !if (.not.(tmp(1:ns) .bitstrgt. list(1:ns,i))) exit
  -                        if (.not.(tmp(1:ns) .bitstrgtt. list(1:ns,i))) exit
  +                        if (.not.(tmp(1:ns) .bitstrgt. list(1:ns,i))) exit
                           list(:,i+1) = list(:,i)
                       end do
                       list(:,i+1) = tmp
  
positive.code: use const, only: i0, int_p, int_64, p, dp, debug
  
  implicit none
  
  interface operator(.bitstrget.)
      module procedure bit_str_i0_ge_trot
  end interface
  
  interface operator(.bitstrgtt.)
      module procedure bit_str_i0_gt_trot
  end interface
  
  contains
  
  
negative.code:                 ! search algorithm.
                  pos = (hi+lo)/2
  
                  compare = bit_str_cmp_trot(list(:,pos), item)
                  select case(compare)
                  case (0)
                      ! hit!
  