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
/*!
Examples of data structures and algorithms in Fungi.
### Basics
- [`basic_write_scope`](https://docs.rs/fungi-lang/0/src/fungi_lang/examples/basic_write_scope.rs.html)
demonstrate _write scopes_, which distinctly qualify written names for different dynamic calling contexts.
### Sequences
Sequences of natural numbers, represented as probabilistically-balanced binary trees (level trees):
- [`seq_max`](https://docs.rs/fungi-lang/0/src/fungi_lang/examples/seq_max.rs.html)
finds the maximum element in a sequence.
- [`seq_filter`](https://docs.rs/fungi-lang/0/src/fungi_lang/examples/seq_filter.rs.html)
filters a sequence of elements, producing a new (smaller) sequence.
### Sets
Sets of natural numbers, represented as probabilistically-balanced binary hash tries:
**TODO**
### Quickhull
Computes the convex hull, in sorted order, of an unordered sequence of points in 2D space.
**TODO**
*/
/// Find the maximum element in a sequence
///
/// [Fungi listing](https://docs.rs/fungi-lang/0/src/fungi_lang/examples/seq_max.rs.html)
/// Filter a sequence of elements, producing a new (smaller) sequence
///
/// [Fungi listing](https://docs.rs/fungi-lang/0/src/fungi_lang/examples/seq_filter.rs.html)
// --- In progress: