| /* | |
| * Simple hash map using javascript objects and an ordered array. | |
| * Repeated elements are not allowed. | |
| * | |
| * @param sort_method By default is ASC order, but you can specified whatever you want. | |
| * | |
| * The public methods are: | |
| * -set | |
| * -get | |
| * -del |
This simple script will take a picture of a whiteboard and use parts of the ImageMagick library with sane defaults to clean it up tremendously.
The script is here:
#!/bin/bash
convert "$1" -morphology Convolve DoG:15,100,0 -negate -normalize -blur 0x1 -channel RBG -level 60%,91%,0.1 "$2"
Why Should I Care (For Developers)
"Docker interests me because it allows simple environment isolation and repeatability. I can create a run-time environment once, package it up, then run it again on any other machine. Furthermore, everything that runs in that environment is isolated from the underlying host (much like a virtual machine). And best of all, everything is fast and simple."
CURLOPT_DNS_CACHE_TIMEOUT: controls the TTL of a DNS cache entry. The default is 60s. Use -1 to keep the entry forever.CURLOPT_RESOLVE: pre-populate the DNS cache manually.CURLOPT_DNS_SERVERS: use alternate DNS servers (instead of system default ones). Warning: works only with c-ares (and it requires c-ares version >= 1.7.4),CURLOPT_DNS_USE_GLOBAL_CACHE: cache DNS queries between easy handles. Warning: this is not thread-safe and documented as deprecated. Use the share interface instead (see below).
| # place this in your fish path | |
| # ~/.config/fish/config.fish | |
| function fish_greeting | |
| if not type fortune > /dev/null 2>&1 | |
| apt-get install fortune | |
| end | |
| fortune -a | |
| end |
| BM25.Tokenize = function(text) { | |
| text = text | |
| .toLowerCase() | |
| .replace(/\W/g, ' ') | |
| .replace(/\s+/g, ' ') | |
| .trim() | |
| .split(' ') | |
| .map(function(a) { return stemmer(a); }); | |
| // Filter out stopStems |
| function flatMap($data, \Closure $p) | |
| { | |
| $collection = call_user_func_array("array_map", array($p)); | |
| return iterator_to_array(new \RecursiveIteratorIterator( | |
| new \RecursiveArrayIterator($data)), false); | |
| } |
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