nexosim 1.0.0

A high performance asynchronous compute framework for system simulation.
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
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
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
mod broadcaster;
mod sender;

use std::any::Any;
use std::collections::VecDeque;
use std::fmt;
use std::sync::Mutex;

use serde::{Deserialize, Serialize};

use crate::macros::scoped_thread_local::scoped_thread_local;
use crate::model::Model;
use crate::ports::EventSinkWriter;
use crate::ports::{InputFn, ReplierFn};
use crate::simulation::Address;
use crate::util::cached_rw_lock::CachedRwLock;
use crate::util::traits::Sealed;
use crate::util::unwrap_or_throw::UnwrapOrThrow;

use broadcaster::{EventBroadcaster, QueryBroadcaster};
use sender::{FilterMapReplierSender, InfallibleSender};

use self::sender::{
    EventSinkSender, FilterMapEventSinkSender, FilterMapInputSender, InputSender,
    MapEventSinkSender, MapInputSender, MapReplierSender, ReplierSender,
};

scoped_thread_local!(pub(crate) static PORT_REG: PortsReg);
pub(crate) type PortsReg = Mutex<VecDeque<Box<dyn Any>>>;

/// An output port.
///
/// `Output` ports can be connected to input ports, i.e. to asynchronous model
/// methods that return no value. They broadcast events to all connected input
/// ports.
///
/// When an `Output` is cloned, the information on connected ports remains
/// shared and therefore all clones use and modify the same list of connected
/// ports.
///
/// Note on serialization: Output types support `serde` based serialization and
/// deserialization with some limitations. Successful state restoration relies
/// on consistent ordering of the Outputs within the models. Therefore storing
/// Outputs in data structures that do not guarantee ordering (such as hashmaps
/// or hashsets) might lead to unpredictable results after deserialization.
#[derive(Clone)]
pub struct Output<T: Clone + Send + 'static> {
    broadcaster: CachedRwLock<EventBroadcaster<T>>,
}

impl<T: Clone + Send + 'static> Output<T> {
    /// Creates a disconnected `Output` port.
    pub fn new() -> Self {
        Self::default()
    }

    /// Adds a connection to an input port of the model specified by the
    /// address.
    ///
    /// The input port must be an asynchronous method of a model of type `M`
    /// taking as argument a value of type `T` plus, optionally, a scheduler
    /// reference.
    pub fn connect<M, F, S>(&mut self, input: F, address: impl Into<Address<M>>)
    where
        M: Model,
        F: for<'a> InputFn<'a, M, T, S> + Clone,
        S: Send + 'static,
    {
        let sender = Box::new(InputSender::new(input, address.into().0));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Adds a connection to an event sink such as
    /// [`EventQueueWriter`](crate::ports::EventQueueWriter).
    pub fn connect_sink<S: EventSinkWriter<T>>(&mut self, sink: S) {
        let sender = Box::new(EventSinkSender::new(sink));
        self.broadcaster.write().unwrap().add(sender)
    }

    /// Adds an auto-converting connection to an input port of the model
    /// specified by the address.
    ///
    /// Events are mapped to another type using the closure provided in
    /// argument.
    ///
    /// The input port must be an asynchronous method of a model of type `M`
    /// taking as argument a value of the type returned by the mapping
    /// closure plus, optionally, a context reference.
    pub fn map_connect<M, C, F, U, S>(&mut self, map: C, input: F, address: impl Into<Address<M>>)
    where
        M: Model,
        C: Fn(&T) -> U + Send + Sync + 'static,
        F: for<'a> InputFn<'a, M, U, S> + Clone,
        U: Send + 'static,
        S: Send + 'static,
    {
        let sender = Box::new(MapInputSender::new(map, input, address.into().0));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Adds an auto-converting connection to an event sink such as
    /// [`EventQueueWriter`](crate::ports::EventQueueWriter).
    ///
    /// Events are mapped to another type using the closure provided in
    /// argument.
    pub fn map_connect_sink<C, U, S>(&mut self, map: C, sink: S)
    where
        C: Fn(&T) -> U + Send + Sync + 'static,
        U: Send + 'static,
        S: EventSinkWriter<U>,
    {
        let sender = Box::new(MapEventSinkSender::new(map, sink));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Adds an auto-converting, filtered connection to an input port of the
    /// model specified by the address.
    ///
    /// Events are mapped to another type using the closure provided in
    /// argument, or ignored if the closure returns `None`.
    ///
    /// The input port must be an asynchronous method of a model of type `M`
    /// taking as argument a value of the type returned by the mapping
    /// closure plus, optionally, a context reference.
    pub fn filter_map_connect<M, C, F, U, S>(
        &mut self,
        filter_map: C,
        input: F,
        address: impl Into<Address<M>>,
    ) where
        M: Model,
        C: Fn(&T) -> Option<U> + Send + Sync + 'static,
        F: for<'a> InputFn<'a, M, U, S> + Clone,
        U: Send + 'static,
        S: Send + 'static,
    {
        let sender = Box::new(FilterMapInputSender::new(
            filter_map,
            input,
            address.into().0,
        ));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Adds an auto-converting connection to an event sink such as
    /// [`EventQueueWriter`](crate::ports::EventQueueWriter).
    ///
    /// Events are mapped to another type using the closure provided in
    /// argument.
    pub fn filter_map_connect_sink<C, U, S>(&mut self, filter_map: C, sink: S)
    where
        C: Fn(&T) -> Option<U> + Send + Sync + 'static,
        U: Send + 'static,
        S: EventSinkWriter<U>,
    {
        let sender = Box::new(FilterMapEventSinkSender::new(filter_map, sink));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Broadcasts an event to all connected input ports.
    pub async fn send(&mut self, arg: T) {
        let broadcaster = self.broadcaster.write_scratchpad().unwrap();
        broadcaster.broadcast(arg).await.unwrap_or_throw();
    }
}

impl<T: Clone + Send + 'static> Default for Output<T> {
    fn default() -> Self {
        Self {
            broadcaster: CachedRwLock::new(EventBroadcaster::default()),
        }
    }
}

impl<T: Clone + Send + 'static> fmt::Debug for Output<T> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(
            f,
            "Output ({} connected ports)",
            self.broadcaster.read_unsync().len()
        )
    }
}

impl<T: Clone + Send> Serialize for Output<T> {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        // Use serialization to store output copy in the global registry.
        PORT_REG.map(|reg| reg.lock().unwrap().push_back(Box::new(self.clone())));
        serializer.serialize_unit()
    }
}

impl<'de, T: Clone + Send> Deserialize<'de> for Output<T> {
    fn deserialize<D>(_deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        // Pop stored value from the registry.
        // If registry is not present, use a default
        Ok(*PORT_REG
            .map(|reg| reg.lock().unwrap().pop_front().unwrap().downcast().unwrap())
            .unwrap_or_default())
    }
}

/// A requestor port.
///
/// `Requestor` ports can be connected to replier ports, i.e. to asynchronous
/// model methods that return a value. They broadcast queries to all connected
/// replier ports.
///
/// When a `Requestor` is cloned, the information on connected ports remains
/// shared and therefore all clones use and modify the same list of connected
/// ports.
///
/// Note on serialization: Requestor types support `serde` based serialization
/// and deserialization with some limitations. Successful state restoration
/// relies on consistent ordering of the Requestors within the models. Therefore
/// storing Requestors in data structures that do not guarantee ordering (such
/// as hashmaps or hashsets) might lead to unpredictable results after
/// deserialization.
pub struct Requestor<T: Clone + Send + 'static, R: Send + 'static> {
    broadcaster: CachedRwLock<QueryBroadcaster<T, R>>,
}

impl<T: Clone + Send + 'static, R: Send + 'static> Requestor<T, R> {
    /// Creates a disconnected `Requestor` port.
    pub fn new() -> Self {
        Self::default()
    }

    /// Adds a connection to a replier port of the model specified by the
    /// address.
    ///
    /// The replier port must be an asynchronous method of a model of type `M`
    /// returning a value of type `R` and taking as argument a value of type `T`
    /// plus, optionally, a context reference.
    pub fn connect<M, F, S>(&mut self, replier: F, address: impl Into<Address<M>>)
    where
        M: Model,
        F: for<'a> ReplierFn<'a, M, T, R, S> + Clone,
        S: Send + 'static,
    {
        let sender = Box::new(ReplierSender::new(replier, address.into().0));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Adds an auto-converting connection to a replier port of the model
    /// specified by the address.
    ///
    /// Queries and replies are mapped to other types using the closures
    /// provided in argument.
    ///
    /// The replier port must be an asynchronous method of a model of type `M`
    /// returning a value of the type returned by the reply mapping closure and
    /// taking as argument a value of the type returned by the query mapping
    /// closure plus, optionally, a context reference.
    pub fn map_connect<M, C, D, F, U, Q, S>(
        &mut self,
        query_map: C,
        reply_map: D,
        replier: F,
        address: impl Into<Address<M>>,
    ) where
        M: Model,
        C: Fn(&T) -> U + Send + Sync + 'static,
        D: Fn(Q) -> R + Send + Sync + 'static,
        F: for<'a> ReplierFn<'a, M, U, Q, S> + Clone,
        U: Send + 'static,
        Q: Send + 'static,
        S: Send + 'static,
    {
        let sender = Box::new(MapReplierSender::new(
            query_map,
            reply_map,
            replier,
            address.into().0,
        ));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Adds an auto-converting, filtered connection to a replier port of the
    /// model specified by the address.
    ///
    /// Queries and replies are mapped to other types using the closures
    /// provided in argument, or ignored if the query closure returns `None`.
    ///
    /// The replier port must be an asynchronous method of a model of type `M`
    /// returning a value of the type returned by the reply mapping closure and
    /// taking as argument a value of the type returned by the query mapping
    /// closure plus, optionally, a context reference.
    pub fn filter_map_connect<M, C, D, F, U, Q, S>(
        &mut self,
        query_filter_map: C,
        reply_map: D,
        replier: F,
        address: impl Into<Address<M>>,
    ) where
        M: Model,
        C: Fn(&T) -> Option<U> + Send + Sync + 'static,
        D: Fn(Q) -> R + Send + Sync + 'static,
        F: for<'a> ReplierFn<'a, M, U, Q, S> + Clone,
        U: Send + 'static,
        Q: Send + 'static,
        S: Send + 'static,
    {
        let sender = Box::new(FilterMapReplierSender::new(
            query_filter_map,
            reply_map,
            replier,
            address.into().0,
        ));
        self.broadcaster.write().unwrap().add(sender);
    }

    /// Broadcasts a query to all connected replier ports.
    pub async fn send(&mut self, arg: T) -> impl Iterator<Item = R> + '_ {
        self.broadcaster
            .write_scratchpad()
            .unwrap()
            .broadcast(arg)
            .await
            .unwrap_or_throw()
    }
}

// Manual clone implementation to cover cases when R is not Clone
impl<T: Clone + Send, R: Send> Clone for Requestor<T, R> {
    fn clone(&self) -> Self {
        Self {
            broadcaster: Clone::clone(&self.broadcaster),
        }
    }
}

impl<T: Clone + Send + 'static, R: Send + 'static> Default for Requestor<T, R> {
    fn default() -> Self {
        Self {
            broadcaster: CachedRwLock::new(QueryBroadcaster::default()),
        }
    }
}

impl<T: Clone + Send + 'static, R: Send + 'static> fmt::Debug for Requestor<T, R> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(
            f,
            "Requestor ({} connected ports)",
            self.broadcaster.read_unsync().len()
        )
    }
}

impl<T: Clone + Send, R: Send> Serialize for Requestor<T, R> {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        // Use serialization to store output copy in the global registry.
        PORT_REG.map(|reg| reg.lock().unwrap().push_back(Box::new(self.clone())));
        serializer.serialize_unit()
    }
}

impl<'de, T: Clone + Send, R: Send> Deserialize<'de> for Requestor<T, R> {
    fn deserialize<D>(_deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        // Pop stored value from the registry.
        // If registry is not present, use a default
        Ok(*PORT_REG
            .map(|reg| reg.lock().unwrap().pop_front().unwrap().downcast().unwrap())
            .unwrap_or_default())
    }
}

/// A requestor port with exactly one connection.
///
/// A `UniRequestor` port is connected to a replier port, i.e. to an
/// asynchronous model method that returns a value.
///
/// Note on serialization: Requestor types support `serde` based serialization
/// and deserialization with some limitations. Successful state restoration
/// relies on consistent ordering of the Requestors within the models. Therefore
/// storing Requestors in data structures that do not guarantee ordering (such
/// as hashmaps or hashsets) might lead to unpredictable results after
/// deserialization.
pub struct UniRequestor<T: Clone + Send + 'static, R: Send + 'static> {
    sender: Box<dyn InfallibleSender<T, R>>,
}

impl<T: Clone + Send + 'static, R: Send + 'static> UniRequestor<T, R> {
    /// Creates a `UniRequestor` port connected to a replier port of the model
    /// specified by the address.
    ///
    /// The replier port must be an asynchronous method of a model of type `M`
    /// returning a value of type `R` and taking as argument a value of type `T`
    /// plus, optionally, a context reference.
    pub fn new<M, F, S>(replier: F, address: impl Into<Address<M>>) -> Self
    where
        M: Model,
        F: for<'a> ReplierFn<'a, M, T, R, S> + Clone,
        S: Send + 'static,
    {
        let sender = Box::new(ReplierSender::new(replier, address.into().0));

        Self { sender }
    }

    /// Creates an auto-converting `UniRequestor` port connected to a replier
    /// port of the model specified by the address.
    ///
    /// Queries and replies are mapped to other types using the closures
    /// provided in argument.
    ///
    /// The replier port must be an asynchronous method of a model of type `M`
    /// returning a value of the type returned by the reply mapping closure and
    /// taking as argument a value of the type returned by the query mapping
    /// closure plus, optionally, a context reference.
    pub fn with_map<M, C, D, F, U, Q, S>(
        query_map: C,
        reply_map: D,
        replier: F,
        address: impl Into<Address<M>>,
    ) -> Self
    where
        M: Model,
        C: Fn(&T) -> U + Send + Sync + 'static,
        D: Fn(Q) -> R + Send + Sync + 'static,
        F: for<'a> ReplierFn<'a, M, U, Q, S> + Clone,
        U: Send + 'static,
        Q: Send + 'static,
        S: Send + 'static,
    {
        let sender = Box::new(MapReplierSender::new(
            query_map,
            reply_map,
            replier,
            address.into().0,
        ));

        Self { sender }
    }

    /// Sends a query to the connected replier port.
    pub async fn send(&mut self, arg: T) -> R {
        self.sender.send_owned(arg).await.unwrap_or_throw()
    }
}

// Manual clone implementation to cover cases when R is not Clone
impl<T: Clone + Send, R: Send> Clone for UniRequestor<T, R> {
    fn clone(&self) -> Self {
        Self {
            sender: Clone::clone(&self.sender),
        }
    }
}

impl<T: Clone + Send + 'static, R: Send + 'static> fmt::Debug for UniRequestor<T, R> {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "UniRequestor")
    }
}

impl<T: Clone + Send, R: Send> Serialize for UniRequestor<T, R> {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        // Use serialization to store output copy in the global registry.
        PORT_REG.map(|reg| reg.lock().unwrap().push_back(Box::new(self.clone())));
        serializer.serialize_unit()
    }
}

impl<'de, T: Clone + Send, R: Send> Deserialize<'de> for UniRequestor<T, R> {
    fn deserialize<D>(_deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        // Pop stored value from the registry.
        //
        // Since there is no easy way to create a default, a dummy sender is
        // used instead.
        Ok(*PORT_REG
            .map(|reg| reg.lock().unwrap().pop_front().unwrap().downcast().unwrap())
            .unwrap_or(Box::new(UniRequestor {
                sender: Box::new(FailSender),
            })))
    }
}

// A helper struct to provide a failsafe option for an invalid UniRequestor
// deserialization.
#[derive(Clone)]
struct FailSender;

impl Sealed for FailSender {}

impl<T, R> InfallibleSender<T, R> for FailSender {
    fn send(&mut self, _: &T) -> sender::RecycledFuture<'_, Result<R, crate::channel::SendError>> {
        panic!();
    }
    fn send_owned(
        &mut self,
        _: T,
    ) -> sender::RecycledFuture<'_, Result<R, crate::channel::SendError>> {
        panic!();
    }
}