Notes on efficient Indices and Replicate

1 files changed, 1 insertions, 0 deletions

diff --git a/docs/implementation/primitive/index.html b/docs/implementation/primitive/index.html
index 093c94a9..7cd025d0 100644
--- a/docs/implementation/primitive/index.html
+++ b/docs/implementation/primitive/index.html
@@ -7,6 +7,7 @@
 <h1 id="primitive-implementation-notes">Primitive implementation notes</h1>
 <p>Commentary on the best methods I know for implementing various primitives. Often there are many algorithms that are viable in different situations, and in these cases I try to discuss the tradeoffs.</p>
 <ul>
+<li><a href="replicate.html">Replicate</a></li>
 <li><a href="sort.html">Sorting</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>