On Sun, Jul 20, 2008 at 7:25 AM, Chaddaï Fouché [EMAIL PROTECTED]
wrote:
That's exactly what I thought. But even if I remove the only 'try' I use
the
memory consumption remains unchanged:
It's true, but in your case your output is almost the raw input data,
which means that even without
I played with another approach without any parser library, just with plain
pattern matching. The idea was to create function to match all different
cases of codes. Since I already got most of the code, it was quite easy to
do. The core function consist of cases like those:
parse
On Sun, Jul 20, 2008 at 12:34 AM, Bulat Ziganshin [EMAIL PROTECTED]
wrote:
Hello Krzysztof,
Sunday, July 20, 2008, 1:55:45 AM, you wrote:
532 MB total memory in use (4 MB lost due to fragmentation).
i think that Parsec library should hold entire file in memory only when
you use 'try' for
2008/7/20 Krzysztof Skrzętnicki [EMAIL PROTECTED]:
On Sun, Jul 20, 2008 at 12:34 AM, Bulat Ziganshin
[EMAIL PROTECTED] wrote:
Hello Krzysztof,
Sunday, July 20, 2008, 1:55:45 AM, you wrote:
532 MB total memory in use (4 MB lost due to fragmentation).
i think that Parsec library should
