gigamonkey

import static java.util.stream.Collectors.joining;

import java.io.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;

public record Reviewers(List<String> handles) {
  //////////////////////////////////////////////////////////////////////////////
  // Utility methods

gigamonkey

import java.util.*;
import java.util.function.*;

public class Lift {

  public static interface Expression {
    public Optional<Double> evaluate();
  }

  // This is a higher-order function that takes a function (i.e. an istance of a

gigamonkey

import java.util.Scanner;

public class TwentyQuestions  {

  public static final String[] GUESSES = {
    "a hamster",
    "a ferret",
    "a dog",
    "a cat",
    "an elephant",

gigamonkey

import java.util.ArrayList;
import java.util.List;
import java.util.function.Predicate;

public class Sexps {

  // Thing that can be evaluated.
  public static interface Expression {
    public double evaluate();
  }

gigamonkey

Trying to understand OAuth

Here’s my basic understanding of how to do client-side OAuth, meaning we want JavaScript running in the browser to be able to authenticate to a service (e.g., GitHub) and then access that service directly from the browser. The key security requirement is that the client-side JavaScript can’t know the client secret because the whole point of secrets as that they be secret. Assume in what follows that our web server is running on example.com. Also note that all these requests should be over HTTPS.

gigamonkey

import Database from 'better-sqlite3';
import { argv } from 'process';
import fs from 'fs';

/*
 * The kind of queries we support.
 */
const kinds = {
  // Execute SQL, returns { changes, lastInsertRowId } object.
  run: () => (stmt) => (...args) => stmt.run(...args),

gigamonkey

#!/usr/bin/env python

"""
Find times to hold the CSA Zoom meeting based on when people said they could do it.
Given a number N, find the N times that maximize the number of people who can come.
"""

from datetime import datetime
from functools import reduce
import json

gigamonkey

// Some utility functions

const distance = (a, b) => Math.abs(a - b);

const distance2d = (p1, p2) => Math.hypot(p1.x - p2.x, p1.y - p2.y);

const clamp = (n, min, max) => (n < min ? min : n > max ? max : n);

const nextPos = (b) => ({ x: b.x + b.dx, y: b.y + b.dy });

gigamonkey

/*
 * A number is prime if it is not divisible by any number other than 1 and
 * itself. 1 is not prime. Thus you can test whether a number greater than 1 is
 * prime by checking whether it is divisible by any smaller number greater than
 * one.
 */

public class Primes {

  public boolean isPrime(int n) {

gigamonkey

import java.util.Scanner;

public class TicTacToe {

  public static void printBoard(int board) {
    System.out.print("\033[2J\033[0;0H");
    int pieces = board >> 4;
    for (int i = 0; i < 9; i++) {
      System.out.print(" " + (i + "XO").charAt((pieces >> i & 1 | pieces >> i + 8 & 2) & 3) + " ");
      if (i % 3 < 2) {