pub struct MemoryDataLoader { /* private fields */ }Expand description
Simple in-memory data loader
Implementations§
Source§impl MemoryDataLoader
impl MemoryDataLoader
Sourcepub fn new(
inputs: SciRS2Array,
targets: SciRS2Array,
batch_size: usize,
shuffle: bool,
) -> Result<Self>
pub fn new( inputs: SciRS2Array, targets: SciRS2Array, batch_size: usize, shuffle: bool, ) -> Result<Self>
Create new memory data loader
Examples found in repository?
examples/pytorch_integration_demo.rs (lines 174-179)
137fn create_quantum_datasets() -> Result<(MemoryDataLoader, MemoryDataLoader)> {
138 // Create synthetic quantum-friendly dataset
139 let num_train = 800;
140 let num_test = 200;
141 let num_features = 4;
142
143 // Training data with quantum entanglement patterns
144 let train_data = Array2::from_shape_fn((num_train, num_features), |(i, j)| {
145 let phase = (i as f64).mul_add(0.1, j as f64 * 0.2);
146 (phase.sin() + (phase * 2.0).cos()) * 0.5
147 });
148
149 let train_labels = Array1::from_shape_fn(num_train, |i| {
150 // Create labels based on quantum-like correlations
151 let sum = (0..num_features).map(|j| train_data[[i, j]]).sum::<f64>();
152 if sum > 0.0 {
153 1.0
154 } else {
155 0.0
156 }
157 });
158
159 // Test data
160 let test_data = Array2::from_shape_fn((num_test, num_features), |(i, j)| {
161 let phase = (i as f64).mul_add(0.15, j as f64 * 0.25);
162 (phase.sin() + (phase * 2.0).cos()) * 0.5
163 });
164
165 let test_labels = Array1::from_shape_fn(num_test, |i| {
166 let sum = (0..num_features).map(|j| test_data[[i, j]]).sum::<f64>();
167 if sum > 0.0 {
168 1.0
169 } else {
170 0.0
171 }
172 });
173
174 let train_loader = MemoryDataLoader::new(
175 SciRS2Array::from_array(train_data.into_dyn()),
176 SciRS2Array::from_array(train_labels.into_dyn()),
177 32,
178 true,
179 )?;
180 let test_loader = MemoryDataLoader::new(
181 SciRS2Array::from_array(test_data.into_dyn()),
182 SciRS2Array::from_array(test_labels.into_dyn()),
183 32,
184 false,
185 )?;
186
187 Ok((train_loader, test_loader))
188}Trait Implementations§
Source§impl DataLoader for MemoryDataLoader
impl DataLoader for MemoryDataLoader
Source§fn next_batch(&mut self) -> Result<Option<(SciRS2Array, SciRS2Array)>>
fn next_batch(&mut self) -> Result<Option<(SciRS2Array, SciRS2Array)>>
Get next batch
Source§fn batch_size(&self) -> usize
fn batch_size(&self) -> usize
Get batch size
Auto Trait Implementations§
impl Freeze for MemoryDataLoader
impl !RefUnwindSafe for MemoryDataLoader
impl Send for MemoryDataLoader
impl Sync for MemoryDataLoader
impl Unpin for MemoryDataLoader
impl !UnwindSafe for MemoryDataLoader
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> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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.