I hereby claim:
- I am nason on github.
- I am nason (https://keybase.io/nason) on keybase.
- I have a public key ASDr3hnnWlYnBwVXpmXtdoPn5yi6X_JsbZg2hUvuDmW6wgo
To claim this, I am signing this object:
| // Available variables: | |
| // - Machine | |
| // - interpret | |
| // - assign | |
| // - send | |
| // - sendParent | |
| // - spawn | |
| // - raise | |
| // - actions |
| async function handleInsert(record) {} | |
| async function handleUpdate(record) {} | |
| async function handleRemove(record) {} | |
| async function receiveHandler(event, context, callback) { | |
| const results = await Promise.all( | |
| event.Records.map(record => { | |
| console.log(JSON.stringify(record)); | |
| switch (record.eventName) { | |
| case 'INSERT': |
| Checkout App | |
| Inactive* | |
| activate -> Init | |
| Init | |
| fetch estimate -> Configure and Review | |
| fetch error -> Error | |
| Configure and Review |
I hereby claim:
To claim this, I am signing this object:
| var optimumPoints = function(input) { | |
| var min = input.reduce(getMin), | |
| max = input.reduce(getMax), | |
| minIndex = input.indexOf(min), | |
| maxIndex = input.lastIndexOf(max); | |
| if (minIndex > maxIndex) { | |
| // Can't sell before we buy, try again | |
| var copy = input.slice(); | |
| // This time, delete the current min to calculate the second lowest min |
| var doubleAnagram = function(string) { | |
| // parse the input string & generate pairs | |
| var words = parseInput(string).map(buildDoubles), | |
| result = false; | |
| for (var i = 0; i<words.length; i++) { | |
| for (var j = i+1; j<words.length; j++) { | |
| // iterate through the words structure, and compare the current to all subsequent | |
| result = checkForAnagram(words[i], words[j]); | |
| if (result) { |
| var request = require('request'); | |
| var options = { | |
| uri: 'https://api.com/v1.1/sections', | |
| qs: { | |
| limit: 1000000000000000 | |
| }, | |
| auth: { | |
| 'user': 'DEMO_KEY' | |
| } | |
| }; |