ufotofu 0.12.5

Abstractions for lazily consuming and producing sequences
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134

//! Consumer functionality for [`BTreeSet`].
//!
//! Specifically, the module provides
//!
//! - an [`IntoConsumer`] impl for `BTreeSet<T>`,
//! - an [`IntoConsumer`] impl for `&mut BTreeSet<T>`.
//!
//! <br/>Counterpart: the [`producer::compat::btree_set`] module.

use core::fmt::Debug;

use std::collections::BTreeSet;

use crate::prelude::*;

/// The consumer of the [`IntoConsumer`] impl of `BTreeSet<T>`; it inserts consumed items to the [`BTreeSet`].
///
/// Use the [`Into`] impl to recover the set when you are done consuming items.
///
/// ```
/// use ufotofu::prelude::*;
/// use std::collections::BTreeSet;
/// # pollster::block_on(async{
/// let mut c = BTreeSet::new().into_consumer();
///
/// c.consume_item(1).await?;
/// c.consume_item(4).await?;
/// c.consume_item(2).await?;
///
/// let mut set: BTreeSet<_> = c.into();
/// let collected: Vec<_> = set.into_iter().collect();
/// assert_eq!(collected, vec![1, 2, 4]);
/// # Result::<(), Infallible>::Ok(())
/// # });
/// ```
///
/// <br/>Counterpart: the [producer::compat::btree_set::IntoProducer] type.
#[derive(Debug)]

pub struct IntoConsumer<T>(BTreeSet<T>);

impl<T> From<IntoConsumer<T>> for BTreeSet<T> {
    fn from(value: IntoConsumer<T>) -> Self {
        value.0
    }
}

impl<T: Ord> Consumer for IntoConsumer<T> {
    type Item = T;
    type Final = ();
    type Error = Infallible;

    /// Inserts the item into the set.
    async fn consume(&mut self, val: Either<Self::Item, Self::Final>) -> Result<(), Self::Error> {
        match val {
            Left(item) => {
                self.0.insert(item);
                Ok(())
            }
            Right(()) => Ok(()),
        }
    }

    async fn flush(&mut self) -> Result<(), Self::Error> {
        Ok(())
    }
}

impl<T: Ord> crate::IntoConsumer for BTreeSet<T> {
    type Item = T;
    type Final = ();
    type Error = Infallible;
    type IntoConsumer = IntoConsumer<T>;

    fn into_consumer(self) -> Self::IntoConsumer {
        IntoConsumer(self)
    }
}

/// The consumer of the [`IntoConsumer`] impl of `&mut BTreeSet<T>`; it inserts consumed items to the [`BTreeSet`].
///
/// ```
/// use ufotofu::prelude::*;
/// use std::collections::BTreeSet;
/// # pollster::block_on(async{
/// let mut set = BTreeSet::new();
/// let mut c = (&mut set).into_consumer();
///
/// c.consume_item(1).await?;
/// c.consume_item(4).await?;
/// c.consume_item(2).await?;
///
/// let collected: Vec<_> = set.into_iter().collect();
/// assert_eq!(collected, vec![1, 2, 4]);
/// # Result::<(), Infallible>::Ok(())
/// # });
/// ```
///
/// <br/>Counterpart: the [producer::compat::btree_set::IntoProducerRef] type.
#[derive(Debug)]

pub struct IntoConsumerMut<'a, T>(&'a mut BTreeSet<T>);

impl<'a, T: Ord> Consumer for IntoConsumerMut<'a, T> {
    type Item = T;
    type Final = ();
    type Error = Infallible;

    /// Inserts the item into the set.
    async fn consume(&mut self, val: Either<Self::Item, Self::Final>) -> Result<(), Self::Error> {
        match val {
            Left(item) => {
                self.0.insert(item);
                Ok(())
            }
            Right(()) => Ok(()),
        }
    }

    async fn flush(&mut self) -> Result<(), Self::Error> {
        Ok(())
    }
}

impl<'a, T: Ord> crate::IntoConsumer for &'a mut BTreeSet<T> {
    type Item = T;
    type Final = ();
    type Error = Infallible;
    type IntoConsumer = IntoConsumerMut<'a, T>;

    fn into_consumer(self) -> Self::IntoConsumer {
        IntoConsumerMut(self)
    }
}