[Qt-interest] qcompleter - more efficient matching

[cb]

Thank you for your message. I added my vote.

<alessandro.portale at nokia.com> wrote in message 
news:66E3F00448310D44B4710E054DE31F3C0384E06DEE at NOK-EUMSG-06.mgdnok.nokia.com...
> Hi,
>
> QCompleter with its current Api is unfortunately very hard (perhaps even 
> impossible) to extend.
> Please add your vote to http://bugreports.qt.nokia.com/browse/QTBUG-7830 
> to underline the relevance.
>
> Sorry, that I cannot offer a better answer.
>
> Alessandro
> ________________________________________
> From: qt-interest-bounces at trolltech.com 
> [qt-interest-bounces at trolltech.com] On Behalf Of ext cb [cb at noaddr.com]
> Sent: Sunday, November 14, 2010 05:33
> To: qt-interest at trolltech.com
> Subject: [Qt-interest] qcompleter - more efficient matching
>
> Hello:
>
> Currently the qcompleter tries to find a match by doing a linear search, 
> or
> by doing a binary search in case the modelSorting is set to 
> xxxSortedModel.
>
> Is it possible to take over the searching mechanism to provide a more
> efficient algorithm? Can you point to a sample?
>
> Thanks
>
>
> _______________________________________________
> Qt-interest mailing list
> Qt-interest at trolltech.com
> http://lists.trolltech.com/mailman/listinfo/qt-interest