Data commit

Task/Ordered-partitions/Rust/ordered-partitions.rust

@@ -0,0 +1,38 @@
+use itertools::Itertools;
+
+type NArray = Vec<Vec<Vec<usize>>>;
+
+fn generate_partitions(args: &[usize]) -> NArray {
+    // calculate the sum of all partitions
+    let max = args.iter().sum();
+
+    // generate combinations with the given lengths
+    // for each partition
+    let c = args.iter().fold(vec![], |mut acc, arg| {
+        acc.push((1..=max).combinations(*arg).collect::<Vec<_>>());
+        acc
+    });
+
+    // create a cartesian product of all individual combinations
+    // filter/keep only where all the elements are there and exactly once
+    c.iter()
+        .map(|i| i.iter().cloned())
+        .multi_cartesian_product()
+        .unique()
+        .filter(|x| x.iter().cloned().flatten().unique().count() == max)
+        .collect::<Vec<_>>()
+}
+
+#[allow(clippy::clippy::ptr_arg)]
+fn print_partitions(result: &NArray) {
+    println!("Partitions:");
+    for partition in result {
+        println!("{:?}", partition);
+    }
+}
+fn main() {
+    print_partitions(generate_partitions(&[2, 0, 2]).as_ref());
+    print_partitions(generate_partitions(&[1, 1, 1]).as_ref());
+    print_partitions(generate_partitions(&[2, 3]).as_ref());
+    print_partitions(generate_partitions(&[0]).as_ref());
+}