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 181-186)
144fn create_quantum_datasets() -> Result<(MemoryDataLoader, MemoryDataLoader)> {
145 // Create synthetic quantum-friendly dataset
146 let num_train = 800;
147 let num_test = 200;
148 let num_features = 4;
149
150 // Training data with quantum entanglement patterns
151 let train_data = Array2::from_shape_fn((num_train, num_features), |(i, j)| {
152 let phase = (i as f64).mul_add(0.1, j as f64 * 0.2);
153 (phase.sin() + (phase * 2.0).cos()) * 0.5
154 });
155
156 let train_labels = Array1::from_shape_fn(num_train, |i| {
157 // Create labels based on quantum-like correlations
158 let sum = (0..num_features).map(|j| train_data[[i, j]]).sum::<f64>();
159 if sum > 0.0 {
160 1.0
161 } else {
162 0.0
163 }
164 });
165
166 // Test data
167 let test_data = Array2::from_shape_fn((num_test, num_features), |(i, j)| {
168 let phase = (i as f64).mul_add(0.15, j as f64 * 0.25);
169 (phase.sin() + (phase * 2.0).cos()) * 0.5
170 });
171
172 let test_labels = Array1::from_shape_fn(num_test, |i| {
173 let sum = (0..num_features).map(|j| test_data[[i, j]]).sum::<f64>();
174 if sum > 0.0 {
175 1.0
176 } else {
177 0.0
178 }
179 });
180
181 let train_loader = MemoryDataLoader::new(
182 SciRS2Array::from_array(train_data.into_dyn()),
183 SciRS2Array::from_array(train_labels.into_dyn()),
184 32,
185 true,
186 )?;
187 let test_loader = MemoryDataLoader::new(
188 SciRS2Array::from_array(test_data.into_dyn()),
189 SciRS2Array::from_array(test_labels.into_dyn()),
190 32,
191 false,
192 )?;
193
194 Ok((train_loader, test_loader))
195}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.