| function mapValues(obj, fn) { | |
| return Object.keys(obj).reduce((result, key) => { | |
| result[key] = fn(obj[key], key); | |
| return result; | |
| }, {}); | |
| } | |
| function pick(obj, fn) { | |
| return Object.keys(obj).reduce((result, key) => { | |
| if (fn(obj[key])) { |
Picking the right architecture = Picking the right battles + Managing trade-offs
Article by Faruk Ateş, [originally on KuraFire.net][original] which is currently down
One of the most commonly overlooked and under-refined elements of a website is its pagination controls. In many cases, these are treated as an afterthought. I rarely come across a website that has decent pagination, and it always makes me wonder why so few manage to get it right. After all, I'd say that pagination is pretty easy to get right. Alas, that doesn't seem the case, so after encouragement from Chris Messina on Flickr I decided to write my Pagination 101, hopefully it'll give you some clues as to what makes good pagination.
Before going into analyzing good and bad pagination, I want to explain just what I consider to be pagination: Pagination is any kind of control system that lets the user browse through pages of search results, archives, or any other kind of continued content. Search results are the o
| // convert 0..255 R,G,B values to binary string | |
| RGBToBin = function(r,g,b){ | |
| var bin = r << 16 | g << 8 | b; | |
| return (function(h){ | |
| return new Array(25-h.length).join("0")+h | |
| })(bin.toString(2)) | |
| } | |
| // convert 0..255 R,G,B values to a hexidecimal color string | |
| RGBToHex = function(r,g,b){ |
I'm having trouble understanding the benefit of require.js. Can you help me out? I imagine other developers have a similar interest.
From Require.js - Why AMD:
The AMD format comes from wanting a module format that was better than today's "write a bunch of script tags with implicit dependencies that you have to manually order"
I don't quite understand why this methodology is so bad. The difficult part is that you have to manually order dependencies. But the benefit is that you don't have an additional layer of abstraction.
| var input = [1,2,3,4,5], | |
| specArr = [0,2,1,4,3]; | |
| function mutate(input, specArr) { | |
| var visited = [0,2] | |
| for(var i=0; i<specArr.length; i++) { | |
| var tmp; | |
| //keep track of array items we've already looped through (wouldn't want to mutate twice :D) |
| /* | |
| * A child is running up a staircase with n steps, and can hop either 1 step, 2 steps, | |
| * or 3 steps at a time. Implement a method to count how many possible ways the | |
| * child can run up the stairs. | |
| */ | |
| var countSteps = (function () { | |
| var memo = [0,1]; | |
| var fn = function (numStairs) { |
| /** | |
| * | |
| * Dinesh | |
| * | |
| * RootedTreeTraversal | |
| * - Preorder Traversal | |
| * - Postorder Traversal | |
| * - Inorder Traversal | |
| * - Levelorder Traversal | |
| * |
Gist copied from here for my own reference
While one might think that leaking credentials is pretty much a noob mistake, and if you are feeling yourself being safe because you are an experienced developer, that’s a wrong impression leading to underestimation of the problem.
I performed a rather simple credentials search using only two methods: wget/untar/grep on npm packages and GitHub Search. The queries were pretty simple, it did not take much time, and that’s a quite obvious thing to do. Do you remember yourself laughing at «begin rsa private key» search results over GitHub and people who publish that?