Struct DynamicFilterNode

pub struct DynamicFilterNode {
    pub left_key: u32,
    pub condition: Option<ExprNode>,
    pub left_table: Option<Table>,
    pub right_table: Option<Table>,
    pub condition_always_relax: bool,
}

Fields

left_key: u32

condition: Option<ExprNode>

Must be one of <, <=, >, >=

left_table: Option<Table>

Left table stores all states with predicate possibly not NULL.

right_table: Option<Table>

Right table stores single value from RHS of predicate.

condition_always_relax: bool

👎Deprecated

If the right side’s change always make the condition more relaxed. In other words, make more record in the left side satisfy the condition. If this is true, we need to store LHS records which do not match the condition in the internal table. When the condition changes, we will tell downstream to insert the LHS records which now match the condition. If this is false, we need to store RHS records which match the condition in the internal table. When the condition changes, we will tell downstream to delete the LHS records which now no longer match the condition.

Implementations

impl DynamicFilterNode

pub fn get_left_key(&self) -> u32

pub fn get_condition(&self) -> Result<&ExprNode, PbFieldNotFound>

pub fn get_left_table(&self) -> Result<&Table, PbFieldNotFound>

pub fn get_right_table(&self) -> Result<&Table, PbFieldNotFound>

pub fn get_condition_always_relax(&self) -> bool

Trait Implementations

impl Clone for DynamicFilterNode

fn clone(&self) -> DynamicFilterNode

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DynamicFilterNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for DynamicFilterNode

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for DynamicFilterNode

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Message for DynamicFilterNode

fn encoded_len(&self) -> usize

Returns the encoded length of the message without a length delimiter.

fn clear(&mut self)

Clears the message, resetting all fields to their default.

fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>

where Self: Sized,

Encodes the message to a buffer.

fn encode_to_vec(&self) -> Vec<u8>

where Self: Sized,

Encodes the message to a newly allocated buffer.

fn encode_length_delimited( &self, buf: &mut impl BufMut, ) -> Result<(), EncodeError>

where Self: Sized,

Encodes the message with a length-delimiter to a buffer.

fn encode_length_delimited_to_vec(&self) -> Vec<u8>

where Self: Sized,

Encodes the message with a length-delimiter to a newly allocated buffer.

fn decode(buf: impl Buf) -> Result<Self, DecodeError>

where Self: Default,

Decodes an instance of the message from a buffer.

fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>

where Self: Default,

Decodes a length-delimited instance of the message from the buffer.

fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>

where Self: Sized,

Decodes an instance of the message from a buffer, and merges it into self.

fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>

where Self: Sized,

Decodes a length-delimited instance of the message from buffer, and merges it into self.

impl PartialEq for DynamicFilterNode

fn eq(&self, other: &DynamicFilterNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for DynamicFilterNode

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for DynamicFilterNode