[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-bugs-dist
Subject:    [Bug 307585] Sorting is too cpu intensive for big folders
From:       Mark <markg85 () gmail ! com>
Date:       2012-10-06 15:14:12
Message-ID: bug-307585-17878-z5ARpQMzPY () http ! bugs ! kde ! org/
[Download RAW message or body]

https://bugs.kde.org/show_bug.cgi?id=307585

--- Comment #29 from Mark <markg85@gmail.com> ---
(In reply to comment #28)
> > QHash<QChar, bool> digitCache;
> 
> You made my day.

Cool huh :)
Not very good for performance ^_^ But i took the idea to the char level. The
downside is a _lot_ hash lookups.

Could you explain your awesome idea?

-- 
You are receiving this mail because:
You are watching all bug changes.
[prev in list] [next in list] [prev in thread] [next in thread]