Skip to content

Instantly share code, notes, and snippets.

View mudge's full-sized avatar

Paul Mucur mudge

124 followers · 15 following
View GitHub Profile
@mudge
mudge / use-debounce.js
Last active August 10, 2024 20:58
A custom React Hook for a debounced click handler with a given callback and delay.
/*
* Inspired by Dan Abramov's "Making setInterval Declarative with React Hooks",
* this is a custom hook for debouncing a callback (e.g. for click handlers) such
* that a callback will not be fired until some delay has passed since the last click.
* The callback will automatically be updated with the latest props and state on every
* render meaning that users don't need to worry about stale information being used.
*
* See https://overreacted.io/making-setinterval-declarative-with-react-hooks/ for the
* original inspiration.
*/
@mudge
mudge / Scale Summit 2019.md
Created March 29, 2019 22:17
Notes from Scale Summit 2019
@mudge
mudge / README.md
Last active June 25, 2024 01:55
Compiling & installing cloudflared for DNS-over-HTTPS on a Raspberry Pi Model B
@mudge
mudge / dijkstra_with_fibonacci_heap.rb
Last active July 15, 2018 16:14
Implementing Dijkstra's algorithm with Fibonacci Heap
require 'fibonacci_heap'
# Assuming `graph` is an object with the following interface that stores vertices as `FibonacciHeap::Node`
# instances and `source` is a `FibonacciHeap::Node`:
#
# * `graph.vertices`: return an Enumerable of all vertices in the graph
# * `graph.neighbours(u)`: return an Enumerable of all vertices that neighbour a given vertex `u`
# * `graph.length(u, v)`: return the numeric weight of the edge between two given vertices `u` and `v`
def dijkstra(graph, source)
dist = Hash.new(Float::INFINITY)
@mudge
mudge / fibonacci_heap.rb
Last active June 24, 2018 19:56
A Ruby implementation of a Fibonacci heap
class CircularDoublyLinkedList
include Enumerable
class Node
include Comparable
attr_accessor :key, :next, :prev
alias right next
alias left prev
@mudge
mudge / dijkstra.rb
Last active June 22, 2018 15:41
An implementation of Dijkstra's algorithm in Ruby
# A pure Ruby implementation of https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
#
# Takes a graph in hash form, e.g. { 'A' => ['B', 'C'], 'B' => ['D'], 'C' => ['D'] },
# and a source node, e.g. 'A', and returns the distances to every reachable node and a hash of "next hops" for each node.
def dijkstra(graph, source)
q = graph.keys
prev = {}
dist = Hash.new(Float::INFINITY)
dist[source] = 0
@mudge
mudge / snitch.rb
Last active February 17, 2018 13:56
A wrapper class for reporting on method calls useful for reverse engineering
# snitch = Snitch.new('A string')
#=> #<Snitch:0x00007fe53a1964b0 @obj="A string">
# snitch.empty?
# Calling empty? on A string with []
#=> false
class Snitch
attr_reader :obj
def initialize(obj)
@mudge
mudge / best_fit.rb
Last active July 28, 2017 21:32
Applying bin packing techniques to GNIP PowerTrack rules
domains = ARGF.readlines.map(&:chomp)
queries = domains.map { |domain| %[url_contains:"/#{domain}" OR url_contains:".#{domain}"] }
queries.sort_by!(&:size)
rule_limit = 1024
operator_limit = 30
rules = [queries.pop]
queries.reverse_each do |query|
@mudge
mudge / arith.rs
Created February 8, 2017 16:45
enum Error {
NoRuleApplies,
}
enum Term {
TmTrue,
TmFalse,
TmIf(Box<Term>, Box<Term>, Box<Term>),
TmZero,
TmSucc(Box<Term>),
@mudge
mudge / nginx.conf
Last active February 6, 2017 20:34
Handling Fastly TLS termination in nginx with map: http://nginx.org/en/docs/http/ngx_http_map_module.html
# Declares a new variable, $forwarded_scheme, that contains the URL scheme
# used by a user even if Fastly terminates your TLS connections.
#
# Will use the scheme extracted from the request URI by default or return
# "https" if the Fastly-SSL HTTP header is found.
map $http_fastly_ssl $forwarded_scheme {
default $scheme;
"1" "https";
}