My resume is available upon request. This repo provides deep links into some interesting code I've written.
I am passionate about the user experience. I respect simple pragmatic architecture. I think we should optimize the ratio of lines of code to user happiness. I want to know that what we're building delivers value. I like to solve gnarly problems and I love working with other passionate, talented people!
BattleSnake is easily the most fun I have had at a programming event. What an incredible way to get people excited about programming! I co-wrote Workday's bounty snake and enjoyed it so much that I continued to work on it afterwards.
My snake uses the A* (A-star) search algorithm to find the best paths to food or nodes adjacent to the snake's tail. Path finding employs a heuristic to avoid walls and enemy snakes. Paths are weighted according to how hungry the snake is, how far away food is and whether or not the goal provides a path back to the snake's tail (i.e. a valid subsequent move). If no valid path to food or the snake's tail can be found, the AI will move the snake in the direction with the most open space.
Swarm is a code review tool. This code sample determines the work an author did in a particular version of a review or between two versions of a review. If one version is given, it is easy. If two changes are given, it is hard.
Reviews\Controller::getAffectedFiles()
Open Source projects tend to evolve organically. This often results in practical code that solves problems simply and with minimal disruption. When it came time to add SVG support to my popular Identicon.js library, I wanted to do it without breaking backwards compatibility and with little risk of regressions. To do so I wrote a small Svg class that adhered to the same interface exposed by PNGlib. This meant that the existing code was largely untouched and made it trivial to switch between SVG and PNG rendering simply by swapping out the image class.
Swarm talks to one or more Perforce Servers. Some data, most notably users and groups, is costly to query and must be accessed frequently. This data requires a local cache to achieve acceptable performance. The following code samples link into a library that provides cache invalidation via distributed counters and memory efficient reads/writes via streaming array iterators.
Contrast is a recently resurrected side-project of mine. It is a desktop diff viewer written in JavaScript with Electron. One of the goals behind this project was to gain some experience with Electron. Another goal was to implement an algorithm that would ensure the left and right lines in a side-by-side diff are aligned on a focal point as the user scrolls through the document. Beware, the code is a bit messy as tends to happen when one is hacking around on a side-project!
Queries are often expressed as strings. This works pretty well for humans and for predefined lookups. But, what happens when an expression needs to be passed around and manipulated in several places in your code? This use case popped up on the Chronicle project. Chronicle is a content management system for Perforce. The following sample models a search expression that can be built-up and pulled apart by adding, removing and nesting condtions.