2 programs for my scheme class
One involving lambdas.
Another involving lambdas too.
Took me about 2 minutes (I still rock with lambdas)
Name:
Anonymous2009-03-30 17:15
Not much, just whipped out valgrind and fixed some memory leaks
Name:
Anonymous2009-03-30 17:19
2 programs for my Haskell class
One involving dead dogs.
Another involving nomads.
Took me about 2 days (I still get type errors with GHC)
Name:
Anonymous2009-03-30 17:31
A Wix installer, an IronPython script to autogenerate FxCop suppression attributes for a WCF interface, and a truckload of unit tests, thereby clearing out about 60 of the 90-odd build warnings on the current project,
Name:
Anonymous2009-03-30 17:48
just finished a stupid little airplane program in C, it asks if you want a smoking or non smoking seat then prints out a little ticket. had to use arrays, it was such a boring program
Name:
Anonymous2009-03-30 18:18
A website publishing system in Haskell.
I am growing to dislike Haskell.
The game I'm writing in linux, using G++ and vim.
Easy, no compiler problems, I just made a quick makefile.
The Queue? VS C++.
Linker errors out the ass.
VS fucking sucks.
Name:
Anonymous2009-03-31 0:26
I wrote my own music player in Gtk
Name:
Anonymous2009-03-31 3:07
>>13
The two problems result from having to cope in an environment of major Windows faggotry, overcomplicating a system for which Erlang is the right answer.
Name:
Anonymous2009-03-31 3:22
Win32 app at work, I miss my enterprise C#.
Name:
Anonymous2009-03-31 5:26
Jacobi method solver for a potential flow problem with axial symmetry and a single obstruction. Sepples
>>25
like this? from math import sqrt
from itertools import takewhile, dropwhile
def eratosthenes():
D = {}
q = 2
while 1:
if q not in D:
yield q
D[q*q] = [q]
else:
for p in D[q]:
D.setdefault(p+q,[]).append(p)
del D[q]
q += 1
def bitcount(n):
r = 0;
while n > 0:
r += n & 1
n >>=1
return r
def take(n, g):
for i in range(n): yield g.next()
def swing(n):
primes = list(takewhile(lambda x: x <= n, eratosthenes()))
smalloddswing = [1,1,1,3,3,15,5,35,35,315,63,693,231,3003,429,6435,6435,109395,12155,230945,46189,969969,88179,2028117,676039,16900975,1300075,35102025,5014575,145422675,9694845,300540195,300540195]
if n < 33: return smalloddswing[n]
primelist = []
rootn = long(sqrt(n))
primesa = takewhile(lambda x: x <= rootn, dropwhile(lambda x: x < 3, primes))
primesb = takewhile(lambda x: x <= n // 3, dropwhile(lambda x: x <= rootn, primes))
for prime in primesa:
q = n // prime
p = 1
while q > 0:
if q & 1 == 1: p *= prime
q //= prime
if p > 1: primelist.append(p)
return reduce(lambda x, y: x * y, list(takewhile(lambda x: x <= n, dropwhile(lambda x: x <= n // 2, primes))) + primelist + filter(lambda x: n // x & 1 == 1, primesb), 1)
def recfactorial(n):
if n < 2: return 1
return recfactorial(n // 2) ** 2 * swing(n)
def factorial(n):
if n < 20: return reduce(lambda x, y: x * y, range(2,n + 1), 1)
return recfactorial(n) << (n - bitcount(n))
Finished rewriting an internal tool used by my company, from C# to C#. Also managers, they know how to extract performance from a tool, yes siree they do. Also FUCKING DATE FORMATTING GOING WRONG AT EVERY POSSIBLE INSTANT ALSO FUCK YOU MS FOR NOT MAKING ODBC READER THREAD SAFE FFFFF-
Name:
Anonymous2009-03-31 10:29
I contributed some code to /ac/.
Name:
Anonymous2009-04-01 1:03
>>30
and you somehow missed the new thread form and posted your code in some other thread.