#haskell - Tue 13 Mar 2007 between 00:31 and 00:54

NY Lost Funds



lemmihfalconair: I doubt that lack of it would have been a show stopper.
falconairLemmih, i thought ByteString had super optimized, memory mapping C code underneath it, no?
sorearfalconair: optimized, yes. memory mapping, no.
falconair: appearantly under windows mmap bypasses ALL caches --> extremely low performance
lemmihfalconair: It uses very little C.
sorearand even less now than it used to
falconairsorear: why less now? due to something in ghc 6.6?
sorearsince dons/rl/forgotten have figured out how to coerce ghc into generating good code
falconair: no, just some *really* good ideas
@go rewriting haskell strings
lambdabothttp://www.cse.unsw.edu.au/~dons/papers/CSL06.html
Title: Rewriting Haskell Strings
falconairhm...doing a little query engine may still be an interesting (motivating) idea ... perhaps even useful since i can't even get monetdb to compile ... i'll prolly have to write more than 3 lines of haskell before i can do a project such as that though :)
sorear: it looks like bytestring does do memory mapping: http://www.cse.unsw.edu.au/~dons/tmp/Data-ByteString.html#v%3AmmapFile
lambdabothttp://tinyurl.com/2dunlv
jfoutz@hoogle dotimes
lambdabotNo matches found
lemmihfalconair: Still, that's nothing new.
brad_can anyone provide a decent explanation of Arrows? or are they too complicated for this type of communication?
jfoutzi think they're like an underwater space suit nuclear waste processing... oh nevermind. I don't understand them :)
brad_your humor is appreciated anyway jfoutz
lemmihArrows are to functions what monads are to data.
brad_hmm, interesting Lemmih
thanks
sorearLemmih: An arrows is an abstraction which is a lot like a monad, but makes input operations explicit.
s/Lemmih/brad_/
brad_: this makes it feasable to do a lot more static operations in an arrow.
brad_hmm, thanks sorear, that's something to chew on!
sorearbrad_: for instance Parsec (monadic parsers) needs to use naive recursive descent, while arrow parsers have been written that perform yacc(1) style LALR(1) compilation for speed
brad_interesting you mention Parsec, as i am investigating Arrows via HXT
bos_it seems like the speed advantage of table-driven parsing is something of a myth, though.
brad_as an aside, do people have an opinion of Parsec vs HXT? it seems they could both be used to digest XML
bos_totally different tools.
parsec is for parsing. hxt is for parsing xml.
brad_thats what i figured, thanks bos_.
bos_so if you wanted to write an xml parser in parsec, you'd have to do a fair bit of work.
brad_we definitely want to avoid work
HXT is a brainful though!
sorearwow, google++
bos_que?

Page: 3 10 17 24 31 38 45 52 59 66 73 80 87 94 101 108 

IrcArchive

NY Lost Funds