; Update tree-sitter HTML manuals in admin/notes

* admin/notes/tree-sitter/html-manual/Language-Definitions.html
* admin/notes/tree-sitter/html-manual/Multiple-Languages.html
* admin/notes/tree-sitter/html-manual/Parser_002dbased-Font-Lock.html
* admin/notes/tree-sitter/html-manual/Parser_002dbased-Indentation.html
* admin/notes/tree-sitter/html-manual/Retrieving-Node.html: Update.

1 files changed, 8 insertions, 9 deletions

diff --git a/admin/notes/tree-sitter/html-manual/Retrieving-Node.html b/admin/notes/tree-sitter/html-manual/Retrieving-Node.html
index e1de2007077..0c086dab91d 100644
--- a/admin/notes/tree-sitter/html-manual/Retrieving-Node.html
+++ b/admin/notes/tree-sitter/html-manual/Retrieving-Node.html
@@ -262,10 +262,9 @@ is non-<code>nil</code>, it looks for smallest named child.
 <dd><p>This function traverses the subtree of <var>node</var> (including
 <var>node</var> itself), looking for a node for which <var>predicate</var>
 returns non-<code>nil</code>.  <var>predicate</var> is a regexp that is matched
-(case-insensitively) against each node&rsquo;s type, or a predicate function
-that takes a node and returns non-<code>nil</code> if the node matches.  The
-function returns the first node that matches, or <code>nil</code> if none
-does.
+against each node&rsquo;s type, or a predicate function that takes a node
+and returns non-<code>nil</code> if the node matches.  The function returns
+the first node that matches, or <code>nil</code> if none does.
 </p>
 <p>By default, this function only traverses named nodes, but if <var>all</var>
 is non-<code>nil</code>, it traverses all the nodes.  If <var>backward</var> is
@@ -279,9 +278,9 @@ down the tree.
 <dt id="index-treesit_002dsearch_002dforward"><span class="category">Function: </span><span><strong>treesit-search-forward</strong> <em>start predicate &amp;optional backward all</em><a href='#index-treesit_002dsearch_002dforward' class='copiable-anchor'> &para;</a></span></dt>
 <dd><p>Like <code>treesit-search-subtree</code>, this function also traverses the
 parse tree and matches each node with <var>predicate</var> (except for
-<var>start</var>), where <var>predicate</var> can be a (case-insensitive) regexp
-or a function.  For a tree like the below where <var>start</var> is marked
-S, this function traverses as numbered from 1 to 12:
+<var>start</var>), where <var>predicate</var> can be a regexp or a function.
+For a tree like the below where <var>start</var> is marked S, this function
+traverses as numbered from 1 to 12:
 </p>
 <div class="example">
 <pre class="example">              12
@@ -336,8 +335,8 @@ as in <code>treesit-search-forward</code>.
 <p>It takes the subtree under <var>root</var>, and combs it so only the nodes
 that match <var>predicate</var> are left.  Like previous functions, the
 <var>predicate</var> can be a regexp string that matches against each
-node&rsquo;s type case-insensitively, or a function that takes a node and
-return non-<code>nil</code> if it matches.
+node&rsquo;s type, or a function that takes a node and return non-<code>nil</code>
+if it matches.
 </p>
 <p>For example, for a subtree on the left that consist of both numbers
 and letters, if <var>predicate</var> is &ldquo;letter only&rdquo;, the returned tree