stonewareslord/this_algorithm
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Decrement word range from 1-3 to 0-2

Browse Source
This commit is contained in:
Austen Adler 2023-02-15 21:16:59 -05:00
parent 2bed778e16
commit 037d3db802
2 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/ALGORITHM.adoc
View File

@ -15,9 +15,9 @@
[source,title='this_algorithm and S2 CellID Format']
----
=== this_algorithm Format ===
WORD3 (13 bits) : vvvvvvvvvvvvv
WORD2 (13 bits) : | |vvv vvvvvvvvvv
WORD1 (13 bits) : | | |vvvvvv vvvvvvv
WORD2 (13 bits) : vvvvvvvvvvvvv
WORD1 (13 bits) : | |vvv vvvvvvvvvv
WORD0 (13 bits) : | | |vvvvvv vvvvvvv
0000 (10 bits) : | | | |vvvvvvvvv v
Not represented : | | | | |
: | | | | |

16
docs/DESIGN.adoc
View File

@ -304,7 +304,7 @@ Where stem:[text(num_prefix)] is the number of number/letter combinations in the
|===
NOTE: This project will use the `(1-1024) WORD1 WORD2 WORD3` variation (1 number component, and 3 word component).
NOTE: This project will use the `(1-1024) WORD0 WORD1 WORD2` variation (1 number component, and 3 word component).
It is longer than Xaddress and what3words, but with the tradeoff of having a significantly smaller dictionary than both.
It requires a larger wordlist than the `9999 WORD WORD WORD` variation, but it allows versioning.
@ -316,7 +316,7 @@ This might make more sense in loactions where numbers might come before word por
TODO: I need better reasoning here with examples.
NOTE: This algorithm will allow exactly two encoding types.
Both `0000 WORD1 WORD2 WORD3` and `WORD3 WORD2 WORD1 0000` formats are equivalent.
Both `0000 WORD0 WORD1 WORD2` and `WORD2 WORD1 WORD0 0000` formats are equivalent.
=== Versioning [[versioning]]
@ -390,12 +390,12 @@ For example, the digits could be the smallest resolution on a per-adjacent cell
|===
The domain of each component of the address `0000 WORD1 WORD2 WORD3` is as follows:
The domain of each component of the address `0000 WORD0 WORD1 WORD2` is as follows:
. `0000` - Responsible for the least significant bits in the encoded layout (smallest area)
. `WORD0`
. `WORD1`
. `WORD2`
. `WORD3` - Responsible for the most significant bits in the encoded layout (largest area)
. `WORD2` - Responsible for the most significant bits in the encoded layout (largest area)
NOTE: This algorithm will preserve locality in all components by requiring that sameness implies locality in every component.
@ -489,9 +489,9 @@ Bit : 64 48 32 16
: 01001011101010001011100010010011 1001001100100l001100000000000000
Not represented : ^^^^^^^^^^^^^^^
0000 (10 bits) : ^^^^^^^^^^
WORD1 (13 bits) : ^^^^^^ ^^^^^^^
WORD2 (13 bits) : ^^^^^^^^^^^^^
WORD3 (13 bits) : ^^^^^^^^^^^^^
WORD0 (13 bits) : ^^^^^^ ^^^^^^^
WORD1 (13 bits) : ^^^^^^^^^^^^^
WORD2 (13 bits) : ^^^^^^^^^^^^^
----
Note that this is just what each component is responsible for encoding, but does not specify exactly how to encode the selected bits.