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
/*
* Copyright 2022 Weavers @ Eternal Loom. All rights reserved.
* Use of this software is governed by the license that can be
* found in LICENSE file in the source repository.
*/
//! Contains [`Interface`] and [`InterfaceType`] and their essential
//! implementations used to model behaviors and states of systems.
//!
//! An [`Interface`] specifies the observable behavior of a system. By
//! generalizing the idea of interfaces and combining with [`InterfaceType`],
//! we will be able to model all aspects of complex dynamic system.
//!
//! ## Interfaces
//!
//! In its simplest form, an interface specifies how to the system converts a
//! set of inputs into a set of outputs. We can write this as
//!
//! ```text
//! f: (I) → O
//! ```
//!
//! This conforms to our notion of functions in programming. This describes
//! the observable behavior of a system we are modeling, a _unit of
//! computation_, if we may.
//!
//! While it is simplistic to think of _f_ as a function, it is, in fact, far
//! more general. It can represent an event, a process or even a complete
//! system. It is the _f interface_ that contractually guarantees that the
//! system will return an output _O_ given an input _I_. It captures the notion
//! of some computation, an _f computation_ or an _f system_.
//!
//! In _Rust_, this this is captured by the [`call`][`Interface::call`] method on
//! the [`Interface`] trait.
//!
//! ```ignore
//! fn call(input: I) -> O;
//! ```
//!
//! [`metals`]: https://docs.rs/metals/
/// An `Interface` specifies the behavior of a system as a map from _input_ to
/// _output_.
///
/// It is easy to think of an `interface` as a _function_. But it is far more
/// general and can represent a function, a network call, an event, a process,
/// an event or a complete system. The essence of `Interface` is captured by
/// the `call` method.
///
/// ```ignore
/// fn call(input: I) -> O;
/// ```
///
/// ## A Few Examples
///
/// ### A _Function_ as `Interface`
///
/// TBD
///
/// ### A _Type_ implementing `Interface`
///
/// A simple increment interface. This is not very interesting, but just
/// to start building familiarity with `Interface`s.
///
/// ```
/// use metals_poly::interface::Interface;
/// /// The types that will implement the necessary increment behavior
/// struct Increment;
///
/// /// Increment represents a computation that turns i32 into some other i32.
/// impl Interface<i32, i32> for Increment {
/// /// Increment the input by 1.
/// fn call(input: i32) -> i32 {
/// input + 1
/// }
/// }
///
/// assert_eq!(Increment::call(1), 2);
/// ```
///
/// There are no `self` (read it as `no state`) or multiple arguments or
/// anything interesting here at all. Looks very boring, to be honest. While
/// it may not appear terribly exciting, let us build a few more interfaces
/// for Increment.
///
/// ```
/// # use metals_poly::interface::Interface;
/// #
/// struct Increment;
/// // x-- hiding previous lines for brevity
/// #
/// # impl Interface<i32, i32> for Increment {
/// # fn call(input: i32) -> i32 {
/// # input + 1
/// # }
/// # }
/// #
///
/// // Increment interface for u32 -> u32
/// impl Interface<u32, u32> for Increment {
/// fn call(input: u32) -> u32 {
/// input + 1
/// }
/// }
///
/// // We have to tell the input type
/// assert_eq!(Increment::call(1u32), 2u32);
/// // This calls previous i32 -> i32
/// assert_eq!(Increment::call(1), 2);
/// ```
///
/// But if we add another interface say, say to increment by 10, for same
/// input and output types, we get compiler error.
///
/// ```compile_fail
/// # use metals_poly::interface::Interface;
/// #
/// struct Increment;
///
/// impl Interface<i32, i32> for Increment {
/// fn call(input: i32) -> i32 {
/// input + 1
/// }
/// }
///
/// // This will lead to compiler error for reimplementing the same function
/// impl Interface<i32, i32> for Increment {
/// fn call(input: i32) -> i32 {
/// input + 10
/// }
/// }
/// ```
///
/// But we can mix input and output types. For e.g., we can have the same
/// increment by 1 method defined for i32 -> u32 (or vice versa).
///
/// ```
/// # use metals_poly::interface::Interface;
/// #
/// struct Increment;
/// // x-- hiding previous code lines for brevity
/// #
/// // Increment interface for i32 -> i32
/// impl Interface<i32, i32> for Increment {
/// // x-- snip implementation code
/// # fn call(input: i32) -> i32 {
/// # input + 1
/// # }
/// }
/// #
/// // Increment interface for u32 -> u32
/// impl Interface<u32, u32> for Increment {
/// // x-- snip implementation code
/// # fn call(input: u32) -> u32 {
/// # input + 1
/// # }
/// }
/// // Increment interface for i32 -> u32
/// impl Interface<i32, u32> for Increment {
/// fn call(input: i32) -> u32 {
/// // x-- snip implementation code
/// u32::try_from(input).unwrap() + 1u32
/// }
/// }
///
/// // Now we have to provide a lot of type information to both at calling
/// // and at assert
///
/// // Calling i32 -> i32. Needs type info even for i32 -> i32
/// let o: i32 = Increment::call(1i32);
/// assert_eq!(o, 2i32);
/// // Calling i32 -> u32
/// let o: u32 = Increment::call(1i32);
/// assert_eq!(o, 2u32);
/// // Calling u32 -> u32, not different from last time
/// assert_eq!(Increment::call(1u32), 2u32);
/// ```
///
/// An `InterfaceType`
///
/// Just placeholders
// Some blanket implementations for mutable references to interfaces.
// impl<'a, T, Input, Output> Interface<Input, Output> for &'a mut T
// where
// T: Interface<Input, Output> + 'a,
// {
// fn call(&mut self, input: Input) -> Output {
// (**self).call(input)
// }
// }
// impl<'a, T, Input, Output> Interface<Input, Output> for Box<T>
// where
// T: Interface<Input, Output> + ?Sized,
// {
// fn call(&mut self, input: Input) -> Output {
// (**self).call(input)
// }
// }