shovon

import * as bigintConversion from "bigint-conversion";

const extendedGcd = (
	a: bigint,
	b: bigint
): { result: bigint; x: bigint; y: bigint } => {
	if (a === 0n) return { result: b, x: 0n, y: 1n };
	const { result, x: x1, y: y1 } = extendedGcd(b % a, a);
	return { result, x: y1 - (b / a) * x1, y: x1 };
};

shovon

A terminal-based terminal emulator

Run a terminal from inside your terminal.

The purpose of this code is to demonstrate how to have applications running in a PTY (psedoterminal) environment.

Usage

Be sure to have Go installed.

shovon

Kawaii: a dumb little JSX front-end library, purely created for educational purposes

I wrote this to teach myself on how React and other JSX library work behind the scenes.

Usage

First, you will need a bundler that doesn't exclusively work with React. Unfortunately, how to configure it is beyond the scope of this README file, since every bundler has their own way of converting JSX to JavaSript.

That said, there are some tutorials on how to do that.

shovon

Bounded Variable

Think of a bounded variable no different than a bounded queue to solve the consumer—producer problem.

A very common use case is for me is to push to a single variable from one producer, and pull from that single variable from one consumer.

Go has a very simple solution: channels.

But I was curious: can we improve the performance?

shovon

Sortable Linked List

Usage

class ComparableNumber implements Comparable<number> {
	constructor(private _value: number) {}

	get value() {
 return this._value;

shovon

/**
 Copyright 2023 Sal Rahman

Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the “Software”), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
the Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:

shovon

We want to prove that

$$ \left(1+\dfrac{1}{n}\right)^n < e < \left(1+\dfrac{1}{n}\right)^{n+1} $$

We will assume that $n \in \mathbb{N}$, $n &gt; 0$.

Left Side $(1+\dfrac{1}{n})^n &lt; e$

shovon

interface ReadOnlyMapNoGetter<K, V> {
	has(key: K): boolean;
	entries(): IterableIterator<[K, V]>;
	forEach(cb: (value: V, key: K, map: ReadOnlyMapNoGetter<K, V>) => void): void;
	keys(): IterableIterator<K>;
	values(): IterableIterator<V>;
	readonly size: number;
}

interface ReadOnlyMap<K, V> extends ReadOnlyMapNoGetter<K, V> {

shovon

class Trie {
	private children: Map<string, Trie> = new Map();

	insert(value: string) {
		if (value === "") {
			return;
		}
		const first = value[0];
		if (!first) {
			throw new Error("Expected the first element to not be an empty string.");

shovon

type List<T1> = [T1, List<T1> | null];

function* iterateCons<T>([left, right]: List<T>): IterableIterator<T> {
  if (right) {
    yield* iterateCons(right);
  }
  yield left;
}

const cons = <T1, T2>(left: T1, right: T2): [T1, T2] => [left, right];