Consider the problem of implementing a modified LIFO stack that has anadditional O(1) operation called min , that gives back the smallestitem in the stack. For now, let's pretend that Python arrays are O(1)(or that someone has implemented a native queue class); in many respectsthey are as far as Python code is concerned.

The simple implementation is to keep two stacks, the main stack andone that you only push new minimum items onto. Then push and pop aresomething

Rosetta Stone for Unix is a very handycross-index of various commands and tasks across various Unix variants.The index of tasks is especially handy as a quick 'how do I do this onX' pointer. It's available in several formats, and as a bonus you getsome helpful links as well.

(Since I was just using this today to figure out how to do variousthings on Solaris, I figured I should finally get around to mentioningit.)

(From a Slashdot comment .)

People have been calling the nofollow tag afailure for a while, most recently in Blog Spam, and a 'nofollow'Post-Mortem , which hit the geek news today. Comment spam has not exactly diminished sincenofollow's adoption, which is not a good result for somethingintroduced with the title 'Preventing comment spam' .Calling it a failure is pretty easy.

The cynical take on nofollow is a bit different: nofollow is actuallya clever way to improve search engine results . While it's not

I know of three command-line programs that will fiddle with theX selection (and/or the cut buffers) in a way that's usefulfor shell scripts: xsnarf from Smarasderagd's collectionof X things , xcb , and xclip .

I use xsnarf for a variety of reasons, I think partly historical (inthat I had it around well before I found the others); I'm jotting downthe other two here partly so that I have the information handy the nexttime someone asks me