add an example to study the _recoding inbreeding_ phenomenon

this MR adds examples/inbreeding.rs which allows to do two things

• naive recoding: in order to generate a new random shard, we first k-decode the whole data and then 1-encode a single shard
• true recoding: to achieve the same goal, we directly k-recode shards into a new one

the scenario

regardless of the recoding strategy, the scenario is the same

1. data is split into k shards and n original shards are generated
2. for a given number of steps s, k shards are drawn randomly with replacement and we count the number of successful decoding, given a measure of the diversity, \delta = \frac{\#success}{\#attempts}
3. create a new recoded shard and add it to the n previous ones, i.e. n increases by one
4. repeat steps 2. and 3. as long as you want

results

examples/inbreeding.rs

@@ -4,7 +4,7 @@
 /// const NB_BYTES = 1_024 * 10
 /// const K = 10
 /// const N = 2 * $K
-/// const NB_MEASUREMENTS = 100
+/// const NB_MEASUREMENTS = 1_000
 /// const MAX_T = 150
 ///
 /// cargo run --example inbreeding -- ...[
@@ -42,7 +42,7 @@
 ///
 /// use std repeat
 ///
-/// let raw = $data | update inbreeding { take ($l - $w + 1)}
+/// # let raw = $data | update inbreeding { take ($l - $w + 1)}
 /// let smooth = $data | update inbreeding { prepend (1 | repeat $w) | window $w | each { math avg } }
 ///
 /// $smooth
@@ -50,7 +50,7 @@
 ///        let r = if $it.r == $k { "k" }  else { $"k - ($k - $it.r)" }
 ///        $"$r = ($r)$"
 ///     }
-///     | append ($raw | insert name null | insert style { line: { alpha: 0.1 } })
+///     # | append ($raw | insert name null | insert style { line: { alpha: 0.1 } })
 ///     | update inbreeding {|it|
 ///         let l = $it.inbreeding | length
 ///         $it.inbreeding | wrap y | merge (seq 1 $l | wrap x) | insert e 0