Quote:
Originally Posted by drMerry
@chaley
this is not a 'must be'.
For example, you could use a hashset with authors (so every author is just inserted once) and one for titles.
If you find a match in both sets, you lookup the books having the matched title (A). Than you lookup the authors (B) of this book and check if these authors (B) would match any titles written by Author (A).
Than it is a match. No big memory issue and even not a big CPU-issue I think.
|
The problem is that what you propose is a completely different implementation from what is there now. My 'only way' assumed that kiwidude wasn't going to rewrite the plugin from the ground up.
In addition, I don't see how it would work at reasonable performance. By definition you would have a book's title and authors in the main sets. It seems that you would be doing multiple set intersections on a book-by-book basis, especially when factoring in exemption groups. But this is neither here nor there, as I could easily be wrong.