narskidan

#!/bin/bash

cd ~/Documents/Code

for directory in *; do
  if ! [ -d "$directory" ]; then continue; fi
  
  cd "$directory"

  # Check if this directory is a Git repository

narskidan

/+  default-agent, dbug
|%
+$  versioned-state
  $%  state-0
  ==
+$  state-0
  $:  [%0 length=@ud values=(list @)]
  ==
+$  card  card:agent:gall
--

narskidan

|%
++  merge
  |=  [a=(list @) b=(list @)]
  ^-  (list @)
  =|  c=(list @)
  |-
  =/  empty-a  =(0 (lent a))
  =/  empty-b  =(0 (lent b))
  ?:  ?|(empty-a empty-b)
    :(weld c a b)

narskidan

|=  $:
  objects=(list *) 
  $=  eye-of-the-beholder
      :: im not mormon, but im not going
      :: to ignore that their theology
      :: is trivially proven correct by
      :: any reasonable reading of Lacan.
      $-([* ?(%mormon-god %love %want %gross)])
=/  buckets  
  $:

narskidan

TL;DR too poor for DO droplet so my website's guestbook went offline, gonna use Urbit as a free backend instead. It worked, you can sign my guestbook here: darigo.su/33chan. Chud stack stands for Css/Htmx ~ Urbit Database

It's 4:33 AM and I'm wide awake, checking my email after a long night working on my grant from the Urbit Foundation.

Is my balance still overdraft, then? Thank God, I am alive. How can I cry[^situation] over cashmoney, when the living Christ breathes every suchness into being? No thanks, billing support. Besides, why the fuck did I learn to program on Urbit if not to use it as a free personal forever cloud server?

So that's what I did.

narskidan

function* restore(raw: string, ip = ''): Generator {
  if (raw.length === 0)
    yield ip.slice(1);
  for (const i of [0, 1, 2]) {
    const octet = raw.slice(0, i+1);
    if (i >= raw.length
      || Number(octet) > 255
      || ip.split('.').length > 4
      || octet.length > 1 && octet[0] === '0'
    ) continue;

narskidan

|=  l=(list @ud)
^-  (list @ud)
?:  =(0 (lent l))
  ~
=/  pivot  (snag 0 l)
=/  rest  (slag 1 l)
=/  less  (skim rest |=(a=@ (lte a pivot)))
=/  more  (skim rest |=(a=@ (gth a pivot)))
:(weld $(l less) ~[pivot] $(l more))

narskidan

class HashMap:
    def __init__(self, size=10_000):
        self.size = size
        self.values = [None] * self.size

    def _char_to_number(self, c):
        return ord(c) - 97
    
    def _hash(self, string):
        result = 0

narskidan

const MEMORY_SIZE = 1_000_000;

type Memory = any[]
type registerName = 'stackPointer' 
    | 'instructionPointer' 
    | 'returnValue' 
    | 'general';

interface Processor {
    halted: boolean;

narskidan

def linked_lists(node):
    next_node = None
    ll = []
    
    # loop somehow
        next_node = linked_lists(node)
        ll.append(next_node)
        next_node = None