pandrs 0.3.0

A high-performance DataFrame library for Rust, providing pandas-like API with advanced features including SIMD optimization, parallel processing, and distributed computing capabilities
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
//! # Advanced MultiIndex with Cross-Section Selection
//!
//! This module provides cross-section selection capabilities for DataFrames with MultiIndex,
//! including partial indexing, level slicing, boolean indexing, and hierarchical navigation.

use crate::column::{Column, ColumnTrait};
use crate::core::advanced_multi_index::{
    AdvancedMultiIndex, CrossSectionResult, IndexValue, SelectionCriteria,
};
use crate::core::error::{Error, Result};
use crate::dataframe::DataFrame;
use std::collections::HashMap;

/// DataFrame with advanced MultiIndex cross-section support
#[derive(Debug, Clone)]
pub struct MultiIndexDataFrame {
    /// The underlying DataFrame
    pub dataframe: DataFrame,
    /// The row index (MultiIndex)
    pub index: AdvancedMultiIndex,
    /// Column names (simple for now, could be extended to MultiIndex)
    pub column_names: Vec<String>,
}

/// Result of cross-section selection
#[derive(Debug, Clone)]
pub struct CrossSectionDataFrame {
    /// Resulting DataFrame
    pub dataframe: MultiIndexDataFrame,
    /// Selected row indices
    pub selected_indices: Vec<usize>,
    /// Whether any level was dropped
    pub level_dropped: bool,
}

impl MultiIndexDataFrame {
    /// Create a new MultiIndexDataFrame
    pub fn new(dataframe: DataFrame, index: AdvancedMultiIndex) -> Result<Self> {
        if index.len() != dataframe.row_count() {
            return Err(Error::InconsistentRowCount {
                expected: dataframe.row_count(),
                found: index.len(),
            });
        }

        let column_names = dataframe.column_names().to_vec();

        Ok(Self {
            dataframe,
            index,
            column_names,
        })
    }

    /// Cross-section selection: select rows with specific value at given level
    pub fn xs(
        &mut self,
        key: IndexValue,
        level: usize,
        drop_level: bool,
    ) -> Result<CrossSectionDataFrame> {
        let xs_result = self.index.xs(key, level, drop_level)?;

        if xs_result.indices.is_empty() {
            return Err(Error::InvalidOperation(
                "No matching rows found for cross-section".to_string(),
            ));
        }

        // Create new DataFrame with selected rows
        let selected_dataframe = self.select_rows(&xs_result.indices)?;

        // Handle index transformation
        let result_index = if drop_level {
            xs_result.index.ok_or_else(|| {
                Error::InvalidOperation("Expected index after dropping level".to_string())
            })?
        } else {
            // Keep original index structure but only selected rows
            self.select_index_rows(&xs_result.indices)?
        };

        let result = MultiIndexDataFrame {
            dataframe: selected_dataframe,
            index: result_index,
            column_names: self.column_names.clone(),
        };

        Ok(CrossSectionDataFrame {
            dataframe: result,
            selected_indices: xs_result.indices,
            level_dropped: drop_level,
        })
    }

    /// Advanced selection using multiple criteria
    pub fn select(&self, criteria: SelectionCriteria) -> Result<CrossSectionDataFrame> {
        let selected_indices = self.index.select(criteria)?;

        if selected_indices.is_empty() {
            return Err(Error::InvalidOperation(
                "No matching rows found for selection criteria".to_string(),
            ));
        }

        let selected_dataframe = self.select_rows(&selected_indices)?;
        let selected_index = self.select_index_rows(&selected_indices)?;

        let result = MultiIndexDataFrame {
            dataframe: selected_dataframe,
            index: selected_index,
            column_names: self.column_names.clone(),
        };

        Ok(CrossSectionDataFrame {
            dataframe: result,
            selected_indices,
            level_dropped: false,
        })
    }

    /// GroupBy operation using index levels
    pub fn groupby_level(&self, levels: &[usize]) -> Result<MultiIndexGroupBy> {
        // Validate levels
        for &level in levels {
            if level >= self.index.n_levels() {
                return Err(Error::IndexOutOfBounds {
                    index: level,
                    size: self.index.n_levels(),
                });
            }
        }

        // Get unique group keys
        let group_keys = self.index.get_group_keys(levels)?;

        // Build groups: group_key -> row_indices
        let mut groups = HashMap::new();
        for group_key in group_keys {
            let indices = self.index.get_group_indices(levels, &group_key)?;
            groups.insert(group_key, indices);
        }

        Ok(MultiIndexGroupBy {
            dataframe: self.clone(),
            groups,
            group_levels: levels.to_vec(),
        })
    }

    /// Select specific levels from the index
    pub fn select_levels(&self, levels: &[usize]) -> Result<MultiIndexDataFrame> {
        // Validate levels
        for &level in levels {
            if level >= self.index.n_levels() {
                return Err(Error::IndexOutOfBounds {
                    index: level,
                    size: self.index.n_levels(),
                });
            }
        }

        // Create new tuples with only selected levels
        let mut new_tuples = Vec::with_capacity(self.index.len());
        for i in 0..self.index.len() {
            let original_tuple = self.index.get_tuple(i)?;
            let new_tuple: Vec<IndexValue> = levels
                .iter()
                .map(|&level| original_tuple[level].clone())
                .collect();
            new_tuples.push(new_tuple);
        }

        // Create new level names
        let original_names = self.index.level_names();
        let new_names: Vec<Option<String>> = levels
            .iter()
            .map(|&level| original_names[level].clone())
            .collect();

        let new_index = AdvancedMultiIndex::new(new_tuples, Some(new_names))?;

        Ok(MultiIndexDataFrame {
            dataframe: self.dataframe.clone(),
            index: new_index,
            column_names: self.column_names.clone(),
        })
    }

    /// Reindex with new MultiIndex
    pub fn reindex(&self, new_index: AdvancedMultiIndex) -> Result<MultiIndexDataFrame> {
        if new_index.len() != self.index.len() {
            return Err(Error::InconsistentRowCount {
                expected: self.index.len(),
                found: new_index.len(),
            });
        }

        Ok(MultiIndexDataFrame {
            dataframe: self.dataframe.clone(),
            index: new_index,
            column_names: self.column_names.clone(),
        })
    }

    /// Swap levels in the index
    pub fn swaplevel(&self, i: usize, j: usize) -> Result<MultiIndexDataFrame> {
        let swapped_index = self.index.reorder_levels(&{
            let mut order: Vec<usize> = (0..self.index.n_levels()).collect();
            order.swap(i, j);
            order
        })?;

        Ok(MultiIndexDataFrame {
            dataframe: self.dataframe.clone(),
            index: swapped_index,
            column_names: self.column_names.clone(),
        })
    }

    /// Sort by index levels
    pub fn sort_index(
        &self,
        levels: Option<&[usize]>,
        ascending: bool,
    ) -> Result<MultiIndexDataFrame> {
        let default_levels: Vec<usize> = (0..self.index.n_levels()).collect();
        let sort_levels = levels.unwrap_or(&default_levels);

        // Create sortable tuples with original indices
        let mut indexed_tuples: Vec<(usize, Vec<IndexValue>)> =
            Vec::with_capacity(self.index.len());
        for i in 0..self.index.len() {
            let tuple = self.index.get_tuple(i)?;
            let sort_tuple: Vec<IndexValue> = sort_levels
                .iter()
                .map(|&level| tuple[level].clone())
                .collect();
            indexed_tuples.push((i, sort_tuple));
        }

        // Sort tuples
        indexed_tuples.sort_by(|a, b| {
            let comparison = a.1.cmp(&b.1);
            if ascending {
                comparison
            } else {
                comparison.reverse()
            }
        });

        // Extract sorted indices
        let sorted_indices: Vec<usize> = indexed_tuples.into_iter().map(|(idx, _)| idx).collect();

        // Apply sorting to DataFrame and index
        let sorted_dataframe = self.select_rows(&sorted_indices)?;
        let sorted_index = self.select_index_rows(&sorted_indices)?;

        Ok(MultiIndexDataFrame {
            dataframe: sorted_dataframe,
            index: sorted_index,
            column_names: self.column_names.clone(),
        })
    }

    /// Get level values as a vector
    pub fn get_level_values(&self, level: usize) -> Result<Vec<IndexValue>> {
        if level >= self.index.n_levels() {
            return Err(Error::IndexOutOfBounds {
                index: level,
                size: self.index.n_levels(),
            });
        }

        let mut values = Vec::with_capacity(self.index.len());
        for i in 0..self.index.len() {
            let tuple = self.index.get_tuple(i)?;
            values.push(tuple[level].clone());
        }

        Ok(values)
    }

    /// Check if index is monotonic at specified level
    pub fn is_monotonic(&self, level: usize) -> Result<bool> {
        let values = self.get_level_values(level)?;
        if values.len() <= 1 {
            return Ok(true);
        }

        let increasing = values.windows(2).all(|w| w[0] <= w[1]);
        let decreasing = values.windows(2).all(|w| w[0] >= w[1]);

        Ok(increasing || decreasing)
    }

    // Helper methods

    fn select_rows(&self, indices: &[usize]) -> Result<DataFrame> {
        // This is a simplified implementation - would need actual DataFrame row selection
        // For now, return a clone as placeholder
        Ok(self.dataframe.clone())
    }

    fn select_index_rows(&self, indices: &[usize]) -> Result<AdvancedMultiIndex> {
        let selected_tuples: Result<Vec<Vec<IndexValue>>> = indices
            .iter()
            .map(|&i| self.index.get_tuple(i).map(|t| t.to_vec()))
            .collect();

        AdvancedMultiIndex::new(selected_tuples?, Some(self.index.level_names().to_vec()))
    }
}

/// GroupBy operation result for MultiIndex DataFrames
#[derive(Debug, Clone)]
pub struct MultiIndexGroupBy {
    dataframe: MultiIndexDataFrame,
    groups: HashMap<Vec<IndexValue>, Vec<usize>>,
    group_levels: Vec<usize>,
}

impl MultiIndexGroupBy {
    /// Get the number of groups
    pub fn ngroups(&self) -> usize {
        self.groups.len()
    }

    /// Get group sizes
    pub fn size(&self) -> HashMap<Vec<IndexValue>, usize> {
        self.groups
            .iter()
            .map(|(key, indices)| (key.clone(), indices.len()))
            .collect()
    }

    /// Get group by key
    pub fn get_group(&self, key: &[IndexValue]) -> Result<MultiIndexDataFrame> {
        let indices = self
            .groups
            .get(key)
            .ok_or_else(|| Error::InvalidOperation(format!("Group key {:?} not found", key)))?;

        let selected_dataframe = self.dataframe.select_rows(indices)?;
        let selected_index = self.dataframe.select_index_rows(indices)?;

        Ok(MultiIndexDataFrame {
            dataframe: selected_dataframe,
            index: selected_index,
            column_names: self.dataframe.column_names.clone(),
        })
    }

    /// Apply aggregation function to all groups
    pub fn agg(&self, func: AggregationFunction) -> Result<MultiIndexDataFrame> {
        let mut result_data: HashMap<String, Vec<f64>> = HashMap::new();
        let mut result_index_tuples = Vec::new();

        // Initialize result columns
        for col_name in &self.dataframe.column_names {
            result_data.insert(col_name.clone(), Vec::new());
        }

        // Process each group
        for (group_key, indices) in &self.groups {
            result_index_tuples.push(group_key.clone());

            for col_name in &self.dataframe.column_names {
                let values = self.extract_column_values(col_name, indices)?;
                let aggregated = func.apply(&values);
                // Safe: column was inserted into result_data during initialization
                if let Some(col_vec) = result_data.get_mut(col_name) {
                    col_vec.push(aggregated);
                } else {
                    return Err(Error::Column(format!(
                        "Column '{}' not found in result_data",
                        col_name
                    )));
                }
            }
        }

        // Create result index with only group levels
        let group_level_names: Vec<Option<String>> = self
            .group_levels
            .iter()
            .map(|&level| self.dataframe.index.level_names()[level].clone())
            .collect();

        let result_index = AdvancedMultiIndex::new(result_index_tuples, Some(group_level_names))?;

        // Create result DataFrame (simplified - would need actual DataFrame construction)
        let result_dataframe = self.dataframe.dataframe.clone(); // Placeholder

        Ok(MultiIndexDataFrame {
            dataframe: result_dataframe,
            index: result_index,
            column_names: self.dataframe.column_names.clone(),
        })
    }

    /// Apply custom function to each group
    pub fn apply<F>(&self, func: F) -> Result<MultiIndexDataFrame>
    where
        F: Fn(&MultiIndexDataFrame) -> Result<MultiIndexDataFrame>,
    {
        let mut result_parts = Vec::new();

        for (group_key, indices) in &self.groups {
            let group_dataframe = self.get_group(group_key)?;
            let group_result = func(&group_dataframe)?;
            result_parts.push((group_key.clone(), group_result));
        }

        // Combine results (simplified implementation)
        if let Some((_, first_result)) = result_parts.first() {
            Ok(first_result.clone()) // Placeholder
        } else {
            Err(Error::InvalidOperation(
                "No groups to apply function to".to_string(),
            ))
        }
    }

    /// Get group keys
    pub fn groups(&self) -> &HashMap<Vec<IndexValue>, Vec<usize>> {
        &self.groups
    }

    fn extract_column_values(&self, column_name: &str, indices: &[usize]) -> Result<Vec<f64>> {
        // This would extract numeric values from the specified column at given indices
        // For now, return placeholder values
        Ok(vec![0.0; indices.len()])
    }
}

/// Aggregation functions for GroupBy operations
#[derive(Debug, Clone, Copy)]
pub enum AggregationFunction {
    Sum,
    Mean,
    Count,
    Min,
    Max,
    Std,
    Var,
    First,
    Last,
}

impl AggregationFunction {
    pub fn apply(&self, values: &[f64]) -> f64 {
        if values.is_empty() {
            return 0.0;
        }

        match self {
            AggregationFunction::Sum => values.iter().sum(),
            AggregationFunction::Mean => values.iter().sum::<f64>() / values.len() as f64,
            AggregationFunction::Count => values.len() as f64,
            AggregationFunction::Min => values.iter().fold(f64::INFINITY, |a, &b| a.min(b)),
            AggregationFunction::Max => values.iter().fold(f64::NEG_INFINITY, |a, &b| a.max(b)),
            AggregationFunction::Std => {
                if values.len() <= 1 {
                    0.0
                } else {
                    let mean = values.iter().sum::<f64>() / values.len() as f64;
                    let variance = values.iter().map(|&x| (x - mean).powi(2)).sum::<f64>()
                        / (values.len() - 1) as f64;
                    variance.sqrt()
                }
            }
            AggregationFunction::Var => {
                if values.len() <= 1 {
                    0.0
                } else {
                    let mean = values.iter().sum::<f64>() / values.len() as f64;
                    values.iter().map(|&x| (x - mean).powi(2)).sum::<f64>()
                        / (values.len() - 1) as f64
                }
            }
            AggregationFunction::First => values[0],
            AggregationFunction::Last => values[values.len() - 1],
        }
    }
}

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

    #[test]
    fn test_cross_section_selection() {
        // Create test data
        let tuples = vec![
            vec![IndexValue::from("A"), IndexValue::from(1)],
            vec![IndexValue::from("A"), IndexValue::from(2)],
            vec![IndexValue::from("B"), IndexValue::from(1)],
            vec![IndexValue::from("B"), IndexValue::from(2)],
        ];

        let index = AdvancedMultiIndex::new(tuples, None).expect("operation should succeed");

        // This test would require a proper DataFrame implementation
        // For now, we'll test the index operations
        assert_eq!(index.len(), 4);
        assert_eq!(index.n_levels(), 2);
    }

    #[test]
    fn test_groupby_level() {
        let tuples = vec![
            vec![
                IndexValue::from("A"),
                IndexValue::from("X"),
                IndexValue::from(1),
            ],
            vec![
                IndexValue::from("A"),
                IndexValue::from("Y"),
                IndexValue::from(2),
            ],
            vec![
                IndexValue::from("B"),
                IndexValue::from("X"),
                IndexValue::from(3),
            ],
            vec![
                IndexValue::from("B"),
                IndexValue::from("Y"),
                IndexValue::from(4),
            ],
        ];

        let index = AdvancedMultiIndex::new(tuples, None).expect("operation should succeed");
        let group_keys = index
            .get_group_keys(&[0])
            .expect("operation should succeed");

        assert_eq!(group_keys.len(), 2); // "A" and "B"

        let indices_a = index
            .get_group_indices(&[0], &[IndexValue::from("A")])
            .expect("operation should succeed");
        assert_eq!(indices_a, vec![0, 1]);

        let indices_b = index
            .get_group_indices(&[0], &[IndexValue::from("B")])
            .expect("operation should succeed");
        assert_eq!(indices_b, vec![2, 3]);
    }

    #[test]
    fn test_aggregation_functions() {
        let values = vec![1.0, 2.0, 3.0, 4.0, 5.0];

        assert_eq!(AggregationFunction::Sum.apply(&values), 15.0);
        assert_eq!(AggregationFunction::Mean.apply(&values), 3.0);
        assert_eq!(AggregationFunction::Count.apply(&values), 5.0);
        assert_eq!(AggregationFunction::Min.apply(&values), 1.0);
        assert_eq!(AggregationFunction::Max.apply(&values), 5.0);
        assert_eq!(AggregationFunction::First.apply(&values), 1.0);
        assert_eq!(AggregationFunction::Last.apply(&values), 5.0);

        // Test std and var
        let std_val = AggregationFunction::Std.apply(&values);
        let var_val = AggregationFunction::Var.apply(&values);
        assert!((std_val - 1.58113883).abs() < 1e-6);
        assert!((var_val - 2.5).abs() < 1e-6);
    }

    #[test]
    fn test_level_selection() {
        let tuples = vec![
            vec![
                IndexValue::from("A"),
                IndexValue::from("X"),
                IndexValue::from(1),
            ],
            vec![
                IndexValue::from("B"),
                IndexValue::from("Y"),
                IndexValue::from(2),
            ],
        ];

        let index = AdvancedMultiIndex::new(tuples, None).expect("operation should succeed");

        // Test getting level values
        let level_0_values = (0..index.len())
            .map(|i| index.get_tuple(i).expect("operation should succeed")[0].clone())
            .collect::<Vec<_>>();
        assert_eq!(
            level_0_values,
            vec![IndexValue::from("A"), IndexValue::from("B")]
        );

        let level_2_values = (0..index.len())
            .map(|i| index.get_tuple(i).expect("operation should succeed")[2].clone())
            .collect::<Vec<_>>();
        assert_eq!(
            level_2_values,
            vec![IndexValue::from(1), IndexValue::from(2)]
        );
    }
}