summaryrefslogtreecommitdiff
path: root/usr
diff options
context:
space:
mode:
authorYann E. MORIN <yann.morin.1998@free.fr>2013-05-06 12:57:47 (GMT)
committerYann E. MORIN <yann.morin.1998@free.fr>2013-06-24 17:57:45 (GMT)
commit193b40aeb537b59eaa36e3dfaabedc2025332ebf (patch)
treef72ea744e1e9aeb53c5a546c1599d496412bd5c6 /usr
parenta5f6d795f5941e97e757b643a6482968a66c6150 (diff)
downloadlinux-193b40aeb537b59eaa36e3dfaabedc2025332ebf.tar.xz
kconfig: sort found symbols by relevance
When searching for symbols, return the symbols sorted by relevance. Sorting is done as thus: - first, symbols that match exactly - then, alphabetical sort Since the search can be a regexp, it is possible that more than one symbol matches exactly. In this case, we can't decide which to sort first, so we fallback to alphabeticall sort. Explain this (new!) sorting heuristic in the documentation. Reported-by: Jean Delvare <jdelvare@suse.de> Signed-off-by: "Yann E. MORIN" <yann.morin.1998@free.fr> Cc: Jean Delvare <jdelvare@suse.de> Cc: Michal Marek <mmarek@suse.cz> Cc: Roland Eggner <edvx1@systemanalysen.net> Cc: Wang YanQing <udknight@gmail.com> -- Changes v1->v2: - drop the previous, complex heuristic in favour of a simpler heuristic that is both easier to understand, *and* to maintain (Jean) - explain sorting heuristic in the doc (Jean)
Diffstat (limited to 'usr')
0 files changed, 0 insertions, 0 deletions