darighost

|=  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))

darighost

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

darighost

const MEMORY_SIZE = 1_000_000;

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

interface Processor {
    halted: boolean;

darighost

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

darighost

A proposal for app sec on Urbit

TL;DR: apps should run on moons and their access to each other's data managed by a server running on your ship.

Right now, an "app" on Urbit is more like a desktop environment. Apps have access to all of your data, and manage your interaction with your Urbit. Basically, the TempleOS security model.

But in the words of ~wicdev-wisryt, Urbit is eminently securable (X).

Other proposals have been proffered, typically requiring a VM application to run on top of Urbit, which you would run apps inside of.

darighost

import flag # https://pypi.org/project/emoji-country-flag/
import pprint

# raw table from https://www.nationsonline.org/oneworld/country_code_list.htm
raw_text="""
  	
A
	Afghanistan 	AF 	AFG 	004
ALA 	Aland Islands 	AX 	ALA 	248
	Albania 	AL 	ALB 	008

darighost

import requests
import subprocess
import time

while True:
    try:
        req = requests.get('https://google.com')
        subprocess.run('say "Internet connection has been established"', shell=True)
        break
    except:

darighost

class BTree:
  def __init__(self, l, r):
    self.raw_tree = (l, r)
    self.left = BTree(*l) if type(l) == tuple else l
    self.right = BTree(*r) if type(r) == tuple else r

  def __str__(self):
    return 'BTreeNode*'

  def index(self, desired_i):

darighost

|=  n=tape
=/  index  0
=/  found  ""
=/  vowels  "aeiou"
|-
?:  =(index (lent vowels))
  found
=/  current  (trip (snag index vowels))
=/  added  ?:  =(~ (find current n))
  ""

darighost

const parseIp = (ip: string) => 
    ip.split('.').map((p: string) => parseInt(p));

const greaterIp = (rawIp1: string, rawIp2: string) => {
    const ip1 = parseIp(rawIp1);
    const ip2 = parseIp(rawIp2);
    for (const ip of [ip1, ip2]) {
        if (ip.length !== 4 
            || ip.some(p => p > 0 && p < 255))
            return `Invalid IP: ${ip}`;