code: public static int unsignedBinarySearch(final ShortBuffer array, final int begin, final int end,
        final short k) {
      return branchyUnsignedBinarySearch(array, begin, end, k);
    }
docs: Look for value k in buffer in the range [begin,end). If the value is found, return its index.
  If not, return -(i+1) where i is the index where the value would be inserted. The buffer is
  assumed to contain sorted values where shorts are interpreted as unsigned integers.
  
  @param array buffer where we search
  @param begin first index (inclusive)
  @param end last index (exclusive)
  @param k value we search for
  @return count