Andy You can use the API for this easily. Just need to handle the High Byte / Low Byte addressing. VFP has no issue with it and handles multi - terabyte files if one is inclined to play with files that large. I've tested with files up to 300Gb and no issue.
-----Original Message----- From: ProfoxTech [mailto:[email protected]] On Behalf Of AndyHC Sent: Saturday, 9 November 2013 7:49 PM To: [email protected] Subject: Re: Working with text files larger than 2GB (VFP9SP2) From VFP Help! /FSEEK( ) returns the number of bytes the file pointer is positioned from the beginning of the file. The file pointer can also be moved with FREAD( ) and FWRITE( )./ So you can't use FSEEK on a file > 2GB (?4Gb) because the return value would cause an error. iirc FREAD and FWRITE leave the file pointer at the end of the block just read/ written BUT there*/is/* a file pointer held internally which imho is going to be limited to 31/32 bits. As I said in my previous post, I think you need low-level *disk* access to break the 2Gb. otoh VFP may box clever internally - just tried this (on a 64-bit m/c if that matters): xbig=2^63 xxbig=2^67 ?xxbig/xbig & 16.0000 xxbig = xxbig+29 & these may be xbig = xbig+17 & lost in rounding? ?xxbig/xbig & 16.0000 On 09/11/2013 02:55, MB Software Solutions General Account wrote: > On Thu, November 7, 2013 1:18 pm, Gene Wirchenko wrote: >> Is the entire file required in memory? A text file could be >> processed sequentially a line or a buffer at a time. > > No, the entire file is not required in memory at the same time. I'm > just taking 1 line at a time, and writing the string out to a > different file based on the first 6 characters of the row. (That's the provider number.) > I plan to create this "splitter" program to pare down the behemouth > files into smaller ones they can process by provider. (All provider > data is separate...no one mixed.) > > So given that...I don't have to worry how big their source file is then, eh? > > [excessive quoting removed by server] _______________________________________________ Post Messages to: [email protected] Subscription Maintenance: http://mail.leafe.com/mailman/listinfo/profox OT-free version of this list: http://mail.leafe.com/mailman/listinfo/profoxtech Searchable Archive: http://leafe.com/archives/search/profox This message: http://leafe.com/archives/byMID/profox/[email protected] ** All postings, unless explicitly stated otherwise, are the opinions of the author, and do not constitute legal or medical advice. This statement is added to the messages for those lawyers who are too stupid to see the obvious.
