SCIP_Node

Struct SCIP_Node 

Source
#[repr(C)]
pub struct SCIP_Node { pub number: c_longlong, pub lowerbound: f64, pub lowerboundexact: *mut SCIP_RATIONAL, pub estimate: f64, pub data: SCIP_Node__bindgen_ty_1, pub parent: *mut SCIP_NODE, pub conssetchg: *mut SCIP_CONSSETCHG, pub domchg: *mut SCIP_DOMCHG, pub _bitfield_align_1: [u32; 0], pub _bitfield_1: __BindgenBitfieldUnit<[u8; 11]>, pub __bindgen_padding_0: [u8; 5], }
Expand description

node data structure

Fields§

§number: c_longlong

< successively assigned number of the node

§lowerbound: f64

< lower (dual) bound of subtree

§lowerboundexact: *mut SCIP_RATIONAL

< lower (dual) rational bound of subtree

§estimate: f64

< estimated value of feasible solution in subtree

§data: SCIP_Node__bindgen_ty_1§parent: *mut SCIP_NODE

< parent node in the tree

§conssetchg: *mut SCIP_CONSSETCHG

< constraint set changes at this node or NULL

§domchg: *mut SCIP_DOMCHG

< domain changes at this node or NULL

§_bitfield_align_1: [u32; 0]§_bitfield_1: __BindgenBitfieldUnit<[u8; 11]>§__bindgen_padding_0: [u8; 5]

Implementations§

Source§

impl SCIP_Node

Source

pub fn depth(&self) -> c_uint

Source

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

Source

pub unsafe fn depth_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_depth_raw(this: *mut Self, val: c_uint)

Source

pub fn reoptid(&self) -> c_uint

Source

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

Source

pub unsafe fn reoptid_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_reoptid_raw(this: *mut Self, val: c_uint)

Source

pub fn reopttype(&self) -> c_uint

Source

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

Source

pub unsafe fn reopttype_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_reopttype_raw(this: *mut Self, val: c_uint)

Source

pub fn repropsubtreemark(&self) -> c_uint

Source

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

Source

pub unsafe fn repropsubtreemark_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_repropsubtreemark_raw(this: *mut Self, val: c_uint)

Source

pub fn active(&self) -> c_uint

Source

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

Source

pub unsafe fn active_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_active_raw(this: *mut Self, val: c_uint)

Source

pub fn cutoff(&self) -> c_uint

Source

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

Source

pub unsafe fn cutoff_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_cutoff_raw(this: *mut Self, val: c_uint)

Source

pub fn reprop(&self) -> c_uint

Source

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

Source

pub unsafe fn reprop_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_reprop_raw(this: *mut Self, val: c_uint)

Source

pub fn nodetype(&self) -> c_uint

Source

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

Source

pub unsafe fn nodetype_raw(this: *const Self) -> c_uint

Source

pub unsafe fn set_nodetype_raw(this: *mut Self, val: c_uint)

Source

pub fn new_bitfield_1( depth: c_uint, reoptid: c_uint, reopttype: c_uint, repropsubtreemark: c_uint, active: c_uint, cutoff: c_uint, reprop: c_uint, nodetype: c_uint, ) -> __BindgenBitfieldUnit<[u8; 11]>

Trait Implementations§

Source§

impl Clone for SCIP_Node

Source§

fn clone(&self) -> SCIP_Node

Returns a duplicate of the value. Read more
1.0.0§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for SCIP_Node

Auto Trait Implementations§

Blanket Implementations§

§

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

§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

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

§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
§

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

§

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

Mutably borrows from an owned value. Read more
§

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

§

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

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> From<T> for T

§

fn from(t: T) -> T

Returns the argument unchanged.

§

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

§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

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

§

type Owned = T

The resulting type after obtaining ownership.
§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
§

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

Uses borrowed data to replace owned data, usually by cloning. Read more
§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
§

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

Performs the conversion.
§

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

§

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

The type returned in the event of a conversion error.
§

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

Performs the conversion.