format/src/main/java/com/github/sadikovi/riff/tree/node/In.java
/**
   * Search array to find if there is a typed expression that matches ordinal value.
   * @param row row to evaluate
   * @param ordinal row ordinal
   * @return true if row value equals any typed expression, false otherwise
   */
Search array to find if there is a typed expression that matches ordinal value.
@param row row to evaluate
@param ordinal row ordinal
@return true if row value equals any typed expression, false otherwise
Search array to find if there is a typed expression that matches ordinal value . @param row row to evaluate @param ordinal row ordinal @return true if row value equals any typed expression false otherwise
private boolean exists(InternalRow row, int ordinal) {
    int low = 0, high = list.length - 1;
    while (low <= high) {
      int mid = high - (high - low) / 2;
      if (list[mid].eqExpr(row, ordinal)) return true;
      if (list[mid].ltExpr(row, ordinal)) {
        high = mid - 1;
      } else {
        low = mid + 1;
      }
    }
    return false;
  }
private boolean exists ( InternalRow row , int ordinal ) { int low = 0 , high = list . length - 1 ; while ( low <= high ) { int mid = high - ( high - low ) / 2 ; if ( list [ mid ] . eqExpr ( row , ordinal ) ) return true ; if ( list [ mid ] . ltExpr ( row , ordinal ) ) { high = mid - 1 ; } else { low = mid + 1 ; } } return false ; }
Search array to find if there is a typed expression that matches ordinal value.
Search array to find if there is a typed expression that matches ordinal value .