Re: CListCtrl, hide and edit

From:

"Tom Serface" <tom.nospam@camaswood.com>

Newsgroups:

microsoft.public.vc.mfc

Date:

Tue, 6 May 2008 07:06:40 -0700

Message-ID:

<34786C1B-FB12-4B45-A703-8C9DDAE22356@microsoft.com>

Yeah, that would work. Fortunately we're just shuffling pointers so it's
pretty quick regardless.

"off the shelf" "out of the box" means the same thing... of course you'd
have to write some code still since you'll want to be able to sort by any
column or even multiple columns perhaps.

Tom

"Giovanni Dicanio" <giovanni.dicanio@invalid.com> wrote in message
news:Oo0otw1rIHA.2520@TK2MSFTNGP02.phx.gbl...

"Tom Serface" <tom.nospam@camaswood.com> ha scritto nel messaggio
news:AFD785C0-EB1B-467F-9F08-268A820C4C8F@microsoft.com...

Yeah, obviously you can replace the sort routine with anything that works
for your data.

If we store data in STL containers like std::vector, we can use the
std::sort algorithm (ready "off the shelf", is that the right expression?
:)

std::sort algorithm has O(N * log(N)) sort complexity.

std::sort
http://msdn.microsoft.com/en-us/library/ecdecxh1(VS.80).aspx

However, as you wrote, I think that on modern hardware the difference is
on big amounts of data (several hundreds thousands).

G