FnTransformerOps

Trait FnTransformerOps 

Source
pub trait FnTransformerOps<T, R>:
    Fn(T) -> R
    + Sized
    + 'static {
    // Provided methods
    fn and_then<S, F>(self, after: F) -> BoxTransformer<T, S>
       where S: 'static,
             F: Transformer<R, S> + 'static,
             T: 'static,
             R: 'static { ... }
    fn compose<S, F>(self, before: F) -> BoxTransformer<S, R>
       where S: 'static,
             F: Transformer<S, T> + 'static,
             T: 'static,
             R: 'static { ... }
    fn when<P>(self, predicate: P) -> BoxConditionalTransformer<T, R>
       where P: Predicate<T> + 'static,
             T: 'static,
             R: 'static { ... }
}
Expand description

Extension trait for closures implementing Fn(T) -> R

Provides composition methods (and_then, compose, when) for closures and function pointers without requiring explicit wrapping in BoxTransformer, RcTransformer, or ArcTransformer.

This trait is automatically implemented for all closures and function pointers that implement Fn(T) -> R.

§Design Rationale

While closures automatically implement Transformer<T, R> through blanket implementation, they don’t have access to instance methods like and_then, compose, and when. This extension trait provides those methods, returning BoxTransformer for maximum flexibility.

§Examples

§Chain composition with and_then

use prism3_function::{Transformer, FnTransformerOps};

let double = |x: i32| x * 2;
let to_string = |x: i32| x.to_string();

let composed = double.and_then(to_string);
assert_eq!(composed.apply(21), "42");

§Reverse composition with compose

use prism3_function::{Transformer, FnTransformerOps};

let double = |x: i32| x * 2;
let add_one = |x: i32| x + 1;

let composed = double.compose(add_one);
assert_eq!(composed.apply(5), 12); // (5 + 1) * 2

§Conditional transformation with when

use prism3_function::{Transformer, FnTransformerOps};

let double = |x: i32| x * 2;
let conditional = double.when(|x: &i32| *x > 0).or_else(|x: i32| -x);

assert_eq!(conditional.apply(5), 10);
assert_eq!(conditional.apply(-5), 5);

§Author

Hu Haixing

Provided Methods§

Source

fn and_then<S, F>(self, after: F) -> BoxTransformer<T, S>
where S: 'static, F: Transformer<R, S> + 'static, T: 'static, R: 'static,

Chain composition - applies self first, then after

Creates a new transformer that applies this transformer first, then applies the after transformer to the result. Consumes self and returns a BoxTransformer.

§Type Parameters
  • S - The output type of the after transformer
  • F - The type of the after transformer (must implement Transformer<R, S>)
§Parameters
  • after - The transformer to apply after self. Note: This parameter is passed by value and will transfer ownership. If you need to preserve the original transformer, clone it first (if it implements Clone). Can be:
    • A closure: |x: R| -> S
    • A function pointer: fn(R) -> S
    • A BoxTransformer<R, S>
    • An RcTransformer<R, S>
    • An ArcTransformer<R, S>
    • Any type implementing Transformer<R, S>
§Returns

A new BoxTransformer<T, S> representing the composition

§Examples
§Direct value passing (ownership transfer)
use prism3_function::{Transformer, FnTransformerOps, BoxTransformer};

let double = |x: i32| x * 2;
let to_string = BoxTransformer::new(|x: i32| x.to_string());

// to_string is moved here
let composed = double.and_then(to_string);
assert_eq!(composed.apply(21), "42");
// to_string.apply(5); // Would not compile - moved
§Preserving original with clone
use prism3_function::{Transformer, FnTransformerOps, BoxTransformer};

let double = |x: i32| x * 2;
let to_string = BoxTransformer::new(|x: i32| x.to_string());

// Clone to preserve original
let composed = double.and_then(to_string.clone());
assert_eq!(composed.apply(21), "42");

// Original still usable
assert_eq!(to_string.apply(5), "5");
Examples found in repository?
examples/fn_transformer_ops_demo.rs (line 23)
16fn main() {
17    println!("=== FnTransformerOps Example ===\n");
18
19    // 1. Basic and_then composition
20    println!("1. Basic and_then composition:");
21    let double = |x: i32| x * 2;
22    let to_string = |x: i32| x.to_string();
23    let composed = double.and_then(to_string);
24    println!(
25        "   double.and_then(to_string).apply(21) = {}",
26        composed.apply(21)
27    );
28    println!();
29
30    // 2. Chained and_then composition
31    println!("2. Chained and_then composition:");
32    let add_one = |x: i32| x + 1;
33    let double = |x: i32| x * 2;
34    let to_string = |x: i32| x.to_string();
35    let chained = add_one.and_then(double).and_then(to_string);
36    println!(
37        "   add_one.and_then(double).and_then(to_string).apply(5) = {}",
38        chained.apply(5)
39    ); // (5 + 1) * 2 = 12
40    println!();
41
42    // 3. compose reverse composition
43    println!("3. compose reverse composition:");
44    let double = |x: i32| x * 2;
45    let add_one = |x: i32| x + 1;
46    let composed = double.compose(add_one);
47    println!(
48        "   double.compose(add_one).apply(5) = {}",
49        composed.apply(5)
50    ); // (5 + 1) * 2 = 12
51    println!();
52
53    // 4. Conditional transformation when
54    println!("4. Conditional transformation when:");
55    let double = |x: i32| x * 2;
56    let conditional = double.when(|x: &i32| *x > 0).or_else(|x: i32| -x);
57    println!("   double.when(x > 0).or_else(negate):");
58    println!("     transform(5) = {}", conditional.apply(5)); // 10
59    println!("     transform(-5) = {}", conditional.apply(-5)); // 5
60    println!();
61
62    // 5. Complex composition
63    println!("5. Complex composition:");
64    let add_one = |x: i32| x + 1;
65    let double = |x: i32| x * 2;
66    let triple = |x: i32| x * 3;
67    let to_string = |x: i32| x.to_string();
68
69    let complex = add_one
70        .and_then(double.when(|x: &i32| *x > 5).or_else(triple))
71        .and_then(to_string);
72
73    println!("   add_one.and_then(double.when(x > 5).or_else(triple)).and_then(to_string):");
74    println!("     transform(1) = {}", complex.apply(1)); // (1 + 1) = 2 <= 5, so 2 * 3 = 6
75    println!("     transform(5) = {}", complex.apply(5)); // (5 + 1) = 6 > 5, so 6 * 2 = 12
76    println!("     transform(10) = {}", complex.apply(10)); // (10 + 1) = 11 > 5, so 11 * 2 = 22
77    println!();
78
79    // 6. Type conversion
80    println!("6. Type conversion:");
81    let to_string = |x: i32| x.to_string();
82    let get_length = |s: String| s.len();
83    let length_transformer = to_string.and_then(get_length);
84    println!(
85        "   to_string.and_then(get_length).apply(12345) = {}",
86        length_transformer.apply(12345)
87    ); // 5
88    println!();
89
90    // 7. Closures that capture environment
91    println!("7. Closures that capture environment:");
92    let multiplier = 3;
93    let multiply = move |x: i32| x * multiplier;
94    let add_ten = |x: i32| x + 10;
95    let with_capture = multiply.and_then(add_ten);
96    println!(
97        "   multiply(3).and_then(add_ten).apply(5) = {}",
98        with_capture.apply(5)
99    ); // 5 * 3 + 10 = 25
100    println!();
101
102    // 8. Function pointers
103    println!("8. Function pointers:");
104    fn double_fn(x: i32) -> i32 {
105        x * 2
106    }
107    fn add_one_fn(x: i32) -> i32 {
108        x + 1
109    }
110    let fn_composed = double_fn.and_then(add_one_fn);
111    println!(
112        "   double_fn.and_then(add_one_fn).apply(5) = {}",
113        fn_composed.apply(5)
114    ); // 5 * 2 + 1 = 11
115    println!();
116
117    // 9. Multi-conditional transformation
118    println!("9. Multi-conditional transformation:");
119    let abs = |x: i32| x.abs();
120    let double = |x: i32| x * 2;
121    let transformer = abs.when(|x: &i32| *x < 0).or_else(double);
122    println!("   abs.when(x < 0).or_else(double):");
123    println!("     transform(-5) = {}", transformer.apply(-5)); // abs(-5) = 5
124    println!("     transform(5) = {}", transformer.apply(5)); // 5 * 2 = 10
125    println!("     transform(0) = {}", transformer.apply(0)); // 0 * 2 = 0
126    println!();
127
128    println!("=== Example completed ===");
129}
Source

fn compose<S, F>(self, before: F) -> BoxTransformer<S, R>
where S: 'static, F: Transformer<S, T> + 'static, T: 'static, R: 'static,

Reverse composition - applies before first, then self

Creates a new transformer that applies the before transformer first, then applies this transformer to the result. Consumes self and returns a BoxTransformer.

§Type Parameters
  • S - The input type of the before transformer
  • F - The type of the before transformer (must implement Transformer<S, T>)
§Parameters
  • before - The transformer to apply before self. Note: This parameter is passed by value and will transfer ownership. If you need to preserve the original transformer, clone it first (if it implements Clone). Can be:
    • A closure: |x: S| -> T
    • A function pointer: fn(S) -> T
    • A BoxTransformer<S, T>
    • An RcTransformer<S, T>
    • An ArcTransformer<S, T>
    • Any type implementing Transformer<S, T>
§Returns

A new BoxTransformer<S, R> representing the composition

§Examples
§Direct value passing (ownership transfer)
use prism3_function::{Transformer, FnTransformerOps, BoxTransformer};

let double = |x: i32| x * 2;
let add_one = BoxTransformer::new(|x: i32| x + 1);

// add_one is moved here
let composed = double.compose(add_one);
assert_eq!(composed.apply(5), 12); // (5 + 1) * 2
// add_one.apply(3); // Would not compile - moved
§Preserving original with clone
use prism3_function::{Transformer, FnTransformerOps, BoxTransformer};

let double = |x: i32| x * 2;
let add_one = BoxTransformer::new(|x: i32| x + 1);

// Clone to preserve original
let composed = double.compose(add_one.clone());
assert_eq!(composed.apply(5), 12); // (5 + 1) * 2

// Original still usable
assert_eq!(add_one.apply(3), 4);
Examples found in repository?
examples/fn_transformer_ops_demo.rs (line 46)
16fn main() {
17    println!("=== FnTransformerOps Example ===\n");
18
19    // 1. Basic and_then composition
20    println!("1. Basic and_then composition:");
21    let double = |x: i32| x * 2;
22    let to_string = |x: i32| x.to_string();
23    let composed = double.and_then(to_string);
24    println!(
25        "   double.and_then(to_string).apply(21) = {}",
26        composed.apply(21)
27    );
28    println!();
29
30    // 2. Chained and_then composition
31    println!("2. Chained and_then composition:");
32    let add_one = |x: i32| x + 1;
33    let double = |x: i32| x * 2;
34    let to_string = |x: i32| x.to_string();
35    let chained = add_one.and_then(double).and_then(to_string);
36    println!(
37        "   add_one.and_then(double).and_then(to_string).apply(5) = {}",
38        chained.apply(5)
39    ); // (5 + 1) * 2 = 12
40    println!();
41
42    // 3. compose reverse composition
43    println!("3. compose reverse composition:");
44    let double = |x: i32| x * 2;
45    let add_one = |x: i32| x + 1;
46    let composed = double.compose(add_one);
47    println!(
48        "   double.compose(add_one).apply(5) = {}",
49        composed.apply(5)
50    ); // (5 + 1) * 2 = 12
51    println!();
52
53    // 4. Conditional transformation when
54    println!("4. Conditional transformation when:");
55    let double = |x: i32| x * 2;
56    let conditional = double.when(|x: &i32| *x > 0).or_else(|x: i32| -x);
57    println!("   double.when(x > 0).or_else(negate):");
58    println!("     transform(5) = {}", conditional.apply(5)); // 10
59    println!("     transform(-5) = {}", conditional.apply(-5)); // 5
60    println!();
61
62    // 5. Complex composition
63    println!("5. Complex composition:");
64    let add_one = |x: i32| x + 1;
65    let double = |x: i32| x * 2;
66    let triple = |x: i32| x * 3;
67    let to_string = |x: i32| x.to_string();
68
69    let complex = add_one
70        .and_then(double.when(|x: &i32| *x > 5).or_else(triple))
71        .and_then(to_string);
72
73    println!("   add_one.and_then(double.when(x > 5).or_else(triple)).and_then(to_string):");
74    println!("     transform(1) = {}", complex.apply(1)); // (1 + 1) = 2 <= 5, so 2 * 3 = 6
75    println!("     transform(5) = {}", complex.apply(5)); // (5 + 1) = 6 > 5, so 6 * 2 = 12
76    println!("     transform(10) = {}", complex.apply(10)); // (10 + 1) = 11 > 5, so 11 * 2 = 22
77    println!();
78
79    // 6. Type conversion
80    println!("6. Type conversion:");
81    let to_string = |x: i32| x.to_string();
82    let get_length = |s: String| s.len();
83    let length_transformer = to_string.and_then(get_length);
84    println!(
85        "   to_string.and_then(get_length).apply(12345) = {}",
86        length_transformer.apply(12345)
87    ); // 5
88    println!();
89
90    // 7. Closures that capture environment
91    println!("7. Closures that capture environment:");
92    let multiplier = 3;
93    let multiply = move |x: i32| x * multiplier;
94    let add_ten = |x: i32| x + 10;
95    let with_capture = multiply.and_then(add_ten);
96    println!(
97        "   multiply(3).and_then(add_ten).apply(5) = {}",
98        with_capture.apply(5)
99    ); // 5 * 3 + 10 = 25
100    println!();
101
102    // 8. Function pointers
103    println!("8. Function pointers:");
104    fn double_fn(x: i32) -> i32 {
105        x * 2
106    }
107    fn add_one_fn(x: i32) -> i32 {
108        x + 1
109    }
110    let fn_composed = double_fn.and_then(add_one_fn);
111    println!(
112        "   double_fn.and_then(add_one_fn).apply(5) = {}",
113        fn_composed.apply(5)
114    ); // 5 * 2 + 1 = 11
115    println!();
116
117    // 9. Multi-conditional transformation
118    println!("9. Multi-conditional transformation:");
119    let abs = |x: i32| x.abs();
120    let double = |x: i32| x * 2;
121    let transformer = abs.when(|x: &i32| *x < 0).or_else(double);
122    println!("   abs.when(x < 0).or_else(double):");
123    println!("     transform(-5) = {}", transformer.apply(-5)); // abs(-5) = 5
124    println!("     transform(5) = {}", transformer.apply(5)); // 5 * 2 = 10
125    println!("     transform(0) = {}", transformer.apply(0)); // 0 * 2 = 0
126    println!();
127
128    println!("=== Example completed ===");
129}
Source

fn when<P>(self, predicate: P) -> BoxConditionalTransformer<T, R>
where P: Predicate<T> + 'static, T: 'static, R: 'static,

Creates a conditional transformer

Returns a transformer that only executes when a predicate is satisfied. You must call or_else() to provide an alternative transformer for when the condition is not satisfied.

§Parameters
  • predicate - The condition to check. Note: This parameter is passed by value and will transfer ownership. If you need to preserve the original predicate, clone it first (if it implements Clone). Can be:
    • A closure: |x: &T| -> bool
    • A function pointer: fn(&T) -> bool
    • A BoxPredicate<T>
    • An RcPredicate<T>
    • An ArcPredicate<T>
    • Any type implementing Predicate<T>
§Returns

Returns BoxConditionalTransformer<T, R>

§Examples
§Basic usage with or_else
use prism3_function::{Transformer, FnTransformerOps};

let double = |x: i32| x * 2;
let conditional = double.when(|x: &i32| *x > 0).or_else(|x: i32| -x);

assert_eq!(conditional.apply(5), 10);
assert_eq!(conditional.apply(-5), 5);
§Preserving predicate with clone
use prism3_function::{Transformer, FnTransformerOps, BoxPredicate};

let double = |x: i32| x * 2;
let is_positive = BoxPredicate::new(|x: &i32| *x > 0);

// Clone to preserve original predicate
let conditional = double.when(is_positive.clone())
    .or_else(|x: i32| -x);

assert_eq!(conditional.apply(5), 10);

// Original predicate still usable
assert!(is_positive.test(&3));
Examples found in repository?
examples/fn_transformer_ops_demo.rs (line 56)
16fn main() {
17    println!("=== FnTransformerOps Example ===\n");
18
19    // 1. Basic and_then composition
20    println!("1. Basic and_then composition:");
21    let double = |x: i32| x * 2;
22    let to_string = |x: i32| x.to_string();
23    let composed = double.and_then(to_string);
24    println!(
25        "   double.and_then(to_string).apply(21) = {}",
26        composed.apply(21)
27    );
28    println!();
29
30    // 2. Chained and_then composition
31    println!("2. Chained and_then composition:");
32    let add_one = |x: i32| x + 1;
33    let double = |x: i32| x * 2;
34    let to_string = |x: i32| x.to_string();
35    let chained = add_one.and_then(double).and_then(to_string);
36    println!(
37        "   add_one.and_then(double).and_then(to_string).apply(5) = {}",
38        chained.apply(5)
39    ); // (5 + 1) * 2 = 12
40    println!();
41
42    // 3. compose reverse composition
43    println!("3. compose reverse composition:");
44    let double = |x: i32| x * 2;
45    let add_one = |x: i32| x + 1;
46    let composed = double.compose(add_one);
47    println!(
48        "   double.compose(add_one).apply(5) = {}",
49        composed.apply(5)
50    ); // (5 + 1) * 2 = 12
51    println!();
52
53    // 4. Conditional transformation when
54    println!("4. Conditional transformation when:");
55    let double = |x: i32| x * 2;
56    let conditional = double.when(|x: &i32| *x > 0).or_else(|x: i32| -x);
57    println!("   double.when(x > 0).or_else(negate):");
58    println!("     transform(5) = {}", conditional.apply(5)); // 10
59    println!("     transform(-5) = {}", conditional.apply(-5)); // 5
60    println!();
61
62    // 5. Complex composition
63    println!("5. Complex composition:");
64    let add_one = |x: i32| x + 1;
65    let double = |x: i32| x * 2;
66    let triple = |x: i32| x * 3;
67    let to_string = |x: i32| x.to_string();
68
69    let complex = add_one
70        .and_then(double.when(|x: &i32| *x > 5).or_else(triple))
71        .and_then(to_string);
72
73    println!("   add_one.and_then(double.when(x > 5).or_else(triple)).and_then(to_string):");
74    println!("     transform(1) = {}", complex.apply(1)); // (1 + 1) = 2 <= 5, so 2 * 3 = 6
75    println!("     transform(5) = {}", complex.apply(5)); // (5 + 1) = 6 > 5, so 6 * 2 = 12
76    println!("     transform(10) = {}", complex.apply(10)); // (10 + 1) = 11 > 5, so 11 * 2 = 22
77    println!();
78
79    // 6. Type conversion
80    println!("6. Type conversion:");
81    let to_string = |x: i32| x.to_string();
82    let get_length = |s: String| s.len();
83    let length_transformer = to_string.and_then(get_length);
84    println!(
85        "   to_string.and_then(get_length).apply(12345) = {}",
86        length_transformer.apply(12345)
87    ); // 5
88    println!();
89
90    // 7. Closures that capture environment
91    println!("7. Closures that capture environment:");
92    let multiplier = 3;
93    let multiply = move |x: i32| x * multiplier;
94    let add_ten = |x: i32| x + 10;
95    let with_capture = multiply.and_then(add_ten);
96    println!(
97        "   multiply(3).and_then(add_ten).apply(5) = {}",
98        with_capture.apply(5)
99    ); // 5 * 3 + 10 = 25
100    println!();
101
102    // 8. Function pointers
103    println!("8. Function pointers:");
104    fn double_fn(x: i32) -> i32 {
105        x * 2
106    }
107    fn add_one_fn(x: i32) -> i32 {
108        x + 1
109    }
110    let fn_composed = double_fn.and_then(add_one_fn);
111    println!(
112        "   double_fn.and_then(add_one_fn).apply(5) = {}",
113        fn_composed.apply(5)
114    ); // 5 * 2 + 1 = 11
115    println!();
116
117    // 9. Multi-conditional transformation
118    println!("9. Multi-conditional transformation:");
119    let abs = |x: i32| x.abs();
120    let double = |x: i32| x * 2;
121    let transformer = abs.when(|x: &i32| *x < 0).or_else(double);
122    println!("   abs.when(x < 0).or_else(double):");
123    println!("     transform(-5) = {}", transformer.apply(-5)); // abs(-5) = 5
124    println!("     transform(5) = {}", transformer.apply(5)); // 5 * 2 = 10
125    println!("     transform(0) = {}", transformer.apply(0)); // 0 * 2 = 0
126    println!();
127
128    println!("=== Example completed ===");
129}

Dyn Compatibility§

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors§

Source§

impl<T, R, F> FnTransformerOps<T, R> for F
where F: Fn(T) -> R + 'static,

Blanket implementation of FnTransformerOps for all closures

Automatically implements FnTransformerOps<T, R> for any type that implements Fn(T) -> R.

§Author

Hu Haixing