Skip to content

Instantly share code, notes, and snippets.

Avatar
🧐

Simon Eskildsen sirupsen

🧐
View GitHub Profile
@sirupsen
sirupsen / search.bash
Last active March 5, 2023 14:39
I run all my searches in FZF as I edit my notes in Vim. See https://share.cleanshot.com/x9ZkfBQQ -- Will require some tinkering but it runs the inference/search server so the searches are fast. It's deployed to Modal.com
View search.bash
#!/bin/bash
# FZF quotes field names so I can't easily get preview to work otherwise
cd "$ZK_PATH"
# --bind="2:preview(echo '\"{q}\",\"{4..}\",2' >> judge.csv && echo Rated 2!)" \
FZF_DEFAULT_COMMAND="python ~/src/semsearch/search_webhook.py learning"
fzf \
--bind="0:preview(ruby ~/src/semsearch/write.rb {q} {4..} 0 && echo Rated 0!)" \
--bind="1:preview(ruby ~/src/semsearch/write.rb {q} {4..} 1 && echo Rated 1!)" \
@sirupsen
sirupsen / sidenotes.tsx
Last active January 5, 2022 11:47
Sidenotes and table of contents on MDX with React.
View sidenotes.tsx
function isColliding(a: DOMRect, b: DOMRect) {
return !(
((a.y + a.height) < (b.y))
|| (a.y > (b.y + b.height))
|| ((a.x + a.width) < b.x)
|| (a.x > (b.x + b.width))
);
}
// Move the footnotes from the bottom to become sidenotes if the viewport is
View monty_hall.rb
switch_strategy = 0
no_switch_strategy = 0
n_simulations = 1_000_000
n_simulations.times do
winner_door = rand(3)
chosen_door = rand(3)
if winner_door == chosen_door
switch_strategy += 0
View simulator.rb
n_shards = 128
n_simulations = 1_000_000
processed_booted_for_minimum_two_per_shard = []
n_simulations.times do |i| # Number of simulations
booted = 0
booted_by_shard = [0] * n_shards
done = [false] * n_shards
done_count = 0
View ping.rb
require 'socket'
def internet_checksum(packet) # https://tools.ietf.org/html/rfc1071
packet += [0].pack('C') if packet.size.odd? # since we read 2 bytes at once, append 0 if odd
sum = packet.unpack("n#{packet.size/2}").sum
sum = (sum & 0xffff) + (sum >> 16) while (sum >> 16 > 0) # fold 32 bits -> 16
~sum & 0xffff # 1s complement
end
@sirupsen
sirupsen / queuing.rb
Created February 14, 2020 21:09
Queuing theory exercise
View queuing.rb
class Node
attr_accessor :edges, :jobs, :id
def initialize(id, arrivals_per_tick)
@id = id
@jobs = 0.0
@tick = 0
@edges = []
@arrivals_per_tick = arrivals_per_tick
end
View zettelkasten-search.rb
require "sqlite3"
require 'set'
require 'byebug'
# Will be rebuilt at any time. Nice and incremental.
db = SQLite3::Database.new "index.db"
# Keep prefix indexes for "mos*" searches.
#
# TODO: It doesn't seem like SQLITE FTS5 supports synonyms well. That's ok, but
# we're going to want that. We can download this database from Princeton, write
View black_box.rs
use std::io::{Read, Seek, SeekFrom, Write};
use std::slice;
use std::time::Instant;
use std::{fs::OpenOptions, io::Result};
use std::ptr;
use std::mem::forget;
const BUF_SIZE: usize = 1024 * 32;
const FILE_SIZE: usize = 1024 * 1024 * 512;
const QUEUE_DEPTH: usize = 32;
View sequantial_io.rs
use std::{fs::OpenOptions, io::Result};
use std::io::{Read, Write, Seek, SeekFrom};
use std::slice;
use std::time::Instant;
const BUF_SIZE: usize = 1024 * 32;
const FILE_SIZE: usize = 1024 * 1024 * 512;
const QUEUE_DEPTH: usize = 32;
fn main() -> Result<()> {
@sirupsen
sirupsen / ping_less.rb
Created March 7, 2019 12:33
Ping less patch for MySQL.
View ping_less.rb
# frozen_string_literal: true
# By default, ActiveRecord will issue a PING command to the database to check
# if it is active at various points. This overhead is unnecessary; we instead
# attempt to issue queries without checking the connection, then if the query
# returns an error and the connection was closed, try to reconnect.
# This also allows for reconnection during a single UoW, improving resiliency
# under transient connection failure (e.g. ProxySQL restarts).
#
# To avoid amplifying load when a database is intermittently down, the attempt