File sorting, filtering shared files

[Kras]

Since hashing has been implemented and seems to be stable maybe it not premature to suggest two new features that hashing makes possible:

1. Identical files should occupy only one line in the different lists, like in Kazaa. One can expand to see all the files and different users by by some command if necessary, also like in Kazaa.

2. Files that one already has and is sharing should be filtered from the lists. One advantage is that it obviously makes it easier to find new files, one other is that this increases the incentive to share all the files that one has.

Some people don't see the hidden advantages that hashing brings to automatic searching etc but notice the initial cpu intensive hashing. I think that the 2 features above would makes the advantages of hashing obvious to everyone.

[BSOD2600]

1) I know this was in BCDC when he was playing around with hashing, so I can only guess it should be in the next version of DC++. Would make sense though to have it.

2) When you mean filtered from the list.. do you mean your filelist or returning searches? If you mean the filelist, duplicates are already removed. As for returning searches, this would make sense, but i think there could be a large overhead for those who have giant shares.

[GargoyleMT]

1. Is planned
2. There are a couple RFE's open for this in the sourceforge tracker:
[ 896494 ] Eradicate duplicate downloads
[ 833103 ] Filters locally applied on search results

I think the first one would make people realize more of the benefits of hashing. It's on my todo list.