aboutsummaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorEven Rouault <even.rouault@spatialys.com>2020-01-10 00:34:36 +0100
committerEven Rouault <even.rouault@spatialys.com>2020-01-10 00:34:36 +0100
commitacb2bd68bcfda90eb1f1d0bc12debaf9d051d6b9 (patch)
tree5618c3c7e4761a7fb1271d481c9a6553061bf6b5 /src
parent0961c1951c1d48bc09f2db002a150526ec135fa3 (diff)
downloadPROJ-acb2bd68bcfda90eb1f1d0bc12debaf9d051d6b9.tar.gz
PROJ-acb2bd68bcfda90eb1f1d0bc12debaf9d051d6b9.zip
Doc of CRS::identify(): make it clear that this is a best-effort attempt only
Diffstat (limited to 'src')
-rw-r--r--src/iso19111/c_api.cpp4
-rw-r--r--src/iso19111/crs.cpp20
2 files changed, 24 insertions, 0 deletions
diff --git a/src/iso19111/c_api.cpp b/src/iso19111/c_api.cpp
index 7d4f5eba..9f73f8e9 100644
--- a/src/iso19111/c_api.cpp
+++ b/src/iso19111/c_api.cpp
@@ -2192,6 +2192,10 @@ PJ *proj_get_target_crs(PJ_CONTEXT *ctx, const PJ *obj) {
* The candidate CRSs are either hard-coded, or looked in the database when
* it is available.
*
+ * Note that the implementation uses a set of heuristics to have a good
+ * compromise of successful identifications over execution time. It might miss
+ * legitimate matches in some circumstances.
+ *
* The method returns a list of matching reference CRS, and the percentage
* (0-100) of confidence in the match. The list is sorted by decreasing
* confidence.
diff --git a/src/iso19111/crs.cpp b/src/iso19111/crs.cpp
index cf90c388..a24508d4 100644
--- a/src/iso19111/crs.cpp
+++ b/src/iso19111/crs.cpp
@@ -730,6 +730,10 @@ CRSNNPtr CRS::normalizeForVisualization() const {
* The candidate CRSs are either hard-coded, or looked in the database when
* authorityFactory is not null.
*
+ * Note that the implementation uses a set of heuristics to have a good
+ * compromise of successful identifications over execution time. It might miss
+ * legitimate matches in some circumstances.
+ *
* The method returns a list of matching reference CRS, and the percentage
* (0-100) of confidence in the match. The list is sorted by decreasing
* confidence.
@@ -1648,6 +1652,10 @@ static bool hasCodeCompatibleOfAuthorityFactory(
* The candidate CRSs are either hard-coded, or looked in the database when
* authorityFactory is not null.
*
+ * Note that the implementation uses a set of heuristics to have a good
+ * compromise of successful identifications over execution time. It might miss
+ * legitimate matches in some circumstances.
+ *
* The method returns a list of matching reference CRS, and the percentage
* (0-100) of confidence in the match:
* <ul>
@@ -2746,6 +2754,10 @@ bool VerticalCRS::_isEquivalentTo(
* The candidate CRSs are looked in the database when
* authorityFactory is not null.
*
+ * Note that the implementation uses a set of heuristics to have a good
+ * compromise of successful identifications over execution time. It might miss
+ * legitimate matches in some circumstances.
+ *
* The method returns a list of matching reference CRS, and the percentage
* (0-100) of confidence in the match.
* 100% means that the name of the reference entry
@@ -3529,6 +3541,10 @@ void ProjectedCRS::addUnitConvertAndAxisSwap(io::PROJStringFormatter *formatter,
* The candidate CRSs are either hard-coded, or looked in the database when
* authorityFactory is not null.
*
+ * Note that the implementation uses a set of heuristics to have a good
+ * compromise of successful identifications over execution time. It might miss
+ * legitimate matches in some circumstances.
+ *
* The method returns a list of matching reference CRS, and the percentage
* (0-100) of confidence in the match. The list is sorted by decreasing
* confidence.
@@ -4050,6 +4066,10 @@ bool CompoundCRS::_isEquivalentTo(
* The candidate CRSs are looked in the database when
* authorityFactory is not null.
*
+ * Note that the implementation uses a set of heuristics to have a good
+ * compromise of successful identifications over execution time. It might miss
+ * legitimate matches in some circumstances.
+ *
* The method returns a list of matching reference CRS, and the percentage
* (0-100) of confidence in the match. The list is sorted by decreasing
* confidence.