Re: Processing large amounts of files

[Liliana Marie Prikler <liliana.prikler@ist.tugraz.at>]

Am Dienstag, dem 26.03.2024 um 22:30 +0100 schrieb Ricardo Wurmus:
> 
> Ricardo Wurmus <rekado@elephly.net> writes:
> > Another significant delay is introduced by the cache mechanism,
> > which computes a unique prefix based on the contents of all input
> > files.  It's not unexpected that this will take a little while, but
> > it's not great either.
> 
> With commit f4442e409cf05d0c7cc4d6a251626d22efaffe8c it's a little
> faster.  We used a whole lot of alists, and this becomes slow when
> there are thousands of inputs.  We're now using hash tables.
SGTM.  I assume the caches are internal and do not affect input order
otherwise?  i.e. a process that declares

  inputs : files "foo" "bar" "baz"

will still see the same {{inputs}} as before?  I see there are tests
covering make-process, but I'm not quite sure how to parse "prepare-
inputs returns the unmodified inputs-map when all files exist" tbh.

Cheers