marvhus

Floating Point Precision in x86-64 Assembly

The lack of precison you get with floating point numbers isn't a language problem, it's a problem with floating point nubers themselves, so it even shows up as low as x86-64 assembly.

The assembly in the file bellow is the code I have written to showcase this.

To compile it you have to do this:

$ nasm floats.asm -o floats.o -f elf64

marvhus

Connecting emacs and Protonmail Bridge

This guide will cover the basics on how to integrate emacs with protonmail-bridge using

• mu4e
• mbsync
• smtpmail
• protonmail-bridge

Configuring mbsync

marvhus

getPairs :: [Int] -> [(Int, Int)]
getPairs [] = []
getPairs [_] = []
getPairs (x:y:xs) = (x,y) : getPairs (y:xs)

getDiff :: [(Int, Int)] -> [Int]
getDiff [] = []
getDiff ((x1, x2):xs) = (x2 - x1) : getDiff xs

generate :: [Int] -> [[Int]]

marvhus

#!/usr/bin/bash
setxkbmap -option caps:ctrl_modifier no &

do_dwm ()
{
    slstatus &

    picom -b &
    nitrogen --restore &
    dunst -font "iosveka" &

marvhus

use std::fs;

const CHARSET: &[u8] = b"QWlKoxp3mT9EeRb4YzgG6rNj1OLvZ5SDfMBaXtP8JyIFVH07uh2wicdnUAC#@q";

fn encode(input: String) -> String {
    let input_bytes = input.as_bytes();
    let mut output = Vec::new();

    let mut temp = 0u32;
    let mut temp_len = 0u8;

marvhus

fizzbuzz :: (low: u32, high: u32) {
    _print :: (str: string) #expand {
        print("%", str);
        `already_printed = true;
    }
    for i: low..high {
        already_printed := false;
        if i % 3 == 0 then _print("Fizz");
        if i % 5 == 0 then _print("Buzz");
        if !already_printed then print("%", i);

marvhus

main :: () {
	print("What is your name?\n> ");
	name := input();
	print("Hello, %!\n", name);
}

#import "Basic";

#if OS == .LINUX {
	#import "POSIX";

marvhus

#!/bin/bash

# Small script to count lines in .jai files
# Cloc doesn't support jai, so I just made this for now

files=$(find $1 -name "*.jai")
if [ "$1" == "" ]; then
    echo "No path"
    exit 1
fi

marvhus

u8_to_string :: (c: u8) -> string {
    buff: String_Builder;
    init_string_builder(*buff);
    append(*buff, c);
    return builder_to_string(*buff);
}
u8_to_string :: (cs: []u8) -> string {
    buff: String_Builder;
    init_string_builder(*buff);
    for c: cs {

marvhus

COUNT :: 1_000_000;
arr : [COUNT] bool;
sieve :: () {
    // Computer primes using sieve of Eratosthenes
    for 1..arr.count-1 { arr[it] = true; }
    arr[1] = false;
    for idx: 2..(COUNT / 2) - 1 {
        j := 2 * idx;
        while j < COUNT {
            arr[j] = false;