Armen Michaeli amn

I have had to understand Python packaging in depth on a number of occasions lately, both in my private development efforts and at my place of employment. For my own sake and simply to help others, I'd like to share what I consider valuable insight and information -- to save others time and effort, if mine was anything to judge by.

Python packaging has come further since people had to express everything with setup.py and more importantly without pyproject.toml. PEP 517 standardises how tools like Pip will execute building, in fact, and the standardisation basically makes it an entirely customizable process starting already with the so-called build backend. That's the value of build-backend in your pyproject.toml. A number of build backends have been developed now -- Poetry, Flit, Hatchling and others. Setuptools, a further development of disttools that used to ship with Python, has also been standardized to offer a build backend -- if the pyproject.toml specifies `build-backend = "setuptools

To reverse a list of words separated by white-space, the reverse can be called as a function with e.g. $(call reverse, a b c).

	class TypeError extends Error {
	static {
	this.prototype.name = this.name;
	}
	}

	export default class Cache {
	#entries = [];
	add(request) {
	return this.addAll([ request ]);

	/**
	* Some useful HTTP-related Web API helpers.
	*
	* See:
	* * https://fetch.spec.whatwg.org/
	*/

	/**
	* Compile and return a `Headers` object corresponding to well-known objects `input` and `init` that normally are passed to `Request` constructor.
	*

	/**
	* Sort a sequence using the binary insertion sort algorithm.
	*
	* The traditional insertion sort algorithm will look for a place to re-insert "current" element by simply walking towards the beginning of the sequence, through the already sorted portion. This implementation drastically reduces number of comparisons thus required to determine where in the [already sorted] portion of the sequence to re-insert current element, by using so-called binary space/search partitioning. This yields a worst-case `n * Math.log2(n)` performance vs traditionally `n * n`, all the more noticable for large enough sequence and/or where cost of sorting order comparison (see the `fn` parameter) is non-negligible.
	*
	* The sequence is sorted in-place, which is why this procedure does not return anything. Sorting is guarateed to be "stable" -- any two items for which `compare` does not indicate sorting (by returning zero), retain their relative positions in the sequence. Worst case performance is, unlike regular insertion sort

	# Calculate local sunset time and set Windows theme to "dark" if it's past sunset time or "light" if it's before sunset time
	# Author: Armen Michaeli <[email protected]>

	# May be run on a schedule (e.g. every 15 minutes) or manually.

	Add-Type -AssemblyName System.Device

	$gcw = New-Object System.Device.Location.GeoCoordinateWatcher

	$gcw.Start()

	export default class MediaRecorderDataStream extends ReadableStream {
	constructor(recorder) {
	const signaler = new AbortController(), { signal } = signaler;
	super({
	start: controller => {
	recorder.addEventListener("dataavailable", ev => {
	controller.enqueue(ev.data);
	}, { signal });
	recorder.addEventListener("stop", ev => {
	controller.close();

	export const uuid4 = () => {
	const ho = (n, p) => n.toString(16).padStart(p, 0); /// Return the hexadecimal text representation of number `n`, padded with zeroes to be of length `p`
	crypto.getRandomValues(new Uint8Array(16)); /// Fill a data buffer with random data
	data[6] = (data[6] & 0xf) \| 0x40; /// Patch the 6th byte to reflect a version 4 UUID
	data[8] = (data[8] & 0x3f) \| 0x80; /// Patch the 8th byte to reflect a variant 1 UUID (version 4 UUIDs are)
	const view = new DataView(data.buffer); /// Create a view on the data buffer
	return `${ho(view.getUint32(0), 8)}-${ho(view.getUint16(4), 4)}-${ho(view.getUint16(6), 4)}-${ho(view.getUint16(8), 4)}-${ho(view.getUint32(10), 8)}${ho(view.getUint16(14), 4)}`; /// Compile the canonical representation of the data
	};

	" URL: https://gist.github.com/amn/f77f67df54ad4471f2fa12262d7addf5

	hi clear

	if exists("syntax_on")
	syntax reset
	endif

	let g:colors_name = "Solarized"