summaryrefslogtreecommitdiff
path: root/morphology/README.md
diff options
context:
space:
mode:
authorjacksonfu14 <jackson@fashionunited.com>2025-11-11 07:04:56 +0100
committerJackson Moore <jacksonmoore@tuta.io>2025-11-11 07:04:56 +0100
commit1d0086a3d223f12201b4b1a7832cd283ff384daf (patch)
treed6c500125025e48ead3cf92dea29edae396b35a9 /morphology/README.md
parentcccaa346384c7fed2ebf2524a2a6cca1e1bec577 (diff)
feat: add breadth first sorting
Diffstat (limited to 'morphology/README.md')
-rw-r--r--morphology/README.md32
1 files changed, 15 insertions, 17 deletions
diff --git a/morphology/README.md b/morphology/README.md
index 7e1865b..9b8807f 100644
--- a/morphology/README.md
+++ b/morphology/README.md
@@ -82,6 +82,9 @@ count_sequences(&set, length) -> usize
PrecedenceOrder::IncreasingNegativeFirst // [0, -1, 1, -2, 2, ...]
PrecedenceOrder::IncreasingPositiveFirst // [0, 1, -1, 2, -2, ...]
+SortingMethod::DepthFirst // Compare position-by-position: outer then inner at each position
+SortingMethod::BreadthFirst // Compare all outer values first, then all inner values
+
sort_sequences(&mut sequences, outer_order, inner_order)
```
@@ -161,9 +164,8 @@ let all_sets = generate_valid_sets(5);
```rust
use meta_affine::{ValidSet, Value, Sequence};
-use meta_affine::sequence::generate_sequences;
-use meta_affine::{generate_all_sequences, sort_sequences, PrecedenceOrder};
-use std::collections::HashMap;
+use meta_affine::sequence::{generate_sequences, generate_all_sequences, sort_sequences};
+use meta_affine::sequence::{SequenceOptions, PrecedenceOrder, SortingMethod};
// Create a valid set
let set = ValidSet::new()
@@ -171,24 +173,20 @@ let set = ValidSet::new()
// Generate all valid sequences of length 3 from this set
let mut sequences = generate_sequences(&set, 3);
-// Returns sequences like [(0,0), (1,0), (0,0)] and [(1,0), (0,0), (1,0)]
-// Sort sequences with default precedence (IncreasingPositiveFirst for both)
-sort_sequences(&mut sequences, None, None);
+// Sort with defaults (DepthFirst, IncreasingPositiveFirst)
+sort_sequences(&mut sequences, None);
-// Sort with custom precedence orders
-sort_sequences(
- &mut sequences,
- Some(PrecedenceOrder::IncreasingNegativeFirst), // outer: [0, -1, 1, -2, 2, ...]
- Some(PrecedenceOrder::IncreasingPositiveFirst), // inner: [0, 1, -1, 2, -2, ...]
-);
+// Sort with custom options using builder pattern
+let opts = SequenceOptions::new()
+ .sorting_method(SortingMethod::BreadthFirst)
+ .outer_order(PrecedenceOrder::IncreasingNegativeFirst)
+ .inner_order(PrecedenceOrder::IncreasingPositiveFirst);
+sort_sequences(&mut sequences, opts);
// Generate all sequences from all valid sets with sorting options
-let mut options = HashMap::new();
-options.insert("outerPrecedenceOrder".to_string(), PrecedenceOrder::IncreasingNegativeFirst);
-options.insert("innerPrecedenceOrder".to_string(), PrecedenceOrder::IncreasingPositiveFirst);
-let all_sequences = generate_all_sequences(3, options);
-// Returns all valid sequences of length 3, sorted by the specified precedence
+let opts = SequenceOptions::new().sorting_method(SortingMethod::BreadthFirst);
+let all_sequences = generate_all_sequences(3, opts);
```
## Mathematical Background