Without knowing more about the data and the rules, I don't think you can get away with comparing each defect with all the rules.
Having said that, if you have many rules of the form "specific_attribute equals X" or "specific_attribute falls between Y and Z", you can preprocess the rule data. For exact matches, build hash; for ranged matches, use something like a segment tree. That would reduce your algorithm from O(A*R) to O((A+R)*log2(R)), where A is the total number of attributes (of all defects together) and R the number of rules.
-
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.
|