Dustin Van Tate Testa dvtate

Postfix Haskell Devlog

Here is a timeline of development for a programming language I worked on 2020-2023

This is a POC for first ~1/3 of compiler for new language I'm working on... This demo is just a shell for part of compiler that handles:

Note: Commands here are just for examples. They will NOT run as they are shown here. You have to adapt them to your own needs and system.

Create the directory to hold the project:

mkdir /home/USER/debpkgs/my-program_version_architecture
Create a directory called "DEBIAN" inside the project directory:

Required Use of old software that had bugs, was no longer maintained and was poorly documented
Delicate, expensive components
Required a middleman controller to translate
System involved maintaining 3 separate libraries in 2 languages on 3 devices
- massive time investment
- In addition, motor controllers and arduino had custom instruction sets we had to use
encoders:
- Previous system used hardware PID controllers

	#!/bin/sh

	# configure the system proxy in gnome settings
	gnome_sys_proxy () {
	# $1 - 'enable' \| 'disable'

	# toggle proxy
	if [ $1 -eq 'status' ]
	then
	gsettings get org.gnome.system.proxy mode

	const { expect } = require('chai');
	const { Vector3 } = require('three');

	describe('lookup', function callback() {
	it('does not crash', function callback() {
	const jsdom = new (require('jsdom')).JSDOM();
	const canvas = jsdom.window.document.createElement('canvas');
	global.window = jsdom.window;
	global.document = jsdom.window.document;

	# Developer: qorg11
	# Maintainer: Dustin Testa <[email protected]>

	pkgname=lainsafecli
	pkgver=0.4.r0.g47312a4 # updated by pkgver()
	pkgrel=1
	pkgdesc="CLI interface for lainsafe"
	arch=('any')
	url='https://github.com/qorg11/lainsafe'
	license=('GPL')

	#include <stdio.h>
	#include <time.h>


	// expects ret to be a char buffer with length 8*sizeof(int)
	inline void bitwise_itobin(const int n, char* ret) {
	const unsigned char l = sizeof(int) * 8;
	for (unsigned char i = 0; i < l; i++)
	ret[i - 1] = (n & (1 << i)) ? '1' : '0';
	}