From 3538d173a22f5e3236f97b8c4b9eb0192403ee2c Mon Sep 17 00:00:00 2001
From: Marshall Lochbaum <mwlochbaum@gmail.com>
Date: Tue, 28 Jun 2022 16:52:41 -0400
Subject: Link to transpose implementation notes in index

---
 docs/implementation/primitive/index.html | 1 +
 1 file changed, 1 insertion(+)

(limited to 'docs/implementation/primitive')

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>
-- 
cgit v1.2.3