laat

// vite-plugin-selfpack.js
//
// DecompressionStream('brotli') support (current engines):
//   Chromium — long-standing · Safari 18.4+ · Firefox 147+
//   Fallback for older builds: 'deflate-raw' (universal since 2023).
import zlib from 'node:zlib';

export default function selfpack({
  format = 'brotli',        // 'brotli' | 'deflate-raw' | 'gzip'
  fileName = 'index.html',

laat

const sleep = (s) =>
  new Promise((resolve) =>
    setTimeout(() => resolve(s), s * 1000)
  );

const sleepSort = async (arr) => {
  const res = [];
  await Promise.all(
    arr
      .map(sleep)

laat

const arr = [1, 4, 4, 54, 56, 54, 2, 23, 6, 54, 65, 65];
const reduceSum = arr => arr.reduce((acc, val) => acc + val);
const forEachSum = arr => {
   let sum = 0;
   arr.forEach(el => sum += el);
   return sum;
};
const forSum = arr => {
  let sum = 0;
  for (let i = 0; i < arr.length; i++ ) sum += arr[i];

laat

Relays messages published on a redis channel over Server-Sent Events.

laat

import mime from "mime";
import { stat } from "node:fs/promises";
import http2, { Http2ServerRequest, Http2ServerResponse } from "node:http2";
import { join } from "node:path";

export type Http2Handler = (
  next?: (
    req: Http2ServerRequest,
    res: Http2ServerResponse
  ) => Promise<void> | void

laat

Invert Binary Tree in F#

An inverted Binary Tree is a Binary Tree with left and right children of all non-leaf nodes interchanged.

type Node =
  { Value: int

laat

WITH 
  external_data
 /* 
  In an external system, we have some episode to series relations.
  An episode can be in multiple series.
  The SERIES_ID is monotonically increasing database ID.
 */
     AS (SELECT 10 SERIES_ID, 1 EPISODE_ID FROM dual UNION ALL
         SELECT 2  SERIES_ID, 1 EPISODE_ID FROM dual),
  transformed_data

laat

#!/usr/bin/env -S dotnet fsi --quiet
#r "nuget: JsonSchema.Net"
// 
// This file contains a basic example of json schema validation
// 

open Json.Schema
open System.Text.Json

let schema =

laat

The times macro

(defmacro laat/times (n fn arg) 
  (cons 'thread-last (cons arg (cl-loop for i below n collect fn))))

(laat/times 3 sqrt 256)

laat

Advent Of Code 2020

Using org-mode and Emacs Lisp to solve Advent of Code.

(org-babel-lob-ingest "./library-of-babel.org")

Day 1

Part 1