 | | Re: MPD file loading search order —Anders Isaksson
|
| | | (...) What about the following algorithm (assuming everything is cached): - whenever a file reference is read, search for the file in the cache. if not found, add it as an empty file and flag it as 'incomplete' - whenever a 'file' is seen, search (...) (18 years ago, 26-Jul-06, to lugnet.cad.dev)
|
| | | |
| | | | | Re: MPD file loading search order —Timothy Gould
|
| | | | (...) That is a two pass algorithm. It's optimised by only searching files that have already appeared but the search in stage II is a second pass. Tim (18 years ago, 26-Jul-06, to lugnet.cad.dev)
|
| | | | |
| | | | | | Re: MPD file loading search order —Anders Isaksson
|
| | | | (...) Actually I can't get my head around 'searching for a file in the cache' as equivalent to 'do a second pass of the source file'. Every part is searched for in the cache. Each source line is only read and parsed once. What am I not (...) (18 years ago, 26-Jul-06, to lugnet.cad.dev)
|
| | | | |
| | | | | | Re: MPD file loading search order —Timothy Gould
|
| | | | (...) I suspect there's two definitions of "pass" at work here. I would consider a two pass algorithm to be anything requiring two loops (which we must have either way as their is no reference order specified in MPDs). Another way of considering it (...) (18 years ago, 27-Jul-06, to lugnet.cad.dev)
|
| | | | |
| | | | | | Re: MPD file loading search order —Anders Isaksson
|
| | | | (...) Probably. As I was reading the thread it was *loading* the MPD file that was considered two-pass, and my algorithm is definitely only one-pass for that (and no extra fixups after reading it all). OTOH, if the file should be rendered on screen (...) (18 years ago, 27-Jul-06, to lugnet.cad.dev)
|
| | | | |
