Directory recursive walking

drug drug2004 at bk.ru
Thu Jan 14 16:47:45 UTC 2021


On 1/14/21 7:06 PM, dog2002 wrote:
> On Thursday, 14 January 2021 at 16:01:43 UTC, drug wrote:
>> On 1/14/21 6:55 PM, drug wrote:
>>>>
>>>> But this method consumes a huge amount of memory (up to 4 GB and 
>>>> more). Is there a more appropriate way to walk directories 
>>>> recursively that does not consume a lot of memory?
>>>
>>> DirEntry is a struct. First of all I would try this:
>>> ```D
>>> foreach(ref entry; dirEntries(path, SpanMode.shallow, false))
>>> ```
>>
>> Does your directory just contain large amount of files?
> 
> Yes. I forgot to add it in the original post.

How much files do you have? DirEntry size is 168 bytes only and dirEntry 
is lazy range so I'm curious what is the reason of huge memory 
consumption. Do you use Windows 32 bits between?


More information about the Digitalmars-d-learn mailing list