Neil Edwards neiled

Keybase proof

I hereby claim:

I am neiled on github.
I am neiled (https://keybase.io/neiled) on keybase.
I have a public key whose fingerprint is 76DC EFCC 14D6 B698 EE5E FCAF E84A F9DA 17E2 9D5D

To claim this, I am signing this object:

Keybase proof

I hereby claim:

I am neiled on github.
I am neiled (https://keybase.io/neiled) on keybase.
I have a public key whose fingerprint is B733 DCCB 65F0 0747 5F25 99CE B406 ABAE F9F3 8E18

To claim this, I am signing this object:

Keybase proof

I hereby claim:

I am neiled on github.
I am neiled (https://keybase.io/neiled) on keybase.
I have a public key whose fingerprint is 6A8E 50E5 EC89 2C66 18B1 FD19 8663 92CE 7C80 AAB5

To claim this, I am signing this object:

=What to have on an admin dashboard=

==Users== List all of the users in the system Ability to:

Group/filter by company
Reset a user's password
See their billing status (Last billed time, amount, status)
Refund them money
Invite a new user to a company

Locate the section for your github remote in the .git/config file. It looks like this:

[remote "origin"]
	fetch = +refs/heads/*:refs/remotes/origin/*
	url = [email protected]:joyent/node.git

Now add the line fetch = +refs/pull/*/head:refs/remotes/origin/pr/* to this section. Obviously, change the github url to match your project's URL. It ends up looking like this:

	renderer.AddGradientPoint (-1.0000, utils::Color ( 0, 0, 128, 255)); // deeps
	renderer.AddGradientPoint (-0.2500, utils::Color ( 0, 0, 255, 255)); // shallow
	renderer.AddGradientPoint ( 0.0000, utils::Color ( 0, 128, 255, 255)); // shore
	renderer.AddGradientPoint ( 0.0625, utils::Color (240, 240, 64, 255)); // sand
	renderer.AddGradientPoint ( 0.1250, utils::Color ( 32, 160, 0, 255)); // grass
	renderer.AddGradientPoint ( 0.3750, utils::Color (224, 224, 0, 255)); // dirt
	renderer.AddGradientPoint ( 0.7500, utils::Color (128, 128, 128, 255)); // rock
	renderer.AddGradientPoint ( 1.0000, utils::Color (255, 255, 255, 255)); // snow

	public void AddDoors(Level level)
	{
	for (int y = RoomStart.Y - 1; y <= RoomStart.Y + Height; y++)
	{
	for (int x = RoomStart.X-1; x <= RoomStart.X + Width; x ++)
	{
	if (y != RoomStart.Y - 1 && y != RoomStart.Y + Height && x != RoomStart.X - 1 && x != RoomStart.X + Width)
	continue;

	if (y < 0) continue;

	private void connectRooms(List<Room> rooms)
	{
	/*
	Input: A non-empty connected weighted graph with vertices V and edges E (the weights can be negative).
	Initialize: Vnew = {x}, where x is an arbitrary node (starting point) from V, Enew = {}
	Repeat until Vnew = V:
	Choose an edge {u, v} with minimal weight such that u is in Vnew and v is not
	* (if there are multiple edges with the same weight, any of them may be picked)
	Add v to Vnew, and {u, v} to Enew
	Output: Vnew and Enew describe a minimal spanning tree

	Done
	1 Albino Troll
	1 Birds of Paradise
	1 Blastoderm
	1 Call of the Herd
	1 Constant Mists
	1 Crop Rotation
	1 Elvish Scrapper
	1 Eternal Witness
	1 Fyndhorn Elves