From 65eef4fade5eb426dae01d480f383b8a30b23071 Mon Sep 17 00:00:00 2001
From: Marshall Lochbaum <mwlochbaum@gmail.com>
Date: Wed, 11 Aug 2021 14:06:02 -0400
Subject: Change "BQN / main" in header to "(github) / BQN"

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

(limited to 'docs/implementation/primitive/replicate.html')

diff --git a/docs/implementation/primitive/replicate.html b/docs/implementation/primitive/replicate.html
index 5b9cf07b..9d539d40 100644
--- a/docs/implementation/primitive/replicate.html
+++ b/docs/implementation/primitive/replicate.html
@@ -3,7 +3,7 @@
   <link href="../../style.css" rel="stylesheet"/>
   <title>BQN: Implementation of Indices and Replicate</title>
 </head>
-<div class="nav"><a href="https://github.com/mlochbaum/BQN">BQN</a> / <a href="../../index.html">main</a> / <a href="../index.html">implementation</a> / <a href="index.html">primitive</a></div>
+<div class="nav">(<a href="https://github.com/mlochbaum/BQN">github</a>) / <a href="../../index.html">BQN</a> / <a href="../index.html">implementation</a> / <a href="index.html">primitive</a></div>
 <h1 id="implementation-of-indices-and-replicate">Implementation of Indices and Replicate</h1>
 <p>The replicate family of functions contains not just primitives but powerful tools for implementing other functionality. The most important is converting <a href="#booleans-to-indices">bits to indices</a>: AVX-512 extensions implement this natively for various index sizes, and even with no SIMD support at all there are surprisingly fast table-based algorithms for it.</p>
 <p><a href="#replicate">General replication</a> is more complex. Branching will slow many useful cases down considerably when using the obvious solution. However, branch-free techniques introduce overhead for larger replication amounts. Hybridizing these seems to be the only way, but it's finicky.</p>
-- 
cgit v1.2.3