Fellow monks,
Parsing a document and searching for key terms, which of these is best for speed of execution and memory utilization?
Option 1:
Checking a hash of about 100,000 entries:
foreach $word( @termList )
{
if ( exists( $hash{ $word } ) )
{
# Record occurrence of term
}
}
Option 2:
100,000 global substitutions
foreach $word ( keys $termHash )
{
$document =~ s/$word/$termHash{ $word }/g;
}
thanks much,
bw
updated: Correcton to option 2. Thanks to Roy Johnson
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|