<?xml version="1.0" encoding="windows-1252"?>
<node id="969947" title="Re^4: Is it possible to find the number of matching and non-matching positions in strings using perl code?" created="2012-05-11 05:15:14" updated="2012-05-11 05:15:14">
<type id="11">
note</type>
<author id="616540">
moritz</author>
<data>
<field name="doctext">
&lt;p&gt;While it might be a single instruction, I'm pretty sure the number of ticks that is used up is still proportional to the length of the strings - you just can't wrap an O(n) operation in O(1) with finite hardware.

&lt;!-- Node text goes above. Div tags should contain sig only --&gt;
&lt;div class="pmsig"&gt;&lt;div class="pmsig-616540"&gt;
[http://perl6.org/|Perl 6 - the future is here, just unevenly distributed]
&lt;/div&gt;&lt;/div&gt;</field>
<field name="root_node">
969839</field>
<field name="parent_node">
969938</field>
</data>
</node>
