linuxdcpp-team team mailing list archive

[maksis <1265889@xxxxxxxxxxxxxxxxxx>]

It seems quite clear that the client should move on to other locations
when the list of search terms to match gets empty after matching a
directory name. But what should happen if there aren't enough matching
items to reach the maximum result count? Should it then enter those
fully matched directories and return items from them?

In a way this is also a response to
http://forum.dcbase.org/viewtopic.php?f=55&t=695

Google doesn't support wildcards/regexp and it's still quite widely
used, so making things harder for the users doesn't feel like the
preferred alternative to go with (given the issues with the current
implementation).

The worst searching case I can think of is that when the user wants to
find items where the title consists of plain number(s) or some really
common word(s) that match lots of shared items. Preferring matches where
the search terms are found from the beginning of the item name should
help with this. The client could check that the order of the matched
words is the same and that they are matched right after each others
(words can be repeated in the name though). Word separators among the
shared items may differ so including those directly in the search string
may not be enough.

-- 
You received this bug notification because you are a member of
Dcplusplus-team, which is subscribed to DC++.
https://bugs.launchpad.net/bugs/1265889

Title:
  Return more relevant search results

Status in AirDC++:
  Confirmed
Status in DC++:
  New

Bug description:
  Currently the client returns results for the items that are first
  found. It could prefer returning results from different folders and
  select the returned results in a better way (compare the match
  positions and the number of matched words, possibly the modify date
  and download counts and so on).

To manage notifications about this bug go to:
https://bugs.launchpad.net/airdcpp/+bug/1265889/+subscriptions