We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://github.com/google/open-location-code/blob/main/docs/specification.md#code-precision mentions non-square areas starting at digit 11.
https://github.com/google/open-location-code/blob/main/docs/olc_definition.adoc also says
From 11 digits on, a different algorithm is used. The areas are slightly larger but the advantage is that the codes are shorter.
Alas, neither documents give any algorithm. Even what digit goes into what box is never explained.
The text was updated successfully, but these errors were encountered:
The algorithm you are looking for is described in the Least significant five digits sections of the document.
Sorry, something went wrong.
Update specification.md , reordering to make more sense
c4dcb06
google#580
I see. It looked like two separate algorithms that one could choose from.
P.S., in addition to the English description, it would help a lot to see code samples. Else it is rather hard to be sure one is reading it OK.
No branches or pull requests
https://github.com/google/open-location-code/blob/main/docs/specification.md#code-precision mentions non-square areas starting at digit 11.
https://github.com/google/open-location-code/blob/main/docs/olc_definition.adoc also says
Alas, neither documents give any algorithm. Even what digit goes into what box is never explained.
The text was updated successfully, but these errors were encountered: