blog: WIP

src/content/blog/How Many Iconic Computing Numbers can you Recognize%3F.mdx

@@ -6,38 +6,36 @@ https://www.reddit.com/r/ApplyingToCollege/comments/103aycn/only_a2c/?utm_source
 
 SUB 5 OCR F2L FULL EO WV COLL NO PLL U AUF RD 2 WR329
 
+Very general iconic computing numbers
 
-Mostly not a memory test
-only digits
-Little ambiguity
+Not a memory test you should be able to identify each number with little ambiguity.
+<!-- Each number will be in its raw form. One step process 0xdeadbeef and (Fast inverse square root constant is memory) as example -->
+Only digits, doesn’t have to be decimal
 All digits used
-One step process 0xdeadbeef and (Fast inverse square root constant is memory) as example
-No sequence of numbers
-No degree to understands it’s very general
-Long numbers truncated
-Doesn’t have to be decimal
+Long numbers truncated, 3-6 digits
 
 1970
 192168
-31337
+1337
 754
 8086
 214748
 418
 443
-44100
-9600
-264
 3301
+9600
 414141
+44100
+80211
 25519
 65537
-509
+777
+264
 400000
-80211
+509
 8601
-5994
 2600
+5994
+7400
 437
-777
-471768
+471768

src/content/blog/Implementing === in JavaScript from Scratch.mdx

@@ -223,7 +223,7 @@ And... there we go. The full implementation is provided in a [GitHub repository]
 
 ```js
 await new Promise((resolve) => {
-  document.addEventListener("strictEqualityLoaded", resolve);
+  document.addEventListener("strictEqualityLoaded", resolve, { once: true });
 });
 let obj = [];
 (await strictEquality(obj, obj)) && console.log("same");