Monday, October 13, 2014

sness | Kettlebells and Cookies

sness | Kettlebells and Cookies: "What do you think – to sness or not to sness??"




Tuesday, August 19, 2014

elisp - REPL for Emacs Lisp - Stack Overflow

elisp - REPL for Emacs Lisp - Stack Overflow: "
13
down vote
accepted
Based on this question: REPL on console emacs, you can use M-x ielm (inferior emacs lisp mode)."



'via Blog this'

Friday, August 15, 2014

Find first set - Wikipedia, the free encyclopedia

Find first set - Wikipedia, the free encyclopedia: "In software, find first set (ffs) or find first one is a bit operation that, given an unsigned machine word, identifies the least significant index or position of the bits set to one in the word. "



'via Blog this'

2014 Music Lineups [Updates] | Burners.Me: Me, Burners and The Man

2014 Music Lineups [Updates] | Burners.Me: Me, Burners and The Man:



'via Blog this'

Wednesday, May 28, 2014

iphone - AVFoundation, how to turn off the shutter sound when captureStillImageAsynchronouslyFromConnection? - Stack Overflow

iphone - AVFoundation, how to turn off the shutter sound when captureStillImageAsynchronouslyFromConnection? - Stack Overflow: "Then I used third-party app to extract photoShutter.caf from Documents directory (DiskAid for Mac). Next step I opened photoShutter.caf in Audacity audio editor and applied inversion effect, it looks like this on high zoom:"




Tarjan's strongly connected components algorithm - Wikipedia, the free encyclopedia

Tarjan's strongly connected components algorithm - Wikipedia, the free encyclopedia: "The basic idea of the algorithm is this: a depth-first search begins from an arbitrary start node (and subsequent depth-first searches are conducted on any nodes that have not yet been found). As usual with depth-first search, the search visits every node of the graph exactly once, declining to revisit any node that has already been explored. Thus, the collection of search trees is a spanning forest of the graph. The strongly connected components will be recovered as certain subtrees of this forest. The roots of these subtrees are called the "roots" of the strongly connected components. Any node of a strongly connected component might serve as the root, if it happens to be the first node of the component that is discovered by the search."



'via Blog this'

Twenty Questions for Donald Knuth | | InformIT

Twenty Questions for Donald Knuth | | InformIT: "I know that my books still aren't terribly easy to fathom, even for geeks. But I could have made them much, much harder."



'via Blog this'