WillDignazio

import random
import sys

strings = {
    "2":		[":battlefield-2:", ":bf2:"],
    "99": 		[":99:"],
    "a": 		[":amazon:", ":amd:", ":anarchy:", ":angular:", ":ansible:", ":arch:", ":atlassian:", ":azure:"],
    "actually": 	[":actually:"],
    "ati":		[":ati:"],
    "app":		[":app:"],

WillDignazio

#include <stdio.h>

int main(int argc, char *argv[]) {
  char *test_string;

  test_string = "foobar";
  printf("%s\n", test_string);

  return 0;
}

WillDignazio

import java.util.List;
import java.util.ArrayList;
import java.util.stream.Collectors;
import java.util.concurrent.ConcurrentLinkedQueue;

public class ClosureTest {
    public static void main(String[] args) {
	List<String> lst = new ArrayList<>();
	lst.add("Alice");
	lst.add("Will");

WillDignazio

import java.util.HashMap;
import java.util.Map;
import java.util.Optional;

public class Trie {
    private String val;
    private Trie parent;
    private final Map<String, Trie> trie = new HashMap<>();

    private int _count = 0;

WillDignazio

public class GenericArray {
  public static void main(String[] args) {
    Pair<String, String> arr[] = new Pair<String, String>[10]; // BOOM!
  }
}

WillDignazio

import java.util.Date;

public class Fib {                                                                                                                                                                                                                               
    public static int fibn(int n) {                                                                                                                                                                                                              
        if (n == 0 || n == 1)                                                                                                                                                                                                                    
            return n;                                                                                                                                                                                                                            
                                

WillDignazio

### Keybase proof

I hereby claim:

  * I am WillDignazio on github.
  * I am slackwill (https://keybase.io/slackwill) on keybase.
  * I have a public key whose fingerprint is A7C5 85BC CED2 8189 4892  DDF1 BCBA 9484 916C 52F5

To claim this, I am signing this object:

WillDignazio

#!/bin/python
import requests
import multiprocessing
import uuid
import time

def worker():
    while True:
        req = requests.post("http://uvb.csh.rit.edu/register/rhubarb_%s" % uuid.uuid4())
        time.sleep(1)

WillDignazio

/*
 * Algorithe E -- verbose 
 */

#include <stdio.h> 
#include <stdlib.h>

/* 
 * Given two positive integers m and n, we may computer their greatest common 
 * divisor d, and we also compute two not-necessarily positive integers a and b

WillDignazio

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <unistd.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <fcntl.h>

typedef uint8_t  __u8;
typedef uint16_t __u16;