I hereby claim:
- I am subnomo on github.
- I am subnomo (https://keybase.io/subnomo) on keybase.
- I have a public key ASCFG6v7ynKKvj4MwoqCo_jxc3z3Ulv9NxME9mwB7oTrLQo
To claim this, I am signing this object:
| local surface = game.player.surface | |
| local pp = game.player.position | |
| local count = 0 | |
| for key, entity in pairs(surface.find_entities_filtered({ type="cliff", radius=250, position=pp })) do | |
| count = count + 1 | |
| entity.destroy() | |
| end | |
| game.player.print(string.format('Destroyed %d cliffs!', count)) |
| [package] | |
| name = "donut" | |
| version = "0.1.0" | |
| authors = ["Alex Taylor <alex@subnomo.me>"] | |
| [dependencies] | |
| time = "0.1.37" |
| TITLE Combinations Calculator (final.asm) | |
| ; Author: Alexander Taylor | |
| ; CS 271 Sec. 1 / Program 6B Date: 12/04/16 | |
| ; Description: This program generates practice combinations problems. | |
| ; It takes user input for each problem, and tells the user | |
| ; the answer, as well as if they were right or wrong. Finally, | |
| ; it implements extra credit #1 by keeping track of each answer, | |
| ; and tallying up the number of right and wrong at the end. |
| pow MACRO x, n | |
| LOCAL start | |
| push ebx | |
| push ecx | |
| push edx | |
| mov eax, x | |
| mov ebx, eax | |
| mov ecx, n |
| declare global { | |
| interface Array<T> { | |
| includes(searchElement: T): boolean; | |
| } | |
| } | |
| if (!Array.prototype.includes) { | |
| Array.prototype.includes = (searchElement: any, ...args: number[]) => { | |
| if (this == null) { | |
| throw new TypeError("Array.prototype.includes called on null or undefined"); |
| #include "SimpleMemory.h" | |
| SimpleMemory::SimpleMemory(std::wstring windowName) { | |
| hwnd = FindWindowW(nullptr, windowName.c_str()); | |
| DWORD pid; | |
| GetWindowThreadProcessId(hwnd, &pid); | |
| hProcess = OpenProcess(PROCESS_VM_READ | PROCESS_VM_WRITE | PROCESS_VM_OPERATION, false, pid); | |
| } |
| struct Foo { | |
| value: u32 | |
| } | |
| trait HasUIntValue { | |
| fn as_uint(self) -> u32; | |
| } | |
| impl Foo { | |
| fn add<T: HasUIntValue>(&mut self, value: T) { |
I hereby claim:
To claim this, I am signing this object:
| //#define USE_SharpZipLib | |
| #if !UNITY_WEBPLAYER | |
| #define USE_FileIO | |
| #endif | |
| /* * * * * | |
| * A simple JSON Parser / builder | |
| * ------------------------------ | |
| * | |
| * It mainly has been written as a simple JSON parser. It can build a JSON string | |
| * from the node-tree, or generate a node tree from any valid JSON string. |
I've sniffed most of the Tinder API to see how it works. You can use this to create bots (etc) very trivially. Some example python bot code is here -> https://gist.github.com/rtt/5a2e0cfa638c938cca59 (horribly quick and dirty, you've been warned!)
Note: this was written in April/May 2014 and the API may have changed since