----------------------------------------
> Date: Fri, 23 Apr 2010 11:53:09 -0700
> From: forum_...@trumpetinc.com
> To: itext-questions@lists.sourceforge.net
> Subject: Re: [iText-questions] performance follow up
>
>
> Parsing PDF requires a lot of random access. It tends to be chunked - move
> to a particular offset in the file, then parse as a stream (this is why
> paging makes sense, and why memory mapping is effective until the file gets
Yes, that is great but instead of a generic MRU approach are
there better predictions you can make, even start loaing pages
before having to wait later etc? Maybe multithreading makes
sense here.
> too big). But the parsing is incredibly complex. You can have nested
> object structures, lots of alternative representations for the same type of
> data, etc...
surely there are rules and I'm sure this topic has been beaten
to death in many CS courses ( as have stats LOL). Profiling
should point to some suspects. Algorithmic optimizations may
be possible as maybe just coding changes. Most compilers
operate sequentially on input in maybe multiple passes I'm
sure you can find ideas easily in a vraiety of sources.
>
> And we definitely don't know size of any of these structures ahead of time.
well, you don;t need to know if a week ahead of time, but
you could maybe waste an access or two finding sizes if that
can be done more quickly than just reading everything.
_________________________________________________________________
Hotmail is redefining busy with tools for the New Busy. Get more from your
inbox.
http://www.windowslive.com/campaign/thenewbusy?ocid=PID28326::T:WLMTAGL:ON:WL:en-US:WM_HMP:042010_2
------------------------------------------------------------------------------
_______________________________________________
iText-questions mailing list
iText-questions@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/itext-questions
Buy the iText book: http://www.itextpdf.com/book/
Check the site with examples before you ask questions:
http://www.1t3xt.info/examples/
You can also search the keywords list: http://1t3xt.info/tutorials/keywords/
