Documentation for Find

2 files changed, 4 insertions, 3 deletions

diff --git a/docs/doc/index.html b/docs/doc/index.html
index 7ccb5768..e6bfb843 100644
--- a/docs/doc/index.html
+++ b/docs/doc/index.html
@@ -5,7 +5,7 @@
 </head>
 <div class="nav"><a href="https://github.com/mlochbaum/BQN">BQN</a> / <a href="../index.html">main</a></div>
 <h1 id="bqn-documentation">BQN documentation</h1>
-<p>BQN's documentation describes what features it has, how to use them (with examples), and why they were chosen. For a linear introduction to the language, see the <a href="../tutorial/index.html">tutorials</a>. While the core language <a href="../spec/index.html">specification</a> is complete, the documentation still has some gaps.</p>
+<p>BQN's documentation describes what features it has, how to use them (with examples), and why they were chosen. For a linear introduction to the language, see the <a href="../tutorial/index.html">tutorials</a>. While the core language <a href="../spec/index.html">specification</a> is complete, the documentation still has minor gaps.</p>
 <p>Overview:</p>
 <ul>
 <li><a href="syntax.html">Syntax</a></li>
@@ -40,6 +40,7 @@
 <li><a href="assert.html">Assert</a> (<code><span class='Function'>!</span></code>)</li>
 <li><a href="reshape.html">Deshape and Reshape</a> (<code><span class='Function'>⥊</span></code>)</li>
 <li><a href="enclose.html">Enclose</a> (<code><span class='Function'>&lt;</span></code>)</li>
+<li><a href="find.html">Find</a> (<code><span class='Function'>⍷</span></code>)</li>
 <li><a href="fold.html">Fold and Insert</a> (<code><span class='Modifier'>´˝</span></code>)</li>
 <li><a href="group.html">Group</a> (<code><span class='Function'>⊔</span></code>)</li>
 <li><a href="identity.html">Identity functions</a> (<code><span class='Function'>⊢⊣</span></code>)</li>
diff --git a/docs/doc/primitive.html b/docs/doc/primitive.html
index 84bd38b3..56b8a1a3 100644
--- a/docs/doc/primitive.html
+++ b/docs/doc/primitive.html
@@ -9,7 +9,7 @@
 <p>Primitives have no side effects other than errors, and can't perform infinite computations, except when a primitive modifier calls an operand function that does one of these things (this can only happen when arguments are passed, as primitive modifiers are always deferred). Side effects here include both writing state such as variables or printed output, and reading any outside state, so that a function without them always returns the same result if passed the same arguments. Since trains and list notation have the same nice properties, tacit code written entirely with primitives, trains, and lists always describes finite, self-contained computations.</p>
 <p>Recursion is the primary way to perform potentially infinite computations in BQN, and it can be packaged into <a href="control.html">control structures</a> like <code><span class='Function'>While</span></code> for ease of use. A given BQN implementation might also provide <a href="../spec/system.html">system values</a> for &quot;impure&quot; tasks like file access or other I/O.</p>
 <h2 id="functions">Functions</h2>
-<p>Functions that have significant differences from APL functions are marked with an asterisk. A few of the non-asterisk links go the the APL Wiki currently.</p>
+<p>Functions that have significant differences from APL equivalents or don't appear in APL are marked with an asterisk.</p>
 <table>
 <thead>
 <tr>
@@ -222,7 +222,7 @@
 <tr>
 <td><code><span class='Function'>⍷</span></code></td>
 <td><a href="selfcmp.html#deduplicate">Deduplicate</a></td>
-<td><a href="https://aplwiki.com/wiki/Find">Find</a></td>
+<td><a href="find.html">Find</a></td>
 </tr>
 <tr>
 <td><code><span class='Function'>⊔</span></code></td>