How much memory may a HPPL program use on a G2?

[komame]

Hi Tyann,

(09-23-2023 11:15 AM)Tyann Wrote:  I've improved my search routine and I'm now for ??e??r???? <10s.

The results after the modification:
??e??r??? => 386 words found in 5.03 - 5.81s (previously 5.6 - 7.6s)
??e??r??s => 130 words found in 4.72 - 5.63s (previously 5.7 - 7.7s)
??e?????s => 1031 words found in 5.32 - 6.38s (previously 5.8 - 7.3s)
p?e??r??? => 93 words forund in 1.10 - 1.27s (previously 1.3 - 2.0s)
 a??????? => 3167 words found in 1.413 - 1.801s (previously 1.461 - 1.719s)
a???????? => 3839 words found in 2.270 - 2.597s (previously 2.363 - 2.725s)

In some cases, this method works slower:
     a??? => 123 words found in 0.031 - 0.043s (previously 0.021 - 0.023s)
   a????? => 1101 words found in 0.287 - 0.392s (previously 0.255 - 0.291s)
sc???r??? => 9 words found in 0.61 - 0.67s (previously 0.597 - 0.618s)
p????eurs => 29 words in 1.25 - 1.50s (previously 0.975 - 1.171s)

I suspect that the time it takes to compare a single letter is longer because we have to read the index twice, so in certain cases, it may indeed take longer than just comparing without retrieving the index of the letter. This depends on the ratio of the number of letters to compare to the total number of letters in the word, and depending on the case, the old or new method should be selected.