diff options
| author | Marshall Lochbaum <mwlochbaum@gmail.com> | 2022-06-28 16:52:41 -0400 |
|---|---|---|
| committer | Marshall Lochbaum <mwlochbaum@gmail.com> | 2022-06-28 16:52:41 -0400 |
| commit | 3538d173a22f5e3236f97b8c4b9eb0192403ee2c (patch) | |
| tree | bbc7a917f980cf1d2310d40545ae7236913632f8 /docs/implementation/primitive/index.html | |
| parent | ee5d2530746854d9ee32084d2f742c00c9b6d893 (diff) | |
Link to transpose implementation notes in index
Diffstat (limited to 'docs/implementation/primitive/index.html')
| -rw-r--r-- | docs/implementation/primitive/index.html | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/docs/implementation/primitive/index.html b/docs/implementation/primitive/index.html index f139e5f4..c4cc319a 100644 --- a/docs/implementation/primitive/index.html +++ b/docs/implementation/primitive/index.html @@ -9,6 +9,7 @@ <ul> <li><a href="replicate.html">Replicate</a></li> <li><a href="sort.html">Sorting</a></li> +<li><a href="transpose.html">Transpose</a></li> <li><a href="random.html">Randomness</a></li> </ul> <p>Raw speed is of course the most important factor; I also consider predictability and memory usage to be important. Predictability mostly for the benefit of the programmer, but it's also important when there are multiple algorithms to be able to compute which one will be fastest. In some cases an algorithm is best on some subset of inputs, but is effectively useless because it's too difficult to tell if the input falls in that set. Whitney and other K users sometimes profess that binary size is critically important; I don't believe this.</p> |