FUCK YOU PROG. YOU DESTROYED MY LIFE. EVERY MINUTE I REFRESH PROG AND SEE ONLY SPAM, YET I KEEP COMING BACK. I CANT STOP LURKING. LET ME GO YOU BASTARDS.
i am a JAVA. i ahev a long doc and i make programs w/ my API. if you dont repost this comment on 10 other pages i will hax your anus tonight and make a mess of your computer and ass
>>10
That's an unverifiable statement, thus unscientific and ultimately destructive.
Name:
Anonymous2008-06-11 21:25
i am a JAVA. i ahev a long doc and i make programs w/ my API. if you dont repost this comment on 10 other pages i will hax your anus tonight and make a mess of your computer and ass
Name:
Anonymous2008-06-11 22:35
Who else on /prog/ suffers from terminal laziness? I'm writing a game in C++ (with SDL/OpenGL) right now and I can't bring myself to implement all these simple features. When I get down to it, when I get in the "Zone", I can go for hours straight pounding away at my keyboard. But most of the time, I'd much rather go and find some obscure problem to solve in one line of Haskell.
>>14
I too favour writing Hasell one-liners over doing meaningful work. And much like lurking in /prog/, I feel like I can't help it.
Name:
Anonymous2008-06-12 10:29
>>22,23
I had that same epiphany months ago and still feel like a lazy fuck.
Name:
Anonymous2008-06-12 19:15
DID SOMEBODY SAY HASKELL?????
-- Ananagrams
--
-- http://www.streamtech.nl/problemset/156.html
--
-- Write a program that will read in the dictionary of a restricted
-- domain and determine the relative ananagrams. Note that single
-- letter words are, ipso facto, relative ananagrams since they cannot
-- be ``rearranged'' at all. The dictionary will contain no more than
-- 1000 words.
--
-- run ghci, and execute:
-- > :l Ananagrams.hs
-- Ananagrams*> showAnsOfFile "words.txt"
--
-- Takes about 1 second to do 1881 words, separated into 882 lines
-- of a file, from http://www.buber.net/Basque/Euskara/hitz.html
ONE WORD: FORCED SYNTAX HIGHLIGHTING OF THE CODE. THREAD OVER.
Name:
Anonymous2008-06-12 19:21
-- Ananagrams
--
-- http://www.streamtech.nl/problemset/156.html
--
-- Write a program that will read in the dictionary of a restricted
-- domain and determine the relative ananagrams. Note that single
-- letter words are, ipso facto, relative ananagrams since they cannot
-- be ``rearranged'' at all. The dictionary will contain no more than
-- 1000 words.
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy
All work and no play makes Jack a dull boy