pub struct DataSplit {
pub train_nodes: Vec<NodeId>,
pub val_nodes: Vec<NodeId>,
pub test_nodes: Vec<NodeId>,
pub train_edges: Vec<EdgeId>,
pub val_edges: Vec<EdgeId>,
pub test_edges: Vec<EdgeId>,
}Expand description
Result of a data split.
Fields§
§train_nodes: Vec<NodeId>Training node IDs.
val_nodes: Vec<NodeId>Validation node IDs.
test_nodes: Vec<NodeId>Test node IDs.
train_edges: Vec<EdgeId>Training edge IDs.
val_edges: Vec<EdgeId>Validation edge IDs.
test_edges: Vec<EdgeId>Test edge IDs.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for DataSplit
impl RefUnwindSafe for DataSplit
impl Send for DataSplit
impl Sync for DataSplit
impl Unpin for DataSplit
impl UnsafeUnpin for DataSplit
impl UnwindSafe for DataSplit
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.