gene-ressler

type Color = 'r' | 'b';
type NullableNode<K, V> = Node<K, V> | null;
type Node<K, V> = {
  value: V;
  color: Color;
  kids: [NullableNode<K, V>, NullableNode<K, V>];
};

export class TreeMap<K, V> {
  private root: NullableNode<K, V> = null;

gene-ressler

class ImagesLoader {
  private readonly images: Map<string, HTMLImageElement>;
  private readonly pendingActions: ((images: Map<string, HTMLImageElement>) => void)[] = [];
  public readonly errors = new Set<string>();
  private remainingCount: number;

  constructor(urls: string[]) {
    this.remainingCount = urls.length;
    this.images = new Map<string, HTMLImageElement>(
      ((loader) => {

gene-ressler

#include <stdio.h>
#include <stdlib.h>

typedef struct node_s {
  struct node_s *parent;
  int size;
  int value;
} DISJOINT_SET;

DISJOINT_SET *make_set(int value) {

gene-ressler

#include <ctype.h>

#define ACTIVE_BUZZER 12

char s[256];
int n = 0, p = 0;

void setup() {
  delay(1000);
  pinMode(LED_BUILTIN, OUTPUT);

gene-ressler

#include <stdio.h>
#include <stdlib.h>

static int med3(int a, int b, int c) {
  return a < b
    ? c < a ? a : (c < b ? c : b)
    : c > a ? a : (c > b ? c : b);
}

static void swap(int *a, int i, int j) {

gene-ressler

# For any 0 <= k < fact(n), return a unique permutation of [0..n-1].
# Functional inverse of number_from_perm().
def perm_from_number(n, k):
  a = list(range(n))
  p = []
  for d in range(2, n + 1):
    p.append(k % d)
    k //= d
  t = n - 1
  for i in reversed(p):

gene-ressler

#include <stdio.h>
#include <stdlib.h>

static int med3(int a, int b, int c) {
  return a < b
    ? c < a ? a : (c < b ? c : b)
    : c > a ? a : (c > b ? c : b);
}

static void swap(int *a, int i, int j) {

gene-ressler

#include <stdio.h>
#include <stdlib.h>

typedef struct edge_s {
  struct edge_s *next;
  int to;
} Edge;

typedef struct vertex_s {
  Edge *edges;

gene-ressler

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void sort(int *a, int n) {
  if (n <= 1) return;
  int m = (n + 1) / 2;
  sort(a, m);
  sort(a + m, n - m);
  int b[m];

gene-ressler

#include <stdio.h>
#include <stdlib.h>

void sift_down(int *a, int n, int j) {
  int j_rgt, val = a[j];
  while ((j_rgt = 2 * j + 2) <= n) {
    int j_lft = j_rgt - 1;
    if (j_rgt == n || a[j_lft] > a[j_rgt]) {
      if (val >= a[j_lft]) break;
      a[j] = a[j_lft];