So there were a few threads going around recently about a challenge to write the longest sequence of keywords in Javascript:
There are, however, a few problems:
| const handler = { | |
| get(target, propKey, receiver) { | |
| if (/^_[0-9]+$/.test(propKey)) { | |
| const result = []; | |
| const first = Number(receiver); | |
| const last = Number(propKey.slice(1)); | |
| for (let i=first; i<=last; i++) { | |
| result.push(i); | |
| } | |
| return result; |
| a4b.amazonaws.com | |
| access-analyzer.amazonaws.com | |
| account.amazonaws.com | |
| acm-pca.amazonaws.com | |
| acm.amazonaws.com | |
| airflow-env.amazonaws.com | |
| airflow.amazonaws.com | |
| alexa-appkit.amazon.com | |
| alexa-connectedhome.amazon.com | |
| amazonmq.amazonaws.com |
Together with HellMood we won this year's (2016) JS1K competition and thought this might be a good opportunity to write about the development process and my motivation behind it. If you're already familiar with JS1K, feel free to skip the next two paragraphs.
Disclaimer: This piece is written anonymously. The names of a few particular companies are mentioned, but as common examples only.
This is a short write-up on things that I wish I'd known and considered before joining a private company (aka startup, aka unicorn in some cases). I'm not trying to make the case that you should never join a private company, but the power imbalance between founder and employee is extreme, and that potential candidates would
| // Create a Promise that resolves after ms time | |
| var timer = function(ms) { | |
| return new Promise(resolve => { | |
| setTimeout(resolve, ms); | |
| }); | |
| }; | |
| // Repeatedly generate a number starting | |
| // from 0 after a random amount of time | |
| var source = async function*() { |
Simply put, destructuring in Clojure is a way extract values from a datastructure and bind them to symbols, without having to explicitly traverse the datstructure. It allows for elegant and concise Clojure code.
| /// Playground - noun: a place where people can play | |
| /// Church-Turing clan ain’t nothing to func with. | |
| /// Church encoding is a means of representing data and operators in the lambda | |
| /// calculus. In Swift, this means restricting functions to their fully curried | |
| /// forms; returning blocks wherever possible. Church Encoding of the natural | |
| /// numbers is the most well-known form of encoding, but the lambda calculus is | |
| /// expressive enough to represent booleans, conditionals, pairs, and lists as | |
| /// well. This file is an exploration of all 4 representations mentioned. |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
Each of these commands will run an ad hoc http static server in your current (or specified) directory, available at http://localhost:8000. Use this power wisely.
$ python -m SimpleHTTPServer 8000