Group by Hash

[foxyshadis]

Not sure if this is slated to be in .402 yet, but I think it's an extremely important and integral part of adopting hashing. I didn't find it in search, so here it is. I'm of the opinon that all searches, no matter what the selected sort order is, should be grouped by their hash to identify all identical files and give the user the best chance to pick someone fast. There's really no point in scattering identical hash files.

Along these lines, it would be nice to collect all of those indentical-hash files into a single line that could be expended and collapsed, one of the features of winmx I always appreciated. The one that shows up could be the first, or the most common name, or whatever, and various aggregate stats shown (total free slot? highest bw? highest bw with a free slot?). When expanded it'd just show everything normally with a little line, or marker, or alternating background to tie them together.

(At least, the first part should be made into a default option until the more complex latter could be worked out.)

[Todi]

I belive it's on the to-do-soon list, but unsure if it'll be in next version or not. It would however definately be a good feature to show doubters the advantages of hashing, very visible.

[Pofis]

Seems a good feature to me too.
Looks like hashing is bringing lots of new features and ideias to DC++, which is really good

Pofis