Struct joinNode

Source

#[repr(C)]
pub struct joinNode {Show 18 fields
    pub _bitfield_1: __BindgenBitfieldUnit<[u8; 4], u16>,
    pub bsaveID: c_ulong,
    pub memoryLeftAdds: c_longlong,
    pub memoryRightAdds: c_longlong,
    pub memoryLeftDeletes: c_longlong,
    pub memoryRightDeletes: c_longlong,
    pub memoryCompares: c_longlong,
    pub leftMemory: *mut betaMemory,
    pub rightMemory: *mut betaMemory,
    pub networkTest: *mut Expression,
    pub secondaryNetworkTest: *mut Expression,
    pub leftHash: *mut Expression,
    pub rightHash: *mut Expression,
    pub rightSideEntryStructure: *mut c_void,
    pub nextLinks: *mut joinLink,
    pub lastLevel: *mut joinNode,
    pub rightMatchNode: *mut joinNode,
    pub ruleToActivate: *mut Defrule,
}

Fields§

§_bitfield_1: __BindgenBitfieldUnit<[u8; 4], u16>§bsaveID: c_ulong§memoryLeftAdds: c_longlong§memoryRightAdds: c_longlong§memoryLeftDeletes: c_longlong§memoryRightDeletes: c_longlong§memoryCompares: c_longlong§leftMemory: *mut betaMemory§rightMemory: *mut betaMemory§networkTest: *mut Expression§secondaryNetworkTest: *mut Expression§leftHash: *mut Expression§rightHash: *mut Expression§rightSideEntryStructure: *mut c_void§nextLinks: *mut joinLink§lastLevel: *mut joinNode§rightMatchNode: *mut joinNode§ruleToActivate: *mut Defrule

Struct joinNodeCopy item path

Fields§

Implementations§

impl joinNode

pub fn firstJoin(&self) -> c_uint

pub fn set_firstJoin(&mut self, val: c_uint)

pub fn logicalJoin(&self) -> c_uint

pub fn set_logicalJoin(&mut self, val: c_uint)

pub fn joinFromTheRight(&self) -> c_uint

pub fn set_joinFromTheRight(&mut self, val: c_uint)

pub fn patternIsNegated(&self) -> c_uint

pub fn set_patternIsNegated(&mut self, val: c_uint)

pub fn patternIsExists(&self) -> c_uint

pub fn set_patternIsExists(&mut self, val: c_uint)

pub fn initialize(&self) -> c_uint

pub fn set_initialize(&mut self, val: c_uint)

pub fn marked(&self) -> c_uint

pub fn set_marked(&mut self, val: c_uint)

pub fn rhsType(&self) -> c_uint

pub fn set_rhsType(&mut self, val: c_uint)

pub fn depth(&self) -> c_uint

pub fn set_depth(&mut self, val: c_uint)

pub fn new_bitfield_1( firstJoin: c_uint, logicalJoin: c_uint, joinFromTheRight: c_uint, patternIsNegated: c_uint, patternIsExists: c_uint, initialize: c_uint, marked: c_uint, rhsType: c_uint, depth: c_uint, ) -> __BindgenBitfieldUnit<[u8; 4], u16>

Trait Implementations§

impl Clone for joinNode

fn clone(&self) -> joinNode

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

impl Debug for joinNode

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

impl Default for joinNode

fn default() -> Self

impl Copy for joinNode

Auto Trait Implementations§

impl Freeze for joinNode

impl RefUnwindSafe for joinNode

impl !Send for joinNode

impl !Sync for joinNode

impl Unpin for joinNode

impl UnwindSafe for joinNode

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dst: *mut u8)

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct joinNode

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

impl<T, U> Into<U> for T
where U: From<T>,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,