Codestin Search App

Thanks to visit codestin.com
Credit goes to GitHub.com

chunkybanana
May 7, 2022
Maintainer

Some of our digraphs are somewhat redundant, and can be done with either one or two bytes normally:

k1 to k4 = 3↵ to 6↵
k≈ = [0, 1] = 2ʁ
k¶ = 512 = 9E, k⁋ = 1024 = ₀E
øo = Ǒ
øV = ¢
Þ* = Π
Þ↓ = ṡh
Þ↑ = ṡt

Replies: 0 comments

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment