[OT] Finding longest documents

[Steven Schveighoffer]

"Christopher Wright" wrote
> Actually, I STRONGLY urge that nobody use this heap.
>
> It's a struct. If you access it by value and append to it, then access it 
> from any other alias, you will erase a random element from the heap.
>
> If it were a class, this would not be possible. As I implemented it, it 
> would not be possible.
>
> Containers as value types is such an idiotic idea for precisely this 
> reason.

Unless such value types have copy constructors which make a copy of their 
elements...

Or are you calling the authors of STL idiots ;)

-Steve