Skip to content

Instantly share code, notes, and snippets.

Avatar

David Albert davidbalbert

View GitHub Profile
View FastNote.swift
//
// ContentView.swift
// FastNote
//
// Created by David Albert on 6/9/21.
//
import SwiftUI
struct Note: Identifiable {
@davidbalbert
davidbalbert / issue.sh
Created Dec 20, 2020
UniFi Certificate - acme.sh + Route 53
View issue.sh
# Run this once in your shell. All access keys and all settings will be saved by acme.sh
DOMAIN=unifi.example.com
AWS_ACCESS_KEY_ID=foo AWS_SECRET_ACCESS_KEY=bar acme.sh \
--issue -d $DOMAIN \
--dns dns_aws \
--fullchain-file /tmp/$DOMAIN.crt \
--key-file /tmp/$DOMAIN.key \
--reloadcmd /path/to/unifi-import-certificate.sh
View miniKanren.swift
// µKanren
struct Var: Equatable, Hashable {
let i: Int
init(_ i: Int) {
self.i = i
}
}
View main.swift
func nullo(_ x: Term) -> Goal {
x =~ []
}
func conso(_ a: Term, _ d: Term, _ p: Term) -> Goal {
p =~ .pair(a, d)
}
func appendo(_ l: Term, _ t: Term, _ out: Term) -> Goal {
disj {
View fizzbuzz.sld
; ht to http://www.shlomifish.org/lecture/Lambda-Calculus/slides/
(define λ lambda)
(define 0 (λ (f) (λ (x) x)))
(define +1 (λ (n) (λ (f) (λ (x) (f ((n f) x))))))
(define pred_next_tuple
(λ (tuple)
(cons (car (cdr tuple)) (cons (+1 (car (cdr tuple))) '()))))
View japanese.sld
(define 定義しろ define)
(定義しろ 見せろ display)
(定義しろ 車 car)
(定義しろ 来るだ cdr)
(定義しろ 組み立てろ cons)
(定義しろ 原子 atom)
(定義しろ 同 eq)
(定義しろ 条件 cond)
View autoindent.rb
#!/usr/bin/env ruby
nesting = 0
ARGF.each_line do |l|
nesting -= l.count("}")
puts " "*nesting + l
nesting += l.count("{")
@davidbalbert
davidbalbert / macosx-dp-2.sh
Last active Mar 27, 2021
Install and run Mac OS X DP2 in QEMU
View macosx-dp-2.sh
#!/bin/sh
# To create and format a 10 GB hard drive image
dd if=/dev/zero of=hd.img bs=1048576 count=10240
pdisk hd.img # `i` for initialize then `w` for write
# To boot from install CD, add:
# -drive file=dp2.iso,index=2,format=raw,media=cdrom \
# -prom-env 'boot-device=ide1:9,\\BootX' \
View euler15.js
function countPossibilities(n, m) {
if (n === -1 || m === -1) {
return 0;
} else if (n === 0 && m === 0) {
return 1;
}
return countPossibilities(n-1, m) + countPossibilities(n, m-1);
}
View database.html
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>Database.js</title>
</head>
<body>
<script>
'use strict';