code: public static boolean inverseSetContains (@Nonnull final int [] aCodepointSet, final int value)
    {
      int nStart = 0;
      int nEnd = aCodepointSet.length;
      while (nEnd - nStart > 8)
      {
        final int i = (nEnd + nStart) >>> 1;
        nStart = aCodepointSet[i] <= value ? i : nStart;
        nEnd = aCodepointSet[i] > value ? i : nEnd;
      }
      while (nStart < nEnd)
      {
        if (value < aCodepointSet[nStart])
          break;
        nStart++;
      }
      return ((nStart - 1) & 1) == 0;
    }
docs: Treats the specified int array as an Inversion Set and returns
  <code>true</code> if the value is located within the set. This will only
  work correctly if the values in the int array are monotonically increasing
  
  @param aCodepointSet
  Source set
  @param value
  Value to check
  @return <code>true</code> if the value is located within the set