nebkor

#!/bin/sh
# bee - return Spelling Bee words from maximal set
# Andrew Ho <andrew@zeuscat.com>

ME=`basename "$0"`
USAGE="usage: $ME letters middle-letter"
die_usage() { (echo "$ME: $@"; echo "$USAGE") 1>&2; exit 1; }

letters="$1"
[[ -z "$letters" ]] && die_usage 'missing required letters'

nebkor

#include <pthread.h>
#include <unistd.h>

void *work(void *arg) {
    printf("Sleeping for %d seconds.\n", *(int *) arg);
    sleep(*(uint *) arg);
    printf("%d\n", *(int*) arg);
    return arg;
} 

nebkor

genie:git/rls> cargo test --release
    Finished release [optimized] target(s) in 0.0 secs
     Running target/release/deps/rls-8d538f90923cc0fd

running 10 tests
test test::test_completion ... FAILED
test test::test_find_all_refs ... FAILED
test test::test_find_all_refs_no_cfg_test ... FAILED
test test::test_highlight ... FAILED
test test::test_goto_def ... FAILED

nebkor

#lang racket

(provide parse-lisp)

(define (parse-lisp str)
  (parenthesize (tokenize str)))

(define (tokenize str)
  (string-split
   (string-trim

nebkor

Keybase proof

I hereby claim:

• I am nebkor on github.
• I am nebkor (https://keybase.io/nebkor) on keybase.
• I have a public key whose fingerprint is 8D52 0962 1B52 2FCC E64B 27FE 5E6A 4292 907D D966

To claim this, I am signing this object: