anchor.diff:              ! element which doesn't exist yet) the binary search can find either
               ! the element before or after where item should be placed.
               if (hi == lo) then
  -                !compare = bit_str_cmp_trot(list(:,hi), item)
  -                compare = bit_str_i0_cmp_trot(list(:,hi), item)
  +                compare = bit_str_cmp_trot(list(:,hi), item)
                   select case(compare)
                   case (0)
                       ! hit!
  
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!
  