mirror of
https://github.com/osm-search/Nominatim.git
synced 2026-02-15 02:47:59 +00:00
nearest place search should match any of given tokens not all
When multiple isin tokens are given, then these are duplicates and it is enough that any one of them is found in the name_vector. Fixes #1056.
This commit is contained in:
@@ -96,7 +96,7 @@ BEGIN
|
||||
SELECT place_id, name_vector, address_rank, search_rank,
|
||||
ST_Distance(centroid, point) as distance, null as isguess
|
||||
FROM search_name_-partition-
|
||||
WHERE name_vector @> isin_token
|
||||
WHERE name_vector && isin_token
|
||||
AND ST_DWithin(centroid, point, 0.015)
|
||||
AND search_rank between 26 and 27
|
||||
ORDER BY distance ASC limit 1
|
||||
@@ -124,7 +124,7 @@ BEGIN
|
||||
SELECT place_id, name_vector, address_rank, search_rank,
|
||||
ST_Distance(centroid, point) as distance, null as isguess
|
||||
FROM search_name_-partition-
|
||||
WHERE name_vector @> isin_token
|
||||
WHERE name_vector && isin_token
|
||||
AND ST_DWithin(centroid, point, 0.03)
|
||||
AND search_rank between 16 and 22
|
||||
ORDER BY distance ASC limit 1
|
||||
|
||||
Reference in New Issue
Block a user