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 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292
use super::{Signal, Builder, Value}; use primitives::lift::LiftSignal; use primitives::lift2::{Lift2Signal}; use primitives::fold::FoldSignal; use primitives::fork::Branch; /// Methods for manipulating signals /// pub trait SignalExt<A>: Signal<A> + Sized where Self: 'static, A: 'static + Send + Clone, { /// Transform in input signal into an output signal /// /// # Example /// /// ``` /// use std::default::Default; /// use std::sync::mpsc::*; /// use cfrp::*; /// /// let (in_tx, in_rx) = sync_channel(0); /// let (out_tx, out_rx) = channel(); /// /// spawn_topology(Default::default(), move |t| { /// t.listen(0, in_rx) /// .lift(move |i| { out_tx.send(i | (1 << 1)).unwrap(); }) /// .add_to(t); /// }); /// /// // Initial value /// assert_eq!(out_rx.recv().unwrap(), 0b00000010); /// /// // Lifted value /// in_tx.send(1).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), 0b00000011); /// ``` /// fn lift<F, B>(mut self, f: F) -> LiftSignal<F, A, B> where F: 'static + Send + Fn(A) -> B, B: 'static + Send + Clone, { self.init(); LiftSignal::new(self.config(), Box::new(self), f) } /// Combine two signals into an output signal /// /// # Example /// /// ``` /// use std::default::Default; /// use std::sync::mpsc::*; /// use cfrp::*; /// /// let (l_tx, l_rx) = sync_channel(0); /// let (r_tx, r_rx) = sync_channel(0); /// let (out_tx, out_rx) = channel(); /// /// spawn_topology(Default::default(), move |t| { /// t.listen(1 << 0, l_rx) /// .lift2(t.listen(1 << 1, r_rx), move |i,j| { out_tx.send(*i | *j).unwrap() }) /// .add_to(t); /// }); /// /// // Initial value /// assert_eq!(out_rx.recv().unwrap(), (1 << 0) | (1 << 1)); /// /// l_tx.send(1 << 2).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), (1 << 2) | (1 << 1)); /// /// r_tx.send(1 << 3).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), (1 << 2) | (1 << 3)); /// ``` /// fn lift2<F, SB, B, C>(mut self, mut right: SB, f: F) -> Lift2Signal<F, A, B, C> where SB: 'static + Signal<B>, F: 'static + Send + Fn(Value<A>, Value<B>) -> C, B: 'static + Send + Clone, C: 'static + Send + Clone, { self.init(); right.init(); Lift2Signal::new(self.config(), Box::new(self), Box::new(right), f) } /// Merge data from a signal into an accumulator and return a signal with /// the accumulator's value /// /// # Example /// /// ``` /// use std::default::Default; /// use std::sync::mpsc::*; /// use cfrp::*; /// /// let (in_tx, in_rx) = sync_channel(0); /// let (out_tx, out_rx) = channel(); /// /// spawn_topology(Default::default(), move |t| { /// t.listen(0, in_rx) /// .fold(out_tx, |tx, i| { tx.send(i | (1 << 1)).unwrap(); tx }) /// .add_to(t); /// }); /// /// // Initial value /// assert_eq!(out_rx.recv().unwrap(), 0b00000010); /// /// // Lifted value /// in_tx.send(1).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), 0b00000011); /// ``` /// fn fold<F, B>(mut self, initial: B, f: F) -> FoldSignal<F, A, B> where F: 'static + Send + Fn(B, A) -> B, B: 'static + Send + Clone, { self.init(); FoldSignal::new(self.config(), Box::new(self), initial, f) } /// Sugar for `Builder::add` /// fn add_to(self, builder: &Builder) -> Branch<A> { builder.add(self) } /// Sugar for `Builder::async` /// fn async(self, builder: &Builder) -> Branch<A> { builder.async(self) } /// Alias of `lift` fn map<F, B>(self, f: F) -> LiftSignal<F, A, B> where F: 'static + Send + Fn(A) -> B, B: 'static + Send + Clone, { self.lift(f) } /// Takes two input signals and returns a signal containing 2-tuples /// of elements from the input signals. /// /// Roughly equivalent to `Iterator::zip`, however if one signal /// changes but the other doesn't, the most-recent value of the unchanged /// signal will be output. In other words, this operation doesn't block /// on receiving changes from both inputs. /// /// # Example /// /// ``` /// use std::default::Default; /// use std::sync::mpsc::*; /// use cfrp::*; /// /// let (l_tx, l_rx): (SyncSender<usize>, Receiver<usize>) = sync_channel(0); /// let (r_tx, r_rx): (SyncSender<usize>, Receiver<usize>) = sync_channel(0); /// let (out_tx, out_rx) = channel(); /// /// spawn_topology(Default::default(), move |t| { /// t.listen(0, l_rx) /// .zip(t.listen(0, r_rx)) /// .lift(move |i| { out_tx.send(i).unwrap(); }) /// .add_to(t); /// }); /// /// // Initial value /// assert_eq!(out_rx.recv().unwrap(), (Value::Unchanged(0), Value::Unchanged(0))); /// /// l_tx.send(1).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), (Value::Changed(1), Value::Unchanged(0))); /// /// r_tx.send(1).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), (Value::Unchanged(1), Value::Changed(1))); /// ``` /// fn zip<SB, B>(self, right: SB) -> Box<Signal<(Value<A>, Value<B>)>> where SB: 'static + Signal<B>, B: 'static + Send + Clone, { Box::new( self.lift2( right, |l: Value<A>, r: Value<B>| -> (Value<A>, Value<B>) { (l,r) } ) ) } /// Same as `Iterator::enumerate`. /// /// The counter only increments when upstream data changes. To track /// the aggregate number of messages processed by a topology consider /// `Builder::counter()` /// /// # Example /// /// ``` /// use std::default::Default; /// use std::sync::mpsc::*; /// use cfrp::*; /// /// let (in_tx, in_rx) = sync_channel(0); /// let (out_tx, out_rx) = channel(); /// /// spawn_topology(Default::default(), move |t| { /// t.listen(0, in_rx) /// .enumerate() /// .lift(move |i| { out_tx.send(i).unwrap(); }) /// .add_to(t); /// }); /// /// // Initial value /// assert_eq!(out_rx.recv().unwrap(), (1, 0)); /// /// in_tx.send(1).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), (2, 1)); /// ``` /// fn enumerate(self) -> Box<Signal<(usize, A)>> { let initial = self.initial().unwrap(); Box::new( self.fold( (0, initial), |state: (usize, A), i: A| { (state.0 + 1, i) }, ) ) } /// Filter an input stream by a predicate function `F`. /// /// In this case 'filtered' is reflected by a value of `None` /// /// # Example /// /// ``` /// use std::default::Default; /// use std::sync::mpsc::*; /// use cfrp::*; /// /// let (in_tx, in_rx) = sync_channel(0); /// let (out_tx, out_rx) = channel(); /// /// spawn_topology(Default::default(), move |t| { /// t.listen(0, in_rx) /// .filter(|i| { i % 2 == 0 }) /// .lift(move |i| { out_tx.send(i).unwrap(); }) /// .add_to(t); /// }); /// /// // Initial value /// assert_eq!(out_rx.recv().unwrap(), Some(0)); /// /// in_tx.send(1).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), None); /// /// in_tx.send(2).unwrap(); /// assert_eq!(out_rx.recv().unwrap(), Some(2)); /// ``` /// fn filter<F>(self, f: F) -> Box<Signal<Option<A>>> where F: 'static + Send + Fn(&A) -> bool, { Box::new( self.lift(move |i| { if f(&i) { Some(i) } else { None } }) ) } /// Pass each value in a signal to `F` before sending it to an output /// signal. /// fn inspect<F>(self, f: F) -> Box<Signal<A>> where F: 'static + Send + Fn(&A) -> bool, { Box::new( self.lift(move |i| { f(&i); i }) ) } }