summaryrefslogtreecommitdiff
path: root/morphology/examples/test_length_sorting.rs
diff options
context:
space:
mode:
authorjacksonfu14 <jackson@fashionunited.com>2025-11-11 08:12:01 +0100
committerJackson Moore <jacksonmoore@tuta.io>2025-11-11 08:12:01 +0100
commitd0e3dc212ea7d855bf5339a5f9904e681e7b363a (patch)
tree4ae71e1392120615759eaf7ec9511a98e194c7fc /morphology/examples/test_length_sorting.rs
parentcf758968d957de0fa2f1bf39a42d633b4fe74616 (diff)
feat: add sort with segregated sequence lengths
Diffstat (limited to 'morphology/examples/test_length_sorting.rs')
-rw-r--r--morphology/examples/test_length_sorting.rs64
1 files changed, 64 insertions, 0 deletions
diff --git a/morphology/examples/test_length_sorting.rs b/morphology/examples/test_length_sorting.rs
new file mode 100644
index 0000000..2163e50
--- /dev/null
+++ b/morphology/examples/test_length_sorting.rs
@@ -0,0 +1,64 @@
+// Test program to demonstrate InterpolateLength vs SegregateLength sorting
+
+use meta_affine::{Sequence, Value};
+use meta_affine::sequence::{sort_sequences, SequenceOptions, LengthSorting, SortingMethod};
+
+fn print_sequences(label: &str, sequences: &[Sequence]) {
+ println!("\n{}:", label);
+ for (i, seq) in sequences.iter().enumerate() {
+ print!(" {}: [", i);
+ for (j, v) in seq.values().iter().enumerate() {
+ if j > 0 { print!(", "); }
+ print!("({},{})", v.outer, v.inner);
+ }
+ println!("] (length {})", seq.length());
+ }
+}
+
+fn main() {
+ // Create sequences of different lengths
+ let sequences = vec![
+ // Length 3
+ Sequence::new(vec![Value::new(1, 0), Value::new(0, 1), Value::new(0, 0)]),
+ // Length 1
+ Sequence::new(vec![Value::new(0, 0)]),
+ // Length 2
+ Sequence::new(vec![Value::new(1, 0), Value::new(0, 0)]),
+ // Length 3
+ Sequence::new(vec![Value::new(0, 1), Value::new(1, 0), Value::new(0, 0)]),
+ // Length 2
+ Sequence::new(vec![Value::new(0, 1), Value::new(0, 0)]),
+ // Length 4
+ Sequence::new(vec![Value::new(1, 0), Value::new(0, 1), Value::new(1, 0), Value::new(0, 0)]),
+ ];
+
+ print_sequences("Original sequences", &sequences);
+
+ // Test InterpolateLength (default) - sequences sorted by content, length mixed in
+ let mut interpolate = sequences.clone();
+ let opts = SequenceOptions::new()
+ .length_sorting(LengthSorting::InterpolateLength)
+ .sorting_method(SortingMethod::DepthFirst);
+ sort_sequences(&mut interpolate, opts);
+
+ print_sequences("InterpolateLength (sorted by content, lengths mixed)", &interpolate);
+ println!(" Explanation: Sequences are sorted by their content values");
+ println!(" Length is only considered when content is equal");
+
+ // Test SegregateLength - sequences grouped by length, then sorted by content within each group
+ let mut segregate = sequences.clone();
+ let opts = SequenceOptions::new()
+ .length_sorting(LengthSorting::SegregateLength)
+ .sorting_method(SortingMethod::DepthFirst);
+ sort_sequences(&mut segregate, opts);
+
+ print_sequences("SegregateLength (grouped by length, then by content)", &segregate);
+ println!(" Explanation: All length-1 sequences come first (sorted by content)");
+ println!(" Then all length-2 sequences (sorted by content)");
+ println!(" Then all length-3 sequences (sorted by content)");
+ println!(" Then all length-4 sequences (sorted by content)");
+
+ println!("\n=== Summary ===");
+ println!("InterpolateLength: Length is only a tiebreaker when content is equal");
+ println!("SegregateLength: Sequences are grouped by length first, shorter always before longer");
+}