#[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
impl SCIP_Node
pub fn depth(&self) -> c_uint
pub fn set_depth(&mut self, val: c_uint)
pub unsafe fn depth_raw(this: *const Self) -> c_uint
pub unsafe fn set_depth_raw(this: *mut Self, val: c_uint)
pub fn reoptid(&self) -> c_uint
pub fn set_reoptid(&mut self, val: c_uint)
pub unsafe fn reoptid_raw(this: *const Self) -> c_uint
pub unsafe fn set_reoptid_raw(this: *mut Self, val: c_uint)
pub fn reopttype(&self) -> c_uint
pub fn set_reopttype(&mut self, val: c_uint)
pub unsafe fn reopttype_raw(this: *const Self) -> c_uint
pub unsafe fn set_reopttype_raw(this: *mut Self, val: c_uint)
pub fn repropsubtreemark(&self) -> c_uint
pub fn set_repropsubtreemark(&mut self, val: c_uint)
pub unsafe fn repropsubtreemark_raw(this: *const Self) -> c_uint
pub unsafe fn set_repropsubtreemark_raw(this: *mut Self, val: c_uint)
pub fn active(&self) -> c_uint
pub fn set_active(&mut self, val: c_uint)
pub unsafe fn active_raw(this: *const Self) -> c_uint
pub unsafe fn set_active_raw(this: *mut Self, val: c_uint)
pub fn cutoff(&self) -> c_uint
pub fn set_cutoff(&mut self, val: c_uint)
pub unsafe fn cutoff_raw(this: *const Self) -> c_uint
pub unsafe fn set_cutoff_raw(this: *mut Self, val: c_uint)
pub fn reprop(&self) -> c_uint
pub fn set_reprop(&mut self, val: c_uint)
pub unsafe fn reprop_raw(this: *const Self) -> c_uint
pub unsafe fn set_reprop_raw(this: *mut Self, val: c_uint)
pub fn nodetype(&self) -> c_uint
pub fn set_nodetype(&mut self, val: c_uint)
pub unsafe fn nodetype_raw(this: *const Self) -> c_uint
pub unsafe fn set_nodetype_raw(this: *mut Self, val: c_uint)
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§
Auto Trait Implementations§
impl Freeze for SCIP_Node
impl RefUnwindSafe for SCIP_Node
impl !Send for SCIP_Node
impl !Sync for SCIP_Node
impl Unpin for SCIP_Node
impl UnwindSafe for SCIP_Node
Blanket Implementations§
§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§unsafe fn clone_to_uninit(&self, dest: *mut u8)
unsafe fn clone_to_uninit(&self, dest: *mut u8)
🔬This is a nightly-only experimental API. (
clone_to_uninit)