/// Efficiently determines if this column contains non-null values that
/// differ from the provided set of values.
///
/// Informally, this method provides an efficient way of answering "is it
/// worth spending time reading this column for distinct values that are not
/// present in the provided set?".
///
/// More formally, this method returns the relative complement of this
/// column's dictionary in the provided set of values.
Efficiently determines if this column contains non-null values that
differ from the provided set of values.

Informally, this method provides an efficient way of answering "is it
worth spending time reading this column for distinct values that are not
present in the provided set?".

More formally, this method returns the relative complement of this
column's dictionary in the provided set of values.
Efficiently determines if this column contains non - null values that differ from the provided set of values . Informally this method provides an efficient way of answering " is it worth spending time reading this column for distinct values that are not present in the provided set? " . More formally this method returns the relative complement of this column ' s dictionary in the provided set of values .
fn has_other_non_null_values(&self, values: &BTreeSet<String>) -> bool {
        match self {
            Self::RLE(enc) => enc.has_other_non_null_values(values),
            Self::Plain(enc) => enc.has_other_non_null_values(values),
        }
    }
fn has_other_non_null_values ( & self , values : & BTreeSet < String > ) -> bool { match self { Self :: RLE ( enc ) => enc . has_other_non_null_values ( values ) , Self :: Plain ( enc ) => enc . has_other_non_null_values ( values ) , } }
Efficiently determines if this column contains non-null values that
differ from the provided set of values.
Efficiently determines if this column contains non - null values that differ from the provided set of values .
&self
values
&BTreeSet<String>