|jcreigh||I think address-space is going to be fine for a while.|
|sorear||jcreigh: (looking at logs) Yes.|
|Pseudonym||And even then, address-space isn't memory.;|
|sorear||darcs record ; darcs send is correct.|
|jcreigh||sorear: okay, thanks|
does that just send them an email in a format darcs can grok?
darcs send sends emain
darcs send -o /tmp/my_mailsystem_is_broken_so_I_promise_to_mail_this_myself too
unless you're using MacOS
|jcreigh||that's cool that darcs has a "send a patch" command. It's like darcs is designed for open source projects.|
|sorear||darcs send -o /tmp/my_mailsystem_is_broken_so_I_pr|
in that case
|jcreigh||haha. MacOS are filename length limits?|
|sorear||remember, 31 char limit :)|
dos is dead so we have to poke fun at hfs+ now
|sorear||such a shame ext2 was modified to reduce the length limit from 65535 to 255|
|desp||HFS+ does not have a 31 char limit|
|Cale||sorear: why the heck was that done?|
|desp||only if you're using obsolete software|
written in pre-Carbon days
|sorear||Cale: to free up a byte in struct dirent to hold the filetype cache|
|falconair||hi folks, are any of you familiar with monetdb? it is a 'vertically decomposed' database. I've been wondering if it is feasible to use Haskell's bytestrings to duplicate the functionality of monetdb...perhaps with far less code ...|
any one know of any obvious problems with this idea?
|Cale||falconair: I don't know anything about MonetDB, but another option to consider would be using FFI to bind to it.|
Or writing a driver for HDBC.
|falconair||well, i don't actually want to access it, i was thinking that it might be cool to duplicate it ... as it is, the query engine is far more appropriate for functional programming languages rather than imperative languages (algebraic properties being optimized, etc.) ... this is the same one Prof. Grust (profteggy or similar #haskell nick) uses for his xquery stuff|
|lemmih||Rewriting MonetDB in Haskell seems like a non-trivial undertaking.|
|falconair||let's say the 'idea' of monetdb ... bunch of columns stored on disk and read into memory, while queries are parsed, optimized and answered by a haskell system on top ... i'm also thinking of recent papers on the DODO query flattening ...|
frankly i'm surprised there aren't already 3 different haskell implementations of this idea ... perhaps because bytestring is rather new?
|lambdabot||Maximum users seen in #haskell: 339, currently: 281 (82.9%), active: 45 (16.0%)|
|sorear||Argh, yac << parsec|
|mgsloan||so 'yac' is executed after parsec then, eh, curious!|
|lemmih||falconair: Data.ByteString is just a pretty interface to old functionality.|