You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
<p>The basic premise of this algorithm is to walk all searchable text nodes within a block,
115907
115907
collecting them into a list. The list is then concatenated into a single string in which we can
115908
-
search, using the node list to determine offsets with a node so we can return a <span>range</span>.</p>
115908
+
search, using the node list to determine offsets with a node so we can return a
115909
+
<span>range</span>.</p>
115909
115910
115910
115911
<pre><code class="html">Collection breaks when we hit a block node, e.g. searching over this tree:
115911
-
<div>
115912
-
a<em>b</em>c<div>d</div>e
115913
-
</div></code></pre>
115912
+
<div>
115913
+
a<em>b</em>c<div>d</div>e
115914
+
</div></code></pre>
115914
115915
115915
115916
<p>Will perform a search on "<code data-x="">abc</code>", then on "<code data-x="">d</code>",
115916
115917
then on "<code data-x="">e</code>".
115917
115918
115918
-
<p>Thus, <var>query</var> will only match text that is continuous (i.e., uninterrupted by a block-level container) within a single block-level container.</p>
115919
+
<p>Thus, <var>query</var> will only match text that is continuous (i.e., uninterrupted by a
115920
+
block-level container) within a single block-level container.</p>
0 commit comments