Daniel Wong allyourcode

## nested_list.cc
#include <iostream>
#include <initializer_list>
#include <vector>

using namespace ::std;

template <typename E>
class NestedList {
public:
  class Element {

## .gitignore
**/__pycache__

## .gitignore
*.pyc
*~

## panelize.py
from __future__ import print_function

import csv
import os
import sys

import cv2


def freak_out(msg):

## convex_hull.py
import math
import operator

def normalize_azimuth_radians(angle):
  positive = (angle % 2 * math.pi)
  return positive if positive <= math.pi else positive - 2 * math.pi

class Vector(object):

  def __init__(self, x, y):

## running_total.erl
-module(running_total).
-export([new/2, update/2, update_silently/2]).

-export([sum/0, truncated_sum/1]).


new(Reducer, Initial) ->
    spawn_link(fun() -> run(Reducer, Initial) end)
.

## assassin.erl
-module(assassin).
-export([linked/2]).

% Monitors a gen_server2 for responsiveness by periodically sending
% is_healthy requests, and expecting a response in an amount of time
% specified by user of this module.
%
% Like supervisor, N out of M failures are allowed (where failure
% means response took too long).

## reenter.html
<!doctype html>
<html>
<head>
<title>Wat</title>
</head>
<body>

<script>

/* Support */

## id_server.erl
-module(id_server).

-behavior(gen_server).
-export([init/1, code_change/3, terminate/2]).
-export([handle_call/3, handle_cast/2, handle_info/2]).


% Unlike Snowflake (Twitter) or Flake (boundary), one of the goals here is for
% IDs to be scattered. This is because it is assumed that there will be some
% kind of sorted index on IDs. In that case, IDs that correlate with time would

## click_server.erl
-module(click_server).
-behavior(gen_server).
% For gen_server behavior.
-export([
         % life cycle functions
         init/1, code_change/3, terminate/2,
         % handle_* service provider functions
         handle_call/3, handle_cast/2, handle_info/2]).

% For users of this module.
	#include <iostream>
	#include <initializer_list>
	#include <vector>

	using namespace ::std;

	template <typename E>
	class NestedList {
	public:
	class Element {
	from __future__ import print_function

	import csv
	import os
	import sys

	import cv2


	def freak_out(msg):
	import math
	import operator

	def normalize_azimuth_radians(angle):
	positive = (angle % 2 * math.pi)
	return positive if positive <= math.pi else positive - 2 * math.pi

	class Vector(object):

	def __init__(self, x, y):
	-module(running_total).
	-export([new/2, update/2, update_silently/2]).

	-export([sum/0, truncated_sum/1]).


	new(Reducer, Initial) ->
	spawn_link(fun() -> run(Reducer, Initial) end)
	.
	-module(assassin).
	-export([linked/2]).

	% Monitors a gen_server2 for responsiveness by periodically sending
	% is_healthy requests, and expecting a response in an amount of time
	% specified by user of this module.
	%
	% Like supervisor, N out of M failures are allowed (where failure
	% means response took too long).
	<!doctype html>
	<html>
	<head>
	<title>Wat</title>
	</head>
	<body>

	<script>

	/* Support */
	-module(id_server).

	-behavior(gen_server).
	-export([init/1, code_change/3, terminate/2]).
	-export([handle_call/3, handle_cast/2, handle_info/2]).


	% Unlike Snowflake (Twitter) or Flake (boundary), one of the goals here is for
	% IDs to be scattered. This is because it is assumed that there will be some
	% kind of sorted index on IDs. In that case, IDs that correlate with time would
	-module(click_server).
	-behavior(gen_server).
	% For gen_server behavior.
	-export([
	% life cycle functions
	init/1, code_change/3, terminate/2,
	% handle_* service provider functions
	handle_call/3, handle_cast/2, handle_info/2]).

	% For users of this module.