From 4cff919b4393ea60b36f237c18ad451a99a329c7 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sat, 14 Nov 2020 22:45:52 -0500 Subject: Add font comparison page --- docs/fonts.html | 181 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 181 insertions(+) create mode 100644 docs/fonts.html (limited to 'docs/fonts.html') diff --git a/docs/fonts.html b/docs/fonts.html new file mode 100644 index 00000000..4d9b3e61 --- /dev/null +++ b/docs/fonts.html @@ -0,0 +1,181 @@ + + + + + Fonts for BQN + + + + + +
BQN / main
+

Fonts for BQN

+ +

This page displays samples of all four free fonts I know of that fully support BQN's character set:

+ +

Other than DejaVu, the versions embedded on this page are small subsets, and you should get your copy from the links above (unless perhaps you want to use them for embedding as well). In addition to these, Pragmata Pro and Everson Mono have full support, but each charges a significant fee for usage and I can't freely embed them here.

+ +

The table below shows samples of the whole BQN keyboard (which includes the entire BQN character set plus a few unused characters) and APL characters that don't feature in BQN.

+ + + + + + + + + + + + +
+DejaVu Sans Mono BQN +
`1234567890=  ~!@#$%^&*()_+
+ qwertyuiop[] QWERTYUIOP{}
+ asdfghjkl;'\ ASDFGHJKL:"|
+ zxcvbnm,./   ZXCVBNM<>?
+
+˜˘¨⁼⌜´˝ ∞¯•×  ¬⎉⚇⍟◶⊘⎊⍎⍕⟨⟩√⋆
+ ⌽𝕨∊↑∧ ⊔⊏⊐π←→ ↙𝕎⍷𝕣⍋  ⊑⊒⍳⊣⊢
+ ⍉𝕤↕𝕗𝕘⊸∘○⟜⋄   ↖𝕊 𝔽𝔾« ⌾»·˙|
+ ⥊𝕩↓∨⌊ ≡∾≍≠    𝕏 ⍒⌈ ≢≤≥⇐
+
+⍬⍺⍵⍴⍳⍸⌷⍨⍤⍥⍣⊖⊂⊃⊆⊇∩∪⊥⊤⍝⍀⌿⍪
+⎕⌺⌹⌸⍞⍠⌶⍱⍲⍫∇∆⍢⍙…
+
+		 +
BQN386
+
`1234567890=  ~!@#$%^&*()_+
+ qwertyuiop[] QWERTYUIOP{}
+ asdfghjkl;'\ ASDFGHJKL:"|
+ zxcvbnm,./   ZXCVBNM<>?
+
+˜˘¨⁼⌜´˝ ∞¯•×  ¬⎉⚇⍟◶⊘⎊⍎⍕⟨⟩√⋆
+ ⌽𝕨∊↑∧ ⊔⊏⊐π←→ ↙𝕎⍷𝕣⍋  ⊑⊒⍳⊣⊢
+ ⍉𝕤↕𝕗𝕘⊸∘○⟜⋄   ↖𝕊 𝔽𝔾« ⌾»·˙|
+ ⥊𝕩↓∨⌊ ≡∾≍≠    𝕏 ⍒⌈ ≢≤≥⇐
+
+⍬⍺⍵⍴⍳⍸⌷⍨⍤⍥⍣⊖⊂⊃⊆⊇∩∪⊥⊤⍝⍀⌿⍪
+⎕⌺⌹⌸⍞⍠⌶⍱⍲⍫∇∆⍢⍙…
+
+
+
`1234567890=  ~!@#$%^&*()_+
+ qwertyuiop[] QWERTYUIOP{}
+ asdfghjkl;'\ ASDFGHJKL:"|
+ zxcvbnm,./   ZXCVBNM<>?
+
+˜˘¨⁼⌜´˝ ∞¯•×  ¬⎉⚇⍟◶⊘⎊⍎⍕⟨⟩√⋆
+ ⌽𝕨∊↑∧ ⊔⊏⊐π←→ ↙𝕎⍷𝕣⍋  ⊑⊒⍳⊣⊢
+ ⍉𝕤↕𝕗𝕘⊸∘○⟜⋄   ↖𝕊 𝔽𝔾« ⌾»·˙|
+ ⥊𝕩↓∨⌊ ≡∾≍≠    𝕏 ⍒⌈ ≢≤≥⇐
+
+⍬⍺⍵⍴⍳⍸⌷⍨⍤⍥⍣⊖⊂⊃⊆⊇∩∪⊥⊤⍝⍀⌿⍪
+⎕⌺⌹⌸⍞⍠⌶⍱⍲⍫∇∆⍢⍙…
+
+Fairfax HD +		 +
`1234567890=  ~!@#$%^&*()_+
+ qwertyuiop[] QWERTYUIOP{}
+ asdfghjkl;'\ ASDFGHJKL:"|
+ zxcvbnm,./   ZXCVBNM<>?
+
+˜˘¨⁼⌜´˝ ∞¯•×  ¬⎉⚇⍟◶⊘⎊⍎⍕⟨⟩√⋆
+ ⌽𝕨∊↑∧ ⊔⊏⊐π←→ ↙𝕎⍷𝕣⍋  ⊑⊒⍳⊣⊢
+ ⍉𝕤↕𝕗𝕘⊸∘○⟜⋄   ↖𝕊 𝔽𝔾« ⌾»·˙|
+ ⥊𝕩↓∨⌊ ≡∾≍≠    𝕏 ⍒⌈ ≢≤≥⇐
+
+⍬⍺⍵⍴⍳⍸⌷⍨⍤⍥⍣⊖⊂⊃⊆⊇∩∪⊥⊤⍝⍀⌿⍪
+⎕⌺⌹⌸⍞⍠⌶⍱⍲⍫∇∆⍢⍙…
+
+
Julia Mono
+
+ + +

And here are code samples taken from this repository.

+
DejaVu Sans Mono BQN
+
+  c←𝕩='#'⋄s←/0‿0⊸«⊸∧sm←𝕩='''⋄d←/dm←𝕩='"'
+  g←⍋q←∾⟨  s⋄¯1↓d⋄/c⟩ ⋄q↩g⊏q                # Open indices
+  e← g⊏∾⟨2+s⋄ 1↓d⋄-⟜»∘⊏⟜(0∾+`c)⊸//(𝕩=lf)∾1⟩ # Matching close indices
+  Se←{(⊏˜𝕨)Se 1¨⌾((𝕩/𝕨)⊸⊏)𝕩}⍟(0=¯1⊑⊢)       # Mark reachable openings
+
+PrecedesGroup ← {
+  # We prepend a 0 to 𝕨, so that 0 is the "before start" index, with a
+  # false value, and normal indices are increased by 1.
+  𝕨 ∾˜↩ 0
+  inds ← 1 + ↕≠𝕩
+  # Zero out indices where 𝕩 was true, and find the greatest index so
+  # far at each position.
+  last ← ⌈` inds × ¬𝕩
+  last ⊏ 𝕨
+}
+
+ +
BQN386
+
+  c←𝕩='#'⋄s←/0‿0⊸«⊸∧sm←𝕩='''⋄d←/dm←𝕩='"'
+  g←⍋q←∾⟨  s⋄¯1↓d⋄/c⟩ ⋄q↩g⊏q                # Open indices
+  e← g⊏∾⟨2+s⋄ 1↓d⋄-⟜»∘⊏⟜(0∾+`c)⊸//(𝕩=lf)∾1⟩ # Matching close indices
+  Se←{(⊏˜𝕨)Se 1¨⌾((𝕩/𝕨)⊸⊏)𝕩}⍟(0=¯1⊑⊢)       # Mark reachable openings
+
+PrecedesGroup ← {
+  # We prepend a 0 to 𝕨, so that 0 is the "before start" index, with a
+  # false value, and normal indices are increased by 1.
+  𝕨 ∾˜↩ 0
+  inds ← 1 + ↕≠𝕩
+  # Zero out indices where 𝕩 was true, and find the greatest index so
+  # far at each position.
+  last ← ⌈` inds × ¬𝕩
+  last ⊏ 𝕨
+}
+
+ +
Fairfax HD
+
+  c←𝕩='#'⋄s←/0‿0⊸«⊸∧sm←𝕩='''⋄d←/dm←𝕩='"'
+  g←⍋q←∾⟨  s⋄¯1↓d⋄/c⟩ ⋄q↩g⊏q                # Open indices
+  e← g⊏∾⟨2+s⋄ 1↓d⋄-⟜»∘⊏⟜(0∾+`c)⊸//(𝕩=lf)∾1⟩ # Matching close indices
+  Se←{(⊏˜𝕨)Se 1¨⌾((𝕩/𝕨)⊸⊏)𝕩}⍟(0=¯1⊑⊢)       # Mark reachable openings
+
+PrecedesGroup ← {
+  # We prepend a 0 to 𝕨, so that 0 is the "before start" index, with a
+  # false value, and normal indices are increased by 1.
+  𝕨 ∾˜↩ 0
+  inds ← 1 + ↕≠𝕩
+  # Zero out indices where 𝕩 was true, and find the greatest index so
+  # far at each position.
+  last ← ⌈` inds × ¬𝕩
+  last ⊏ 𝕨
+}
+
+ +
Julia Mono
+
+  c←𝕩='#'⋄s←/0‿0⊸«⊸∧sm←𝕩='''⋄d←/dm←𝕩='"'
+  g←⍋q←∾⟨  s⋄¯1↓d⋄/c⟩ ⋄q↩g⊏q                # Open indices
+  e← g⊏∾⟨2+s⋄ 1↓d⋄-⟜»∘⊏⟜(0∾+`c)⊸//(𝕩=lf)∾1⟩ # Matching close indices
+  Se←{(⊏˜𝕨)Se 1¨⌾((𝕩/𝕨)⊸⊏)𝕩}⍟(0=¯1⊑⊢)       # Mark reachable openings
+
+PrecedesGroup ← {
+  # We prepend a 0 to 𝕨, so that 0 is the "before start" index, with a
+  # false value, and normal indices are increased by 1.
+  𝕨 ∾˜↩ 0
+  inds ← 1 + ↕≠𝕩
+  # Zero out indices where 𝕩 was true, and find the greatest index so
+  # far at each position.
+  last ← ⌈` inds × ¬𝕩
+  last ⊏ 𝕨
+}
+
+ + + -- cgit v1.2.3