paul/pbrinkmeier.de
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

UTF-63: Fix missing p tag

Browse Source
This commit is contained in:
Paul Brinkmeier
2026-08-05 13:09:27 +02:00
parent 1076663c8e
commit 32e5f72dab
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
blog/utf63/index.html
+1 -1
View File
@@ -54,8 +54,8 @@
<p> <p>
For our entirely random example, this UTF-63 encoding uses only 16 bytes, a clear win over the whopping 21 bytes required by UTF-8 (that's 30% more!). For our entirely random example, this UTF-63 encoding uses only 16 bytes, a clear win over the whopping 21 bytes required by UTF-8 (that's 30% more!).
So how does it work? So how does it work?
<p>
</p> </p>
<p>
Decoding is dead simple: Decoding is dead simple:
We consider each set of 8 bytes a Big Endian 64-bit code unit. We consider each set of 8 bytes a Big Endian 64-bit code unit.
If the most significant bit is 0, the other 63 bits contain nine Basic Latin characters (i.e. ASCII characters) at 7 bits each. If the most significant bit is 0, the other 63 bits contain nine Basic Latin characters (i.e. ASCII characters) at 7 bits each.