Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Parse string greater than 2GB

by sundialsvc4 (Abbot)
on Jul 01, 2013 at 11:23 UTC ( #1041823=note: print w/replies, xml ) Need Help??

in reply to Parse string greater than 2GB

Unless it is reasonably possible that “the single thing that you are looking for” is actually ≥ 2GB in size by itself, then you will be, one way or the other, reading it in some more conveniently-sized sections and in some suitable way dealing with the “fragments” that are left-over at the end of each read.   (You move this unused portion to the start of your buffer, read more data to fill it up again, and keep going.)   If you can identify a record separator to Perl (it doesn’t have to be \n), Perl will even do a lot of the leg-work for you, using its own buffering scheme.

One way that is sometimes useful to deal with very large static files is to memory-map them, e.g. PerlIO::mmap (or any of 64-or-so other packages I found in using the key, “mmap.”)   This technique uses the operating system’s virtual memory subsystem to do some of the dirty-work for you, by mapping a portion of the file (a movable “window” into it, of some selected-but-not-2GB size) into the process’s virtual memory address space ... this avoids copying.   But you still can’t map “all of” a very large file.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1041823]
[LanX]: LOL I google for escaping POD commands and get hits for escape pods
[choroba]: Programming is dangerous.

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (7)
As of 2018-03-24 12:18 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (298 votes). Check out past polls.