[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-02 21:25:50
Message-ID: bug-307585-17878-aa2wWcV1yT () http ! bugs ! kde ! org/
[Download RAW message or body]

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

--- Comment #20 from Mark <markg85@gmail.com> ---
(In reply to comment #19)
> static inline bool isDigit(QChar c)
> {
>     return unsigned(c.unicode() - '0') < 10U;
> }
> 
> This will only handle arabic digits, but I don't know if non-arabic digits
> have been handled before. The allocations I was speaking about are those
> that are done inside localeAwareCompare().

Ohh you actually meant inside localeAwareCompare.
I'm not touching Qt internals :) This optimizing is difficult enough as it is.
> 
> Regarding your request on the qt list, I looked at
> http://unicode.org/reports/tr10/ (Unicode Collating), but unfortunately, it
> says it won't handle numerical sorting, so it looks like we still need the
> custom code even with Qt 5.x.

The collating sounds interesting. I wonder how fast it will be. Thiago replied
in my request and told me that "QCollator will be public in Qt 5.1." :) I don't
know if that one will do numerical sorting...

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