This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
MacOS Device Setup | |
1. OS Configuration | |
- [x] Remove extra apps from dock | |
- [x] Sort Launchpad | |
- [x] Remove default apps I don’t use (Can’t delete default macOS apps now?) | |
- [x] Set background color, accent color and other general visual settings in system preferences | |
- [x] General | |
- [x] About (change computer name) | |
- [x] Software Update |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
javascript: Promise.all([import('https://unpkg.com/turndown@6.0.0?module'), import('https://unpkg.com/@tehshrike/readability@0.2.0'), ]).then(async ([{ | |
default: Turndown | |
}, { | |
default: Readability | |
}]) => { | |
/* Optional vault name */ | |
const vault = ""; | |
/* Optional folder name such as "Clippings/" */ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"global": { | |
"Monochrome": { | |
"Black 100": { | |
"value": "#000000", | |
"type": "color" | |
}, | |
"Black 90": { | |
"value": "#1a1a1a", | |
"type": "color" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
I contributed to the clr.fund Trusted Setup Multi-Party Ceremony. | |
The following are my contribution signatures: | |
Circuit: qvt32 | |
Contributor # 659 | |
Hash: 5c7ee737 4aec7c10 d75e0cf0 1f67600a | |
6e78e2fb 7c798d78 6d2aa9ee 2acce5b5 | |
964150b5 a2117384 87870c7d 9256a59d | |
def64097 896da5f3 c50200f3 3d6c1f18 | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:: Naked gate turns any @p-aura'd input into pure atom | |
|= input=@p | |
`@`input |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<section id="what-is-urbit" class="c4-10-md c4-10-lg full mt6"> | |
<p>So, what <em>is</em> an Urbit?</p> | |
<figure class="mt6 grid12"> | |
<img class="w-100 full" src="assets/intro/rock.svg" /> | |
<h3 class="mt5 c2-3-md c2-3-lg">2.</h3> | |
<figcaption class="mt5 c3-11-md c3-11-lg"> | |
<h3 class="fw6 mb4">It's designed for permanence and durability</h3> | |
Your Urbit is a permanent and completely private archive. Your Urbit can store all your data safely, privately, forever. | |
</figcaption> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:: Line 3: We are creating a naked generator that accepts a @ud-typed face we're naming 'n' | |
:: | |
|= n=@ud | |
:: Line 6: Within the initial generator, we're setting a new face (with value) to be used in the recursion below — a @ud-typed face named 't' | |
:: | |
=/ t=@ud 1 | |
:: Line 9: The rune "barhep" sets our recursion point: Everything after this rune loops until a terminating clause is met | |
:: | |
|- | |
:: Line 12: The rune 'wutcol' branches execution based on a boolean test — it is asking, "is face 'n' equivalent to the atom 1?"... |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:: Line 3: We are creating a naked generator that accepts a @ud-typed face we're naming 'n' | |
:: | |
|= n=@ud | |
:: Line 6: Within the initial generator, we're setting a new face (with value) to be used in the recursion below — a @ud-typed face named 't' | |
:: | |
=/ t=@ud 1 | |
:: Line 9: The rune "barhep" sets our recursion point: Everything after this rune loops until a terminating clause is met | |
:: | |
|- | |
:: Line 12: The rune 'wutcol' branches execution based on a boolean test — it is asking, "is face 'n' equivalent to the atom 1?"... |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:: I managed to figure out how to get a simple | |
:: atom-only list checker running, but I struggled | |
:: to figure out how to get strings rendered as their | |
:: initial textual aura instead of @ud-type output | |
:: | |
:: I was curious why I needed to use '2' as my count | |
:: number, as other examples I saw in the tutorial (snag.hoon) | |
:: allowed the user to specify their "selection point | |
:: and have it represented in the output just fine, i.e: | |
:: using an input of "3" in snag.hoon would actually get the third list item. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
:: Assignment Reflection 20190722 | |
:: | |
:: I was overthinking this assignment to a huge degree before | |
:: I read the type-checking docs in section 2.2 and sanity-checked | |
:: myself — I think I got too stuck with trying to replicate the | |
:: code demonstrated in the "conditionals" walkthrough | |
:: and added too many layers of t/f checking before | |
:: landing on the below solution, remembering that the assignment | |
:: was to produce a naked generator |
NewerOlder