Update learning docs

Author: codereport

learning/LIVESTREAM_LESSONS.md

@@ -49,13 +49,13 @@ palindrome =. (-: |.)    NB. hook version
 * That Travis-CI is not free, you have 10,000 credits which get used per minute per OS 
 * We learned the following about CI pricing:
 
-|    Platform    | Free Linux Minutes |
-| :------------: | :----------------: |
-|   Travis CI    |        1000        |
-| Azure Pipelines|        1800        |
-| Github Actions |        2000        |
-|   Buildkite    |     Infinity?      |
-|   Appveyor     |     Infinity?      |
+|    Platform     | Free Linux Minutes |
+| :-------------: | :----------------: |
+|    Travis CI    |        1000        |
+| Azure Pipelines |        1800        |
+| Github Actions  |        2000        |
+|    Buildkite    |     Infinity?      |
+|    Appveyor     |     Infinity?      |
 
 * We learned for some reason macOS is 5-10x more costly when it comes to CI
 * ~~We should checkout GitHub actions~~
@@ -119,3 +119,11 @@ Prelude> let innerProduct = blackbird sum (zipWith (*))
 * Learned that MicroAPL refers to "tack" as pass (and Dyalog APL refers to it as same)
 * Learned about the [P Programming Language](https://github.com/p-org/P)
 * Learned for a multi-line J function to use `f =. 3 : 0` or `g =. 4 : 0`
+
+### Livestream #8 2021-02-18
+
+* `x y z | value` is the sparse array view
+* We learned `=` has lower precedence that equality comparision in C++
+* IRS = Integral/Integrated Rank Support (optimizations for certain verbs - see [this paper](https://www.jsoftware.com/papers/rank.htm))
+* Discrovered [Try J](http://tryj.freeddns.org/) site set up by Nathan
+* Used our first C++ Standard Algorithm (`std::mismatch` x2)

learning/REFACTORINGS.md

@@ -9,27 +9,28 @@
 
 | Rule  |   Core Guideline   | Count |
 | :---: | :----------------: | :---: |
-| CON.4 |    Use `const`     |   1   |
+| CON.4 |    Use `const`     |   4   |
 | ES.21 |    Reduce scope    |   3   |
-| ES.22 |  Decl-Init Split   |   2   |
-| ES.30 |   No Text Macros   |   4   |
+| ES.22 |  Decl-Init Split   |   5   |
+| ES.30 |   No Text Macros   |   6   |
 | ES.49 | Use explicit casts |   4   |
 | E.12  |   Use `noexcept`   |   3   |
 
 ### Refactoring Translations
 
-|         From          |                       To                       |
-| :-------------------: | :--------------------------------------------: |
-|          `A`          |                    `array`                     |
-|       `SETIC` 1       |                 `item_count()`                 |
-|       `REPSGN`        |               `replicate_sign` 2               |
-|         `AV`          |              `pointer_to_values`               |
-|         `IAV`         |              `pointer_to_values`               |
-|    `IAV(w)[i] = k`    |            `set_value_at(w, i, k)`             |
-|       `k & ~1`        |               `!zero_or_one(k)`                |
-| `GAT0(z, TYPE, x, y)` | `z = make_array<TYPE, copy_shape_0>(jt, x, y)` |
-|       `GA(...)`       |                  `make_array`                  |
-|         `sc`          |             `make_scalar_integer`              |
+|         From          |                         To                          |
+| :-------------------: | :-------------------------------------------------: |
+|          `A`          |                       `array`                       |
+|       `SETIC` 1       |                   `item_count()`                    |
+|       `REPSGN`        |                 `replicate_sign` 2                  |
+|         `AV`          |                 `pointer_to_values`                 |
+|         `IAV`         |                 `pointer_to_values`                 |
+|    `IAV(w)[i] = k`    |               `set_value_at(w, i, k)`               |
+|       `k & ~1`        |                  `!zero_or_one(k)`                  |
+| `GAT0(z, TYPE, x, y)` |   `z = make_array<TYPE, copy_shape_0>(jt, x, y)`    |
+|       `GA(...)`       |                    `make_array`                     |
+|         `sc`          |                `make_scalar_integer`                |
+|      `DO(m, s)`       | `for (int i = 0; i < m; ++i) m` OR `std::algorithm` |
 
 1. There could be exceptions where this doesn't work
 2. Will probably be renamed