Isabella Bosia izabera

for the latest chapter of what's becoming a blog on the most cursed bash you can imagine, let's do some maths together

euclid's algorithm for gcd could be written like this in python:

>>> def gcd(a, b):
...     if b:
...         return gcd(b, a%b)
... return a

	#!/bin/bash

	# max multiple of pi so our maths always fits in a signed 64 bit int
	pi=314159
	scale=100000



	# bhaskara's formula
	# https://en.wikipedia.org/wiki/Bh%C4%81skara_I's_sine_approximation_formula

	#!/usr/bin/env dumb

	input fentry.cpp count.hpp
	output fentry.o
	cmd clang++ -std=c++17 -ggdb3 -fPIC -mgeneral-regs-only -c fentry.cpp

	input count.cpp count.hpp
	output count.o
	cmd clang++ -std=c++17 -ggdb3 -fPIC -c count.cpp

	#!/usr/bin/env dumb

	in: fentry.cpp
	out: fentry.o
	cmd: clang++ -std=c++23 -ggdb3 -fPIC -mgeneral-regs-only -c fentry.cpp

	in: count.cpp
	out: count.o
	cmd: clang++ -std=c++23 -ggdb3 -fPIC -c count.cpp

	#!/usr/bin/gawk -E
	# prints a sorted list of all the current processes
	# sorted by the number of executable bytes in their address space

	BEGIN {
	"echo /proc/[0-9]*/maps" \| getline
	ARGC = split($0, ARGV)
	}

	BEGINFILE {

	#!/usr/bin/env python3
	# a basic alternative to make2graph, significantly less painful to read

	import re
	import sys


	class Node:
	def __init__(self, target):
	self.target = target