[fpc-pascal] Question on how to avoid memory trouble

>The error is not from a lack of stack space, either. The error is >EOutOfMemory that indicates a less easily solved problem. >Can anyone recommend a method to search a whole drive, of arbitrary >size, without running out of memory. >Stu Cox This is exactly the kind of thing my string class wo

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

On Sat, 3 Feb 2007, Marco van de Voort wrote: > > On Sat, 3 Feb 2007, Marco van de Voort wrote: > > > > > > Yes it will, because the reallocations don't happen as often. > > > > The sorting introduces an overhead anyway, whether you set capacity or > > > > not. > > > > > > Yes, but I was tal

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

Michael Van Canneyt wrote: All this doesn't exclude that a specialized class may be more suitable for the job. To be honest, the only good point of TStringList seems to be that it is default available on all Object Pascal. The specialised stuff (splitting strings) is also plagued with odd

Re: [fpc-pascal] New stylesheet for fpcunit xml reports

Graeme Geldenhuys schreef: Ok, I'll bite.. ;-) Thanks. It is nice to find a volunteer. :-) Vincent ___ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

> On Sat, 3 Feb 2007, Marco van de Voort wrote: > > > > Yes it will, because the reallocations don't happen as often. > > > The sorting introduces an overhead anyway, whether you set capacity or > > > not. > > > > Yes, but I was talking about slowness in general, not just from the heap. > > >

Re: [fpc-pascal] New stylesheet for fpcunit xml reports

Graeme, Ok, I'll bite.. ;-) I spoke to Dean the other day and he mentioned a new update for FPCUnit will be sumbitted shortly. I didn't want to start on the new XSLT stylesheet before I know what format the XML is in. Dean, if you can confirm that the new xml format with nested test suits are

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

On Sat, 3 Feb 2007, Marco van de Voort wrote: > > Yes it will, because the reallocations don't happen as often. > > The sorting introduces an overhead anyway, whether you set capacity or not. > > Yes, but I was talking about slowness in general, not just from the heap. > > And TStringList wit

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

Am Samstag, den 03.02.2007, 16:36 +0100 schrieb Marc Santhoff: > Am Freitag, den 02.02.2007, 08:52 -0800 schrieb Cox, Stuart TRAN:EX: ... > > Can anyone recommend a method to search a whole drive, of arbitrary > > size, without running out of memory. > > >From reading this thread I think you must

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

> Yes it will, because the reallocations don't happen as often. > The sorting introduces an overhead anyway, whether you set capacity or not. Yes, but I was talking about slowness in general, not just from the heap. And TStringList with those huge internal list has to move on avg half of the arr

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

Am Freitag, den 02.02.2007, 08:52 -0800 schrieb Cox, Stuart TRAN:EX: > I am trying to EnumerateFiles (create a list of all files that match a > given filespec) across and down a whole drive. I've directly used the > EnumerateFiles code from TurboPower's SysTools as available on > SourceForge. > >

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

On Sat, 3 Feb 2007, Marco van de Voort wrote: > > On Fri, 2 Feb 2007, Marco van de Voort wrote: > > > > > > Can anyone recommend a method to search a whole drive, of arbitrary > > > > size, without running out of memory. > > > > > > I don't know seen SysTools, but I worked analysing logfiles f

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

> On Fri, 2 Feb 2007, Marco van de Voort wrote: > > > > Can anyone recommend a method to search a whole drive, of arbitrary > > > size, without running out of memory. > > > > I don't know seen SysTools, but I worked analysing logfiles for a year. All > > containertypes (TList TObjectList and Tstr

Re: [fpc-pascal] Question on how to avoid memory trouble using FindFirst(), FindNext() and FindClose()

On Fri, 2 Feb 2007, Marco van de Voort wrote: > > Can anyone recommend a method to search a whole drive, of arbitrary > > size, without running out of memory. > > I don't know seen SysTools, but I worked analysing logfiles for a year. All > containertypes (TList TObjectList and TstringList incl

Re: [fpc-pascal] New stylesheet for fpcunit xml reports

Graeme, I spoke to Dean the other day and he mentioned a new update for FPCUnit will be sumbitted shortly. I didn't want to start on the new XSLT stylesheet before I know what format the XML is in. Dean, if you can confirm that the new xml format with nested test suits are still as is, then I'l

Re: [fpc-pascal] New stylesheet for fpcunit xml reports

Ok, I'll bite.. ;-) I spoke to Dean the other day and he mentioned a new update for FPCUnit will be sumbitted shortly. I didn't want to start on the new XSLT stylesheet before I know what format the XML is in. Dean, if you can confirm that the new xml format with nested test suits are still as