Skip to main content

BoxConditionalStatefulBiConsumer

Struct BoxConditionalStatefulBiConsumer 

Source
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 self on use
  • Conditional Execution: Only consumes when predicate returns true
  • Chainable: Can add or_else branch to create if-then-else logic
  • Implements BiConsumer: Can be used anywhere a BiConsumer is 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

Implementations§

Source§

impl<T, U> BoxConditionalStatefulBiConsumer<T, U>

Source

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:

  1. First, it checks the predicate of this conditional bi-consumer
  2. If the predicate is satisfied, it executes the internal bi-consumer of this conditional bi-consumer
  3. Then, regardless of whether the predicate was satisfied, it unconditionally executes the next bi-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!)
Source

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?
examples/consumers/bi_consumer_demo.rs (lines 140-142)
32fn main() {
33    println!("=== BiConsumer Demo ===\n");
34
35    // 1. BoxBiConsumer - Single ownership
36    println!("1. BoxBiConsumer - Single ownership:");
37    let log = Arc::new(Mutex::new(Vec::new()));
38    let l = log.clone();
39    let box_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
40        println!("  Processing: x={}, y={}", x, y);
41        l.lock().unwrap().push(*x + *y);
42    });
43    box_consumer.accept(&10, &5);
44    println!("  Result log: {:?}\n", *log.lock().unwrap());
45
46    // 2. Method chaining with BoxBiConsumer
47    println!("2. BoxBiConsumer with method chaining:");
48    let log = Arc::new(Mutex::new(Vec::new()));
49    let l1 = log.clone();
50    let l2 = log.clone();
51    let chained = BoxBiConsumer::new(move |x: &i32, y: &i32| {
52        l1.lock().unwrap().push(*x + *y);
53        println!("  After first operation: sum = {}", x + y);
54    })
55    .and_then(move |x: &i32, y: &i32| {
56        l2.lock().unwrap().push(*x * *y);
57        println!("  After second operation: product = {}", x * y);
58    });
59    chained.accept(&5, &3);
60    println!("  Final log: {:?}\n", *log.lock().unwrap());
61
62    // 3. ArcBiConsumer - Thread-safe shared ownership
63    println!("3. ArcBiConsumer - Thread-safe shared ownership:");
64    let log = Arc::new(Mutex::new(Vec::new()));
65    let l = log.clone();
66    let arc_consumer = ArcBiConsumer::new(move |x: &i32, y: &i32| {
67        l.lock().unwrap().push(*x + *y);
68        println!("  Thread {:?}: sum = {}", thread::current().id(), x + y);
69    });
70
71    let consumer1 = arc_consumer.clone();
72    let consumer2 = arc_consumer.clone();
73
74    let handle1 = thread::spawn(move || {
75        let c = consumer1;
76        c.accept(&10, &5);
77    });
78
79    let handle2 = thread::spawn(move || {
80        let c = consumer2;
81        c.accept(&20, &8);
82    });
83
84    handle1.join().unwrap();
85    handle2.join().unwrap();
86    println!("  Final log: {:?}\n", *log.lock().unwrap());
87
88    // 4. RcBiConsumer - Single-threaded shared ownership
89    println!("4. RcBiConsumer - Single-threaded shared ownership:");
90    let log = Rc::new(RefCell::new(Vec::new()));
91    let l = log.clone();
92    let rc_consumer = RcBiConsumer::new(move |x: &i32, y: &i32| {
93        l.borrow_mut().push(*x + *y);
94    });
95
96    let clone1 = rc_consumer.clone();
97    let clone2 = rc_consumer.clone();
98
99    clone1.accept(&5, &3);
100    println!("  After first use: {:?}", *log.borrow());
101
102    clone2.accept(&7, &2);
103    println!("  After second use: {:?}\n", *log.borrow());
104
105    // 5. Working with closures directly
106    println!("5. Working with closures directly:");
107    let log = Arc::new(Mutex::new(Vec::new()));
108    let l = log.clone();
109    let closure = move |x: &i32, y: &i32| {
110        let sum = *x + *y;
111        l.lock().unwrap().push(sum);
112    };
113    closure.accept(&10, &20);
114    println!("  After closure: {:?}\n", *log.lock().unwrap());
115
116    // 6. Conditional BiConsumer
117    println!("6. Conditional BiConsumer:");
118    let log = Arc::new(Mutex::new(Vec::new()));
119    let l = log.clone();
120    let mut conditional = BoxStatefulBiConsumer::new(move |x: &i32, y: &i32| {
121        l.lock().unwrap().push(*x + *y);
122    })
123    .when(|x: &i32, y: &i32| *x > 0 && *y > 0);
124
125    conditional.accept(&5, &3);
126    println!("  Positive values: {:?}", *log.lock().unwrap());
127
128    conditional.accept(&-5, &3);
129    println!("  Negative value (unchanged): {:?}\n", *log.lock().unwrap());
130
131    // 7. Conditional branch BiConsumer
132    println!("7. Conditional branch BiConsumer:");
133    let log = Arc::new(Mutex::new(Vec::new()));
134    let l1 = log.clone();
135    let l2 = log.clone();
136    let mut branch = BoxStatefulBiConsumer::new(move |x: &i32, _y: &i32| {
137        l1.lock().unwrap().push(*x);
138    })
139    .when(|x: &i32, y: &i32| *x > *y)
140    .or_else(move |_x: &i32, y: &i32| {
141        l2.lock().unwrap().push(*y);
142    });
143
144    branch.accept(&15, &10);
145    println!("  When x > y: {:?}", *log.lock().unwrap());
146
147    branch.accept(&5, &10);
148    println!("  When x <= y: {:?}\n", *log.lock().unwrap());
149
150    // 8. Accumulating statistics
151    println!("8. Accumulating statistics:");
152    let count = Arc::new(Mutex::new(0));
153    let sum = Arc::new(Mutex::new(0));
154    let c = count.clone();
155    let s = sum.clone();
156    let stats_consumer = BoxBiConsumer::new(move |x: &i32, y: &i32| {
157        *c.lock().unwrap() += 1;
158        *s.lock().unwrap() += x + y;
159    });
160
161    stats_consumer.accept(&5, &3);
162    stats_consumer.accept(&10, &2);
163    stats_consumer.accept(&7, &8);
164
165    println!("  Count: {}", *count.lock().unwrap());
166    println!("  Sum: {}\n", *sum.lock().unwrap());
167
168    // 9. Name support
169    println!("9. Name support:");
170    let mut named_consumer = BoxBiConsumer::<i32, i32>::noop();
171    println!("  Initial name: {:?}", named_consumer.name());
172
173    named_consumer.set_name("sum_calculator");
174    println!("  After setting name: {:?}", named_consumer.name());
175    println!("  Display: {}\n", named_consumer);
176
177    println!("=== Demo Complete ===");
178}

Trait Implementations§

Source§

impl<T, U> Debug for BoxConditionalStatefulBiConsumer<T, U>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<T, U> Display for BoxConditionalStatefulBiConsumer<T, U>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<T, U> StatefulBiConsumer<T, U> for BoxConditionalStatefulBiConsumer<T, U>

Source§

fn accept(&mut self, first: &T, second: &U)

Performs the consumption operation Read more
Source§

fn into_box(self) -> BoxStatefulBiConsumer<T, U>
where Self: 'static,

Converts to BoxStatefulBiConsumer Read more
Source§

fn into_rc(self) -> RcStatefulBiConsumer<T, U>
where Self: 'static,

Converts to RcStatefulBiConsumer Read more
Source§

fn into_fn(self) -> impl FnMut(&T, &U)

Converts bi-consumer to a closure Read more
Source§

fn into_arc(self) -> ArcStatefulBiConsumer<T, U>
where Self: Sized + Send + 'static,

Converts to ArcStatefulBiConsumer Read more
Source§

fn into_once(self) -> BoxBiConsumerOnce<T, U>
where Self: Sized + 'static,

Convert to BiConsumerOnce Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.