2008/12/9 duncan <[EMAIL PROTECTED]>: > Without even looking at the code I am almost sure that the import algorithm, > as it stands, must perform a scan of all previously imported items, > for each imported item.... that would explain the O(nsquared) > behaviour. If that's not the case something similar must be going on.
Well, maybe option "Check for duplicates when adding new cards" is answer. However it doesn't explain why deleting cards takes so much time. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mnemosyne-proj-users" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/mnemosyne-proj-users?hl=en -~----------~----~----~----~------~----~------~--~---
