[Kde-pim] Review Request 124211: Fix inefficient algorithm

[Sergio Luis Martins]

-----------------------------------------------------------
This is an automatically generated e-mail. To reply, visit:
https://git.reviewboard.kde.org/r/124211/
-----------------------------------------------------------

(Updated June 30, 2015, 8:06 a.m.)


Status
------

This change has been marked as submitted.


Review request for KDEPIM and Daniel Vrátil.


Repository: akonadi


Description
-------

3 iterations were being done:

1) .values() iterates the whole hash internally and creates a QList (memory allocations++)
2) .contains()
3) .key(value)

Instead, iterate only once


Diffs
-----

  src/server/collectionscheduler.cpp b77249d 

Diff: https://git.reviewboard.kde.org/r/124211/diff/


Testing
-------


Thanks,

Sergio Luis Martins

_______________________________________________
KDE PIM mailing list kde-pim at kde.org
https://mail.kde.org/mailman/listinfo/kde-pim
KDE PIM home page at http://pim.kde.org/