Lukas Baumert Suppenterrine

Download source from source

For example: source https://www.sqlite.org/2023/sqlite-amalgamation-3430100.zip
Download binary from binary

For example: binary https://www.sqlite.org/2023/sqlite-dll-win64-x64-3430100.zip
Extract both archives to the same directory

	let diff_dt_now = new Date();
	let diff_dt_const = new Date('2020-12-31');

	// delta between current month and 2020-12-31 (integer)
	let month_diff = (diff_dt_const.getTime() - diff_dt_now.getTime()) / 1000;
	month_diff /= (60 * 60 * 24 * 7 * 4);
	month_diff = Math.abs(Math.round(month_diff));

	class Month {
	constructor (range) {

	using System;
	using System.Collections.Generic;
	using System.Linq;
	using System.Text;
	using System.Threading.Tasks;
	using System.Windows;
	using System.Windows.Controls;
	using System.Windows.Data;
	using System.Windows.Documents;
	using System.Windows.Input;

	entry = input("Enter a Mayan date: ")

	i=0 # this is used to track our position in the string
	output = "" # start with output set to nothing
	while entry[i:]:

	# if we hit a space, then we've got to the end of that number
	# print it out and reset the output
	if entry[i] == " ":
	print (output)

	-- Author: Michael-Keith Bernard
	-- Date: May 22, 2012
	-- Description: Various implementations of the Fibonacci sequence in Lua. Lua
	-- has native support for tail-call elimination which is why `tail_call` and
	-- `continuation` run in near constant time. For sufficiently large numbers of n
	-- you can start to see linear performace characteristics (particularly for the
	-- `continuation` implementation), but ultimately the `tail_call` implementation
	-- is an order of magnitude faster than iteration even for values of n as small
	-- as 500k.

	Number.prototype.map = function (in_min, in_max, out_min, out_max) {
	return (this - in_min) * (out_max - out_min) / (in_max - in_min) + out_min;
	}