pub struct BoxBiConsumer<T, U> { /* private fields */ }Expand description
BoxBiConsumer struct
A bi-consumer implementation based on Box<dyn FnMut(&T, &U)> for
single ownership scenarios. This is the simplest and most efficient
bi-consumer type when sharing is not required.
§Features
- Single Ownership: Not cloneable, ownership moves on use
- Zero Overhead: No reference counting or locking
- Mutable State: Can modify captured environment via
FnMut - Builder Pattern: Method chaining consumes
selfnaturally
§Use Cases
Choose BoxBiConsumer when:
- The bi-consumer is used only once or in a linear flow
- Building pipelines where ownership naturally flows
- No need to share the consumer across contexts
- Performance is critical and sharing overhead is unacceptable
§Performance
BoxBiConsumer has the best performance among the three bi-consumer
types:
- No reference counting overhead
- No lock acquisition or runtime borrow checking
- Direct function call through vtable
- Minimal memory footprint (single pointer)
§Examples
use prism3_function::{BiConsumer, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let mut consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x + *y);
});
consumer.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]);§Author
Haixing Hu
Implementations§
Source§impl<T, U> BoxBiConsumer<T, U>where
T: 'static,
U: 'static,
impl<T, U> BoxBiConsumer<T, U>where
T: 'static,
U: 'static,
Sourcepub fn new<F>(f: F) -> Self
pub fn new<F>(f: F) -> Self
Creates a new BoxBiConsumer
§Type Parameters
F- The closure type
§Parameters
f- The closure to wrap
§Returns
Returns a new BoxBiConsumer<T, U> instance
§Examples
use prism3_function::{BiConsumer, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let mut consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x * 2 + *y);
});
consumer.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![13]);Examples found in repository?
21fn main() {
22 println!("=== BiConsumer Demo ===\n");
23
24 // 1. BoxBiConsumer - Single ownership
25 println!("1. BoxBiConsumer - Single ownership:");
26 let log = Arc::new(Mutex::new(Vec::new()));
27 let l = log.clone();
28 let mut box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
29 println!(" Processing: x={}, y={}", x, y);
30 l.lock().unwrap().push(*x + *y);
31 });
32 box_consumer.accept(&10, &5);
33 println!(" Result log: {:?}\n", *log.lock().unwrap());
34
35 // 2. Method chaining with BoxBiConsumer
36 println!("2. BoxBiConsumer with method chaining:");
37 let log = Arc::new(Mutex::new(Vec::new()));
38 let l1 = log.clone();
39 let l2 = log.clone();
40 let mut chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
41 l1.lock().unwrap().push(*x + *y);
42 println!(" After first operation: sum = {}", x + y);
43 })
44 .and_then(move |x: &i32, y: &i32| {
45 l2.lock().unwrap().push(*x * *y);
46 println!(" After second operation: product = {}", x * y);
47 });
48 chained.accept(&5, &3);
49 println!(" Final log: {:?}\n", *log.lock().unwrap());
50
51 // 3. ArcBiConsumer - Thread-safe shared ownership
52 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
53 let log = Arc::new(Mutex::new(Vec::new()));
54 let l = log.clone();
55 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
56 l.lock().unwrap().push(*x + *y);
57 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
58 });
59
60 let consumer1 = arc_consumer.clone();
61 let consumer2 = arc_consumer.clone();
62
63 let handle1 = thread::spawn(move || {
64 let mut c = consumer1;
65 c.accept(&10, &5);
66 });
67
68 let handle2 = thread::spawn(move || {
69 let mut c = consumer2;
70 c.accept(&20, &8);
71 });
72
73 handle1.join().unwrap();
74 handle2.join().unwrap();
75 println!(" Final log: {:?}\n", *log.lock().unwrap());
76
77 // 4. RcBiConsumer - Single-threaded shared ownership
78 println!("4. RcBiConsumer - Single-threaded shared ownership:");
79 let log = Rc::new(RefCell::new(Vec::new()));
80 let l = log.clone();
81 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
82 l.borrow_mut().push(*x + *y);
83 });
84
85 let mut clone1 = rc_consumer.clone();
86 let mut clone2 = rc_consumer.clone();
87
88 clone1.accept(&5, &3);
89 println!(" After first use: {:?}", *log.borrow());
90
91 clone2.accept(&7, &2);
92 println!(" After second use: {:?}\n", *log.borrow());
93
94 // 5. Working with closures directly
95 println!("5. Working with closures directly:");
96 let log = Arc::new(Mutex::new(Vec::new()));
97 let l = log.clone();
98 let mut closure = move |x: &i32, y: &i32| {
99 let sum = *x + *y;
100 l.lock().unwrap().push(sum);
101 };
102 closure.accept(&10, &20);
103 println!(" After closure: {:?}\n", *log.lock().unwrap());
104
105 // 6. Conditional BiConsumer
106 println!("6. Conditional BiConsumer:");
107 let log = Arc::new(Mutex::new(Vec::new()));
108 let l = log.clone();
109 let mut conditional = BoxBiConsumer::new(move |x: &i32, y: &i32| {
110 l.lock().unwrap().push(*x + *y);
111 })
112 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
113
114 conditional.accept(&5, &3);
115 println!(" Positive values: {:?}", *log.lock().unwrap());
116
117 conditional.accept(&-5, &3);
118 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
119
120 // 7. Conditional branch BiConsumer
121 println!("7. Conditional branch BiConsumer:");
122 let log = Arc::new(Mutex::new(Vec::new()));
123 let l1 = log.clone();
124 let l2 = log.clone();
125 let mut branch = BoxBiConsumer::new(move |x: &i32, _y: &i32| {
126 l1.lock().unwrap().push(*x);
127 })
128 .when(|x: &i32, y: &i32| *x > *y)
129 .or_else(move |_x: &i32, y: &i32| {
130 l2.lock().unwrap().push(*y);
131 });
132
133 branch.accept(&15, &10);
134 println!(" When x > y: {:?}", *log.lock().unwrap());
135
136 branch.accept(&5, &10);
137 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
138
139 // 8. Accumulating statistics
140 println!("8. Accumulating statistics:");
141 let count = Arc::new(Mutex::new(0));
142 let sum = Arc::new(Mutex::new(0));
143 let c = count.clone();
144 let s = sum.clone();
145 let mut stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
146 *c.lock().unwrap() += 1;
147 *s.lock().unwrap() += x + y;
148 });
149
150 stats_consumer.accept(&5, &3);
151 stats_consumer.accept(&10, &2);
152 stats_consumer.accept(&7, &8);
153
154 println!(" Count: {}", *count.lock().unwrap());
155 println!(" Sum: {}\n", *sum.lock().unwrap());
156
157 // 9. Name support
158 println!("9. Name support:");
159 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
160 println!(" Initial name: {:?}", named_consumer.name());
161
162 named_consumer.set_name("sum_calculator");
163 println!(" After setting name: {:?}", named_consumer.name());
164 println!(" Display: {}\n", named_consumer);
165
166 println!("=== Demo Complete ===");
167}Sourcepub fn new_with_name<F>(name: &str, f: F) -> Self
pub fn new_with_name<F>(name: &str, f: F) -> Self
Creates a new BoxBiConsumer with a name
§Type Parameters
F- The closure type
§Parameters
name- The name of the consumerf- The closure to wrap
§Returns
Returns a new BoxBiConsumer<T, U> instance with the specified name
§Examples
use prism3_function::{BiConsumer, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let mut consumer = BoxBiConsumer::new_with_name("sum_logger", move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x + *y);
});
assert_eq!(consumer.name(), Some("sum_logger"));
consumer.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]);Sourcepub fn noop() -> Self
pub fn noop() -> Self
Creates a no-op bi-consumer
Returns a bi-consumer that performs no operation.
§Returns
Returns a no-op bi-consumer
§Examples
use prism3_function::{BiConsumer, BoxBiConsumer};
let mut noop = BoxBiConsumer::<i32, i32>::noop();
noop.accept(&42, &10);
// Values unchangedExamples found in repository?
21fn main() {
22 println!("=== BiConsumer Demo ===\n");
23
24 // 1. BoxBiConsumer - Single ownership
25 println!("1. BoxBiConsumer - Single ownership:");
26 let log = Arc::new(Mutex::new(Vec::new()));
27 let l = log.clone();
28 let mut box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
29 println!(" Processing: x={}, y={}", x, y);
30 l.lock().unwrap().push(*x + *y);
31 });
32 box_consumer.accept(&10, &5);
33 println!(" Result log: {:?}\n", *log.lock().unwrap());
34
35 // 2. Method chaining with BoxBiConsumer
36 println!("2. BoxBiConsumer with method chaining:");
37 let log = Arc::new(Mutex::new(Vec::new()));
38 let l1 = log.clone();
39 let l2 = log.clone();
40 let mut chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
41 l1.lock().unwrap().push(*x + *y);
42 println!(" After first operation: sum = {}", x + y);
43 })
44 .and_then(move |x: &i32, y: &i32| {
45 l2.lock().unwrap().push(*x * *y);
46 println!(" After second operation: product = {}", x * y);
47 });
48 chained.accept(&5, &3);
49 println!(" Final log: {:?}\n", *log.lock().unwrap());
50
51 // 3. ArcBiConsumer - Thread-safe shared ownership
52 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
53 let log = Arc::new(Mutex::new(Vec::new()));
54 let l = log.clone();
55 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
56 l.lock().unwrap().push(*x + *y);
57 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
58 });
59
60 let consumer1 = arc_consumer.clone();
61 let consumer2 = arc_consumer.clone();
62
63 let handle1 = thread::spawn(move || {
64 let mut c = consumer1;
65 c.accept(&10, &5);
66 });
67
68 let handle2 = thread::spawn(move || {
69 let mut c = consumer2;
70 c.accept(&20, &8);
71 });
72
73 handle1.join().unwrap();
74 handle2.join().unwrap();
75 println!(" Final log: {:?}\n", *log.lock().unwrap());
76
77 // 4. RcBiConsumer - Single-threaded shared ownership
78 println!("4. RcBiConsumer - Single-threaded shared ownership:");
79 let log = Rc::new(RefCell::new(Vec::new()));
80 let l = log.clone();
81 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
82 l.borrow_mut().push(*x + *y);
83 });
84
85 let mut clone1 = rc_consumer.clone();
86 let mut clone2 = rc_consumer.clone();
87
88 clone1.accept(&5, &3);
89 println!(" After first use: {:?}", *log.borrow());
90
91 clone2.accept(&7, &2);
92 println!(" After second use: {:?}\n", *log.borrow());
93
94 // 5. Working with closures directly
95 println!("5. Working with closures directly:");
96 let log = Arc::new(Mutex::new(Vec::new()));
97 let l = log.clone();
98 let mut closure = move |x: &i32, y: &i32| {
99 let sum = *x + *y;
100 l.lock().unwrap().push(sum);
101 };
102 closure.accept(&10, &20);
103 println!(" After closure: {:?}\n", *log.lock().unwrap());
104
105 // 6. Conditional BiConsumer
106 println!("6. Conditional BiConsumer:");
107 let log = Arc::new(Mutex::new(Vec::new()));
108 let l = log.clone();
109 let mut conditional = BoxBiConsumer::new(move |x: &i32, y: &i32| {
110 l.lock().unwrap().push(*x + *y);
111 })
112 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
113
114 conditional.accept(&5, &3);
115 println!(" Positive values: {:?}", *log.lock().unwrap());
116
117 conditional.accept(&-5, &3);
118 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
119
120 // 7. Conditional branch BiConsumer
121 println!("7. Conditional branch BiConsumer:");
122 let log = Arc::new(Mutex::new(Vec::new()));
123 let l1 = log.clone();
124 let l2 = log.clone();
125 let mut branch = BoxBiConsumer::new(move |x: &i32, _y: &i32| {
126 l1.lock().unwrap().push(*x);
127 })
128 .when(|x: &i32, y: &i32| *x > *y)
129 .or_else(move |_x: &i32, y: &i32| {
130 l2.lock().unwrap().push(*y);
131 });
132
133 branch.accept(&15, &10);
134 println!(" When x > y: {:?}", *log.lock().unwrap());
135
136 branch.accept(&5, &10);
137 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
138
139 // 8. Accumulating statistics
140 println!("8. Accumulating statistics:");
141 let count = Arc::new(Mutex::new(0));
142 let sum = Arc::new(Mutex::new(0));
143 let c = count.clone();
144 let s = sum.clone();
145 let mut stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
146 *c.lock().unwrap() += 1;
147 *s.lock().unwrap() += x + y;
148 });
149
150 stats_consumer.accept(&5, &3);
151 stats_consumer.accept(&10, &2);
152 stats_consumer.accept(&7, &8);
153
154 println!(" Count: {}", *count.lock().unwrap());
155 println!(" Sum: {}\n", *sum.lock().unwrap());
156
157 // 9. Name support
158 println!("9. Name support:");
159 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
160 println!(" Initial name: {:?}", named_consumer.name());
161
162 named_consumer.set_name("sum_calculator");
163 println!(" After setting name: {:?}", named_consumer.name());
164 println!(" Display: {}\n", named_consumer);
165
166 println!("=== Demo Complete ===");
167}Sourcepub fn name(&self) -> Option<&str>
pub fn name(&self) -> Option<&str>
Examples found in repository?
21fn main() {
22 println!("=== BiConsumer Demo ===\n");
23
24 // 1. BoxBiConsumer - Single ownership
25 println!("1. BoxBiConsumer - Single ownership:");
26 let log = Arc::new(Mutex::new(Vec::new()));
27 let l = log.clone();
28 let mut box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
29 println!(" Processing: x={}, y={}", x, y);
30 l.lock().unwrap().push(*x + *y);
31 });
32 box_consumer.accept(&10, &5);
33 println!(" Result log: {:?}\n", *log.lock().unwrap());
34
35 // 2. Method chaining with BoxBiConsumer
36 println!("2. BoxBiConsumer with method chaining:");
37 let log = Arc::new(Mutex::new(Vec::new()));
38 let l1 = log.clone();
39 let l2 = log.clone();
40 let mut chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
41 l1.lock().unwrap().push(*x + *y);
42 println!(" After first operation: sum = {}", x + y);
43 })
44 .and_then(move |x: &i32, y: &i32| {
45 l2.lock().unwrap().push(*x * *y);
46 println!(" After second operation: product = {}", x * y);
47 });
48 chained.accept(&5, &3);
49 println!(" Final log: {:?}\n", *log.lock().unwrap());
50
51 // 3. ArcBiConsumer - Thread-safe shared ownership
52 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
53 let log = Arc::new(Mutex::new(Vec::new()));
54 let l = log.clone();
55 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
56 l.lock().unwrap().push(*x + *y);
57 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
58 });
59
60 let consumer1 = arc_consumer.clone();
61 let consumer2 = arc_consumer.clone();
62
63 let handle1 = thread::spawn(move || {
64 let mut c = consumer1;
65 c.accept(&10, &5);
66 });
67
68 let handle2 = thread::spawn(move || {
69 let mut c = consumer2;
70 c.accept(&20, &8);
71 });
72
73 handle1.join().unwrap();
74 handle2.join().unwrap();
75 println!(" Final log: {:?}\n", *log.lock().unwrap());
76
77 // 4. RcBiConsumer - Single-threaded shared ownership
78 println!("4. RcBiConsumer - Single-threaded shared ownership:");
79 let log = Rc::new(RefCell::new(Vec::new()));
80 let l = log.clone();
81 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
82 l.borrow_mut().push(*x + *y);
83 });
84
85 let mut clone1 = rc_consumer.clone();
86 let mut clone2 = rc_consumer.clone();
87
88 clone1.accept(&5, &3);
89 println!(" After first use: {:?}", *log.borrow());
90
91 clone2.accept(&7, &2);
92 println!(" After second use: {:?}\n", *log.borrow());
93
94 // 5. Working with closures directly
95 println!("5. Working with closures directly:");
96 let log = Arc::new(Mutex::new(Vec::new()));
97 let l = log.clone();
98 let mut closure = move |x: &i32, y: &i32| {
99 let sum = *x + *y;
100 l.lock().unwrap().push(sum);
101 };
102 closure.accept(&10, &20);
103 println!(" After closure: {:?}\n", *log.lock().unwrap());
104
105 // 6. Conditional BiConsumer
106 println!("6. Conditional BiConsumer:");
107 let log = Arc::new(Mutex::new(Vec::new()));
108 let l = log.clone();
109 let mut conditional = BoxBiConsumer::new(move |x: &i32, y: &i32| {
110 l.lock().unwrap().push(*x + *y);
111 })
112 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
113
114 conditional.accept(&5, &3);
115 println!(" Positive values: {:?}", *log.lock().unwrap());
116
117 conditional.accept(&-5, &3);
118 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
119
120 // 7. Conditional branch BiConsumer
121 println!("7. Conditional branch BiConsumer:");
122 let log = Arc::new(Mutex::new(Vec::new()));
123 let l1 = log.clone();
124 let l2 = log.clone();
125 let mut branch = BoxBiConsumer::new(move |x: &i32, _y: &i32| {
126 l1.lock().unwrap().push(*x);
127 })
128 .when(|x: &i32, y: &i32| *x > *y)
129 .or_else(move |_x: &i32, y: &i32| {
130 l2.lock().unwrap().push(*y);
131 });
132
133 branch.accept(&15, &10);
134 println!(" When x > y: {:?}", *log.lock().unwrap());
135
136 branch.accept(&5, &10);
137 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
138
139 // 8. Accumulating statistics
140 println!("8. Accumulating statistics:");
141 let count = Arc::new(Mutex::new(0));
142 let sum = Arc::new(Mutex::new(0));
143 let c = count.clone();
144 let s = sum.clone();
145 let mut stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
146 *c.lock().unwrap() += 1;
147 *s.lock().unwrap() += x + y;
148 });
149
150 stats_consumer.accept(&5, &3);
151 stats_consumer.accept(&10, &2);
152 stats_consumer.accept(&7, &8);
153
154 println!(" Count: {}", *count.lock().unwrap());
155 println!(" Sum: {}\n", *sum.lock().unwrap());
156
157 // 9. Name support
158 println!("9. Name support:");
159 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
160 println!(" Initial name: {:?}", named_consumer.name());
161
162 named_consumer.set_name("sum_calculator");
163 println!(" After setting name: {:?}", named_consumer.name());
164 println!(" Display: {}\n", named_consumer);
165
166 println!("=== Demo Complete ===");
167}Sourcepub fn set_name(&mut self, name: impl Into<String>)
pub fn set_name(&mut self, name: impl Into<String>)
Examples found in repository?
21fn main() {
22 println!("=== BiConsumer Demo ===\n");
23
24 // 1. BoxBiConsumer - Single ownership
25 println!("1. BoxBiConsumer - Single ownership:");
26 let log = Arc::new(Mutex::new(Vec::new()));
27 let l = log.clone();
28 let mut box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
29 println!(" Processing: x={}, y={}", x, y);
30 l.lock().unwrap().push(*x + *y);
31 });
32 box_consumer.accept(&10, &5);
33 println!(" Result log: {:?}\n", *log.lock().unwrap());
34
35 // 2. Method chaining with BoxBiConsumer
36 println!("2. BoxBiConsumer with method chaining:");
37 let log = Arc::new(Mutex::new(Vec::new()));
38 let l1 = log.clone();
39 let l2 = log.clone();
40 let mut chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
41 l1.lock().unwrap().push(*x + *y);
42 println!(" After first operation: sum = {}", x + y);
43 })
44 .and_then(move |x: &i32, y: &i32| {
45 l2.lock().unwrap().push(*x * *y);
46 println!(" After second operation: product = {}", x * y);
47 });
48 chained.accept(&5, &3);
49 println!(" Final log: {:?}\n", *log.lock().unwrap());
50
51 // 3. ArcBiConsumer - Thread-safe shared ownership
52 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
53 let log = Arc::new(Mutex::new(Vec::new()));
54 let l = log.clone();
55 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
56 l.lock().unwrap().push(*x + *y);
57 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
58 });
59
60 let consumer1 = arc_consumer.clone();
61 let consumer2 = arc_consumer.clone();
62
63 let handle1 = thread::spawn(move || {
64 let mut c = consumer1;
65 c.accept(&10, &5);
66 });
67
68 let handle2 = thread::spawn(move || {
69 let mut c = consumer2;
70 c.accept(&20, &8);
71 });
72
73 handle1.join().unwrap();
74 handle2.join().unwrap();
75 println!(" Final log: {:?}\n", *log.lock().unwrap());
76
77 // 4. RcBiConsumer - Single-threaded shared ownership
78 println!("4. RcBiConsumer - Single-threaded shared ownership:");
79 let log = Rc::new(RefCell::new(Vec::new()));
80 let l = log.clone();
81 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
82 l.borrow_mut().push(*x + *y);
83 });
84
85 let mut clone1 = rc_consumer.clone();
86 let mut clone2 = rc_consumer.clone();
87
88 clone1.accept(&5, &3);
89 println!(" After first use: {:?}", *log.borrow());
90
91 clone2.accept(&7, &2);
92 println!(" After second use: {:?}\n", *log.borrow());
93
94 // 5. Working with closures directly
95 println!("5. Working with closures directly:");
96 let log = Arc::new(Mutex::new(Vec::new()));
97 let l = log.clone();
98 let mut closure = move |x: &i32, y: &i32| {
99 let sum = *x + *y;
100 l.lock().unwrap().push(sum);
101 };
102 closure.accept(&10, &20);
103 println!(" After closure: {:?}\n", *log.lock().unwrap());
104
105 // 6. Conditional BiConsumer
106 println!("6. Conditional BiConsumer:");
107 let log = Arc::new(Mutex::new(Vec::new()));
108 let l = log.clone();
109 let mut conditional = BoxBiConsumer::new(move |x: &i32, y: &i32| {
110 l.lock().unwrap().push(*x + *y);
111 })
112 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
113
114 conditional.accept(&5, &3);
115 println!(" Positive values: {:?}", *log.lock().unwrap());
116
117 conditional.accept(&-5, &3);
118 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
119
120 // 7. Conditional branch BiConsumer
121 println!("7. Conditional branch BiConsumer:");
122 let log = Arc::new(Mutex::new(Vec::new()));
123 let l1 = log.clone();
124 let l2 = log.clone();
125 let mut branch = BoxBiConsumer::new(move |x: &i32, _y: &i32| {
126 l1.lock().unwrap().push(*x);
127 })
128 .when(|x: &i32, y: &i32| *x > *y)
129 .or_else(move |_x: &i32, y: &i32| {
130 l2.lock().unwrap().push(*y);
131 });
132
133 branch.accept(&15, &10);
134 println!(" When x > y: {:?}", *log.lock().unwrap());
135
136 branch.accept(&5, &10);
137 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
138
139 // 8. Accumulating statistics
140 println!("8. Accumulating statistics:");
141 let count = Arc::new(Mutex::new(0));
142 let sum = Arc::new(Mutex::new(0));
143 let c = count.clone();
144 let s = sum.clone();
145 let mut stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
146 *c.lock().unwrap() += 1;
147 *s.lock().unwrap() += x + y;
148 });
149
150 stats_consumer.accept(&5, &3);
151 stats_consumer.accept(&10, &2);
152 stats_consumer.accept(&7, &8);
153
154 println!(" Count: {}", *count.lock().unwrap());
155 println!(" Sum: {}\n", *sum.lock().unwrap());
156
157 // 9. Name support
158 println!("9. Name support:");
159 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
160 println!(" Initial name: {:?}", named_consumer.name());
161
162 named_consumer.set_name("sum_calculator");
163 println!(" After setting name: {:?}", named_consumer.name());
164 println!(" Display: {}\n", named_consumer);
165
166 println!("=== Demo Complete ===");
167}Sourcepub fn and_then<C>(self, next: C) -> Selfwhere
C: BiConsumer<T, U> + 'static,
pub fn and_then<C>(self, next: C) -> Selfwhere
C: BiConsumer<T, U> + 'static,
Chains another consumer in sequence
Returns a new consumer executing the current operation first, then the next operation. Consumes self.
§Type Parameters
C- The type of the next consumer
§Parameters
next- The consumer to execute after the current operation. Note: This parameter is passed by value and will transfer ownership. If you need to preserve the original consumer, clone it first (if it implementsClone). Can be:- A closure:
|x: &T, y: &U| - A
BoxBiConsumer<T, U> - An
ArcBiConsumer<T, U> - An
RcBiConsumer<T, U> - Any type implementing
BiConsumer<T, U>
- A closure:
§Returns
Returns a new composed BoxBiConsumer<T, U>
§Examples
§Direct value passing (ownership transfer)
use prism3_function::{BiConsumer, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l1 = log.clone();
let l2 = log.clone();
let first = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l1.lock().unwrap().push(*x + *y);
});
let second = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l2.lock().unwrap().push(*x * *y);
});
// second is moved here
let mut chained = first.and_then(second);
chained.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8, 15]);
// second.accept(&2, &3); // Would not compile - moved§Preserving original with clone
use prism3_function::{BiConsumer, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l1 = log.clone();
let l2 = log.clone();
let first = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l1.lock().unwrap().push(*x + *y);
});
let second = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l2.lock().unwrap().push(*x * *y);
});
// Clone to preserve original
let mut chained = first.and_then(second.clone());
chained.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8, 15]);
// Original still usable
second.accept(&2, &3);
assert_eq!(*log.lock().unwrap(), vec![8, 15, 6]);Examples found in repository?
21fn main() {
22 println!("=== BiConsumer Demo ===\n");
23
24 // 1. BoxBiConsumer - Single ownership
25 println!("1. BoxBiConsumer - Single ownership:");
26 let log = Arc::new(Mutex::new(Vec::new()));
27 let l = log.clone();
28 let mut box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
29 println!(" Processing: x={}, y={}", x, y);
30 l.lock().unwrap().push(*x + *y);
31 });
32 box_consumer.accept(&10, &5);
33 println!(" Result log: {:?}\n", *log.lock().unwrap());
34
35 // 2. Method chaining with BoxBiConsumer
36 println!("2. BoxBiConsumer with method chaining:");
37 let log = Arc::new(Mutex::new(Vec::new()));
38 let l1 = log.clone();
39 let l2 = log.clone();
40 let mut chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
41 l1.lock().unwrap().push(*x + *y);
42 println!(" After first operation: sum = {}", x + y);
43 })
44 .and_then(move |x: &i32, y: &i32| {
45 l2.lock().unwrap().push(*x * *y);
46 println!(" After second operation: product = {}", x * y);
47 });
48 chained.accept(&5, &3);
49 println!(" Final log: {:?}\n", *log.lock().unwrap());
50
51 // 3. ArcBiConsumer - Thread-safe shared ownership
52 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
53 let log = Arc::new(Mutex::new(Vec::new()));
54 let l = log.clone();
55 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
56 l.lock().unwrap().push(*x + *y);
57 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
58 });
59
60 let consumer1 = arc_consumer.clone();
61 let consumer2 = arc_consumer.clone();
62
63 let handle1 = thread::spawn(move || {
64 let mut c = consumer1;
65 c.accept(&10, &5);
66 });
67
68 let handle2 = thread::spawn(move || {
69 let mut c = consumer2;
70 c.accept(&20, &8);
71 });
72
73 handle1.join().unwrap();
74 handle2.join().unwrap();
75 println!(" Final log: {:?}\n", *log.lock().unwrap());
76
77 // 4. RcBiConsumer - Single-threaded shared ownership
78 println!("4. RcBiConsumer - Single-threaded shared ownership:");
79 let log = Rc::new(RefCell::new(Vec::new()));
80 let l = log.clone();
81 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
82 l.borrow_mut().push(*x + *y);
83 });
84
85 let mut clone1 = rc_consumer.clone();
86 let mut clone2 = rc_consumer.clone();
87
88 clone1.accept(&5, &3);
89 println!(" After first use: {:?}", *log.borrow());
90
91 clone2.accept(&7, &2);
92 println!(" After second use: {:?}\n", *log.borrow());
93
94 // 5. Working with closures directly
95 println!("5. Working with closures directly:");
96 let log = Arc::new(Mutex::new(Vec::new()));
97 let l = log.clone();
98 let mut closure = move |x: &i32, y: &i32| {
99 let sum = *x + *y;
100 l.lock().unwrap().push(sum);
101 };
102 closure.accept(&10, &20);
103 println!(" After closure: {:?}\n", *log.lock().unwrap());
104
105 // 6. Conditional BiConsumer
106 println!("6. Conditional BiConsumer:");
107 let log = Arc::new(Mutex::new(Vec::new()));
108 let l = log.clone();
109 let mut conditional = BoxBiConsumer::new(move |x: &i32, y: &i32| {
110 l.lock().unwrap().push(*x + *y);
111 })
112 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
113
114 conditional.accept(&5, &3);
115 println!(" Positive values: {:?}", *log.lock().unwrap());
116
117 conditional.accept(&-5, &3);
118 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
119
120 // 7. Conditional branch BiConsumer
121 println!("7. Conditional branch BiConsumer:");
122 let log = Arc::new(Mutex::new(Vec::new()));
123 let l1 = log.clone();
124 let l2 = log.clone();
125 let mut branch = BoxBiConsumer::new(move |x: &i32, _y: &i32| {
126 l1.lock().unwrap().push(*x);
127 })
128 .when(|x: &i32, y: &i32| *x > *y)
129 .or_else(move |_x: &i32, y: &i32| {
130 l2.lock().unwrap().push(*y);
131 });
132
133 branch.accept(&15, &10);
134 println!(" When x > y: {:?}", *log.lock().unwrap());
135
136 branch.accept(&5, &10);
137 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
138
139 // 8. Accumulating statistics
140 println!("8. Accumulating statistics:");
141 let count = Arc::new(Mutex::new(0));
142 let sum = Arc::new(Mutex::new(0));
143 let c = count.clone();
144 let s = sum.clone();
145 let mut stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
146 *c.lock().unwrap() += 1;
147 *s.lock().unwrap() += x + y;
148 });
149
150 stats_consumer.accept(&5, &3);
151 stats_consumer.accept(&10, &2);
152 stats_consumer.accept(&7, &8);
153
154 println!(" Count: {}", *count.lock().unwrap());
155 println!(" Sum: {}\n", *sum.lock().unwrap());
156
157 // 9. Name support
158 println!("9. Name support:");
159 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
160 println!(" Initial name: {:?}", named_consumer.name());
161
162 named_consumer.set_name("sum_calculator");
163 println!(" After setting name: {:?}", named_consumer.name());
164 println!(" Display: {}\n", named_consumer);
165
166 println!("=== Demo Complete ===");
167}Sourcepub fn when<P>(self, predicate: P) -> BoxConditionalBiConsumer<T, U>where
P: BiPredicate<T, U> + 'static,
pub fn when<P>(self, predicate: P) -> BoxConditionalBiConsumer<T, U>where
P: BiPredicate<T, U> + 'static,
Creates a conditional bi-consumer
Returns a bi-consumer that only executes when a predicate is 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 bi-predicate, clone it first (if it implementsClone). Can be:- A closure:
|x: &T, y: &U| -> bool - A function pointer:
fn(&T, &U) -> bool - A
BoxBiPredicate<T, U> - An
RcBiPredicate<T, U> - An
ArcBiPredicate<T, U> - Any type implementing
BiPredicate<T, U>
- A closure:
§Returns
Returns BoxConditionalBiConsumer<T, U>
Examples found in repository?
21fn main() {
22 println!("=== BiConsumer Demo ===\n");
23
24 // 1. BoxBiConsumer - Single ownership
25 println!("1. BoxBiConsumer - Single ownership:");
26 let log = Arc::new(Mutex::new(Vec::new()));
27 let l = log.clone();
28 let mut box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
29 println!(" Processing: x={}, y={}", x, y);
30 l.lock().unwrap().push(*x + *y);
31 });
32 box_consumer.accept(&10, &5);
33 println!(" Result log: {:?}\n", *log.lock().unwrap());
34
35 // 2. Method chaining with BoxBiConsumer
36 println!("2. BoxBiConsumer with method chaining:");
37 let log = Arc::new(Mutex::new(Vec::new()));
38 let l1 = log.clone();
39 let l2 = log.clone();
40 let mut chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
41 l1.lock().unwrap().push(*x + *y);
42 println!(" After first operation: sum = {}", x + y);
43 })
44 .and_then(move |x: &i32, y: &i32| {
45 l2.lock().unwrap().push(*x * *y);
46 println!(" After second operation: product = {}", x * y);
47 });
48 chained.accept(&5, &3);
49 println!(" Final log: {:?}\n", *log.lock().unwrap());
50
51 // 3. ArcBiConsumer - Thread-safe shared ownership
52 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
53 let log = Arc::new(Mutex::new(Vec::new()));
54 let l = log.clone();
55 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
56 l.lock().unwrap().push(*x + *y);
57 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
58 });
59
60 let consumer1 = arc_consumer.clone();
61 let consumer2 = arc_consumer.clone();
62
63 let handle1 = thread::spawn(move || {
64 let mut c = consumer1;
65 c.accept(&10, &5);
66 });
67
68 let handle2 = thread::spawn(move || {
69 let mut c = consumer2;
70 c.accept(&20, &8);
71 });
72
73 handle1.join().unwrap();
74 handle2.join().unwrap();
75 println!(" Final log: {:?}\n", *log.lock().unwrap());
76
77 // 4. RcBiConsumer - Single-threaded shared ownership
78 println!("4. RcBiConsumer - Single-threaded shared ownership:");
79 let log = Rc::new(RefCell::new(Vec::new()));
80 let l = log.clone();
81 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
82 l.borrow_mut().push(*x + *y);
83 });
84
85 let mut clone1 = rc_consumer.clone();
86 let mut clone2 = rc_consumer.clone();
87
88 clone1.accept(&5, &3);
89 println!(" After first use: {:?}", *log.borrow());
90
91 clone2.accept(&7, &2);
92 println!(" After second use: {:?}\n", *log.borrow());
93
94 // 5. Working with closures directly
95 println!("5. Working with closures directly:");
96 let log = Arc::new(Mutex::new(Vec::new()));
97 let l = log.clone();
98 let mut closure = move |x: &i32, y: &i32| {
99 let sum = *x + *y;
100 l.lock().unwrap().push(sum);
101 };
102 closure.accept(&10, &20);
103 println!(" After closure: {:?}\n", *log.lock().unwrap());
104
105 // 6. Conditional BiConsumer
106 println!("6. Conditional BiConsumer:");
107 let log = Arc::new(Mutex::new(Vec::new()));
108 let l = log.clone();
109 let mut conditional = BoxBiConsumer::new(move |x: &i32, y: &i32| {
110 l.lock().unwrap().push(*x + *y);
111 })
112 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
113
114 conditional.accept(&5, &3);
115 println!(" Positive values: {:?}", *log.lock().unwrap());
116
117 conditional.accept(&-5, &3);
118 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
119
120 // 7. Conditional branch BiConsumer
121 println!("7. Conditional branch BiConsumer:");
122 let log = Arc::new(Mutex::new(Vec::new()));
123 let l1 = log.clone();
124 let l2 = log.clone();
125 let mut branch = BoxBiConsumer::new(move |x: &i32, _y: &i32| {
126 l1.lock().unwrap().push(*x);
127 })
128 .when(|x: &i32, y: &i32| *x > *y)
129 .or_else(move |_x: &i32, y: &i32| {
130 l2.lock().unwrap().push(*y);
131 });
132
133 branch.accept(&15, &10);
134 println!(" When x > y: {:?}", *log.lock().unwrap());
135
136 branch.accept(&5, &10);
137 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
138
139 // 8. Accumulating statistics
140 println!("8. Accumulating statistics:");
141 let count = Arc::new(Mutex::new(0));
142 let sum = Arc::new(Mutex::new(0));
143 let c = count.clone();
144 let s = sum.clone();
145 let mut stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
146 *c.lock().unwrap() += 1;
147 *s.lock().unwrap() += x + y;
148 });
149
150 stats_consumer.accept(&5, &3);
151 stats_consumer.accept(&10, &2);
152 stats_consumer.accept(&7, &8);
153
154 println!(" Count: {}", *count.lock().unwrap());
155 println!(" Sum: {}\n", *sum.lock().unwrap());
156
157 // 9. Name support
158 println!("9. Name support:");
159 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
160 println!(" Initial name: {:?}", named_consumer.name());
161
162 named_consumer.set_name("sum_calculator");
163 println!(" After setting name: {:?}", named_consumer.name());
164 println!(" Display: {}\n", named_consumer);
165
166 println!("=== Demo Complete ===");
167}Trait Implementations§
Source§impl<T, U> BiConsumer<T, U> for BoxBiConsumer<T, U>
impl<T, U> BiConsumer<T, U> for BoxBiConsumer<T, U>
Source§fn into_box(self) -> BoxBiConsumer<T, U>where
T: 'static,
U: 'static,
fn into_box(self) -> BoxBiConsumer<T, U>where
T: 'static,
U: 'static,
Source§fn into_rc(self) -> RcBiConsumer<T, U>where
T: 'static,
U: 'static,
fn into_rc(self) -> RcBiConsumer<T, U>where
T: 'static,
U: 'static,
Source§impl<T, U> BiConsumerOnce<T, U> for BoxBiConsumer<T, U>where
T: 'static,
U: 'static,
impl<T, U> BiConsumerOnce<T, U> for BoxBiConsumer<T, U>where
T: 'static,
U: 'static,
Source§fn accept_once(self, first: &T, second: &U)
fn accept_once(self, first: &T, second: &U)
Performs the one-time consumption operation
Executes the underlying function once and consumes the consumer. After calling this method, the consumer is no longer available.
§Parameters
first- Reference to the first value to consumesecond- Reference to the second value to consume
§Examples
use prism3_function::{BiConsumerOnce, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x + *y);
});
consumer.accept_once(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]);Source§fn into_box_once(self) -> BoxBiConsumerOnce<T, U>where
Self: Sized + 'static,
T: 'static,
U: 'static,
fn into_box_once(self) -> BoxBiConsumerOnce<T, U>where
Self: Sized + 'static,
T: 'static,
U: 'static,
Converts to BoxBiConsumerOnce
⚠️ Consumes self: Original consumer becomes unavailable after
calling this method.
§Returns
Returns the wrapped BoxBiConsumerOnce<T, U>
§Examples
use prism3_function::{BiConsumerOnce, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x + *y);
});
let box_once = consumer.into_box_once();
box_once.accept_once(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]);Source§fn into_fn_once(self) -> impl FnOnce(&T, &U)where
Self: Sized + 'static,
T: 'static,
U: 'static,
fn into_fn_once(self) -> impl FnOnce(&T, &U)where
Self: Sized + 'static,
T: 'static,
U: 'static,
Converts to a closure
⚠️ Consumes self: Original consumer becomes unavailable after
calling this method.
Converts the bi-consumer to a closure usable with standard library
methods requiring FnOnce.
§Returns
Returns a closure implementing FnOnce(&T, &U)
§Examples
use prism3_function::{BiConsumerOnce, BoxBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x + *y);
});
let func = consumer.into_fn_once();
func(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]);