HNHacker News
TopNewBestAskShowJobs

tsewlliw

261 karma · joined November 22, 2010

submissionscomments
tsewlliw··on Top Missing PostgreSQL Features
I really liked the article, it made me think about interesting problems, but I only count 7 features in it.

>1. Query progress >3. Session Wait Data >4. Session Tracing

These are all the same feature. Granted, it's an awesome feature, and thats a reasonable division.

>2. Index Only Scans >5. Multiple Block I/O

These are real valid (and separate) points. There's a good argument for leaving 5 to the OS, but it does mean accepting that the OS might suck at predicting what you want.

>6. Tablespace Quotas

It doesn't seem like this should be so hard -- use a user-space FS with a cap.

>7. No Logging

Why are you creating indexes all the time? Large data loads I can see.

>9. Query Hints

Flamebait, but acknowledged as such.

>8. Better Export/Import Tools >10. More Backup/Restore Options

Seriously, you just used the flamebait between these two so you'd make it to 10. Nice tactic :)

tsewlliw··on Why Learning Prolog Can Make You a Better Programmer
not that depth first search isn't a pretty good analogy for what happens, but I believe it's SLDNF resolution, and I'm not 100% sure the exact algorithm is mandated by the language, though it might be for cuts.
tsewlliw··on Ask HN: Who is Hiring? (April 2011)
Austin, TX

SmartBear, CodeCollaborator team. We do team lunches, and we have fun.

Multiple developer openings:

Mostly just be smart and adaptable, but specifics in Eclipse/RCP, Visual Studio addins, Web GUI stuff, and version control systems are big wins.

QA opening:

We like automated testing. I'm the wrong guy for specifics, but I'll hook you up.

will.west@smartbear.com

tsewlliw··on Concatenative Programming: An Overlooked Paradigm in Functional Programmng [pdf]
Please ignore this, it's the key to my big idea that will change the world.
tsewlliw··on Cycle Sort
If you must restrict the input to permutations of [0,...,N], you already know the result! Finding cycles is neat, but this works for the same data, minus having bounds:

(define (trivialsort vals) (lambda (i) i))

← PreviousPage 5 of 5