tenflowers-dataset 0.1.1

Data pipeline and dataset utilities for TenfloweRS
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
//! Core dataset traits, types, and utility implementations.
//!
//! This module contains the fundamental `Dataset` trait, `DatasetUtilsExt` extension trait,
//! and all the basic dataset wrapper types (`TensorDataset`, `BatchedDataset`, `ConcatDataset`,
//! `FilteredDataset`, `SubsetDataset`, `MergedDataset`, `DatasetSplitter`, etc.).

use scirs2_core::random::rng;
use std::marker::PhantomData;
use std::sync::Arc;
use tenflowers_core::ops::slice;
use tenflowers_core::{Result, Tensor, TensorError};

/// Core trait for datasets.
///
/// All dataset types must implement this trait to be usable with data loaders,
/// transforms, and other dataset utilities.
pub trait Dataset<T> {
    fn len(&self) -> usize;
    fn is_empty(&self) -> bool {
        self.len() == 0
    }
    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)>;
    fn batch(self, batch_size: usize) -> BatchedDataset<T, Self>
    where
        Self: Sized,
    {
        BatchedDataset {
            dataset: self,
            batch_size,
            current_index: 0,
            _phantom: PhantomData,
        }
    }
}

/// Implement Dataset for `Arc<D>` to allow shared ownership
impl<T, D: Dataset<T>> Dataset<T> for Arc<D> {
    fn len(&self) -> usize {
        (**self).len()
    }

    fn is_empty(&self) -> bool {
        (**self).is_empty()
    }

    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)> {
        (**self).get(index)
    }
}

/// Extension trait providing utility methods for datasets
pub trait DatasetUtilsExt<T>: Dataset<T> {
    /// Get multiple samples by their indices
    fn get_multiple(&self, indices: &[usize]) -> Result<Vec<(Tensor<T>, Tensor<T>)>> {
        let mut samples = Vec::with_capacity(indices.len());
        for &index in indices {
            samples.push(self.get(index)?);
        }
        Ok(samples)
    }

    /// Get a range of samples from start (inclusive) to end (exclusive)
    fn get_range(&self, start: usize, end: usize) -> Result<Vec<(Tensor<T>, Tensor<T>)>> {
        if start >= end {
            return Ok(Vec::new());
        }
        if end > self.len() {
            return Err(TensorError::invalid_argument(format!(
                "End index {} out of bounds for dataset of length {}",
                end,
                self.len()
            )));
        }

        let mut samples = Vec::with_capacity(end - start);
        for i in start..end {
            samples.push(self.get(i)?);
        }
        Ok(samples)
    }

    /// Get a random sample from the dataset
    fn get_random(&self) -> Result<(Tensor<T>, Tensor<T>)> {
        use scirs2_core::random::rand_prelude::*;
        if self.is_empty() {
            return Err(TensorError::invalid_argument(
                "Cannot get random sample from empty dataset".to_string(),
            ));
        }
        let mut rng = rng();
        let random_val: f64 = rng.random();
        let index = (random_val * self.len() as f64) as usize;
        let index = index.min(self.len() - 1); // Clamp to valid range
        self.get(index)
    }

    /// Get multiple random samples from the dataset (with replacement)
    fn get_random_samples(&self, count: usize) -> Result<Vec<(Tensor<T>, Tensor<T>)>> {
        use scirs2_core::random::rand_prelude::*;
        if self.is_empty() {
            return Err(TensorError::invalid_argument(
                "Cannot get random samples from empty dataset".to_string(),
            ));
        }

        let mut rng = rng();
        let mut samples = Vec::with_capacity(count);
        for _ in 0..count {
            let random_val: f64 = rng.random();
            let index = (random_val * self.len() as f64) as usize;
            let index = index.min(self.len() - 1); // Clamp to valid range
            samples.push(self.get(index)?);
        }
        Ok(samples)
    }
}

/// Implement DatasetUtilsExt for all types that implement Dataset
impl<T, D: Dataset<T>> DatasetUtilsExt<T> for D {}

#[derive(Clone)]
pub struct TensorDataset<T> {
    features: Tensor<T>,
    #[allow(dead_code)]
    labels: Tensor<T>,
}

impl<T: Clone + Default + scirs2_core::numeric::Zero + Send + Sync + 'static> TensorDataset<T> {
    pub fn new(features: Tensor<T>, labels: Tensor<T>) -> Self {
        Self { features, labels }
    }
}

impl<T: Clone + Default + scirs2_core::numeric::Zero + Send + Sync + 'static> Dataset<T>
    for TensorDataset<T>
{
    fn len(&self) -> usize {
        self.features.shape().dims()[0]
    }

    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)> {
        if index >= self.len() {
            return Err(TensorError::invalid_argument(format!(
                "Index {} out of bounds for dataset of length {}",
                index,
                self.len()
            )));
        }

        // Create slice ranges for the specific index
        let mut feature_ranges = Vec::new();
        let mut label_ranges = Vec::new();

        // For the first dimension (batch dimension), slice to get single index
        feature_ranges.push(index..index + 1);
        label_ranges.push(index..index + 1);

        // For remaining dimensions, take all elements
        for i in 1..self.features.shape().rank() {
            feature_ranges.push(0..self.features.shape().dims()[i]);
        }
        for i in 1..self.labels.shape().rank() {
            label_ranges.push(0..self.labels.shape().dims()[i]);
        }

        // Slice the tensors
        let feature_slice = slice(&self.features, &feature_ranges)?;
        let label_slice = slice(&self.labels, &label_ranges)?;

        // Squeeze the first dimension (remove batch dimension of size 1)
        let feature_squeezed = squeeze_first_dim(&feature_slice)?;
        let label_squeezed = squeeze_first_dim(&label_slice)?;

        Ok((feature_squeezed, label_squeezed))
    }
}

/// Helper function to squeeze the first dimension of a tensor
fn squeeze_first_dim<T>(tensor: &Tensor<T>) -> Result<Tensor<T>>
where
    T: Clone + Default + scirs2_core::numeric::Zero + Send + Sync + 'static,
{
    let shape = tensor.shape();
    if shape.rank() == 0 {
        return Ok(tensor.clone());
    }

    if shape.dims()[0] != 1 {
        return Err(TensorError::invalid_argument(format!(
            "Cannot squeeze dimension of size {}",
            shape.dims()[0]
        )));
    }

    let new_shape: Vec<usize> = shape.dims()[1..].to_vec();
    tenflowers_core::ops::reshape(tensor, &new_shape)
}

pub struct BatchedDataset<T, D: Dataset<T>> {
    dataset: D,
    batch_size: usize,
    current_index: usize,
    _phantom: PhantomData<T>,
}

impl<T, D: Dataset<T>> Iterator for BatchedDataset<T, D> {
    type Item = Vec<(Tensor<T>, Tensor<T>)>;

    fn next(&mut self) -> Option<Self::Item> {
        if self.current_index >= self.dataset.len() {
            return None;
        }

        let mut batch = Vec::new();
        let end_index = (self.current_index + self.batch_size).min(self.dataset.len());

        for i in self.current_index..end_index {
            match self.dataset.get(i) {
                Ok(sample) => batch.push(sample),
                Err(_) => break, // Stop on error, return partial batch if any
            }
        }

        self.current_index = end_index;

        if batch.is_empty() {
            None
        } else {
            Some(batch)
        }
    }
}

/// Dataset concatenation - combines multiple datasets into one
pub struct ConcatDataset<T, D: Dataset<T>> {
    datasets: Vec<D>,
    cumulative_lengths: Vec<usize>,
    total_length: usize,
    _phantom: PhantomData<T>,
}

impl<T, D: Dataset<T>> ConcatDataset<T, D> {
    pub fn new(datasets: Vec<D>) -> Self {
        let mut cumulative_lengths = Vec::with_capacity(datasets.len());
        let mut total_length = 0;

        for dataset in &datasets {
            total_length += dataset.len();
            cumulative_lengths.push(total_length);
        }

        Self {
            datasets,
            cumulative_lengths,
            total_length,
            _phantom: PhantomData,
        }
    }

    /// Find which dataset and local index for a global index
    fn find_dataset_and_index(&self, global_index: usize) -> Result<(usize, usize)> {
        for (dataset_idx, &cumulative_len) in self.cumulative_lengths.iter().enumerate() {
            if global_index < cumulative_len {
                let local_index = if dataset_idx == 0 {
                    global_index
                } else {
                    global_index - self.cumulative_lengths[dataset_idx - 1]
                };
                return Ok((dataset_idx, local_index));
            }
        }
        Err(TensorError::invalid_argument(format!(
            "Index {} out of bounds for dataset of total length {}",
            global_index, self.total_length
        )))
    }
}

impl<T, D: Dataset<T>> Dataset<T> for ConcatDataset<T, D> {
    fn len(&self) -> usize {
        self.total_length
    }

    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)> {
        if index >= self.total_length {
            return Err(TensorError::invalid_argument(format!(
                "Index {} out of bounds for dataset of length {}",
                index, self.total_length
            )));
        }

        let (dataset_idx, local_index) = self.find_dataset_and_index(index)?;
        self.datasets[dataset_idx].get(local_index)
    }
}

/// Dataset filtering - creates a view of a dataset with only indices that match a predicate
pub struct FilteredDataset<T, D: Dataset<T>, F: Fn(&(Tensor<T>, Tensor<T>)) -> bool> {
    dataset: D,
    valid_indices: Vec<usize>,
    _phantom: PhantomData<(T, F)>,
}

impl<T, D: Dataset<T>, F: Fn(&(Tensor<T>, Tensor<T>)) -> bool> FilteredDataset<T, D, F> {
    pub fn new(dataset: D, predicate: F) -> Result<Self> {
        let mut valid_indices = Vec::new();

        for i in 0..dataset.len() {
            match dataset.get(i) {
                Ok(sample) => {
                    if predicate(&sample) {
                        valid_indices.push(i);
                    }
                }
                Err(_) => continue, // Skip invalid samples
            }
        }

        Ok(Self {
            dataset,
            valid_indices,
            _phantom: PhantomData,
        })
    }
}

impl<T, D: Dataset<T>, F: Fn(&(Tensor<T>, Tensor<T>)) -> bool> Dataset<T>
    for FilteredDataset<T, D, F>
{
    fn len(&self) -> usize {
        self.valid_indices.len()
    }

    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)> {
        if index >= self.valid_indices.len() {
            return Err(TensorError::invalid_argument(format!(
                "Index {} out of bounds for filtered dataset of length {}",
                index,
                self.valid_indices.len()
            )));
        }

        let actual_index = self.valid_indices[index];
        self.dataset.get(actual_index)
    }
}

/// Dataset splitting - splits a dataset into train/validation/test sets
pub struct DatasetSplit<T, D: Dataset<T>> {
    pub train: SubsetDataset<T, Arc<D>>,
    pub validation: Option<SubsetDataset<T, Arc<D>>>,
    pub test: Option<SubsetDataset<T, Arc<D>>>,
}

/// Subset dataset - creates a view of a dataset with only specified indices
pub struct SubsetDataset<T, D: Dataset<T>> {
    dataset: D,
    indices: Vec<usize>,
    _phantom: PhantomData<T>,
}

impl<T, D: Dataset<T>> SubsetDataset<T, D> {
    pub fn new(dataset: D, indices: Vec<usize>) -> Self {
        Self {
            dataset,
            indices,
            _phantom: PhantomData,
        }
    }
}

impl<T, D: Dataset<T>> Dataset<T> for SubsetDataset<T, D> {
    fn len(&self) -> usize {
        self.indices.len()
    }

    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)> {
        if index >= self.indices.len() {
            return Err(TensorError::invalid_argument(format!(
                "Index {} out of bounds for subset dataset of length {}",
                index,
                self.indices.len()
            )));
        }

        let actual_index = self.indices[index];
        self.dataset.get(actual_index)
    }
}

/// Dataset merging - combines multiple datasets with different modalities
pub struct MergedDataset<T, D1: Dataset<T>, D2: Dataset<T>> {
    dataset1: D1,
    dataset2: D2,
    merge_strategy: MergeStrategy,
    _phantom: PhantomData<T>,
}

/// Strategy for merging datasets
#[derive(Debug, Clone)]
pub enum MergeStrategy {
    /// Concatenate features horizontally
    FeatureConcatenation,
    /// Average features element-wise
    FeatureAverage,
    /// Use features from first dataset, labels from second
    FeatureFromFirst,
    /// Use features from second dataset, labels from first
    FeatureFromSecond,
    /// Custom merge function
    Custom,
}

impl<T, D1: Dataset<T>, D2: Dataset<T>> MergedDataset<T, D1, D2> {
    /// Create a new merged dataset with feature concatenation
    pub fn new_concatenated(dataset1: D1, dataset2: D2) -> Result<Self> {
        if dataset1.len() != dataset2.len() {
            return Err(TensorError::invalid_argument(format!(
                "Dataset lengths must match: {} vs {}",
                dataset1.len(),
                dataset2.len()
            )));
        }

        Ok(Self {
            dataset1,
            dataset2,
            merge_strategy: MergeStrategy::FeatureConcatenation,
            _phantom: PhantomData,
        })
    }

    /// Create a new merged dataset with feature averaging
    pub fn new_averaged(dataset1: D1, dataset2: D2) -> Result<Self> {
        if dataset1.len() != dataset2.len() {
            return Err(TensorError::invalid_argument(format!(
                "Dataset lengths must match: {} vs {}",
                dataset1.len(),
                dataset2.len()
            )));
        }

        Ok(Self {
            dataset1,
            dataset2,
            merge_strategy: MergeStrategy::FeatureAverage,
            _phantom: PhantomData,
        })
    }

    /// Create a new merged dataset using features from first dataset and labels from second
    pub fn new_features_from_first(dataset1: D1, dataset2: D2) -> Result<Self> {
        if dataset1.len() != dataset2.len() {
            return Err(TensorError::invalid_argument(format!(
                "Dataset lengths must match: {} vs {}",
                dataset1.len(),
                dataset2.len()
            )));
        }

        Ok(Self {
            dataset1,
            dataset2,
            merge_strategy: MergeStrategy::FeatureFromFirst,
            _phantom: PhantomData,
        })
    }

    /// Create a new merged dataset using features from second dataset and labels from first
    pub fn new_features_from_second(dataset1: D1, dataset2: D2) -> Result<Self> {
        if dataset1.len() != dataset2.len() {
            return Err(TensorError::invalid_argument(format!(
                "Dataset lengths must match: {} vs {}",
                dataset1.len(),
                dataset2.len()
            )));
        }

        Ok(Self {
            dataset1,
            dataset2,
            merge_strategy: MergeStrategy::FeatureFromSecond,
            _phantom: PhantomData,
        })
    }

    /// Merge two tensors based on the merge strategy
    fn merge_tensors(&self, tensor1: &Tensor<T>, tensor2: &Tensor<T>) -> Result<Tensor<T>>
    where
        T: Clone
            + Default
            + scirs2_core::numeric::Zero
            + scirs2_core::numeric::Float
            + Send
            + Sync
            + 'static,
    {
        match self.merge_strategy {
            MergeStrategy::FeatureConcatenation => {
                // Concatenate tensors along the feature dimension
                let data1 = tensor1.as_slice().ok_or_else(|| {
                    TensorError::invalid_argument(
                        "Cannot access tensor data (GPU tensor not supported)".to_string(),
                    )
                })?;
                let data2 = tensor2.as_slice().ok_or_else(|| {
                    TensorError::invalid_argument(
                        "Cannot access tensor data (GPU tensor not supported)".to_string(),
                    )
                })?;
                let mut merged_data = Vec::new();
                merged_data.extend_from_slice(data1);
                merged_data.extend_from_slice(data2);

                let new_shape = vec![data1.len() + data2.len()];
                Tensor::from_vec(merged_data, &new_shape)
            }
            MergeStrategy::FeatureAverage => {
                // Average tensors element-wise
                let data1 = tensor1.as_slice().ok_or_else(|| {
                    TensorError::invalid_argument(
                        "Cannot access tensor data (GPU tensor not supported)".to_string(),
                    )
                })?;
                let data2 = tensor2.as_slice().ok_or_else(|| {
                    TensorError::invalid_argument(
                        "Cannot access tensor data (GPU tensor not supported)".to_string(),
                    )
                })?;

                if data1.len() != data2.len() {
                    return Err(TensorError::invalid_argument(
                        "Cannot average tensors of different sizes".to_string(),
                    ));
                }

                let mut averaged_data = Vec::new();
                let two = T::from(2.0).expect("conversion of 2.0 to float type should succeed");
                for (v1, v2) in data1.iter().zip(data2.iter()) {
                    let avg = (*v1 + *v2) / two;
                    averaged_data.push(avg);
                }

                Tensor::from_vec(averaged_data, tensor1.shape().dims())
            }
            MergeStrategy::FeatureFromFirst => Ok(tensor1.clone()),
            MergeStrategy::FeatureFromSecond => Ok(tensor2.clone()),
            MergeStrategy::Custom => {
                // For custom merge, just return first tensor for now
                // This could be extended to accept custom merge functions
                Ok(tensor1.clone())
            }
        }
    }
}

impl<T, D1: Dataset<T>, D2: Dataset<T>> Dataset<T> for MergedDataset<T, D1, D2>
where
    T: Clone
        + Default
        + scirs2_core::numeric::Zero
        + scirs2_core::numeric::Float
        + Send
        + Sync
        + 'static,
{
    fn len(&self) -> usize {
        self.dataset1.len()
    }

    fn get(&self, index: usize) -> Result<(Tensor<T>, Tensor<T>)> {
        if index >= self.dataset1.len() {
            return Err(TensorError::invalid_argument(format!(
                "Index {} out of bounds for merged dataset of length {}",
                index,
                self.dataset1.len()
            )));
        }

        let (features1, labels1) = self.dataset1.get(index)?;
        let (features2, labels2) = self.dataset2.get(index)?;

        let merged_features = self.merge_tensors(&features1, &features2)?;

        // For labels, use the strategy to determine which label to use
        let merged_labels = match self.merge_strategy {
            MergeStrategy::FeatureFromFirst => labels1,
            MergeStrategy::FeatureFromSecond => labels2,
            _ => labels1, // Default to first dataset's labels
        };

        Ok((merged_features, merged_labels))
    }
}

/// Dataset splitting utilities
pub struct DatasetSplitter;

impl DatasetSplitter {
    /// Split dataset into train/validation/test sets with given ratios
    pub fn split<T, D: Dataset<T>>(
        dataset: D,
        train_ratio: f64,
        val_ratio: Option<f64>,
        test_ratio: Option<f64>,
        shuffle: bool,
    ) -> Result<DatasetSplit<T, D>> {
        let total_len = dataset.len();
        if total_len == 0 {
            return Err(TensorError::invalid_argument(
                "Cannot split empty dataset".to_string(),
            ));
        }

        // Validate ratios
        let val_ratio = val_ratio.unwrap_or(0.0);
        let test_ratio = test_ratio.unwrap_or(0.0);

        if train_ratio + val_ratio + test_ratio > 1.0 {
            return Err(TensorError::invalid_argument(
                "Sum of ratios cannot exceed 1.0".to_string(),
            ));
        }

        // Create indices
        let mut indices: Vec<usize> = (0..total_len).collect();

        // Shuffle if requested
        if shuffle {
            use scirs2_core::random::rand_prelude::*;
            let mut rng = rng();
            indices.shuffle(&mut rng);
        }

        // Calculate split points
        let train_end = (total_len as f64 * train_ratio) as usize;
        let val_end = train_end + (total_len as f64 * val_ratio) as usize;
        let test_end = val_end + (total_len as f64 * test_ratio) as usize;

        // Create subset datasets using Arc for sharing
        let dataset_arc = Arc::new(dataset);
        let train_indices = indices[0..train_end].to_vec();
        let train = SubsetDataset::new(dataset_arc.clone(), train_indices);

        let validation = if val_ratio > 0.0 {
            let val_indices = indices[train_end..val_end].to_vec();
            Some(SubsetDataset::new(dataset_arc.clone(), val_indices))
        } else {
            None
        };

        let test = if test_ratio > 0.0 {
            let test_indices = indices[val_end..test_end].to_vec();
            Some(SubsetDataset::new(dataset_arc.clone(), test_indices))
        } else {
            None
        };

        Ok(DatasetSplit {
            train,
            validation,
            test,
        })
    }

    /// Split dataset into k-folds for cross-validation
    #[allow(clippy::type_complexity)]
    pub fn k_fold<T, D: Dataset<T>>(
        dataset: D,
        k: usize,
        shuffle: bool,
    ) -> Result<Vec<(SubsetDataset<T, Arc<D>>, SubsetDataset<T, Arc<D>>)>> {
        if k <= 1 {
            return Err(TensorError::invalid_argument(
                "K must be greater than 1".to_string(),
            ));
        }

        let total_len = dataset.len();
        if total_len == 0 {
            return Err(TensorError::invalid_argument(
                "Cannot split empty dataset".to_string(),
            ));
        }

        let mut indices: Vec<usize> = (0..total_len).collect();

        if shuffle {
            use scirs2_core::random::rand_prelude::*;
            let mut rng = rng();
            indices.shuffle(&mut rng);
        }

        let fold_size = total_len / k;
        let mut folds = Vec::new();
        let dataset_arc = Arc::new(dataset);

        for i in 0..k {
            let start = i * fold_size;
            let end = if i == k - 1 {
                total_len
            } else {
                (i + 1) * fold_size
            };

            let val_indices = indices[start..end].to_vec();
            let train_indices: Vec<usize> = indices[0..start]
                .iter()
                .chain(indices[end..].iter())
                .cloned()
                .collect();

            let train_dataset = SubsetDataset::new(dataset_arc.clone(), train_indices);
            let val_dataset = SubsetDataset::new(dataset_arc.clone(), val_indices);

            folds.push((train_dataset, val_dataset));
        }

        Ok(folds)
    }

    /// Stratified split - maintains class distribution across splits
    pub fn stratified_split<T, D: Dataset<T>>(
        dataset: D,
        train_ratio: f64,
        val_ratio: Option<f64>,
        extract_class: fn(&(Tensor<T>, Tensor<T>)) -> usize,
    ) -> Result<(Vec<usize>, Vec<usize>)> {
        let total_len = dataset.len();
        if total_len == 0 {
            return Err(TensorError::invalid_argument(
                "Cannot split empty dataset".to_string(),
            ));
        }

        // Group indices by class
        let mut class_indices: std::collections::HashMap<usize, Vec<usize>> =
            std::collections::HashMap::new();

        for i in 0..total_len {
            if let Ok(sample) = dataset.get(i) {
                let class = extract_class(&sample);
                class_indices.entry(class).or_default().push(i);
            }
        }

        let mut train_indices = Vec::new();
        let mut val_indices = Vec::new();

        // Split each class proportionally
        for (_, mut indices) in class_indices {
            // Shuffle class indices
            use scirs2_core::random::rand_prelude::*;
            let mut rng = rng();
            indices.shuffle(&mut rng);

            let class_len = indices.len();
            let train_end = (class_len as f64 * train_ratio) as usize;

            train_indices.extend(indices[0..train_end].iter());

            if let Some(val_ratio) = val_ratio {
                let val_end = train_end + (class_len as f64 * val_ratio) as usize;
                val_indices.extend(indices[train_end..val_end].iter());
            }
        }

        Ok((train_indices, val_indices))
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use tenflowers_core::Tensor;

    #[test]
    fn test_tensor_dataset_creation() {
        let features = Tensor::<f32>::from_vec(vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0], &[3, 2])
            .expect("test: tensor creation should succeed");
        let labels = Tensor::<f32>::from_vec(vec![0.0, 1.0, 2.0], &[3])
            .expect("test: tensor creation should succeed");

        let dataset = TensorDataset::new(features, labels);
        assert_eq!(dataset.len(), 3);
        assert!(!dataset.is_empty());
    }

    #[test]
    fn test_tensor_dataset_get() {
        let features = Tensor::<f32>::from_vec(
            vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0],
            &[3, 2], // 3 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels = Tensor::<f32>::from_vec(
            vec![10.0, 20.0, 30.0],
            &[3], // 3 labels
        )
        .expect("test: operation should succeed");

        let dataset = TensorDataset::new(features, labels);

        // Test getting first sample
        let (feat, label) = dataset.get(0).expect("index should be in bounds");
        assert_eq!(feat.shape().dims(), &[2]); // Should be squeezed from [1, 2] to [2]
        assert_eq!(label.shape().dims(), &[] as &[usize]); // Should be squeezed from [1] to scalar

        // Test getting second sample
        let (feat2, label2) = dataset.get(1).expect("index should be in bounds");
        assert_eq!(feat2.shape().dims(), &[2]);
        assert_eq!(label2.shape().dims(), &[] as &[usize]);

        // Test out of bounds
        assert!(dataset.get(3).is_err());
    }

    #[test]
    fn test_batched_dataset() {
        let features = Tensor::<f32>::from_vec(
            vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0],
            &[4, 2], // 4 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels = Tensor::<f32>::from_vec(
            vec![10.0, 20.0, 30.0, 40.0],
            &[4], // 4 labels
        )
        .expect("test: operation should succeed");

        let dataset = TensorDataset::new(features, labels);
        let mut batched = dataset.batch(2);

        // First batch should have 2 samples
        let batch1 = batched.next().expect("test: iterator should have next");
        assert_eq!(batch1.len(), 2);

        // Second batch should have 2 samples
        let batch2 = batched.next().expect("test: iterator should have next");
        assert_eq!(batch2.len(), 2);

        // No more batches
        assert!(batched.next().is_none());
    }

    #[test]
    fn test_batched_dataset_partial_batch() {
        let features = Tensor::<f32>::from_vec(
            vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0],
            &[3, 2], // 3 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels = Tensor::<f32>::from_vec(
            vec![10.0, 20.0, 30.0],
            &[3], // 3 labels
        )
        .expect("test: operation should succeed");

        let dataset = TensorDataset::new(features, labels);
        let mut batched = dataset.batch(2);

        // First batch should have 2 samples
        let batch1 = batched.next().expect("test: iterator should have next");
        assert_eq!(batch1.len(), 2);

        // Second batch should have 1 sample (partial)
        let batch2 = batched.next().expect("test: iterator should have next");
        assert_eq!(batch2.len(), 1);

        // No more batches
        assert!(batched.next().is_none());
    }

    #[test]
    fn test_merged_dataset_concatenation() {
        // Create two datasets
        let features1 = Tensor::<f32>::from_vec(
            vec![1.0, 2.0, 3.0, 4.0],
            &[2, 2], // 2 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels1 = Tensor::<f32>::from_vec(vec![10.0, 20.0], &[2])
            .expect("test: tensor creation should succeed");
        let dataset1 = TensorDataset::new(features1, labels1);

        let features2 = Tensor::<f32>::from_vec(
            vec![5.0, 6.0, 7.0, 8.0],
            &[2, 2], // 2 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels2 = Tensor::<f32>::from_vec(vec![30.0, 40.0], &[2])
            .expect("test: tensor creation should succeed");
        let dataset2 = TensorDataset::new(features2, labels2);

        // Create merged dataset
        let merged = MergedDataset::new_concatenated(dataset1, dataset2)
            .expect("test: operation should succeed");

        assert_eq!(merged.len(), 2);

        // Test getting first sample
        let (features, labels) = merged.get(0).expect("index should be in bounds");
        assert_eq!(features.shape().dims(), &[4]); // 2 + 2 features concatenated
        assert_eq!(labels.shape().dims(), &[] as &[usize]);
    }

    #[test]
    fn test_merged_dataset_averaging() {
        // Create two datasets with same feature size
        let features1 = Tensor::<f32>::from_vec(
            vec![1.0, 2.0, 3.0, 4.0],
            &[2, 2], // 2 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels1 = Tensor::<f32>::from_vec(vec![10.0, 20.0], &[2])
            .expect("test: tensor creation should succeed");
        let dataset1 = TensorDataset::new(features1, labels1);

        let features2 = Tensor::<f32>::from_vec(
            vec![5.0, 6.0, 7.0, 8.0],
            &[2, 2], // 2 samples, 2 features each
        )
        .expect("test: operation should succeed");
        let labels2 = Tensor::<f32>::from_vec(vec![30.0, 40.0], &[2])
            .expect("test: tensor creation should succeed");
        let dataset2 = TensorDataset::new(features2, labels2);

        // Create merged dataset with averaging
        let merged = MergedDataset::new_averaged(dataset1, dataset2)
            .expect("test: operation should succeed");

        assert_eq!(merged.len(), 2);

        // Test getting first sample - should be averaged
        let (features, _) = merged.get(0).expect("index should be in bounds");
        assert_eq!(features.shape().dims(), &[2]); // Same feature size
                                                   // First sample should be (1+5)/2=3, (2+6)/2=4
        let data = features.as_slice().expect("tensor should be contiguous");
        assert!((data[0] - 3.0).abs() < 1e-6);
        assert!((data[1] - 4.0).abs() < 1e-6);
    }

    #[test]
    fn test_merged_dataset_mismatched_lengths() {
        // Create two datasets with different lengths
        let features1 = Tensor::<f32>::from_vec(
            vec![1.0, 2.0, 3.0, 4.0],
            &[2, 2], // 2 samples
        )
        .expect("test: operation should succeed");
        let labels1 = Tensor::<f32>::from_vec(vec![10.0, 20.0], &[2])
            .expect("test: tensor creation should succeed");
        let dataset1 = TensorDataset::new(features1, labels1);

        let features2 = Tensor::<f32>::from_vec(
            vec![5.0, 6.0, 7.0, 8.0, 9.0, 10.0],
            &[3, 2], // 3 samples
        )
        .expect("test: operation should succeed");
        let labels2 = Tensor::<f32>::from_vec(vec![30.0, 40.0, 50.0], &[3])
            .expect("test: tensor creation should succeed");
        let dataset2 = TensorDataset::new(features2, labels2);

        // Should fail with mismatched lengths
        assert!(MergedDataset::new_concatenated(dataset1, dataset2).is_err());
    }
}