pub struct BoxConditionalStatefulBiConsumer<T, U> { /* private fields */ }Expand description
BoxConditionalBiConsumer struct
A conditional bi-consumer that only executes when a predicate is satisfied.
Uses BoxStatefulBiConsumer and BoxBiPredicate for single ownership semantics.
This type is typically created by calling BoxStatefulBiConsumer::when() and is
designed to work with the or_else() method to create if-then-else logic.
§Features
- Single Ownership: Not cloneable, consumes
selfon use - Conditional Execution: Only consumes when predicate returns
true - Chainable: Can add
or_elsebranch to create if-then-else logic - Implements BiConsumer: Can be used anywhere a
BiConsumeris expected
§Examples
§Basic Conditional Execution
use qubit_function::{BiConsumer, BoxStatefulBiConsumer, StatefulBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l = log.clone();
let mut consumer = BoxStatefulBiConsumer::new(move |x: &i32, y: &i32| {
l.lock().unwrap().push(*x + *y);
});
let mut conditional = consumer.when(|x: &i32, y: &i32| *x > 0 && *y > 0);
conditional.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]); // Executed
conditional.accept(&-5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]); // Not executed§With or_else Branch
use qubit_function::{BiConsumer, BoxStatefulBiConsumer, StatefulBiConsumer};
use std::sync::{Arc, Mutex};
let log = Arc::new(Mutex::new(Vec::new()));
let l1 = log.clone();
let l2 = log.clone();
let mut consumer = BoxStatefulBiConsumer::new(move |x: &i32, y: &i32| {
l1.lock().unwrap().push(*x + *y);
}).when(|x: &i32, y: &i32| *x > 0 && *y > 0)
.or_else(move |x: &i32, y: &i32| {
l2.lock().unwrap().push(*x * *y);
});
consumer.accept(&5, &3);
assert_eq!(*log.lock().unwrap(), vec![8]); // when branch executed
consumer.accept(&-5, &3);
assert_eq!(*log.lock().unwrap(), vec![8, -15]); // or_else branch executed§Author
Haixing Hu
Implementations§
Source§impl<T, U> BoxConditionalStatefulBiConsumer<T, U>
impl<T, U> BoxConditionalStatefulBiConsumer<T, U>
Sourcepub fn and_then<C>(self, next: C) -> BoxStatefulBiConsumer<T, U>where
T: 'static,
U: 'static,
C: StatefulBiConsumer<T, U> + 'static,
pub fn and_then<C>(self, next: C) -> BoxStatefulBiConsumer<T, U>where
T: 'static,
U: 'static,
C: StatefulBiConsumer<T, U> + 'static,
Chains another bi-consumer in sequence
Combines the current conditional bi-consumer with another bi-consumer into a new bi-consumer that implements the following semantics:
When the returned bi-consumer is called with two arguments:
- First, it checks the predicate of this conditional bi-consumer
- If the predicate is satisfied, it executes the internal bi-consumer of this conditional bi-consumer
- Then, regardless of whether the predicate was
satisfied, it unconditionally executes the
nextbi-consumer
In other words, this creates a bi-consumer that conditionally executes the first action (based on the predicate), and then always executes the second action.
§Parameters
next- The next bi-consumer to execute (always executed)
§Returns
Returns a new combined bi-consumer
§Examples
use std::sync::atomic::{AtomicI32, Ordering};
use qubit_function::BoxBiConsumer;
use qubit_function::BiConsumer;
use std::sync::Arc;
let result = Arc::new(AtomicI32::new(0));
let result1 = result.clone();
let result2 = result.clone();
let consumer1 = BoxBiConsumer::new(move |x: &i32, y: &i32| {
result1.fetch_add(x + y, Ordering::SeqCst);
});
let consumer2 = BoxBiConsumer::new(move |x: &i32, y: &i32| {
result2.fetch_add(2 * (x + y), Ordering::SeqCst);
});
let conditional = consumer1.when(|x: &i32, y: &i32| *x > 0 && *y > 0);
let chained = conditional.and_then(consumer2);
chained.accept(&5, &3); // result = (5+3) + 2*(5+3) = 24
let result3 = result.clone();
result3.store(0, Ordering::SeqCst); // reset
chained.accept(&-5, &3); // result = 0 + 2*(-5+3) = -4 (not -8!)Sourcepub fn or_else<C>(self, else_consumer: C) -> BoxStatefulBiConsumer<T, U>where
T: 'static,
U: 'static,
C: StatefulBiConsumer<T, U> + 'static,
pub fn or_else<C>(self, else_consumer: C) -> BoxStatefulBiConsumer<T, U>where
T: 'static,
U: 'static,
C: StatefulBiConsumer<T, U> + 'static,
Adds an else branch
Executes the original bi-consumer when the condition is satisfied, otherwise executes else_consumer.
§Parameters
else_consumer- The bi-consumer for the else branch
§Returns
Returns a new bi-consumer with if-then-else logic
Examples found in repository?
31fn main() {
32 println!("=== BiConsumer Demo ===\n");
33
34 // 1. BoxBiConsumer - Single ownership
35 println!("1. BoxBiConsumer - Single ownership:");
36 let log = Arc::new(Mutex::new(Vec::new()));
37 let l = log.clone();
38 let box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
39 println!(" Processing: x={}, y={}", x, y);
40 l.lock().unwrap().push(*x + *y);
41 });
42 box_consumer.accept(&10, &5);
43 println!(" Result log: {:?}\n", *log.lock().unwrap());
44
45 // 2. Method chaining with BoxBiConsumer
46 println!("2. BoxBiConsumer with method chaining:");
47 let log = Arc::new(Mutex::new(Vec::new()));
48 let l1 = log.clone();
49 let l2 = log.clone();
50 let chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
51 l1.lock().unwrap().push(*x + *y);
52 println!(" After first operation: sum = {}", x + y);
53 })
54 .and_then(move |x: &i32, y: &i32| {
55 l2.lock().unwrap().push(*x * *y);
56 println!(" After second operation: product = {}", x * y);
57 });
58 chained.accept(&5, &3);
59 println!(" Final log: {:?}\n", *log.lock().unwrap());
60
61 // 3. ArcBiConsumer - Thread-safe shared ownership
62 println!("3. ArcBiConsumer - Thread-safe shared ownership:");
63 let log = Arc::new(Mutex::new(Vec::new()));
64 let l = log.clone();
65 let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
66 l.lock().unwrap().push(*x + *y);
67 println!(" Thread {:?}: sum = {}", thread::current().id(), x + y);
68 });
69
70 let consumer1 = arc_consumer.clone();
71 let consumer2 = arc_consumer.clone();
72
73 let handle1 = thread::spawn(move || {
74 let c = consumer1;
75 c.accept(&10, &5);
76 });
77
78 let handle2 = thread::spawn(move || {
79 let c = consumer2;
80 c.accept(&20, &8);
81 });
82
83 handle1.join().unwrap();
84 handle2.join().unwrap();
85 println!(" Final log: {:?}\n", *log.lock().unwrap());
86
87 // 4. RcBiConsumer - Single-threaded shared ownership
88 println!("4. RcBiConsumer - Single-threaded shared ownership:");
89 let log = Rc::new(RefCell::new(Vec::new()));
90 let l = log.clone();
91 let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
92 l.borrow_mut().push(*x + *y);
93 });
94
95 let clone1 = rc_consumer.clone();
96 let clone2 = rc_consumer.clone();
97
98 clone1.accept(&5, &3);
99 println!(" After first use: {:?}", *log.borrow());
100
101 clone2.accept(&7, &2);
102 println!(" After second use: {:?}\n", *log.borrow());
103
104 // 5. Working with closures directly
105 println!("5. Working with closures directly:");
106 let log = Arc::new(Mutex::new(Vec::new()));
107 let l = log.clone();
108 let closure = move |x: &i32, y: &i32| {
109 let sum = *x + *y;
110 l.lock().unwrap().push(sum);
111 };
112 closure.accept(&10, &20);
113 println!(" After closure: {:?}\n", *log.lock().unwrap());
114
115 // 6. Conditional BiConsumer
116 println!("6. Conditional BiConsumer:");
117 let log = Arc::new(Mutex::new(Vec::new()));
118 let l = log.clone();
119 let mut conditional = BoxStatefulBiConsumer::new(move |x: &i32, y: &i32| {
120 l.lock().unwrap().push(*x + *y);
121 })
122 .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
123
124 conditional.accept(&5, &3);
125 println!(" Positive values: {:?}", *log.lock().unwrap());
126
127 conditional.accept(&-5, &3);
128 println!(" Negative value (unchanged): {:?}\n", *log.lock().unwrap());
129
130 // 7. Conditional branch BiConsumer
131 println!("7. Conditional branch BiConsumer:");
132 let log = Arc::new(Mutex::new(Vec::new()));
133 let l1 = log.clone();
134 let l2 = log.clone();
135 let mut branch = BoxStatefulBiConsumer::new(move |x: &i32, _y: &i32| {
136 l1.lock().unwrap().push(*x);
137 })
138 .when(|x: &i32, y: &i32| *x > *y)
139 .or_else(move |_x: &i32, y: &i32| {
140 l2.lock().unwrap().push(*y);
141 });
142
143 branch.accept(&15, &10);
144 println!(" When x > y: {:?}", *log.lock().unwrap());
145
146 branch.accept(&5, &10);
147 println!(" When x <= y: {:?}\n", *log.lock().unwrap());
148
149 // 8. Accumulating statistics
150 println!("8. Accumulating statistics:");
151 let count = Arc::new(Mutex::new(0));
152 let sum = Arc::new(Mutex::new(0));
153 let c = count.clone();
154 let s = sum.clone();
155 let stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
156 *c.lock().unwrap() += 1;
157 *s.lock().unwrap() += x + y;
158 });
159
160 stats_consumer.accept(&5, &3);
161 stats_consumer.accept(&10, &2);
162 stats_consumer.accept(&7, &8);
163
164 println!(" Count: {}", *count.lock().unwrap());
165 println!(" Sum: {}\n", *sum.lock().unwrap());
166
167 // 9. Name support
168 println!("9. Name support:");
169 let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
170 println!(" Initial name: {:?}", named_consumer.name());
171
172 named_consumer.set_name("sum_calculator");
173 println!(" After setting name: {:?}", named_consumer.name());
174 println!(" Display: {}\n", named_consumer);
175
176 println!("=== Demo Complete ===");
177}