izabera

the program

it creates a tcp socket, connects to 127.0.0.1:8080, closes the socket, and repeats

the issue

every few iterations, connect blocks for just a little over a second

things that seem required for this to happen

• this only happens if the client and the server run on the same machine and the connection is on the loopback interface. if the client is running on a different machine, it's fast in all cases
• if the client forks for each iteration, this issue never happens

izabera

#!/bin/bash

genspell () {
    declare -gA spell
    local w s i
    while read -r w; do
        for ((i=${#w}-1;i>=0;i--)) do
            spell[_${w::i}${w:i+1}]+=\ $w
        done
        spell[_$w]+=\ $w

izabera

ai reviews my mini webserver

i needed to share a single file so i wrote a quick webserver in bash like any normal person would. it supports head and get, which was all i needed. as far as i'm aware it doesn't misbehave too badly

then i showed it to a bunch of extremely smart phd level agi bots that are going to replace us all and asked them to review it and point out any flaws

izabera

sed 'sentence;secede;secede' <<< canter        # canter -> cancer -> dancer -> dander
sed 'severe;serene;secede' <<< cove            # cove -> core -> cone -> done

sed 'septette;settee' <<< Capt                 # Capt -> Catt -> Ca
sed 'severe;serene' <<< Iva                    # Iva -> Ira -> Ina
sed 'severe;serene' <<< paves                  # paves -> pares -> panes
sed 'secrete;settee' <<< critter               # critter -> titter -> tier
sed 'severe;serene' <<< v                      # v -> r -> n
sed 'severe;serene' <<< coves                  # coves -> cores -> cones
sed 'severe;serene' <<< vapes                  # vapes -> rapes -> napes

izabera

asking gemini to write some cube code

i'm writing another lil cube thing. if you've ever written a rubik's cube simulator/solver, you will know that some parts can be more akin to data than to code. one way or another, you always end up with lots and lots of tables to select the right pieces and move them to the right places. if good code reads like poetry and bad code reads like a phonebook, this is always easily in the top 10 most mind-numbingly boring programs of all time.

izabera

1
/sent/ { stot += sent[s++] = $2 }
/recv/ { rtot += recv[r++] = $2 }
END {
    if (r != s)
        printf "error: s=%d r=%d\n", s, r
    for (i in sent)
        if (sent[i] < recv[i])
            printf "error: sent[%d]=%d recv[%d]=%d\n", i, sent[i], i, recv[i]
    printf "sent=%'d avg=%'d\n", stot, stot/s

izabera

#!/bin/bash

usage () {
    cat << 'eof'
bgcmd manages a long running, interactive command in background

usage:

    bgcmd START command [args...]    # starts a command in background

izabera

namerefs (introduced in bash 4.0) act as aliases for other variables

var=meow
declare -n ref=var

echo $ref  # prints meow

ref=moo
echo $var  # prints moo

izabera

#if 0
#define _XOPEN_SOURCE 700
#include <aio.h>
#include <arpa/inet.h>
#include <assert.h>
#include <_Complex.h>
#include <ctype.h>
#include <dirent.h>
#include <dlfcn.h>
#include <errno.h>

izabera

set -f
IFS=

rpn () {
    for token do
        case $token in
            +|-|\*|/|%|\*\*) (( stack[-2] = stack[-2] $token stack[-1] )); unset stack[-1] ;;
            =) (( ${stack[-2]} = stack[-1] )); unset stack[-1] stack[-1] ;;
            *) stack+=($token) ;;
        esac